Struct ToyRsa 

pub struct ToyRsa {
    pub n: u64,
    pub e: u64,
    pub d: u64,
}

Toy RSA key pair (n, e, d).

WARNING

This is a toy implementation for education only. It uses tiny parameters and is completely insecure. NEVER use for real data.

Fields

n: u64

RSA modulus n = p * q

e: u64

Public exponent e (typically 65537 in real RSA)

d: u64

Private exponent d (e^{-1} mod λ(n))

Implementations

impl ToyRsa

pub fn generate(p: u64, q: u64) -> Option<Self>

Generate a toy RSA key pair from two small primes p and q.

Computes n = p*q, λ(n) = lcm(p-1, q-1), chooses e=65537 (or 3 as fallback), and derives d = e^{-1} mod λ(n).

Returns None if the primes are unsuitable (e.g., gcd(e, λ(n)) ≠ 1).

WARNING

Educational only. Real RSA requires 2048-bit+ primes.

pub fn encrypt(&self, m: u64) -> u64

Encrypt plaintext m as m^e mod n.

WARNING

Toy implementation. Does not pad, not semantically secure.

pub fn decrypt(&self, c: u64) -> u64

Decrypt ciphertext c as c^d mod n.

WARNING

Toy implementation only.