Cryptography: RSA & Vigenere Cipher
Full implementation of RSA encryption/decryption with cryptographic attacks including weak key detection, broadcast attacks using Chinese Remainder Theorem, and parity oracle exploits.
Overview
A comprehensive cryptography project implementing RSA and Vigenere cipher algorithms with various cryptographic attacks. The project demonstrates deep understanding of public-key cryptography, including key generation, encryption/decryption, and multiple attack vectors using advanced mathematical techniques like the Chinese Remainder Theorem and modular arithmetic.
Technologies
Key Features
- ✓RSA key generation with large prime numbers
- ✓RSA encryption and decryption implementation
- ✓Vigenere cipher with dictionary-based cryptanalysis
- ✓Weak RSA key detection using GCD analysis
- ✓RSA broadcast attack using Chinese Remainder Theorem
- ✓Parity oracle attack for plaintext recovery
Challenges
Handling arbitrary-precision arithmetic for 2048+ bit RSA operations, implementing mathematically complex attacks on cryptographic systems, and managing precision issues with Python's Decimal module for extremely large numbers.
Results
Successfully implemented multiple cryptographic algorithms and attacks, demonstrating mastery of both classical and modern cryptography principles. Achieved 100% score on the project.