Talk:Wiener's attack

Way too much info about RSA.

This formula is wrong for RSA. It is the product and not the lcm. $ed\equiv 1{\pmod {\operatorname {lcm} (p-1,q-1))}}$,

Broken References

Hi, the reference list's [1] source is broken. Can someone update this? — Preceding unsigned comment added by CampbellDobbs400 (talk • contribs) 17:34, 7 July 2020 (UTC)

Practical utility of small exponents?

Picking a small decryption (or encryption) exponent for one's key is certainly something that a novice may think is a great way to speed things up, but how much of an advantage would that be in practice (even if we were to disregard this attack)? Using exponentiation by squaring (and its variants), it doesn't matter that much if the exponent is hundreds of bits long, even if a twice as long exponent will require twice as many multiplications overall. An improvement to the article could be to comment upon this matter. ~2026-41802-80 (talk) 16:41, 9 August 2026 (UTC)