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.
Highlights
Institutions in both the public and private sectors have become progressively based on electronic data processing
The safety of our collaborate Hill cipher and RSA cryptography system is ground on various factors: First is that we utilize a key matrix A, which is only recognized to first party and second party (Koblitz, 1998)
Third since you recognize n it will be relatively simple to find j if you just divide n to determine the primes p and never less no one has enough time effectively to factor n when n only two very large prime factors and fourth the collaborate of these two cryptosystem gives a safety where the plaintext is entirely unthinkable to find out for the third parties
Summary
An Execution of a Mathematical Example Using Euler’s Phi-Function in Hill Chiper Cryptosystem. § Presented at the International conference on Applied Science Mathematics and Statistics (ICASMS - 2020), 25-26 November 2020, organized by SciencePlus Global Research Forum
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
