A Trade-off SVP-solving Strategy based on a Sharper pnj-BKZ Simulator-Reference-Cited by-同舟云学术

A Trade-off SVP-solving Strategy based on a Sharper pnj-BKZ Simulator

Published:2023-07-10 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the ACM Asia Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Wang Leizhang¹^ORCID,Wang Yuntao²^ORCID,Wang Baocang³^ORCID

Affiliation:

1. State Key Laboratory of Integrated Service Networks, Xidian University, China and Graduate School of Engineering, Osaka University, Japan

2. Graduate School of Engineering, Osaka University, Japan

3. State Key Laboratory of Integrated Service Networks, Xidian University, China

Funder

National Natural Science Foundation of China

Japan Society for the Promotion of Science

China Scholarship Council

Publisher

ACM

Reference28 articles.

1. 2020. US Department of Commerce , National Institute of Standards and Technology . Post-Quantum Cryptography. ( 2020 ). https://csrc.nist.gov/projects/post-quantum-cryptography/. 2020. US Department of Commerce, National Institute of Standards and Technology. Post-Quantum Cryptography. (2020). https://csrc.nist.gov/projects/post-quantum-cryptography/.

2. 2022. PQC Standardization Process: Fourth Round Candidate Announcement. (2022). https://csrc.nist.gov/News/2022/pqc-candidates-to-be-standardized-and-round-4. 2022. PQC Standardization Process: Fourth Round Candidate Announcement. (2022). https://csrc.nist.gov/News/2022/pqc-candidates-to-be-standardized-and-round-4.

3. Becker A., Gama N., and Joux A . 2015. Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search . In IACR Cryptology ePrint. IACR Cryptology ePrint Archive , 2015 /522. https://eprint.iacr.org/2015/522 Becker A., Gama N., and Joux A.2015. Speeding-up lattice sieving without increasing the memory, using sub-quadratic nearest neighbor search. In IACR Cryptology ePrint. IACR Cryptology ePrint Archive, 2015/522. https://eprint.iacr.org/2015/522

4. Miklós Ajtai , Ravi Kumar , and D. Sivakumar . 2001. A Sieve Algorithm for the Shortest Lattice Vector Problem . In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing(STOC ’01) . Association for Computing Machinery, New York, NY, USA, 601–610. https://doi.org/10.1145/380752.380857 10.1145/380752.380857 Miklós Ajtai, Ravi Kumar, and D. Sivakumar. 2001. A Sieve Algorithm for the Shortest Lattice Vector Problem. In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing(STOC ’01). Association for Computing Machinery, New York, NY, USA, 601–610. https://doi.org/10.1145/380752.380857

5. Martin R. Albrecht , Léo Ducas , Gottfried Herold , Elena Kirshanova , Eamonn W. Postlethwaite , and Marc Stevens . 2019. The General Sieve Kernel and New Records in Lattice Reduction . In Advances in Cryptology – EUROCRYPT 2019 , Yuval Ishai and Vincent Rijmen (Eds.). Springer International Publishing , Cham, 717–746. https://doi.org/10.1007/978-3-030-17656-3_25 10.1007/978-3-030-17656-3_25 Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, and Marc Stevens. 2019. The General Sieve Kernel and New Records in Lattice Reduction. In Advances in Cryptology – EUROCRYPT 2019, Yuval Ishai and Vincent Rijmen (Eds.). Springer International Publishing, Cham, 717–746. https://doi.org/10.1007/978-3-030-17656-3_25