Paper 2023/447
Provable Lattice Reduction of with Blocksize
Abstract
The Lattice Isomorphism Problem (LIP) is the computational task of recovering, assuming it exists, a orthogonal linear transformation sending one lattice to another. For cryptographic purposes, the case of the trivial lattice
Note: Update: many typos fixed, and substantial editorial improvements.
Metadata
- Available format(s)
-
PDF
- Category
- Attacks and cryptanalysis
- Publication info
- Preprint.
- Keywords
- Lattice Isomorphism ProblemLattice ReductionProvable Algorithm
- Contact author(s)
- ducas @ cwi nl
- History
- 2023-09-05: last of 2 revisions
- 2023-03-27: received
- See all versions
- Short URL
- https://ia.cr/2023/447
- License
-
CC0
BibTeX
@misc{cryptoeprint:2023/447, author = {Léo Ducas}, title = {Provable Lattice Reduction of $\mathbb Z^n$ with Blocksize $n/2$}, howpublished = {Cryptology {ePrint} Archive, Paper 2023/447}, year = {2023}, url = {https://eprint.iacr.org/2023/447} }