This is a simple implementation of the RSA encryption algorithm in Rust. It generates two 16-bit prime numbers, computes the public and private keys, and demonstrates encryption and decryption of a message. Please note that this implementation is for educational purposes only and should not be used in production systems. In real-world applications, use well-established libraries and ensure proper key sizes for security. This implementation is intentionally slow and inefficient, especially in the key generation phase, to illustrate the underlying concepts of RSA.
- num-primes = "0.2" (for generating prime numbers)
- rand = "0.8" (for random number generation)