论文信息 - Efficient Parallelization of Lanczos Type Algorithms

Efficient Parallelization of Lanczos Type Algorithms

We propose a new parallelization technique for Lanzos type algorithms for solving sparse linear systems over finite fields on mesh cluster architecture. The algorithm computation time scales as P−1 on P processors, and the communication time scales as P−1/2 for reasonable choice of P .

Ilya Popovyan | I. Popovyan

[1] Arjen K. Lenstra,et al. Factorization of a 768-Bit RSA Modulus , 2010, CRYPTO.

[2] Steven J. Plimpton,et al. An Efficient Parallel Algorithm for Matrix-Vector Multiplication , 1995, Int. J. High Speed Comput..

[3] Erich Kaltofen,et al. On randomized Lanczos algorithms , 1997, ISSAC.

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

[5] Peter L. Montgomery,et al. A Block Lanczos Algorithm for Finding Dependencies Over GF(2) , 1995, EUROCRYPT.

[6] C. Lanczos. An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[7] Ildikó Flesch,et al. A New Parallel Approach to the Block Lanczos Algorithm for Finding Nullspaces over GF ( 2 ) , 2002 .

[8] Carl Pomerance,et al. The Development of the Number Field Sieve , 1994 .

[9] Robert A. van de Geijn,et al. Collective communication: theory, practice, and experience , 2007, Concurr. Comput. Pract. Exp..