Application of Unimodular Hill Cipher and RSA Methods to Text Encryption Algorithms Using Python

Abstract

Text encryption is one of the techniques used to maintain the confidentiality of information in digital communications. In this study, we propose to apply a combination of the Unimodular Hill Cipher and RSA methods to a text encryption algorithm using the Python programming language. The Unimodular Hill Cipher method uses an unimodular matrix to replace text characters with encrypted characters, while RSA (Rivest-Shamir-Adleman) is a public key encryption algorithm that relies on modulo arithmetic properties. The purpose of this research is to combine the strengths of the two methods and produce a more secure text encryption system. Unimodular Hill Cipher provides the advantage of randomizing text characters by using matrix modulo operations, while RSA provides a high level of security through the use of public and private key pairs. In this study, we explain in detail the basic theory and algorithms of the Unimodular Hill Cipher and RSA. We also describe the implementation steps of both methods in the Python programming language. The text data used in this study went through a preprocessing stage before being encrypted. We also analyze the results of the encryption using several statistical methods to measure how close the relationship between the original text and the result of the encryption is. In a comparative analysis with the previous paper, in this study, the use of the Unimodular Hill Cipher and RSA methods in the context of Python provides additional insight into the performance and level of security of both. The experimental results show that the combination of the Unimodular Hill Cipher and RSA methods can produce a higher level of security in text encryption. It is hoped that this research can contribute to the development of a more effective and secure text encryption algorithm.