Skip to Content [alt-c]
In reply to Duplicate Signature Key Selection Attack in Let's Encrypt
The math in your RSA explanation is a bit wrong. The modular-inverse relationship between d and e exists only in the modulus of the totient of n, not n itself. RSA's security comes from the totient being difficult to compute without knowing the two primes chosen to compute n. A modular inverse is otherwise very easy to calculate.
Reply
Your comment will be public. To contact me privately, email me. Please keep your comment polite, on-topic, and comprehensible. Your comment may be held for moderation before being published.
Your Name: (Optional; will be published)
Your Email Address: (Optional; will not be published)
Your Website: (Optional; will be published)
>
monospaced
Post a Reply
Your comment will be public. To contact me privately, email me. Please keep your comment polite, on-topic, and comprehensible. Your comment may be held for moderation before being published.