A Study and Implementation of RSA Cryptosystem
Sinjan Chakraborty, Vineet Kumar

TL;DR
This paper presents an implementation of the RSA encryption algorithm in C, demonstrating key generation, encryption, and decryption processes for secure message transmission.
Contribution
It provides a practical implementation of RSA, including prime generation, key creation, and message encryption/decryption in C language.
Findings
Successful encryption and decryption of messages
Demonstrates RSA key generation process
Validates RSA's functionality in C implementation
Abstract
This project involves an implementation of the Rivest Shamir Adleman (RSA) encryption algorithm in C. It consists of generation of two random prime numbers and a number co- prime to phi(n) also called euler toitent function. These three are used to generate a public key and private key. The user has to enter a message which is encrypted by the public key. The algorithm also decrypts the generated cipher text with the help of the private key and returns the plain text message which was encrypted earlier.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChaos-based Image/Signal Encryption · Cryptography and Data Security · Cryptography and Residue Arithmetic
