Algorithms for the Shortest and Closest Lattice Vector Problems-Reference-Cited by-同舟云学术

Algorithms for the Shortest and Closest Lattice Vector Problems

Published:2011 Issue: Volume: Page:159-190
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hanrot Guillaume,Pujol Xavier,Stehlé Damien

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-20901-7_10

Reference83 articles.

1. Agrell, E., Eriksson, T., Vardy, A., Zeger, K.: Closest point search in lattices. IEEE Transactions on Information Theory 48(8), 2201–2214 (2002)

2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proc. of STOC, pp. 99–108. ACM, New York (1996)

3. Ajtai, M.: The worst-case behavior of Schnorr’s algorithm approximating the shortest nonzero vector in a lattice. In: Proc. of STOC, pp. 396–406. ACM, New York (2003)

4. Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case/average-case equivalence. In: Proc. of STOC, pp. 284–293. ACM, New York (1997)

5. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. of STOC, pp. 601–610. ACM, New York (2001)

Cited by 58 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An ADMM based method for underdetermined box-constrained integer least squares problems;Optimization Methods and Software;2023-12-28

2. Lattice codes for lattice-based PKE;Designs, Codes and Cryptography;2023-11-16

3. Structured $$(\min ,+)$$-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems;Optimization Letters;2023-05-27

4. Flat Tori with Large Laplacian Eigenvalues in Dimensions up to Eight;SIAM Journal on Applied Algebra and Geometry;2023-03-30

5. Practical Improvements on BKZ Algorithm;Cyber Security, Cryptology, and Machine Learning;2023