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)
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)
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
[Article contains additional citations not shown here]
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