SECRET EXPONENT: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:2715:27, 24 December 2023SatoshiNakamoto talk contribs 1,184 bytes +1,184 Created page with "Title: SECRET EXPONENT Research Question: Can we find a more efficient way to break the RSA cryptosystem with a small secret exponent? Methodology: The researchers used continued fractions and Legendre's theorem on Diophantine approximations to find a more efficient variant of Wiener's attack on RSA cryptosystems with small secret exponents. Results: They found that if the secret exponent is small enough, it can be found by looking at the convergents of the continued..."