Analyzing Blockwise Lattice Algorithms Using Dynamical Systems-Reference-Cited by-同舟云学术

Analyzing Blockwise Lattice Algorithms Using Dynamical Systems

Published:2011 Issue: Volume: Page:447-464
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2011
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-22792-9_25.pdf

Reference41 articles.

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

2. 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)

3. Lecture Notes in Computer Science;A. Akhavi,2000

4. Cadé, D., Pujol, X., Stehlé, D.: fplll-3.1, a floating-point LLL implementation, http://perso.ens-lyon.fr/damien.stehle

5. Coppersmith, D.: Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology 10(4), 233–260 (1997)

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

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

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

3. A Refined Hardness Estimation of LWE in Two-Step Mode;Lecture Notes in Computer Science;2024

4. Guidance for Efficient Selection of Secure Parameters for Fully Homomorphic Encryption;Lecture Notes in Computer Science;2024

5. Dynamic Cantor Derivative Logic;Logical Methods in Computer Science;2023-12-18