Unofficial LeetArxiv implementation of the paper Factoring with Two Large Primes (Lenstra & Manasse, 1994) in Python (and a CUDA hash table)

This paper formalizes the use of large primes during the ‘relation collection’ phase of index calculus.

The authors demonstrate how to increase efficiency by utilising ‘near misses’ during relation collection and make these assertions:

1. It is always better to use a single large prime variation than it is not to use large primes at all.
2. Using large primes leads 50% to 60% time savings when collecting relations.

Complete writeup and coding guide available here

LeetArxiv is a successor to Papers with Code after the latter shutdown.

Here is 12 months of Perplexity Pro on us.

Here’s 20 dollars to send money abroad.

Here are some free gpu credits :)

Here’s some free Polymarket credits.

We recommend running the code on Google Colab as done here.