An Execution of a Mathematical Example Using Euler’s Phi-Function in Hill Chiper Cryptosystem

Abstract

In this article, we have explained the RSA public-key cryptosystem initiate by Rivest and Hill Chiper cryptosystem initiate by Lester. Hill for coding and decoding the text. To explain these we apply the Euler-phi function, congruence, and simple Matrix Application in cryptography to decode and encode the message. In our analyses, we have collaborated two cryptosystems which is more assured than standard cryptographic process such as Ceaser cipher. We apply both secret-key cryptography and public-key cryptography which differ from standard cryptography. In our presentation, we use two keys for coding and two for decoding.