Paper 2007/105 Original: eprint.iacr.org/2007/105 ↗
Isodual Reduction of Lattices
Abstract
We define a new notion of a reduced lattice, based on a quantity introduced in the LLL paper. We show that lattices reduced in this sense are simultaneously reduced in both their primal and dual. We show that the definition applies naturally to blocks, and therefore gives a new hierarchy of polynomial time algorithms for lattice reduction with fixed blocksize. We compare this hierarchy of algorithms to previous ones. We then explore algorithms to provably minimize the associated measure, and also some more efficient heuristics. Finally we comment on the initial investigations of applying our technique to the NTRU family of lattices.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2007-08-27: last updated
- 2007-03-23: published
- Short URL
- https://ia.cr/2007/105
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2007/105,
author = {Nicholas A. Howgrave-Graham},
title = {Isodual Reduction of Lattices},
howpublished = {Cryptology {ePrint} Archive, Paper 2007/105},
year = {2007},
url = {https://eprint.iacr.org/2007/105}
}