Designing a New Hybrid Cryptographic Model using Coordinate Axes

Yıl 2020, Cilt: 5 Sayı: 1, 31 - 41, 01.06.2020

Burhan Selçuk Ayşe Nur Altıntaş Tankül Ayşegül Dündar Zehra Akkuş Mehmet Arslan

Öz

With the rapid development of technology, one of the most important requirements in today’s systems is the reliable transfer of information and confidentiality. Thus, military, electronics, banking systems and many other places have become the fields of use of cryptography science. Cryptology methods are used to solve these problems. In this study, a new poly-alphabetic substitution cipher is designed using the coordinate axes. This hybrid method is a mix of the Polybius square cipher and the Vigenère cipher, reinforced with the RSA cryptography algorithm. There are multiple points for a letter in the coordinate axis and there is randomness in the calculation of these points, so the proposed method is a strong encryption method that is difficult to decode.

Anahtar Kelimeler

Poly-alphabetic substitution cipher, Vigenère cipher, Polybius square cipher, RSA, Coordinate axis

Kaynakça

• T. M. Aung, H. H. Naing, and N. N. Hla, A Complex Transformation of Monoalphabetic Cipher to Polyalphabetic Cipher: (Vigenère-Affine Cipher). International Journal of Machine Learning and Computing, (2019) 9 (3) (June).
• P. Chaudhury, S. Dhang, M. Roy, S. Deb, J. Saha, A. Mallik, S. Bal, S. Roy, M. K. Sarkar, R. Das, ACAFP: Asymmetric Key based Cryptographic Algorithm using Four Prime Numbers to Secure Message Communication. A Review on RSA Algorithm, 8th Annual Industrial Automation and Electromechanical Engineering Conference (IEMECON), Bangkok, (2017) 332–337.
• R. Chaves, L. Sousa, N. Sklavos, A. P. Fournaris, G. Kalogeridou, P. Kitsos, F. Sheikh, Secure Hashing: SHA-1, SHA-2, and SHA-3, Taylor & Francis Group, LLC, 2016.
• FIPS 197, Announcing the ADVANCED ENCRYPTION STANDARD (AES). National Institute of Standarts and Technology (NIST) 2001.
• FIPS 46-3, Data Encryption Standard. National Institute of Standarts and Technology (NIST), 1999.
• H. J. Highland, Data encryption: A non-mathematical approach, Computer & Security Volume 16, Issue 5, 1997, Pages 369-386.
• R. S. Kartha, V. Paul, An Efficient Algorithm for Polyalphabetic Substitution Using Infinite Number of Alphabetical Tables. International Journal of Applied Engineering Research, (2018) 13 (4), 14-20.
• J. Katz, Y. Lindell, Introduction to Modern Cryptography: Principles and Protocols, Chapman & Hall, 2008.
• Ç. Koç, Cryptographic Engineering, Springer-Verlag, 2009.
• Y. Kumar, R. Munjal, H. Sharma, Comparison of Symmetric and Asymmetric Cryptography with Existing Vulnerabilities and Countermeasures. IJCSMS International Journal of Computer Science and Management Studies, (2011) 11 (03), 60–63.
• V. Miller, Use of elliptic curves in cryptography. Conference on the theory and application of cryptographic techniques, Springer, (1985) 417–426.
• C. Paar, J. Pelzl, Understanding Cryptography: A Textbook for Student and Practitioners, Springer, 2010.
• A.J. Paul, P. Mythili, Poly-alphabetic Substitution Mapping for Cryptographic Transformations. Conference: National Conference on Recent Innovations in Technology, (2009) (March).
• Plato (2002) The Republic. IDPH. Retrieved from, http://www.idph.net/conteudos/ebooks/republic.pdf
• A. A. P. Ratna, P. D. Purnamasari, A. Shaugi, M. Salman, Analysis and Comparison of MD5 and SHA-1 Algorithm Implementation in Simple-O Authentication based Security System. 2013 International Conference on QiR, 2013 99–104.
• R. L. Rivest, A. Shamir, and L.M. Adleman, A method for obtaining digital signatures and public-key cryptosystems, CACM 21,2 (1978) pp. 120--126.
• R. Rivest, The MD5 Message-Digest Algorithm. Network Working Group, MIT Laboratory for Computer Science and RSA Data Security, Inc., April 1992.
• A. Saraswat, C. Khatri, Sudhakar, P. Thakral, P. Biswas, An Extended Hybridization of Vigenère and Caesar Cipher Techniques for Secure Communication. Procedia Computer Science 92 (2016) 355 – 360.