Lower Bounds on Lattice Enumeration with Extreme Pruning-Reference-Cited by-同舟云学术

Lower Bounds on Lattice Enumeration with Extreme Pruning

Published:2018 Issue: Volume: Page:608-637
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Aono Yoshinori,Nguyen Phong Q.,Seito Takenobu,Shikata Junji

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-96881-0_21

Reference38 articles.

1. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the 33rd STOC, pp. 601–610. ACM (2001)

2. Albrecht, M.R., et al.: Estimate all the LWE, NTRU schemes! Posted on the PQC-forum, 1 February 2018. https://estimate-all-the-lwe-ntru-schemes.github.io/paper.pdf

3. Alkim, E., Ducas, L., Pöppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: Proceedings of the 25th USENIX Security Symposium, pp. 327–343. USENIX Association (2016)

4. Aono, Y.: A faster method for computing Gama-Nguyen-Regev’s extreme pruning coefficients. CoRR, abs/1406.0342 (2014)

5. Lecture Notes in Computer Science;Y Aono,2017

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

1. A Survey of Algorithms for Addressing the Shortest Vector Problem (SVP);Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering;2024

2. Quantum Lattice Enumeration in Limited Depth;Lecture Notes in Computer Science;2024

3. Lattice Enumeration with Discrete Pruning: Improvements, Cost Estimation and Optimal Parameters;Mathematics;2023-02-03

4. On Implicit Time–Fractal–Fractional Differential Equation;Axioms;2022-07-20

5. Lower Bounds on Lattice Sieving and Information Set Decoding;Advances in Cryptology – CRYPTO 2021;2021