|
7
|
A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers
– Johannes Blömer, Alexander May
- 2005
|
|
10
|
Using LLL-Reduction for Solving RSA and Factorization Problems: A Survey
– Alexander May
- 2007
|
|
7
|
Worst Cases and Lattice Reduction
– Damien Stehlé, Vincent Lefèvre, Paul Zimmermann
|
|
27
|
Paillier's Cryptosystem Revisited
– Dario Catalano , Rosario Gennaro, Nick Howgrave-Graham, Phong Q. Nguyen
- 2001
|
|
6
|
Searching worst cases of a one-variable function
– Damien Stehlé, Vincent Lefèvre, Paul Zimmermann
|
|
1
|
Computational Methods in Public Key Cryptology
– Arjen K. Lenstra
- 2002
|
|
8
|
Reducing lattice bases to find small-height values of univariate polynomials
– Daniel J. Bernstein
- 2004
|
|
1
|
On the Security of Multi-prime RSA
– M. Jason Hinek
- 2006
|
|
8
|
Predicting Nonlinear Pseudorandom Number Generators
– Simon R. Blackburn, Domingo Gomez-perez, Jaime Gutierrez, Igor E. Shparlinski
- 2004
|
|
14
|
Computing the RSA Secret Key is Deterministic Polynomial Time Equivalent to Factoring
– Alexander May
- 2004
|
|
54
|
The Two Faces of Lattices in Cryptology
– Phong Q. Nguyen, Jacques Stern
- 2001
|
|
|
Hardness Computing Bits of Secret Keys in Diffie-Hellman and Related Schemes
– Dan Boneh, Ramarathnam Venkatesan
- 1996
|
|
10
|
The Effectiveness of Lattice Attacks Against Low-Exponent RSA
– Christophe Coupé, Phong Nguyen, Jacques Stern
- 1999
|
|
12
|
On the Hardness of the Shortest Vector Problem
– Daniele Micciancio
- 1998
|
|
4
|
On the insecurity of a server-aided RSA protocol
– Phong Q. Nguyen, Igor E. Shparlinski
- 2001
|
|
3
|
On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
– Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
- 2006
|
|
1
|
Floating-Point LLL Revisited
– Phong Q. Nguy Ên, Damien Stehlé
|
|
16
|
Exposing an RSA Private Key Given a Small Fraction of its Bits
– Dan Boneh, Glenn Durfee, Yair Frankel
- 1998
|
|
4
|
Floating-Point LLL: Theoretical and Practical Aspects
– Damien Stehlé
|
