International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Scaling Lattice Sieves across Multiple Machines

Authors:
Martin R. Albrecht , King's College London, SandboxAQ
Joe Rowell , Unaffiliated
Download:
DOI: 10.62056/a3wahey6b
URL: https://cic.iacr.org/p/1/4/11
Search ePrint
Search Google
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.

BibTeX
@article{cic-2025-34904,
  title={Scaling Lattice Sieves across Multiple Machines},
  journal={cic},
  publisher={International Association for Cryptologic Research},
  volume={1, Issue 4},
  url={https://cic.iacr.org/p/1/4/11},
  doi={10.62056/a3wahey6b},
  author={Martin R. Albrecht and Joe Rowell},
  year=2025
}