A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem
As a category of algorithms to solve the shortest lattice vector problem, sieve algorithms have drawn more and more attention due to the prominent performance in recent years. Enumeration algorithms used to perform better in practice even though sieve algorithms are asymptotically faster. Combined w...
Main Authors: | Zedong Sun, Chunxiang Gu, Yonghui Zheng |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9224855/ |
Similar Items
-
Faster Provable Sieving Algorithms for the Shortest Vector Problem and the Closest Vector Problem on Lattices in <i>ℓ</i><sub>p</sub> Norm
by: Priyanka Mukhopadhyay
Published: (2021-12-01) -
Efficient Implementations of Sieving and Enumeration Algorithms for Lattice-Based Cryptography
by: Hami Satılmış, et al.
Published: (2021-07-01) -
Sieve algorithms for the shortest vector problem are practical
by: Nguyen Phong Q., et al.
Published: (2008-07-01) -
A survey on lattice-based digital signature
by: Fengxia Liu, et al.
Published: (2024-04-01) -
On Advances of Lattice-Based Cryptographic Schemes and Their Implementations
by: Harshana Bandara, et al.
Published: (2022-11-01)