Paper 2024/601
Improved Provable Reduction of NTRU and Hypercubic Lattices
Abstract
Lattice-based cryptography typically uses lattices with special properties to improve efficiency. We show how blockwise reduction can exploit lattices with special geometric properties, effectively reducing the required blocksize to solve the shortest vector problem to half of the lattice's rank, and in the case of the hypercubic lattice
Note: V2: fixed minor typos and extended the heuristic analysis in the case of NTRU.
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Published elsewhere. Minor revision. PQCrypto 2024
- DOI
- 10.1007/978-3-031-62743-9_12
- Keywords
- LatticesCryptanalysisNTRULIP
- Contact author(s)
-
henry bambury @ m4x org
phong nguyen @ inria fr - History
- 2025-01-28: revised
- 2024-04-18: received
- See all versions
- Short URL
- https://ia.cr/2024/601
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/601, author = {Henry Bambury and Phong Q. Nguyen}, title = {Improved Provable Reduction of {NTRU} and Hypercubic Lattices}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/601}, year = {2024}, doi = {10.1007/978-3-031-62743-9_12}, url = {https://eprint.iacr.org/2024/601} }