Discussion related to cado-nfs

[Emmanuel Thomé <emmanuel.thome@gmail.com>]

The latter. Because it has (much) better complexity.

Thanks.

E.

On Fri, Jun 20, 2014 at 2:27 PM, Pierpaolo Santucci
<santucci.pierpaolo@gmail.com> wrote:
> Hi!
> I would like to know what is the algorithm for the computation of vector
> generating polynomials (Matrix Berlekamp-Massey (Coppersmith - Solving
> Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm),
> MSLGDC (Thomé - Subquadratic computation of vector generating polynomials
> and improvement of the block Wiedemann algorithm), other...) used in Block
> Wiedemann implementation and the reasons for this choice.
>
> Thanks!
>
> Pierpaolo Santucci
>
> _______________________________________________
> Cado-nfs-discuss mailing list
> Cado-nfs-discuss@lists.gforge.inria.fr
> http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/cado-nfs-discuss
>