Jacques Stern  Home/Search
Context Related
| di.ens.fr/~stern/data/St74.ps 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: di.ens.fr/~stern/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We briefly discuss the history of lattices and cryptography during the last fifteen years. (Update)
Context of citations to this paper: More
.... codes [23] It also has important applications in cryptography [4,6] Another related problem of paramount importance in cryptography [11, 43] is that of lattice basis reduction. These search problems will be discussed in Section VI. The choice of method for solving the...
.... 40] It also has important applications in cryptography [5] 7] Another related problem of paramount importance in cryptography [13] [70] is that of lattice basis reduction. These search problems will be discussed in Section VI. The choice of method for solving the...
Cited by: More
Closest Point Search in Lattices - Agrell, Eriksson, Vardy, Zeger (2002) (Correct)
Similar documents (at the sentence level):
13.8%: Lattice Reduction: a Toolbox for the Cryptanalyst - Joux, Stern (1994) (Correct)
Active bibliography (related documents): More All
0.9: The Two Faces of Lattices in Cryptology - Nguyen, Stern (2001) (Correct)
0.8: Lattice Reduction in Cryptology: An Update - Nguyen, Stern (2000) (Correct)
0.5: Generalized Compact Knapsacks, Cyclic Lattices, and Efficient.. - Micciancio (2004) (Correct)
Similar documents based on text: More All
0.8: Cryptanalysis of the Ajtai-Dwork Cryptosystem - Nguyen, Stern (1998) (Correct)
0.7: A Worst-Case to Average-Case Connection for CVP - Cai (Correct)
0.7: Approximating Shortest Lattice Vectors is Not.. - Goldreich.. (1999) (Correct)
Related documents from co-citation: More All
2: Algorithms to construct Minkowski reduced and Hermite reduced lattice bases (context) - Helfrich - 1985
2: Classical methods in the theory of lattice packings (context) - Ryshkov, Baranovskii - 1979
2: A universal lattice code decoder for fading channels (context) - Viterbo, Boutros - 1996
BibTeX entry: (Update)
J. Stern, "Lattices and cryptography: An overview," in Public Key Cryptography (H. Imai and Y. Zheng, eds.), pp. 50--54, Pacifico Yokohama, Japan, Feb. 1998. http://citeseer.ist.psu.edu/stern98lattices.html More
@article{ stern98lattices,
author = "Jacques Stern",
title = "Lattices and Cryptography: An Overview",
journal = "Lecture Notes in Computer Science",
volume = "1431",
pages = "50--??",
year = "1998",
url = "citeseer.ist.psu.edu/stern98lattices.html" }
Citations (may not include all citations):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
70 Hiding information and signatures in trapdoor knapsacks (context) - Merkle, Hellman - 1978
67 Finding a small root of a univariate modular equation (context) - Coppersmith - 1996
66 On Lov'asz lattice reduction and the nearest lattice point p.. (context) - Babai - 1986
60 Solving low-density subset sum problems (context) - Lagarias, Odlyzko - 1983
51 A hierarchy of polynomial time lattice basis reduction algor.. (context) - Schnorr - 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 - 1997
42 A public-key cryptosystem with worstcase /average-case equiv.. - Ajtai, Dwork - 1997
33 A polynomial-time algorithm for breaking the basic MerkleHel.. (context) - Shamir - 1982
32 the limits of non-approximability of lattice problems - Goldreich, Goldwasser - 1997
29 Disquisitiones arithmeticae (context) - Gauss
27 An improved worst-case to average-case connection for lattic.. - Cai, Nerurkar - 1997
23 Geometrie der Zahlen (context) - Minkowski - 1910
22 Sur les formes quadratiques (context) - Korkine, Zolotarev
21 Reconstructing truncated integer variables satisfying linear.. (context) - Frieze, Hastad et al. - 1988
19 Solving low density knapsacks (context) - Brickell - 1984
18 A more efficient algorithm for lattice basis reduction (context) - Schnorr - 1988
16 Breaking iterated knapsacks (context) - Brickell - 1985
15 Another NP-complete problem and the complexity of computing .. (context) - Boas - 1981
15 Lattice attacks on NTRU (context) - Coppersmith, Shamir - 1997
13 de M. Hermite `a M. Jacobi sur diff (context) - Hermite
12 On breaking generalized knapsack public key cryptosystems (context) - Adleman - 1983
8 Secret linear congruential generators are not cryptographica.. (context) - Stern - 1987
7 Recherches d'arithm'etique (context) - Lagrange
7 Public-key cryptography from lattice reduction problems (context) - Goldreich, Goldwasser et al. - 1997
4 Cryptanalysis of another knapsack cryptosystem (context) - Joux, Stern - 1991
3 The cryptanalysis of a new publickey cryptosystem based on m.. (context) - Chee, Joux et al. - 1991
3 Cryptanalysis of a public-key cryptosystem based on approxim.. (context) - Stern, Toffin - 1990
1 A converse to the Ajtai-Dwork security result and its crypto.. (context) - Nguyen, Stern
Documents on the same site (http://www.di.ens.fr/~stern/publications.html): More
A New Public-Key Cryptosystem - Naccache, Stern (1997) (Correct)
Cryptanalysis of the NTRU Signature Scheme (NSS) from.. - Gentry, Jonsson.. (Correct)
A New Public-Key Cryptosystem Based on Higher Residues - Naccache, 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