Large smooth twins from short lattice vectors
Research in Number Theory · 2026-12 · 12 (4)
DOI: 10.1007/s40993-026-00821-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Research in Number Theory, online erschienen am 21.11.2026. Verfasst von Erik Mulder und 2 weiteren Autor:innen. Die Arbeit nennt 41 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: University of Bergen.
Abstract (Originalsprache)
Finding the largest pair of consecutive B -smooth integers for a fixed B , also called a B -smooth twin, is computationally challenging. It has only been provably done for $$B \le 100$$ B ≤ 100 and heuristically for $$100 < B \le 113$$ 100 < B ≤ 113 . We improve this by detailing a new algorithm to find such smooth twins based on solving the shortest vector problem (SVP) in a well-constructed lattice. Using an estimate of the largest B -smooth twin that we develop in this work, we are able to significantly increase B and notably report the heuristically largest twin with $$B = 751$$ B = 751 , which has 196 bits. By slightly modifying the lattice, we are able to find even larger twins, but the resulting smoothness bound will not always be optimal. This notably includes a 213-bit twin with $$B = 997$$ B = 997 , which is the largest twin found in this work.
Förderung
- University of Bergen
Zitieren
APA
Mulder, E., Sterner, B., & Woerden, W. V. (2026). Large smooth twins from short lattice vectors. Research in Number Theory, 12(4). https://doi.org/10.1007/s40993-026-00821-3
Vancouver
Mulder E, Sterner B, Woerden WV. Large smooth twins from short lattice vectors. Research in Number Theory. 2026;12(4). doi:10.1007/s40993-026-00821-3
BibTeX
@article{Mulder2026,
author = {Mulder, Erik and Sterner, Bruno and Woerden, Wessel van},
title = {Large smooth twins from short lattice vectors},
journal = {Research in Number Theory},
year = {2026},
volume = {12},
number = {4},
doi = {10.1007/s40993-026-00821-3}
}
EUVIMED