You can execute the attack using the Attack on Small Secret Keys dialog.
The attack on short secret keys allows to factor a RSA-Modulus N efficiently, if the public key e is known and the secret key d is selected too small.For this purpose this task is transformed into a root-finding problem, which
is solved with the method of Lattice reduction.
We start with the following equation of the RSA
Cryptosystem:
[BD00] | Boneh, Dan; Durfee, Glenn:
Cryptanalysis of RSA with private key d less than N0.292. In: IEEE
Transactions on Information Theory Bd. 46, 2000. – ISSN 0018–9448,
S. 1339–1349 |
[BM01] | Blömer, Johannes; May, Alexander: Low Secret Exponent RSA Revisited. In: Cryptography and Lattice Conference (CaLC 2001), Lecture Notes in Computer Science Bd. 2146, Springer, 2001, S. 4–19 |
[May03] | May, Alexander: New RSA Vulnerabilities Using Lattice Reduction Methods, University of Paderborn, Diss., 2003 |