Improved lower bound for the complexity of unique shortest vector problem

Improved lower bound for the complexity of unique shortest vector problem

Abstract Unique shortest vector problem (uSVP) plays an important role in lattice based cryptography. Many cryptographic schemes based their security on it. For the cofidence of those applications, it is essential to clarify the complexity of uSVP with different parameters. However, proving the NP-h...

Full description

Bibliographic Details
Main Authors: Baolong Jin, Rui Xue
Format: Article
Language:English
Published: SpringerOpen 2023-11-01
Series:Cybersecurity
Subjects:
Computational complexity
Unique shortest vector problem
Bounded distance decoding
Complexity reduction
Online Access:https://doi.org/10.1186/s42400-023-00173-w

Internet

https://doi.org/10.1186/s42400-023-00173-w

Similar Items