Fast Practical Lattice Reduction Through Iterated Compression-Reference-Cited by-同舟云学术

Fast Practical Lattice Reduction Through Iterated Compression

Published:2023 Issue: Volume: Page:3-36
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2023
language:
Short-container-title:

Author:

Ryan Keegan^ORCID,Heninger Nadia^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-38548-3_1

Reference56 articles.

1. Albrecht, M., Ducas, L.: Lattice attacks on NTRU and LWE: a history of refinements. Cryptology ePrint Archive, Report 2021/799 (2021). https://eprint.iacr.org/2021/799

2. Backendal, M., Haller, M., Paterson, K.G.: MEGA: malleable encryption goes awry. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 450–467, May 2023. https://doi.org/10.1109/SP46215.2023.00026

3. Lecture Notes in Computer Science;DJ Bernstein,2013

4. Lecture Notes in Computer Science;J Bi,2014

5. Biasse, J.F., Song, F.: Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields. In: Krauthgamer, R. (ed.) 27th SODA, pp. 893–902. ACM-SIAM, January 2016. https://doi.org/10.1137/1.9781611974331.ch64

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

1. Survey: Recovering cryptographic keys from partial information, by example;IACR Communications in Cryptology;2024-04-09

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

3. The Cool and the Cruel: Separating Hard Parts of LWE Secrets;Lecture Notes in Computer Science;2024

4. Passive SSH Key Compromise via Lattices;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

5. Inferring Bivariate Polynomials for Homomorphic Encryption Application;Cryptography;2023-06-05