论文信息 - Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes

Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes

We present a heuristic method for the reduction modulo 2 of a large, sparse bit matrix to a smaller, dense bit matrix that can then be solved by conventional means, such as Gaussian elimination. This method worked effectively for us in reducing matrices as large as 100,000 × 100,000 to much smaller, but denser square matrices.

Jeffrey W. Smith | Carl Pomerance | Jeffrey W. Smith | C. Pomerance

[1] Jeffrey W. Smith,et al. A Pipeline Architecture for Factoring Large Integers with the Quadratic Sieve Algorithm , 1988, SIAM J. Comput..

[2] Douglas H. Wiedemann. Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[3] H. Lenstra,et al. Factoring integers with the number field sieve , 1993 .

[4] Béla Bollobás,et al. Random Graphs , 1985 .

[5] Andrew M. Odlyzko,et al. Solving Large Sparse Linear Systems over Finite Fields , 1990, CRYPTO.

[6] Andrew M. Odlyzko,et al. Discrete Logarithms in Finite Fields and Their Cryptographic Significance , 1985, EUROCRYPT.