Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem

Authors:
Xiaoyun Wang;Mingjie Liu;Chengliang Tian;Jingguo Bi
Affiliations:
Tsinghua University, Beijing, Shandong University, Jinan, China;Tsinghua University, Beijing, China;Shandong University, Jinan, China;Shandong University, Jinan, China
Venue:
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Year:
2011

Citing 18
Cited 0

A course in computational algebraic number theory

A course in computational algebraic number theory
A public-key cryptosystem with worst-case/average-case equivalence

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Finding the closest lattice vector when it's unusually close

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A sieve algorithm for the shortest lattice vector problem

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
The Two Faces of Lattices in Cryptology

CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
On lattices, learning with errors, random linear codes, and cryptography

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Trapdoors for hard lattices and new cryptographic constructions

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Finding short lattice vectors within mordell's inequality

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Finding the Closest Lattice Point by Iterative Slicing

SIAM Journal on Discrete Mathematics
Finding a small root of a univariate modular equation

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Cryptanalysis of RSA with private key d less than N0:292

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Improved analysis of Kannan's shortest lattice vector algorithm

CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
A deterministic single exponential time algorithm for most lattice problems based on voronoi cell computations

Proceedings of the forty-second ACM symposium on Theory of computing
Faster exponential time algorithms for the shortest vector problem

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lattice enumeration using extreme pruning

EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Closest point search in lattices

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an improvement of the Nguyen-Vidick heuristic sieve algorithm for shortest vector problem in general lattices, which time complexity is 20.3836n polynomial computations, and space complexity is 20.2557n. In the new algorithm, we introduce a new sieve technique with two-level instead of the previous one-level sieve, and complete the complexity estimation by calculating the irregular spherical cap covering.