Application of Extended Euclid Algorithm on Hill Cipher Cryptography Modulo 95
DOI:
https://doi.org/10.30599/jti.v15i2.2850Keywords:
cryptography, Extended Euclid, modulo 95, hill cipherAbstract
Hill Cipher Cryptography is the art of hiding a message using an invertible matrix as the key. Let A be a 2 2 invertible matrix of the real number. Encryption performed by converting each character on the original message into an ASCII code. The result of the conversion is multiplied by matrix A using matrix multiplication operation modulo 95 which result added with 32. The calculation result in the form of numbers is re-converted into characters according to the ASCII code. It is described in parallel, while the ciphertext matrix is operated using matrix A^(-1). Since matrix A is an invertible matrix and not supposed to have 1/-1 determinant, the matrix result is possibly a non-integer real number. Therefore, the extended Euclid algorithm is needed to finish the description process for finding out the modulo 95 number of a non-integer real number.
Downloads
References
Alfred J. , M., Paul C, O., & Scott A, V. (1996). Handbook of Applied Cryptography. Boca Raton: CRC Press.
Forouzan, B. A. (2008). Introduction to Cryptography and Network Security. New York: McGraw-Hill.
Puspita, N. P., & Nurdin, B. (2010). KRIPTOGRAFI HILL CIPHER DENGAN MENGGUNAKAN OPERASI MATRIKS. Seminar Nasional Ilmu Komputer Universitas Diponegoro. Semarang: Universitas Diponegoro.
Schneier, B. (1996). Applied Cryptography: Protocols, Algorithms, and Source Code in C. New York: John Wiley and Sons.
Singh, L. D., & Singh, K. M. (2015). Implementation of Text Encryption using Elliptic Curve Cryptography. Procedia Computer Science, 73-82.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2023 Annisa, Nikken Prima Puspita, Nurdin Bachtiar, Eriska Meiyana
This work is licensed under a Creative Commons Attribution 4.0 International License.
Abstract Views: 33
| 
File Views: 17
