This paper proposes multiple encryption methods that secures plaintext by integrating various techniques, including the application of graph theory to trees, Fibonacci matrices, and affine transformations. The use of multiple encryption layers minimizes the risks associated with data encryption by ensuring that the compromise of a single layer does not jeopardize the overall security. This multiencryption method can be extended to public key cryptosystems. We introduce a super encryption technique that employs Laplace transformations and Fibonacci numbers. The process begins by applying the Laplace transformation to a selected function, followed by the incorporation of Fibonacci numbers to super encrypt the plaintext. Decryption is achieved by applying the inverse Laplace transform along with the corresponding Fibonacci numbers.