TARU PUBLICATIONS
Journal of Discrete Mathematical Sciences and Cryptography cover

Journal of Discrete Mathematical Sciences and Cryptography

(Since 1998)
Open Access ·Peer-reviewed·ISSN (Online): 2169-0065·ISSN (Print): 0972-0529

CiteScore 2025: 2.7 (Q1)

Powered by:Powered by

Monthly Journal: Publishes theoretical and applied research in all areas of Discrete Mathematical Sciences, Cryptography, Combinatorics, Elliptic Curves and Information Security.

Issues up to 2022 co-published with and available at:Taylor & Francis Online
submissions@tarupublications.com
Taru Online First Current IssueSpecial IssuesBrowse all Issues
Journal of Discrete Mathematical Sciences and Cryptography
Open Access Research Article

A novel multiphase encryption strategy with Fibonacci numbers and matrices

* , , ,

* Corresponding author · click or hover a name for details

pp. 117–129Vol. 28Issue 1February 2025DOI: 10.47974/JDMSC-2069 Crossmark XML
Received:
07 Nov 2023
Published Online:
28 Feb 2025
Article type:
Research Article
Language:
EN
Article no.:
JDMSC-2069
Pages:
117–129

Abstract

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.

Keywords

Fibonacci matricesTreesLaplace transformationsAffine transformations

Subject Classifications

Primary 11B3905C05Secondary 44A10

References

[1] A. N. Philippou, A. F. Horadan, and G. E. Bergun, Application of Fibonacci Numbers, Springer Science Media LLC.
[2] S. Babu, “Modification affine ciphers algorithm for cryptography password,” Int. J. Res. Sci. Eng., vol. 3, no. 2, pp. 346-351 (2017).
[3] J. B. Bacani and J. F. T. Rabago, “On generalized Fibonacci numbers,” arXiv preprint arXiv:1503.05305 (2015).
[4] B. Kittur, D. C. Kumari, S. G. Kulkarni, and M. K. M, “Super-encryption method using affine transform via trees,” International Journal of Mathematics Trends and Technology, vol. 68, no. 6 (2022).
[5] D. C. Kumari and S. Ashok Kumar, “Redei rational functions as permutation function and an algorithm to compute Redei rational functions,” International Journal of Engineering, Science and Mathematics, vol. 8, no. 2, pp. 2320-0294, Feb. (2019).
[6] F. Piper and S. Murthy, Cryptography: A Very Short Introduction.
[7] G. Ashok, S. Ashok Kumar, D. C. Kumari, and M. Ramakrishna, “A type of public cryptosystem using polynomials and Pell sequences,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 7, pp. 1951-1963 (2022). doi: 10.1080/09720529.2022.2133237.
[8] J. S. Han, H. S. Kim, and J. Neggers, “On Fibonacci functions with Fibonacci numbers,” Advances in Difference Equations, pp. 1-7 (2012).
[9] T. C. Hu and K. C. Tan, “Path length of binary search trees,” SIAM Journal on Applied Mathematics, vol. 22, no. 2, pp. 225-234 (1972).
[10] J. Buchman, Introduction to Cryptography, Springer-Verlag (2001).
[11] K. Prasad and H. Mahato, “Cryptography using generalized Fibonacci matrices with Affine-Hill cipher,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 8, pp. 2341-2352 (2022). doi: 10.1080/09720529.2020.1838744.
[12] R. Klein and D. Wood, “On the path length of binary trees,” Journal of the ACM (JACM), vol. 36, no. 2, pp. 280-289 (1989).
[13] K. H. Rosen, Elementary Number Theory and Its Applications, 3rd ed., Addison-Wesley.
[14] Y. S. Mezaal and S. F. Abdulkareem, “Affine cipher cryptanalysis using genetic algorithms,” JP Journal of Algebra, Number Theory and Applications, vol. 39, no. 5, pp. 785-802 (2017).
[15] N. Koblitz, A Course in Number Theory and Cryptography, ISBN 3-578071-8, SPIN 10893308.
[16] S. A. Kumar, A. Chandra Sekhar, C. Pragathi, and B. Ravi Kumar, “Multiple encryption of various ciphers,” International Journal of Engineering Science Invention Research & Development, vol. II, no. VIII, Feb.  (2016).
[17] S. A. Kumar, A. Chandra Sekhar, and D. C. Kumari, “Symmetric key cryptosystem for multiple encryptions,” International Journal of Mathematics Trends and Technology (IJMTT), vol. 29, no. 2, pp. 140-144, Jan.  (2016). ISSN: 2231-5373.
[18] H. Sheng, Y. Li, and Y. Q. Chen, “Application of numerical inverse Laplace transform algorithms in fractional calculus,” Journal of the Franklin Institute, vol. 348, no. 2, pp. 315-330 (2011).
[19] S. L. Basin, “Generalized Fibonacci sequences and squared rectangles,” The American Mathematical Monthly, vol. 70, no. 4, pp. 372-379 (1963).
[20] T. Khoshy, “Fibonacci, Lucas, and Pell numbers and Pascal’s triangle,” Applied Probability Trust, pp. 125-132.
[21] T. Domada, S. A. Kumar, G. Ashok, and D. C. Kumari, “Super-encryption with Pell-Lucas matrices and graphs via Laplace transformations,” Journal of Harbin Engineering University, vol. 44, no. 8, pp. 8975-980 (2023).
[22] T. Domada, S. A. Kumar, G. Ashok, and D. C. Kumari, “Super-encryption technique of graphs via matricial approach,” Journal of Discrete Mathematical Sciences and Cryptography, pp. 1215-1222, Jun. 26 (2024). doi: 10.47974/JDMSC-1976.

Views: 129Downloads: 8Citations: 0