Re: Reimplementing the cubic sieve faster

[Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>]

On Tue, Jun 10, 2025 at 06:25:55PM +0200, Laël Cellier wrote:
> As as supplemental question, is it possible to shrink the factor base if we
> know the discrete logarithm is below a specific bound ?

That will not help.
 
> Or more generally, to speed up the algorithm beside in the end solving the
> linear system modulo ((P−1)÷suborder) ?

We always solve the linear system modulo the prime powers factors of the order
of the basis and use CRT.

Cheers,
bill