Résultats plein texte:

rsa

5 Occurrences trouvées, Dernière modification : il y a 3 ans

required bit length * phi = (p-1)(q-1) * public exponent e: 1 < e < phi, gcd(e, phi) = 1 * se... , ed ≡ 1 (mod phi) * destroy p, q and phi * public key: n , e * private key: n, d * Encryption: ... | d mod (q - 1) | exponent2 | | Exponent | e, the public exponent | publicExponent | | InverseQ | (InverseQ)(q) = 1 mod p | coefficient | | Modulus | n | modulus