Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 323-331

  Thome E ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FAST FOURIER TRANSFORMS; ITERATIVE METHODS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

BLOCK WIEDEMANN ALGORITHM; HALF-GREATEST COMMON DIVISOR ALGORITHM; LINEAR GENERATORS; POLYNOMIAL REMAINDER SEQUENCES BY DIVIDE-AND-CONQUER ALGORITHM;

COMPUTATION THEORY;

EID: 0034782094     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384145     Document Type: Conference Paper

References (26)

1. A uniform approach for the fast computation of matrix-type Padé approximants
2. Asymptotically fast solution of toeplitz and related systems of linear equations
3. Strategies in filtering in the number field sieve
4. Factorization of a 512-bit RSA modulus
5. Fast evaluation of logarithms in fields of characteristic two
6. Solving linear equations over GF(2): Block Lanczos algorithm
7. Solving linear equations over GF(2) via block Wiedemann algorithm
8. On the equivalence between Berlekamp's and Euclid's algorithm
9. An algorithm for solving the discrete log problem on hyperelliptic curves
10. Fast algorithms for rational Hermite approximation and solution of Toeplitz systems
11. Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems
12. Distributed matrix-free solution of large sparse linear systems over finite fields
13. Solving large sparse linear systems over finite fields
14. A block Lanczos algorithm for finding dependencies over GF(2)
15. Doubling algorithms for Toeplitz and related equations
16. Discrete logarithms in finite fields and their cryptographic significance
17. Reduction of huge, sparse matrices over finite fields via created catastrophes
18. Euclid's algorithm and the Lanczos method over finite fields
19. A study of Coppersmith's block Wiedemann algorithm using matrix polynomials
20. Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems
21. The solution of McCurley's discrete log challenge
22. Solving sparse linear equations over finite fields