Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
shortest vector problem
Description:
A computational problem in lattice theory that asks for a shortest nonzero vector in a given lattice.
Primary topic:
Cryptography and Data Security (45%)
Related topics:
Cryptography and Data Security (45%),
Complexity and Algorithms in Graphs (18%)
OpenAlex ID:
keywords/shortest-vector-problem
Trapdoors for hard lattices and new cryptographic constructions
2008
·
Craig Gentry
, Chris Peikert
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
2,569
On lattices, learning with errors, random linear codes, and cryptography
2005
·
Oded Regev
·
ACM Symposium on Theory of Computing (STOC)
·
2,531
Generating hard instances of lattice problems (extended abstract)
1996
·
M. Ajtai
·
ACM Symposium on Theory of Computing (STOC)
·
1,536
PDF
Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
1985
·
U. Fincke
, M. Pohst
·
Mathematics of Computation
·
1,451
PDF
Closest point search in lattices
2002
·
E. Agrell
, T. Eriksson
, et al.
·
IEEE Transactions on Information Theory
·
1,394
PDF
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
2007
·
Daniele Micciancio
, Oded Regev
·
SIAM Journal on Computing
·
948
Public-key cryptosystems from the worst-case shortest vector problem: extended abstract
2009
·
Chris Peikert
·
ACM Symposium on Theory of Computing (STOC)
·
849
A public-key cryptosystem with worst-case/average-case equivalence
1997
·
Miklós Ajtai
, Cynthia Dwork
·
ACM Symposium on Theory of Computing (STOC)
·
668
A hierarchy of polynomial time lattice basis reduction algorithms
1987
·
C.P. Schnorr
·
Theoretical Computer Science
·
664
PDF
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
2009
·
Vadim Lyubashevsky
·
Lecture notes in computer science
·
605
A sieve algorithm for the shortest lattice vector problem
2001
·
Miklós Ajtai
, Ravi Kumar
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
578
Generating Shorter Bases for Hard Random Lattices
2010
·
Joël Alwen
, Chris Peikert
·
Theory of Computing Systems
·
467
The shortest vector problem in L 2 is NP -hard for randomized reductions (extended abstract)
1998
·
Miklós Ajtai
·
ACM Symposium on Theory of Computing (STOC)
·
460
Solving low-density subset sum problems
1985
·
J. C. Lagarias
, A. M. Odlyzko
·
Journal of the ACM
·
409
PDF
Efficient Public Key Encryption Based on Ideal Lattices
2009
·
Damien Stehlé
, Ron Steinfeld
, et al.
·
Lecture notes in computer science
·
397
Approximation Algorithms
2002
·
Daniele Micciancio
, Shafi Goldwasser
·
Springer eBooks
·
363
On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
1981
·
Michael Pohst
·
ACM SIGSAM Bulletin
·
351
PDF
Worst-Case to Average-Case Reductions Based on Gaussian Measures
2004
·
D. Micciancio
, O. Regev
·
Annual Symposium on Foundations of Computer Science
·
346
New directions in nearest neighbor searching with applications to lattice sieving
2015
·
Anja Becker
, Léo Ducas
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
327
PDF
Lattice Enumeration Using Extreme Pruning
2010
·
Nicolas Gama
, Phong Q. Nguyen
, et al.
·
Lecture notes in computer science
·
294
Generalized Compact Knapsacks Are Collision Resistant
2006
·
Vadim Lyubashevsky
, Daniele Micciancio
·
Lecture notes in computer science
·
292
Lattice-based FHE as secure as PKE
2014
·
Zvika Brakerski
, Vinod Vaikuntanathan
·
Conference on Innovations in Theoretical Computer Science
·
287
PDF
The LLL Algorithm: Survey and Applications
2009
·
Nguyen, Phong Q.
, Vallée, Brigitte
·
Information security and cryptography
·
260
Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
2006
·
Chris Peikert
, Alon Rosen
·
Lecture notes in computer science
·
255
PDF
Sieve algorithms for the shortest vector problem are practical
2008
·
Phong Q. Nguyen
, Thomas Vidick
·
Journal of Mathematical Cryptology
·
254
PDF
Show more works
View as search
Works count:
1,178
Citation count:
32,500
Year
Topic
Type