Paper 2024/747
Scaling Lattice Sieves across Multiple Machines
Abstract
Lattice sieves are algorithms for finding short vectors in lattices. We present an implementation of two such sieves – known as “BGJ1” and “BDGL” in the literature – that scales across multiple servers (with varying success). This class of algorithms requires exponential memory which had put into question their ability to scale across sieving nodes. We discuss our architecture and optimisations and report experimental evidence of the efficiency of our approach.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint.
- Keywords
- LatticesLattice ReductionDistributed Computing
- Contact author(s)
-
martin albrecht @ kcl ac uk
joe rowell 2015 @ live rhul ac uk - History
- 2024-05-27: revised
- 2024-05-16: received
- See all versions
- Short URL
- https://ia.cr/2024/747
- License
-
CC0
BibTeX
@misc{cryptoeprint:2024/747,
author = {Martin R. Albrecht and Joe Rowell},
title = {Scaling Lattice Sieves across Multiple Machines},
howpublished = {Cryptology ePrint Archive, Paper 2024/747},
year = {2024},
note = {\url{https://eprint.iacr.org/2024/747}},
url = {https://eprint.iacr.org/2024/747}
}
