|
54
|
Finding a small root of a bivariate integer equation; factoring with high bits known
– D Coppersmith
- 1996
|
|
76
|
Finding a small root of a univariate modular equation
– D Coppersmith
- 1996
|
|
142
|
Small Solutions to Polynomial Equations, and Low Exponent Vulnerabilities
– D Coppersmith
- 1997
|
|
14
|
New RSA Vulnerabilities Using Lattice Reduction Methods
– A May
|
|
554
|
Factoring polynomials with rational coefficients
– A K Lenstra, H W Lenstra, L Lovász
- 1982
|
|
347
|
Private Information Retrieval
– Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan
- 1997
|
|
170
|
Replication Is Not Needed: Single Database, Computationally-Private Information Retrieval (Extended Abstract)
– Eyal Kushilevitz, Rafail Ostrovsky
- 1997
|
|
57
|
An Oblivious Transfer Protocol with Log-Squared Communication
– Helger Lipmaa
- 2004
|
|
256
|
An improved algorithm for computing logarithms over GF (p) and its cryptographic significance
– S Pohlig, M Hellman
- 1978
|
|
11
|
Finding Small Roots of Bivariate Integer Polynomial Equations Revisited
– Jean-sébastien Coron
- 2004
|
|
11
|
A Strategy for Finding Roots of Multivariate Polynomials with New Applications
– E Jochemsz, A May
- 2006
|
|
25
|
Finding small solutions to small degree polynomials
– D Coppersmith
|
|
7
|
New Partial Key Exposure Attacks on
– J Blömer, A May
- 2003
|
|
30
|
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
– Phong Nguyen
- 1999
|
|
152
|
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems.
– C. P. Schnorr, M. Euchner
- 1993
|
|
4
|
Secret Exponent Attacks on RSA-type Schemes with Moduli N = p r q”, Practice and Theory
– A May
- 2004
|
|
6
|
New Attacks on RSA with Small Secret CRT-Exponents
– Daniel Bleichenbacher, Er May, Tu Darmstadt
- 2006
|
|
33
|
An attack on RSA given a small fraction of the private key bits
– D Boneh, G Durfee, Y Frankel
- 1998
|
|
22
|
Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt ’99
– Glenn Durfee, Phong Q. Nguyen
- 2000
|