Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Albrecht et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: