On the Security of Multi-prime RSA

On the Security of Multi-prime RSA (2006)

Cached

Download Links

by M. Jason Hinek

Citations:

BibTeX

@MISC{Hinek06onthe,
    author = {M. Jason Hinek},
    title = {On the Security of Multi-prime RSA},
    year = {2006}
}

Bookmark

OpenURL

Abstract

Abstract. In this work we collect the strongest known algebraic attacks on multi-prime RSA. These include factoring, small private exponent, small CRT exponent and partial key exposure attacks. Five of the attacks are new. A new variant of partial key exposure attacks is also introduced which applies only to multi-prime RSA with more than two primes. 1

Citations

142	Small Solutions to Polynomial Equations, and Low Exponent Vulnerabilities - Coppersmith - 1997
107	Twenty years of attacks on the RSA cryptosystem - Boneh - 1999
85	Cryptanalysis of RSA with private key d less than N 0.292 - Boneh, Durfee - 1999
76	Finding a small root of a univariate modular equation - Coppersmith - 1996
54	Finding a small root of a bivariate integer equation; factoring with high bits known - Coppersmith - 1996
35	Factoring N = p r q for large r - Boneh, Durfee, et al. - 1999
33	An attack on RSA given a small fraction of the private key bits - Boneh, Durfee, et al. - 1998
19	Low Secret Exponent RSA Revisited - Blomer - 2001
16	New Partial Key Exposure Attacks on RSA - Blömer, May - 2003
16	Exposing an RSA Private Key Given a Small Fraction of its Bits”, Full version of the work from Asiacrypt’98, available at http://crypto.stanford.edu/~dabo/abstracts/bits_of_d.html - Boneh, Durfee, et al. - 1998
13	Partial Key Exposure Attacks on RSA up to Full Size Exponents - Ernst, Jochemsz, et al. - 2005
11	Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach - Coron
7	Short private exponent attacks on fast variants of rsa - Ciet, Koeune, et al. - 2003