3 ms·
If it were just that, it would be trivial to break. It's the fact you generate the key after a modulus operation that makes it difficult to recover.
by akira2501 4y ago
If it were just that, it would be trivial to break. It's the fact you generate the key after a modulus operation that makes it difficult to recover.
- nullc 4y agoNope. The public key is not reduced mod anything in RSA. The large semiprime the user calculates is emitted explicitly as part of the public key and is used as a modulus in RSA operations. Factoring that large integer directly yields the user's private key.
- akira2501 4y agoYep.. should not have done that from memory. I had the private exponent in mind and forgot about the simplicity of the actual "RSA problem."