CRYPTOGRAPHIC ENCRYPTION BASED ON RAIL-FENCE PERMUTATION CIPHER

  • Michael N. John Department of Mathematics, Akwa Ibom State University, Nigeria
  • Ogoegbulem Ozioma Department of Mathematics, Dennis Osadebay University, Anwai, asaba, Delta, State, Nigeria
  • Udoaka Otobong. G. Department of Mathematics, Akwa Ibom State University, Nigeria
  • Boniface O. Nwala Department of Mathematics, Ignatius Ajuru University of Education
  • Obi Perpetua Ngozi Department of Mathematics, Imo State College of Education, Nigeria
DOI: https://doi.org/10.5281/zenodo.10209885
Keywords: Cryptographic Encryption, Permutation Ciphers, Confidentiality, Classical Cryptography, Security, Cipher Mechanisms

Abstract

Cryptographic systems play a pivotal role in securing sensitive information in various domains. Permutation ciphers, a fundamental component of classical cryptography, involve the rearrangement of characters in a message to achieve confidentiality. This paper explores the principles and applications of permutation ciphers in cryptographic encryption. The study delves into the historical context, the underlying mechanisms of permutation ciphers, and their relevance in contemporary cryptographic practices. Using permutation on n symbols and Rail Fence Cipher, we construct an algorithm for encrypting and decrypting a message for n = 2, 3

Downloads

Download data is not yet available.

References

[1] B. Abdulaziz, M. Hamed and Ibrahim O. A. Albudawe, Encrypt and decrypt messages using invertible matrices modulo 27, American Journal of Engineeering Research, 6(6)(2017), 212-218.
[2] T. M. Apostol, Introduction to analytic number theory, Springer- Verlag, New York, (2011).
[3] S. Arumugam and A. Thangapandi Issac, Modern algebra, Scitech Publications Pvt. Ltd, India, (2018).
[4] D. M. Burton, Elementary Number Theory, McGraw-Hill, New York, (2011).
[5] J. Kannan and Manju Somanath, Congruum Problem, International Journal of Pure and Applied Mathematical Sciences, 9(2)(2016), 123-131.
[6] J. Kannan and Manju Somanath, Fundamental Perceptions in Contemporary Number Theory, Nova Science Publishers, New York, (2023).
[7] J. Kannan, M. Mahalakshmi and A. Deepshika, Cryptographic Algorithm involving the Matrix Qp∗ , Korean J. Math., 30(3)(2022), 533-538.
[8] Manju Somanath, K. Raja, J. Kannan and M. Mahalakshmi, On a class of solutions for a quadratic Diophantine equation, Advances and Applications in Mathematical Sciences, 19(11)(2020), 1097-1103.
[9] Neha Sharma and Sachin Chirgaiyam, A Novel Approach to Hill Cipher, International Journal of Computer Applications, 108(11)(2014), 34-37. Cryptographic Algorithm Based on Permutation Ciphers / A. Deepshika et al. 7
[10] K. H. Rosen, Elementary number theory and its applications, Addison-Wesley Publishing Company, Boston, (1987).
[11] D. R. Stinson and M. B. Paterson, Cryptography theory and practice, CRC Press, Taylor and Francis Group, (2006). [12] S. G. Telang, Number Theory, Tata McGraw - Hill Publishing Company Limited, New York, (1996).
[12] Knight, S., n.d. The Rail Fence Cipher. [Online] Available at: http://www.cs.trincoll.edu/~crypto/historical/railfence.html
Published
2023-11-26
How to Cite
N. John, M., Ozioma, O., Otobong. G., U., O. Nwala, B., & Perpetua Ngozi, O. (2023). CRYPTOGRAPHIC ENCRYPTION BASED ON RAIL-FENCE PERMUTATION CIPHER. GPH - International Journal of Mathematics, 6(11), 01-06. https://doi.org/10.5281/zenodo.10209885
Issue
Vol 6 No 11 (2023): GPH - International Journal of Mathematics
Section
Articles

Copyright (c) 2023 Michael N. John

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the GPH Journal will have the full right to remove the published article on any misconduct found in the published article.

Most read articles by the same author(s)