Project Name: RSA Cryptosystem

Description: This project provides an in-depth analysis of the RSA Cryptosystem, focusing on its implementation, encryption, and decryption processes using large prime numbers. It also explores the mathematical foundations of RSA, such as modular arithmetic and the use of public and private keys for secure communication.

Programming Languages/Tools: Python

Features:

• Mathematical Foundations: Detailed exploration of modular arithmetic, prime numbers, Euler’s Theorem, and the Extended Euclidean Algorithm, which are integral to RSA.
• Key Generation: Implementation of RSA key generation using large prime numbers and calculating both public and private keys based on mathematical operations.
• Encryption & Decryption: Practical coding of RSA encryption and decryption processes with modular exponentiation.
• Comparative Analysis: Comparative analysis with symmetric encryption techniques such as Simplified AES (S-AES), highlighting RSA’s advantages in public-key cryptography.
• Toy Simulations: Practical toy simulations to demonstrate RSA's functionality with Python code, showcasing key generation, encryption, and decryption with example messages.
• Modern Cryptography Applications: Discussion of RSA’s applications in securing digital communications, including online banking and secure messaging.

View on GitHub View Project Report