Practical, Predictable Lattice Basis Reduction-Reference-Cited by-同舟云学术

Practical, Predictable Lattice Basis Reduction

Published:2016 Issue: Volume: Page:820-849
ISSN:0302-9743
Container-title:Advances in Cryptology – EUROCRYPT 2016
language:
Short-container-title:

Author:

Micciancio Daniele,Walter Michael

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-662-49890-3_31

Reference70 articles.

1. Ajtai, M.: Generating hard instances of lattice problems. Complex. Comput. Proofs Quaderni di Matematica 13, 1–32 (2004). Preliminary version in STOC 1996

2. M. Ajtai and C. Dwork. A public-key cryptosystem with worst-case/average-case equivalence. In: Proceedings of STOC 1997, pp. 284–293. ACM, May 1997

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

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

5. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. Cryptology ePrint Archive, Report 2015/046 (2015). http://eprint.iacr.org/

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

1. Heuristic Number Geometry Method for Finding Low-Weight Codeword in Linear Block Codes;2024 26th International Conference on Digital Signal Processing and its Applications (DSPA);2024-03-27

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

3. Towards Compact Identity-Based Encryption on Ideal Lattices;Lecture Notes in Computer Science;2024

4. Analyzing Pump and Jump BKZ Algorithm Using Dynamical Systems;Lecture Notes in Computer Science;2024

5. Improved Provable Reduction of NTRU and Hypercubic Lattices;Lecture Notes in Computer Science;2024