compute_private_exponent_carmicheal

rsa::algorithms::rsa

Function compute_private_exponent_carmicheal 

Source 
pub(crate) fn compute_private_exponent_carmicheal(
    p: &BigUint,
    q: &BigUint,
    exp: &BigUint,
) -> Result<BigUint>
Expand description

Compute the private exponent from its primes (p and q) and public exponent

This is using the method defined by NIST 800-56B Section 6.2.1. (Carmichael function)

FIPS 186-4 requires the private exponent to be less than λ(n), which would make Euler’s totiem unreliable.