Sieve algorithms for the shortest vector problem are practical
The most famous lattice problem is the Shortest Vector Problem (SVP), which has many applications in cryptology. The best approximation algorithms known for SVP in high dimension rely on a subroutine for exact SVP in low dimension. In this paper, we assess the practicality of the best (theoretical)...
Main Authors: | Nguyen Phong Q., Vidick Thomas |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2008-07-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/JMC.2008.009 |
Similar Items
-
A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem
by: Zedong Sun, et al.
Published: (2020-01-01) -
Efficient MIMO Preprocessor With Sorting-Relaxed QR Decomposition and Modified Greedy LLL Algorithm
by: Lirui Chen, et al.
Published: (2020-01-01) -
Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux
by: Rhee, Donguk
Published: (2012) -
Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux
by: Rhee, Donguk
Published: (2012) -
Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography
by: Hami Satılmış, et al.
Published: (2021-07-01)