Constant time lattice reduction in dimension 4 with application to SQIsign
In this paper we propose a constant time lattice reduction algorithm for integral dimension-4 lattices. Motivated by its application in the SQIsign postquantum signature scheme, we provide for the first time a constant time LLLlike algorithm with guarantees on the length of the shortest output vector. We implemented our algorithm and ensured through various tools that it indeed operates in constant time. Our experiments suggest that in practice our implementation outputs a Minkowski reduced basis and thus can replace a non constant time lattice reduction subroutine in SQIsign.
Authors
- Elena Kirshanova (ORCID: https://orcid.org/0000-0001-8924-7605)
- Alexander Karenin
- Otto Hanyecz
- Péter Kutas
- Sina Schaeffler
Institutions
- Eötvös Loránd University (HU)
- ETH Zurich (CH)
- Technology Innovation Institute (AE)
- IBM Research - Zurich (CH)
Publication Details
- Journal
- IACR Transactions on Cryptographic Hardware and Embedded Systems
- Published
- 2025-03-04
- DOI
- https://doi.org/10.46586/tches.v2025.i2.511-534
- Citations
- 1
- Primary Topic
- Advanced Numerical Analysis Techniques
- Type
- article
- Field-Weighted Citation Impact
- 1.33