## Cryptology ePrint Archive: Report 2011/416

Efficient Parallelization of Lanczos Type Algorithms

Ilya Popovyan

Abstract: We propose a new parallelization technique for Lanczos type algorithms for solving large sparse linear systems over finite fields on mesh cluster architecture. The algorithm computation time scales as $P^{-1}$ on $P processors, and the communcation times scales as$P^{-1/2}$for reasonable choice of$P\$.

Category / Keywords: number field sieve, parallel sparse linear system solver

Contact author: poilyard at gmail com

Available format(s): PDF | BibTeX Citation

Short URL: ia.cr/2011/416

[ Cryptology ePrint archive ]