Algorithmica
Solving sparse linear equations over finite fields
IEEE Transactions on Information Theory
Discrete logarithms in finite fields and their cryptographic significance
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Hoard: a scalable memory allocator for multithreaded applications
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Handbook of Applied Cryptography
Handbook of Applied Cryptography
Solving Large Sparse Linear Systems over Finite Fields
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Computing Discrete Logarithms with the General Number Field Sieve
ANTS-II Proceedings of the Second International Symposium on Algorithmic Number Theory
ICPPW '01 Proceedings of the 2001 International Conference on Parallel Processing Workshops
A block Lanczos algorithm for finding dependencies over GF(2)
EUROCRYPT'95 Proceedings of the 14th annual international conference on Theory and application of cryptographic techniques
Load balanced block lanczos algorithm over GF(2) for factorization of large keys
HiPC'06 Proceedings of the 13th international conference on High Performance Computing
Hi-index | 0.00 |
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several load-balancing methods suited to these platforms. We have carried out process-level and threadlevel parallel implementations under two different arithmetic libraries, and the best speedup obtained is 6.57 on eight cores. To the best of our knowledge, no implementation of the Lanczos algorithm on a multicore platform is ever reported in the literature. Moreover, we seem to have achieved significantly larger speedup compared to all previously reported implementations of this algorithm.