Samples of RSA (Rivest–Shamir–Adleman) public-key cryptosystem implementations for learning purposes

• src/rsa_gmp.rs - uses a rug, a high-level interface to the wrapper over GNU MP / GMP, a well known arbitrary precision arithmetic library
• src/rsa_openssl_bn.rs - uses an openssl, a safe interface to the popular OpenSSL library
• src/rsa_num.rs - uses a num, a collection of numeric types and traits in pure Rust

1. Choose two distinct primes p and q

   FIPS.186-4, Section: B.3.1 Criteria for IFC Key Pairs

   sqrt(2)*2^((nlen/2)-1) <= p <= 2^(nlen/2)-1
   
   sqrt(2)*2^((nlen/2)-1) <= q <= 2^(nlen/2)-1
   
   |p - q| > 2^((nlen/2)-100)  
   

   where:

   ^ is an exponentiation (power) arithmetic operation

   nlen is the appropriate length for the desired security strength

2. Compute the modulus, n

   n = p * q
   

3. Compute the totient, t

• Euler's totient function is used in the original RSA

  φ(n) = (p − 1) * (q − 1)
  

  which outputs the amount of numbers that are coprime to n

• Carmichael function is recommended for modern RSA-based cryptosystems, also known as reduced totient function or least universal exponent function

  λ(n) = lcm(p − 1, q − 1)
  

  where lcm() is the least common multiple

4. Choose a public key exponent, integer e (usually 65537 in decimal, or 0x010001 in hex)

   1 < e < t
   gcd(t, e) = 1
   

5. Compute the modular multiplicative inverse, d

   d = (e ^ (−1)) mod t
   1 = (d * e) mod t
   

6. Public key

   (e, n)
   

7. Private key

   (d, n)
   

The numbers p, q, and d must be kept secret

The encryption of the plaintext message, m

c = (m ^ e) mod n

The decryption of the ciphertext, c

D = (c ^ d) mod n

• RSA in Wikipedia
• FIPS 186-4, Key Pair Generation

This project was created for research purposes and is not intended for use in production systems.