Discussion related to cado-nfs

[Laël Cellier <lael.cellier@grenoble-inp.org>]

As everybody here knows, the ɢɴꜰꜱ is the most efficient algorithm for 
factoring numbers formed of roughly equal in length composites.

But it’s linear Algebra/sequential parts means (If I’m not wrong), that 
it requires at least 9 minutes on current hardware to factor semi‑primes 
formed of composites of roughly equal length (in the case of 382 bits 
semi‑primes the Linear part takes 6 to 10 minutes).

Are there less efficient algorithms but by being more parallelizable, 
that would allow to solve batch of such semi‑primes faster using more 
resources ? (though not prohibitively costly). If yes, it would be good 
for ᴄᴀᴅᴏ to support them…

The aim is part of a small competition where the reward goes to the 
first who answers. The fact the record is still 9 minutes for 382 bits 
semi‑prime seems to tell there’s no solution : but there’s currently 
only 3 participants in the race.

Sincerely,