A. Lenstra, H. Lenstra and L. Lovasz, "Factoring polynomials with rational coefficients ", Mathematische Annalen, 1982 Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Closest Point Search in Lattices - Agrell, Eriksson, Vardy, Zeger (2002) (15 citations) (Correct)
The Two Faces of Lattices in Cryptology - Nguyen, Stern (2001) (7 citations) (Correct)
Lattices and Cryptography: an Overview - Stern (1998) (2 citations) (Correct)
Extended gcd and Hermite normal form algorithms via.. - Havas, Majewski.. (1998) (23 citations) (Correct)
The Effectiveness of Lattice Attacks Against Low-Exponent RSA - Coupé, Nguyen, Stern (1999) (Correct)
Lattice Reduction: a Toolbox for the Cryptanalyst - Joux, Stern (1994) (20 citations) (Correct)
Basis Reduction Algorithms and Subset Sum Problems - LaMacchia (1991) (3 citations) (Correct)
Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000) (12 citations) (Correct)
Some Simple 7-Designs - Betten, Laue, Wassermann (Correct)
Cryptanalysis of MQV with partially known nonces - Leadbitter, Smart (2002) (1 citation) (Correct)
The Integral Basis Method for Integer Programming - Haus, Köppe, Weismantel (2000) (3 citations) (Correct)
Combining Problem Structure with Basis Reduction to solve a.. - Louveaux, Wolsey (2000) (Correct)
Efficient Cryptographic Schemes Provably as Secure as Subset Sum - Impagliazzo, Naor (1996) (32 citations) (Correct)
Generic Gram-Schmidt Orthogonalization by Exact Division - Erlingsson, Kaltofen, Musser (1 citation) (Correct)
Sampling Short Lattice Vectors and the Closest Lattice.. - Ajtai, Kumar, Sivakumar (2002) (1 citation) (Correct)
A Sieve Algorithm for the Shortest Lattice Vector Problem - Ajtai, Kumar, Sivakumar (2001) (12 citations) (Correct)
A Note on the Shortest Lattice Vector Problem - Kumar, Sivakumar (1999) (1 citation) (Correct)
Guest Column: Complexity of SVP - A reader's digest - Kumar, Sivakumar (2001) (Correct)
On Membership Comparable Sets - Sivakumar (1999) (12 citations) (Correct)
Chinese Remaindering with Errors - Goldreich, Ron, Sudan (1998) (9 citations) (Correct)
Complexity Results for Some Eigenvector Problems - Eiter, Gottlob (2000) (1 citation) (Correct)
New Partial Key Exposure Attacks on RSA - Blömer, May (2003) (2 citations) (Correct)
Series Logo - Volume Number Xxxx (Correct)
Collision-Free Hashing from Lattice Problems - Oded Goldreich Shafi (1996) (10 citations) (Correct)
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
Communication over MIMO Broadcast Channels Using.. - Taherzadeh.. (Correct)
LLL Reduction Achieves the Receive Diversity in MIMO.. - Taherzadeh, Mobasher.. (2005) (Correct)
Public-Key Cryptosystems - From Lattice Reduction (1996) (Correct)
Lattice Based Cryptography: A Global Improvement - Daniele Micciancio Laboratory (1999) (3 citations) (Correct)
Computing a Reduced Lattice Basis from a Generating System - Buchmann, Kessler (1993) (2 citations) (Correct)
A Subexponential Algorithm for the Determination of Class Groups .. - Buchmann (1990) (15 citations) (Correct)
Under the Assumption of the Generalized Riemann Hypothesis.. - Thiel (Correct)
SPA-based attack against the modular reduction within a partially.. - Kahl (2004) (Correct)
Chinese Remaindering with Errors - Oded Goldreich Department (1998) (9 citations) (Correct)
Near-Optimal Allocation of Local Memory Arrays - Robert Schreiber And (2004) (Correct)
On the Hardness of the Shortest Vector Problem - Micciancio (1998) (5 citations) (Correct)
A Vector-Perturbation Technique for Near-Capacity.. - Hochwald, Peel.. (2003) (6 citations) (Correct)
On Maximum-Likelihood Detection and the Search for the.. - Damen, Gamal, Caire (2003) (2 citations) (Correct)
Unknown - Tr Electronic Colloquium (1996) (Correct)
Reduced Complexity Closest Point Decoding Algorithms for.. - Zhao, Giannakis (2003) (Correct)
Fast Integer Programming in Fixed Dimension - Eisenbrand (2003) (Correct)
On the Decomposition of Lattices - Hemkemeier, Vallentin (1998) (Correct)
An Algorithmic Theory of Lattice Points in Polyhedra - Barvinok, Pommersheim (1999) (17 citations) (Correct)
Le Cryptosysteme Ntru - Nitaj (2003) (Correct)
On the Complexity of Decoding Lattices Using the.. - Banihashemi, Khandani (1998) (1 citation) (Correct)
Approximating Rings of Integers in Number Fields - Buchmann, Lenstra, Jr. (10 citations) Self-citation (Lenstra) (Correct)
Solving a System of Diophantine Equations with Lower and .. - Aardal, Hurkens, Lenstra (1998) (4 citations) Self-citation (Lenstra) (Correct)
An Algorithm for Solving a Diophantine Equation with.. - Aardal, Lenstra, Hurkens (1997) Self-citation (Lenstra) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC