Random Krylov spaces over finite fields

SIAM Journal on Discrete Mathematics

Volumn 16, Issue 2, 2003, Pages 276-287

  Brent, Richard P ^a   Gao, Shuhong ^b   Lauder, Alan G B ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b CLEMSON UNIVERSITY   (United States)

Author keywords

Finite field; Krylov subspace; Linear transformation; Vector space

Indexed keywords

BOUNDARY CONDITIONS; ITERATIVE METHODS; LINEAR SYSTEMS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

FINITE FIELDS; KRYLOV SPACES;

VECTORS;

EID: 0038137157     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548010139388X     Document Type: Article

References (16)

1. W. A. Adkins and S. H. Weintraub, Algebra: An approach via module theory, Grad. Texts in Math. 136, Springer-Verlag, New York, 1992.
2. m, Discrete Math., 66 (1987), pp. 35-49.
3. D. Coppersmith, Solving linear equations over GF(2): Block Lanczos algorithm, Linear Algebra Appl., 192 (1993), pp. 33-60.
4. D. Coppersmith. Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm, Math. Comp., 62 (1994), pp. 333-350.
5. S. Gao, Factoring multivariate polynomials via partial differential equations, Math. Comp., to appear.
6. S. Gao and J. von zur Gathen, Berlekamp's and Niederreiter's polynomial factorization algorithms, in Proceedings of the 2nd International Conference on Finite Fields: Theory, Applications, and Algorithms, Las Vegas, 1993, Contemp. Math. 168, AMS, Providence, RI, 1994, pp. 101-116.
7. S. Gao and D. Panario, Density of normal elements in finite fields, Finite Fields Appl., 3 (1997), pp. 141-150.
8. E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comp., 64 (1995), pp. 777-806.
9. E. Kaltofen and A. Lobo, Factoring high-degree polynomials by the black box Berlekamp algorithm, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, Oxford, UK, 1994, pp. 90-98.
10. G. Landsberg, Über eine Anzahlbestimmung und eine damit zusammenhängende Reihe, J. Reine Angew. Math., 111 (1893), pp. 87-88.
11. A. K. Lenstra and H. W. Lenstra, Jr., Eds., The Development of the Number Field Sieve, Lecture Notes in Math. 1554, Springer-Verlag, New York, 1993.
12. P. L. Montgomery, A block Lanczos algorithm for finding dependencies over GF(2), in Advances in Cryptology-EUROCRYPT '95, Saint-Malo, France, 1995, Lecture Notes in Comput. Sci. 921, Springer-Verlag, Berlin, 1995, pp. 106-120.
13. D. J. S. Robinson, A Course in the Theory of Groups, 2nd ed., Graduate Texts in Math. 80, Springer-Verlag, New York, 1996.
14. G. Villard, Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems, in Proceedings of the International Symposium on Symbolic and Algebraic Computation, Maui, HI, 1997, ACM, New York, 1997, pp. 32-39
15. G. Villard, A Study of Coppersmith's Block Wiedemann Algorithm Using Matrix Polynomials, Technical report 975 IM, LMC-IMAG, Grenoble, France, 1997.
16. D. H. Wiedemann, Solving sparse linear equations over finite fields, IEEE Trans. Inform. Theory, 32 (1986) pp. 54-62.