Phong Q. Nguyen, Jacques Stern  Home/Search
Context Related
| ens.fr/pub/dmi/users/pngu...ANTS4.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dmi.ens.fr/~pnguyen/pub (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Lattices are regular arrangements of points in space, whose study appeared in the 19th century in both number theory and crystallography. The goal of lattice reduction is to find useful representations of lattices. A major breakthrough in that field occurred twenty years ago, with the appearance of Lov'asz's reduction algorithm, also known as LLL or L 3 . Lattice reduction algorithms have since proved invaluable in many areas of mathematics and computer science, especially in... (Update)
Context of citations to this paper: More
...well. Although the shortest vector problem appears to be NP hard various approximate polynomial time algorithms can be designed, see [12, 17, 18] for references. In this paper we actually need to solve a variation of SVP called the closest vector problem (CVP) given a basis...
Cited by: More
Generalized Compact Knapsacks, Cyclic Lattices, and Efficient.. - Micciancio (2004) (Correct)
Cryptanalysis of RSA Using Algebraic and Lattice Methods - Durfee (2002) (Correct)
NTRUSign: Digital Signatures Using the NTRU Lattice - Hoffstein.. (2002) (Correct)
Similar documents (at the sentence level):
67.9%: The Two Faces of Lattices in Cryptology - Nguyen, Stern (2001) (Correct)
Active bibliography (related documents): More All
8.2: Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000) (Correct)
1.8: Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem.. - Nguyen (1999) (Correct)
1.2: The Geometry of Numbers in Cryptology - Nguyen (1999) (Correct)
Similar documents based on text: More All
1.0: The Effectiveness of Lattice Attacks Against Low-Exponent RSA - Coupé, Nguyen, Stern (1999) (Correct)
0.6: Lattices and Cryptography: an Overview - Stern (1998) (Correct)
0.5: The Hardness of Hensel Lifting: The Case of RSA and.. - Catalano, Nguyen, Stern (2002) (Correct)
Related documents from co-citation: More All
11: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman.. (context) - Boneh, Venkatesan
9: Handbook of Applied Cryptography (context) - Menezes, Van Oorschot et al. - 1996
9: The insecurity of the Digital Signature Algorithm with partially known nonces - Nguyen, Shparlinski - 2000
BibTeX entry: (Update)
P. Q. Nguyen and J. Stern. Lattice reduction in cryptology: An update. In Algorithmic Number Theory -- Proc. of ANTS-IV, volume 1838 of LNCS. Springer-Verlag, 2000. http://citeseer.ist.psu.edu/nguyen00lattice.html More
@inproceedings{ nguyen00lattice,
author = "Phong Nguyen and Jacques Stern",
title = "Lattice Reduction in Cryptology: An Update",
booktitle = "{ANTS}",
pages = "85-112",
year = "2000",
url = "citeseer.ist.psu.edu/nguyen00lattice.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and public-key cry.. - Rivest, Shamir et al. - 1978
1065 Handbook of Applied Cryptography (context) - Menezes, Van Oorschot et al. - 1997
635 New directions in cryptography - Diffie, Hellman - 1976
352 A Course in Computational Algebraic Number Theory (context) - Cohen - 1995
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1993
258 Lattices and Groups (context) - Conway, Sloane - 1998
227 Factoring polynomials with rational coefficients (context) - Lenstra, Lenstra et al. - 1982
120 The hardness of approximate optima in lattices (context) - Arora, Babai et al. - 1997
100 Integer programming with a fixed number of variables (context) - Lenstra - 1983
84 Generating hard instances of lattice problems (context) - Ajtai - 1996
72 Twenty years of attacks on the RSA cryptosystem - Boneh - 1999
70 Hiding information and signatures in trapdoor knapsacks (context) - Merkle, Hellman - 1978
68 Small solutions to polynomial equations (context) - Coppersmith - 1997
66 On Lov'asz lattice reduction and the nearest lattice point p.. (context) - Babai - 1986
62 Geometry of Numbers (context) - Gruber, Lekkerkerker - 1987
60 Lattice basis reduction: improved practical algorithms and s.. - Schnorr, Euchner - 1994
60 Solving low-density subset sum problems (context) - Lagarias, Odlyzko - 1985
59 Cryptanalysis of short RSA secret exponents (context) - Wiener - 1990
55 Hardness of computing the most significant bits of secret ke.. (context) - Boneh, Venkatesan - 1996
49 Minkowski's convex body theorem and integer programming (context) - Kannan - 1987
49 Improved low-density subset sum algorithms - Coster, Joux et al. - 1992
44 The shortest vector problem in L2 is NP-hard for randomized .. (context) - Ajtai - 1998
42 Public-key cryptosystems from lattice reduction problems - Goldreich, Goldwasser et al. - 1997
40 The decision Diffie-Hellman problem - Boneh - 1998
39 Attacking the Chor-Rivest cryptosystem by improved lattice r.. - Schnorr, Horner - 1995
38 A knapsack-type public key cryptosystem based on arithmetic .. - Chor, Rivest - 1988
38 Solving simultaneous modular equations of low degree (context) - Hastad - 1988
34 Breaking RSA may not be equivalent to factoring (context) - Boneh, Venkatesan - 1998
33 A polynomial time algorithm for breaking the basic Merkle-He.. (context) - Shamir - 1982
33 An Algorithmic Theory of Numbers (context) - Lov'asz - 1986
33 Lattice reduction: A toolbox for the cryptanalyst - Joux, Stern - 1998
32 the limits of non-approximability of lattice problems - Goldreich, Goldwasser - 1998
31 Approximating CVP to within almostpolynomial factors is NP-h.. - Dinur, Kindler et al. - 1998
29 Disquisitiones Arithmeticae (context) - Gauss
27 Massachusetts Institute of Technology (context) - Micciancio, Hardness et al. - 1998
27 An improved worst-case to average-case connection for lattic.. - Cai, Nerurkar - 1997
26 Cryptanalysis of RSA with private key d less than n - Boneh, Durfee - 1999
26 A public-key cryptosystem with worst-case/average-case equiv.. (context) - Ajtai, Dwork - 1997
26 Improved algorithms for integer programming and related latt.. (context) - Kannan - 1983
25 Symmetric Bilinear Forms (context) - Milnor, Husemoller - 1973
23 Geometrie der Zahlen (context) - Minkowski
23 Cryptanalysis: A survey of recent results (context) - Brickell, Odlyzko - 1991
23 the lagarias-odlyzko algorithm for the subset sum problem (context) - Frieze - 1986
22 the security of the KMOV public key cryptosystem - Bleichenbacher - 1997
22 Sur les formes quadratiques (context) - Korkine, Zolotareff
20 Finding smooth integers in short intervals using CRT decodin.. - Boneh - 2000
20 Speeding up discrete log and factoring based schemes via pre.. - Boyko, Peinado et al. - 1998
19 FIPS Publication 186: Digital Signature Standard (context) - of, Technology - 1994
19 volume 1554 of Lecture Notes in Mathematics (context) - Lenstra, Lenstra et al. - 1993
19 A multiplicative attack using LLL algorithm on RSA signature.. (context) - Misarsky - 1997
19 Solving low density knapsacks (context) - Brickell - 1984
19 The hardness of the hidden subset sum problem and its crypto.. - Nguyen, Stern - 1999
18 Cryptanalysis of the Ajtai-Dwork cryptosystem - Nguyen, Stern - 1998
18 Another NP-complete problem and the complexity of computing .. (context) - Boas - 1981
18 A more efficient algorithm for lattice basis reduction (context) - Schnorr - 1988
17 Noisy polynomial interpolation and noisy Chinese remainderin.. - Bleichenbacher, Nguyen - 2000
17 An attack on RSA given a small fraction of the private key b.. (context) - Boneh, Durfee et al. - 1998
16 Breaking iterated knapsacks (context) - Brickell - 1985
16 The rise and fall of knapsack cryptosystems - Odlyzko - 1990
16 NTRU: a ring based public key cryptosystem - Hoffstein, Pipher et al. - 1998
16 Les R'eseaux Parfaits des Espaces Euclidiens (context) - Martinet - 1996
15 Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosyste.. - Nguyen - 1999
15 Lattice attacks on NTRU (context) - Coppersmith, Shamir - 1997
14 Finding small roots of univariate modular equations revisite.. (context) - Howgrave-Graham - 1997
14 Lattice points in high-dimensional spheres - Mazo, Odlyzko - 1990
13 Merkle-Hellman revisited: a cryptanalysis of the QuVanstone .. - Nguyen, Stern - 1997
13 de M. Hermite `a M. Jacobi sur diff (context) - Hermite
13 Approximating shortest lattice vectors is not harder than ap.. - Goldreich, Micciancio et al.
13 Eliminating decryption errors in the Ajtai-Dwork cryptosyste.. - Goldreich, Goldwasser et al. - 1997
13 Point lattices (context) - Lagarias - 1995
13 A hierarchy of polynomial lattice basis reduction algorithms (context) - Schnorr - 1987
13 Cryptanalysis of the Chor-Rivest cryptosystem (context) - Vaudenay - 1998
12 Succinct certificates for almost all subset sum problems (context) - Furst, Kannan - 1989
11 The dark side of the hidden number problem: Lattice attacks .. (context) - Nguyen - 2000
11 Factoring integers and computing discrete logarithms via dio.. - Schnorr - 1991
11 Pseudo-random (context) - Bellare, Goldwasser et al. - 1997
11 Lattice attacks on digital signature schemes (context) - Howgrave-Graham, Smart - 1999
10 On finding small solutions of modular multivariate polynomia.. (context) - Jutla - 1998
10 Howgrave-Graham (context) - Boneh, Durfee - 1999
10 The B'eguin-Quisquater server-aided RSA protocol from Crypto.. - Nguyen, Stern - 1998
9 Lectures on the Geometry of Numbers (context) - Siegel - 1989
9 Certificates of recoverability with scalable recovery agent .. (context) - Verheul - 2000
9 The shortest vector problem is NP-hard to approximate within.. (context) - Micciancio - 1998
9 Factoring and lattice reduction (context) - Adleman - 1995
8 A chosen ciphertext attack on NTRU (context) - Jaulmes, Joux - 2000
8 Short RSA keys and their generation (context) - Vanstone, Zuccherato - 1995
7 Annual review of computer science (context) - Kannan, of - 1987
7 Finding the closest lattice vector when it's unusually close - Klein - 2000
7 Tensor-based trapdoors for CVP and their application to publ.. - Fischlin, Seifert - 1999
7 the complexity of computing short linearly independent vecto.. (context) - Blomer, Seifert - 1999
7 Recherches d'arithm'etique (context) - Lagrange
7 Some recent progress on the complexity of lattice problems - Cai - 1999
6 The complexity of some lattice problems (context) - Cai - 2000
6 Cryptanalysis of a fast public key cryptosystem presented at.. - Nguyen, Stern - 1998
5 Lattice based cryptography: A global improvement - Micciancio - 1999
5 Number Theory C++ Library (context) - Shoup
5 A Montgomery-like square root for the number field sieve - Nguyen - 1998
5 Cryptanalysis of countermeasures proposed for repairing ISO (context) - Girault, Misarsky - 2000
4 A public-key cryptosystem based on algebraic number theory (context) - McEliece - 1978
4 The Electronic Colloquium on Computational Complexity (context) - http, eccc et al.
4 the security of Diffie-Hellman bits (context) - Vasco, Shparlinski - 2000
4 A lattice-based public-key cryptosystem (context) - Cai, Cusick - 1999
4 How to guess `-th roots modulo n by reducing lattice bases (context) - Vall'ee, Girault et al. - 1988
3 La G'eom'etrie des Nombres en Cryptologie (context) - Nguyen - 1999
3 On breaking generalized knapsack publick key cryptosystems (context) - Adleman - 1983
3 Approximating SVP1 to within almost-polynomial factors is NP.. (context) - Dinur
3 Sur les formes quadratiques positives ternaires (context) - Korkine, Zolotareff
2 The effectiveness of lattice attacks against low-exponent RS.. (context) - Coup'e, Nguyen et al. - 1999
2 The orthogonal lattice: A new tool for the cryptanalyst (context) - Nguyen, Stern - 2000
2 Computational Mathematics Inspired by RSA (context) - Howgrave-Graham - 1998
2 Challenges for the GGH cryptosystem (context) - Goldreich, Goldwasser et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.dmi.ens.fr/~pnguyen/pub.html): More
The Effectiveness of Lattice Attacks Against Low-Exponent RSA - Coupé, Nguyen, Stern (1999) (Correct)
Cryptanalysis of a Fast Public Key Cryptosystem Presented at.. - Nguyen, Stern (1998) (Correct)
Cryptanalysis of the Ajtai-Dwork Cryptosystem - Nguyen, Stern (1998) (Correct)
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