Skip to Main content Skip to Navigation
Journal articles

Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm

Abstract : This paper describes a new algorithm for computing linear generators (vector generating polynomials) for matrix sequences, running in sub-quadratic time. This algorithm applies in particular to the sequential stage of Coppersmith's block Wiedemann algorithm. Experiments showed that our method can be substituted in place of the quadratic one proposed by Coppersmith, yielding important speedups even for realistic matrix sizes. The base fields we were interested in were finite fields of large characteristic. As an example, we have been able to compute a linear generator for a sequence of 4*4 matrices of length 242 304 defined over GF(2^607) in less than two days on one 667MHz alpha ev67 cpu.
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/inria-00103417
Contributor : Emmanuel Thomé <>
Submitted on : Wednesday, October 4, 2006 - 12:47:02 PM
Last modification on : Wednesday, October 14, 2020 - 3:54:03 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 6:04:25 PM

File

Identifiers

Collections

Citation

Emmanuel Thomé. Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm. Journal of Symbolic Computation, Elsevier, 2002, 33 (5), pp.757-775. ⟨10.1006/jsco.2002.0533⟩. ⟨inria-00103417⟩

Share

Metrics

Record views

409

Files downloads

1227