A new frontier in information security : Polynomial-Fibonacci hybrid cryptography

Ashok, Gudela; Kumar, S. Ashok; Kumari, D. Chaya; Kumar, K. V. M. Vara; Ramakrishna, Mathe

doi:10.47974/JDMSC-1973

Open Access Research Article

A new frontier in information security : Polynomial-Fibonacci hybrid cryptography

^*Gudela AshokCorresponding authorashokavf@gmail.comAffiliation 1Department of MathematicsAndhra University TDR HUBVisakhapatnam, Andhra Pradesh, 530003, IndiaAffiliation 2Department of MathematicsAdikavi Nannaya UniversityRajamahendravaram, Andhra Pradesh, 533296, IndiaView full profile → , S. Ashok Kumarsaiashok.84@gmail.comDepartment of MathematicsGayatri Vidya Parishad College for Degree and P. G. CoursesVisakhapatnam, Andhra Pradesh, 530045, IndiaView full profile → , D. Chaya Kumarichayakumari.divakarla@gmail.comDepartment of MathematicsGayatri Vidya Parishad College for Degree and P. G. CoursesVisakhapatnam, Andhra Pradesh, 530045, IndiaView full profile → , K. V. M. Vara Kumarkalepukumar@gmail.comDepartment of MathematicsAdikavi Nannaya UniversityRajamahendravaram, Andhra Pradesh, 533296, IndiaView full profile → , Mathe Ramakrishnamathe.ramakrishna@gmail.comDepartment of Computer Science and EngineeringAdikavi Nannaya UniversityRajamahendravaram, Andhra Pradesh, 533296, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 1185–1194Vol. 27Issue 4June 2024DOI: 10.47974/JDMSC-1973 Crossmark XML

Published Online:: 26 Jun 2024
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-1973
Pages:: 1185–1194

Abstract

This research paper presents an innovative approach to fortify cryptographic systems by integrating Fibonacci polynomials into network security protocols. Leveraging the unique characteristics of polynomials and Fibonacci sequences, our methodology establishes public and private keys, enhancing message transmission security. Initial encryption with polynomials is followed by incorporating Fibonacci polynomials for an added layer of protection. Through this study, we demonstrate how Fibonacci techniques can enhance system security, providing advanced safeguards for network communications. By integrating polynomials and Fibonacci methods, our approach strengthens defense against potential threats, elevating overall system security. This innovative Polynomial-Fibonacci Hybrid Cryptography offers a promising avenue for enhancing data security in contemporary communication systems amidst escalating digital challenges.

Keywords

Cryptography Polynomials Fibonacci numbers Fibonacci polynomials Information security

Subject Classifications

Primary 11T7111B3911T55 Secondary 11B5011T0694A60

References

[1] Piper, Fred, and Sean Murthy. Cryptograph: A Very Short Introduction.
[2] Buchman, J. Introduction to Cryptography. Springer-Verlag (2001).
[3] Koblitz, Neal. A Course in Number Theory and Cryptography. IBSN 3-578071-8 SPIN 10893308.
[4] Ranasinghe, Rajitha, Chathurangi, Madusha & Athukorala, Pabasara. A novel improvement in RSA algorithm, Journal of Discrete Mathematical Sciences and Cryptography, 27:1, 143–150 (2024), DOI: 10.47974/JDMSC-1628.
[5] Philippou, A. N., et al., editors. Application of Fibonacci Numbers. Springer Science Media LLC.
[6] Clark, Benjamin, “Understanding the NTRU Cryptosystem” Williams Honors College, Honors Research Projects. 906 (2019).
[7] Mukhopadhyay, S. K., et al. “An ECG Signal Compression Technique Using ASCII Character Encoding.” Measurement, vol. 45, no.6, pp. 1651-1660 (2012).
[8] Panwar, Yashwant K., et al. “Generalized Fibonacci Polynomials.” Turkish Journal of Analysis & Number Theory, vol. 1, no. 1, pp. 43-47 (2013).
[9] Gudela Ashok, S. Ashok Kumar, D. Chaya Kumari & Mathe Ramakrishna. A type of public cryptosystem using polynomials and pell sequences, “Journal of Discrete Mathematical Sciences and Cryptography”, 25:7, 1951-1963 (2022), DOI: 10.1080/09720529.2022.2133237.
[10] Piper, Fred, and Sean Murphy. Cryptography: A very short introduction. Vol. 68. Oxford Paperbacks (2002).
[11] Sekhar, A. Chandra, S Ashok Kumar. “Symmetric Key Cryptosystem for Multiple Encryptions.” International Journal of Mathematics Trends and Technology (IJMTT), vol. 29 (2016).
[12] Sekhar, A. Chandra, S Ashok Kumar. “Triple Encryption Scheme Using Two Independent Keys.”
[13] Rao, K. Subba. “Some Properties of Fibonacci Numbers.” The American Mathematical Monthly, vol. 60, no. 10, pp. 680-684 (1953), doi: 10.1080/00029890.1953.11988390.
[14] Bisht, Nivedita, and Sapna Singh. “A Comparative Study of Some Symmetric and Asymmetric Key Cryptography Algorithms.” International Journal of Innovative Research in Science, Engineering and Technology, vol. 4, no. 3, pp. 1028-1031 (2015).
[15] Kumar, Ankit, et al. “An improved quantum key distribution protocol for verification.” Journal of Discrete Mathematical Sciences and Cryptography 22.4 : 491-498 (2019).
[16] Khoshy, Thomas. Fibonacci and Lucas Numbers with Applications. ISBN: 978-0-471-39969-8.
[17] A. Chandra Sekhar, V. Anusha, B. Ravi Kumar & S. Ashok Kumar. Linearly independent spanning sets and linear transformations for Multi-level Encryption, Journal of Information and Optimization Sciences, 36:4, 385-392 (2015), DOI: 10.1080/02522667.2014.961821.

Views: 219Downloads: 75Citations: 0