An RSA encryption implementation for secure data transmission, written in Rust.
- Choose p and q
- Compute n = p * q
- Compute φ(n) = (p - 1) * (q - 1)
- Choose e such that 1 < e < φ(n) and e and φ (n) are coprime.
- Compute a value for d such that (d * e) % φ(n) = 1.
- Public key is (e, n)
- Private key is (d, n)
Using public key (e, n)
- Lightning-fast performance: Experience unmatched speed thanks to the power of Rust, leaving other languages in the dust. ⚡️
- Bulletproof security: Rest easy knowing your data is protected by the battle-tested RSA algorithm and our meticulous coding practices.️
- Effortless usability: Enjoy an intuitive and user-friendly experience, making encryption accessible to everyone.
- Enhanced error handling for a smoother experience.