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 | (Inverse... bF4UlABupXlIZTyuCBS1</D>
</RSAKeyValue>
</code>
Public only:
<code xml>
<RSAKeyValue>
<Modulus>t6yVb
