RSA Cryptosystem Using Python
RSA Cryptosystem Using Python
Volume 4 Issue 6, September-October 2020 Available Online: www.ijtsrd.com e-ISSN: 2456 – 6470
I. INTRODUCTION
The Rivest-Shamir-Adleman (RSA) was publically described
in 1977, which is used by modern computers to encrypt and
decrypt the messages. It is an asymmetric
cryptographic algorithm. As two different keys are used in
this algorithm hence the name asymmetric. One key is
shared to anyone therefore it is also called public key
cryptography. Public key cryptography is largely used for
authentication, non-repudiation, and key exchange. RSA is a
relatively slow algorithm. Due to this limitation, it is not
commonly used to directly encrypt data. RSA is used to
transmit shared keys, which are then used for bulk
encryption-decryption. RSA involves four steps for the
complete process which are key generation, key distribution,
encryption, and decryption. All steps are mentioned below.
Fig1: RSA Public Key and Private Key Generation
II. WORKING OF RSA Method
1. Key Generation: Each person or a party who desires to
participate in communication using encryption needs to 2. Key Distribution: If a message is sent from one end to
generate a pair of keys, namely public key and private the other using RSA, one person will have the public key
key. which is used for encryption (n, e) and other person will
A. Generating the RSA modulus (n) have the private key which will be used for decryption
B. Finding Derived Number (e) (d) and won’t be distributed.
C. Forming the public key
D. Forming the private key
@ IJTSRD | Unique Paper ID – IJTSRD35752 | Volume – 4 | Issue – 6 | September-October 2020 Page 1708
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
3. Encryption: Message is encrypted using a public key To encrypt a plaintext M using an RSA public key we simply
(n, e). To encrypt the first plaintext P, this is modulo n. represent the plaintext as a number between 0 and N-1 and
Mathematical step for encryption is − C = Pe mod n then compute the ciphertext C as:
C = Me mod N.
Ciphertext C is equal to the plaintext P multiplied by
itself e times and then reduced modulo n. To decrypt a ciphertext C using an RSA public key we simply
compute the plaintext M as:
4. Decryption: Message is decrypted using private key by M = Cd mod N.
the receiver. The receiver has received a ciphertext.
Plaintext = Cd mod n V. IMAGE ENCRYPTION AND DECRYPTION
Example can be Core banking which is a set of services
provided by the group of networked bank branches. These
days Internet multimedia is on highest demand.
IV. FLOWCHART
VI. CONCLUSION
Though, RSA is most used algorithm these days, still it has
some limitations which are getting replaced by further
versions of RSA. In today’s digital world the most important
thing is to encrypt the image due to various types of attacks
and misusing of the same. Image encryption using RSA is
proved to be efficient enough and highly securable.
@ IJTSRD | Unique Paper ID – IJTSRD35752 | Volume – 4 | Issue – 6 | September-October 2020 Page 1709
International Journal of Trend in Scientific Research and Development (IJTSRD) @ www.ijtsrd.com eISSN: 2456-6470
VII. REFERENCES [4] http://www.isg.rhul.ac.uk/static/msc/teaching/ic2/d
[1] https://ieeexplore.ieee.org/document/6021216/figu emo/42.htm
res#figures
[5] https://en.wikipedia.org/wiki/RSA_(cryptosystem)
[2] https://www.tutorialspoint.com/cryptography/publi
[6] https://www.geeksforgeeks.org/rsa-algorithm-
c_key_encryption.htm
cryptography/
[3] http://www.ijcset.net/docs/Volumes/volume5issue9
[7] https://www.di-mgt.com.au/rsa_alg.html
/ijcset2015050902.pdf
@ IJTSRD | Unique Paper ID – IJTSRD35752 | Volume – 4 | Issue – 6 | September-October 2020 Page 1710