Research in Number Theory Algebra and Number Theory
Large smooth twins from short lattice vectors
Abstract
Abstract 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.