Predicting Lattice Reduction-Reference-Cited by-同舟云学术

Predicting Lattice Reduction

Published: Issue: Volume: Page:31-51
ISSN:
Container-title:Advances in Cryptology – EUROCRYPT 2008
language:
Short-container-title:

Author:

Gama Nicolas,Nguyen Phong Q.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-78967-3_3.pdf

Reference39 articles.

1. Ajtai, M.: Generating random lattices according to the invariant distribution (Draft of March 2006)

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

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

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

5. Lecture Notes in Computer Science;D. Boneh,1999

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

1. An algebraic algorithm for breaking NTRU with multiple keys;Designs, Codes and Cryptography;2024-08-10

2. Progressive and efficient verification for digital signatures: extensions and experimental results;Journal of Cryptographic Engineering;2024-08-05

3. Quantum-Resistant Forward-Secure Digital Signature Scheme Based on q-ary Lattices;Journal of Telecommunications and Information Technology;2024-06-10

4. On the Concrete Security of LWE With Small Secret;La Matematica;2024-06-07

5. Lattice basis reduction techniques;Multimedia Tools and Applications;2024-02-01