227 citations found. Retrieving documents...
A. Lenstra, H. Lenstra and L. Lovasz, "Factoring polynomials with rational coefficients ", Mathematische Annalen, 1982

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:

First 50 documents  Next 50

Approximating Rings of Integers in Number Fields - Buchmann, Lenstra, Jr.   (10 citations)  Self-citation (Lenstra)   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, Jr., L. Lov'asz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515--534.


New Partial Key Exposure Attacks on RSA - Blömer, May (2003)   (2 citations)  (Correct)

No context found.

A. Lenstra, H. Lenstra and L. Lovasz, "Factoring polynomials with rational coefficients ", Mathematische Annalen, 1982


Series Logo - Volume Number Xxxx   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, Jr., and L. Lov'asz, Factoring polynomials with rational coefficients, Math. Annalen 261 (1982), 515--534.


Collision-Free Hashing from Lattice Problems - Oded Goldreich Shafi (1996)   (10 citations)  (Correct)

No context found.

A.K. Lenstra, H.W. Lenstra, L. Lov'asz. Factoring polynomials with rational coefficients. Mathematische Annalen 261, pages 515--534 (1982).


A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005)   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515--534, 1982.


A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005)   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515--534, 1982.


A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005)   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515-- 534, 1982.


Communication over MIMO Broadcast Channels Using.. - Taherzadeh..   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515--534, 1982.


LLL Reduction Achieves the Receive Diversity in MIMO.. - Taherzadeh, Mobasher.. (2005)   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen, vol. 261, pp. 515--534, 1982.


Public-Key Cryptosystems - From Lattice Reduction (1996)   (Correct)

No context found.

A.K. Lenstra, H.W. Lenstra, L. Lov'asz. Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515-534 (1982).


Lattice Based Cryptography: A Global Improvement - Daniele Micciancio Laboratory (1999)   (3 citations)  (Correct)

No context found.

Arjen K. Lenstra, Hendrik W. Lenstra, Jr., and L'aszl'o Lov'asz. Factoring polynomials with rational coefficients. Mathematische Ann., 261:513--534, 1982.


Computing a Reduced Lattice Basis from a Generating System - Buchmann, Kessler (1993)   (2 citations)  (Correct)

No context found.

A.K. Lenstra, H.W. Lenstra Jr. and C. Lovasz, Factoring polynomials with rational coefficients, Math Anm. 261 (1982), 515-534.


A Subexponential Algorithm for the Determination of Class Groups .. - Buchmann (1990)   (15 citations)  (Correct)

No context found.

A.K. Lenstra, H.W. Lenstra, L. Lowasz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 513-534.


Under the Assumption of the Generalized Riemann Hypothesis.. - Thiel   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra Jr., L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982) 515-534


SPA-based attack against the modular reduction within a partially.. - Kahl (2004)   (Correct)

No context found.

A.K. Lenstra, H.W. Lenstra and L. Lovasz, Factoring polynomials with rational coefficients. Mathematische Annalen 261 (1982) pp. 513-534


Chinese Remaindering with Errors - Oded Goldreich Department (1998)   (9 citations)  (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra and L. Lovasz. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515--534, 1982.


Near-Optimal Allocation of Local Memory Arrays - Robert Schreiber And (2004)   (Correct)

No context found.

A. Lenstra, H. L. Jr., and L. Lovasz. Factoring polynomials with rational coefficients. Mathematische Annalen, 261:515--534, 1982.


On the Hardness of the Shortest Vector Problem - Micciancio (1998)   (5 citations)  (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, Jr., and L. Lov'asz. Factoring polynomials with rational coefficients. Mathematische Ann., 261:513--534, 1982.


A Vector-Perturbation Technique for Near-Capacity.. - Hochwald, Peel.. (2003)   (6 citations)  (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Mathematische Annalen,


On Maximum-Likelihood Detection and the Search for the.. - Damen, Gamal, Caire (2003)   (2 citations)  (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovsz, "Factoring polynomials with rational coefficients," Math. Ann., vol. 261, pp. 515--534, 1982.


Unknown - Tr Electronic Colloquium (1996)   (Correct)

No context found.

A.K. Lenstra, H.W. Lenstra, L. Lov'asz. Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515-534 (1982).


Reduced Complexity Closest Point Decoding Algorithms for.. - Zhao, Giannakis (2003)   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Math. Annalen, vol. 261, pp. 513--534, 1982.


Fast Integer Programming in Fixed Dimension - Eisenbrand (2003)   (Correct)

No context found.

A. K. Lenstra, H. W. Lenstra, and L. Lovsz. Factoring polynomials with rational coefficients. Math. Annalen, 261:515 -- 534, 1982.


On the Decomposition of Lattices - Hemkemeier, Vallentin (1998)   (Correct)

No context found.

A. K. Lenstra, H. W. Jr. Lenstra, and L. Lovasz. Factoring polynomials with rational coefficients. Math. Ann., 261(4):515--534, 1982.


An Algorithmic Theory of Lattice Points in Polyhedra - Barvinok, Pommersheim (1999)   (17 citations)  (Correct)

No context found.

A.K. Lenstra, H.W. Lenstra Jr., and L. Lov'asz, Factoring polynomials with rational coefficients, Mathematische Annalen, 261 (1982), no. 4, 515--534.

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