Improved Provable Reduction of NTRU and Hypercubic Lattices

ePrint Report: Improved Provable Reduction of NTRU and Hypercubic Lattices

Henry Bambury, Phong Q. Nguyen

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 $\mathbb{Z}^n$, further relaxing the approximation factor of blocks to $\sqrt{2}$.
We study both provable algorithms and the …

can cryptography effectively efficiency eprint report exploit nguyen problem report special