Abstract
Now - a- days, the exchange of sensitive information, such as credit card numbers, over the internet is common practice. Protecting data and electronic systems is crucial to our way of living. Cryptography deals with the study of communication over a channel may not be secure and problems related with them. One such well known algorithm is RSA algorithm. This paper displays the classical RSA algorithm and modifies the work in generation of keys. There will be two assignments for the alphabets. Here the only interest is on messages with two letters.
Highlights
Cryptography is a concept of protecting information and conversations which are transmitted through a public source, so that the intended persons only read and process it
Public key is visible to all but private key is used by intended persons only
Making use of Gaussian primes with large real and imaginary parts will leads to a difficulty in factorizing
Summary
Cryptography is a concept of protecting information and conversations which are transmitted through a public source, so that the intended persons only read and process it. There are several encryption and decryption algorithm which involves mathematical concepts to provide more security to the text which has to be shared through a medium. RSA algorithm is a well- known asymmetric cryptography algorithm which uses public and private keys. Public key is visible to all but private key is used by intended persons only. The idea of this algorithm depends on the fact that factorization of large integers into primes is hard. Already there are some works regarding the Gaussian integer application on RSA algorithm [1,2,3]. The main idea in this paper is to just remodel the classical RSA algorithm by using Gaussian primes. This paper was developed mainly for sharing two lettered messages
Sign-in/Register to view highlights & summary 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 callMore From: INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER RESEARCH
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
