Iterative sparse matrix-vector multiplication for accelerating the block Wiedemann algorithm over GF(2) on multi-graphics processing unit systems

Concurrency and Computation: Practice and Experience

Volumn 25, Issue 4, 2013, Pages 586-603

  Schmidt, Bertil ^a   Aribowo, Hans ^a   Dang, Hoang Vu ^a  

^a JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

block Wiedemann; CUDA; factorization; number field sieve; RSA; SpMV

Indexed keywords

COMPUTER GRAPHICS; COMPUTER GRAPHICS EQUIPMENT; FACTORIZATION; ITERATIVE METHODS; LINEAR SYSTEMS; MATRIX ALGEBRA; PROGRAM PROCESSORS; SIEVES;

BLOCK WIEDEMANN; CUDA; INTEGER FACTORIZATION; NUMBER FIELD SIEVE; SPARSE LINEAR SYSTEMS; SPARSE MATRIX FORMATS; SPARSE MATRIX-VECTOR MULTIPLICATION; SPMV;

GRAPHICS PROCESSING UNIT;

EID: 84874116376     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.2896     Document Type: Conference Paper

References (23)

1. Coppersmith D,. Solving homogeneous linear equations over GF(2) via block Wiedemann algorithm. Mathematics of Computation 1994; 62: 333-350. DOI: 10.2307/2153413.
2. Montgomery PL,. A block Lanczos algorithm for finding dependencies over GF(2). Theory and Application of Cryptographic Techniques 1995: 106-120.
3. Aoki K, Franke J, Kleinjung T, Lenstra AK, Osvik DA,. A kilobit special number field sieve factorization. ASIACRYPT, Kuching, Malaysia, 2007; 1-12.
4. Kleinjung T, et al. Factorization of a 768-Bit RSA Modulus. International Crytology Conference, Santa Barbara, CA, USA, 2010; 333-350. DOI: 10.1007/978-3-642-14623-7-18.
5. Aoki K, Shimoyama T, Ueda H,. Experiments on the linear algebra step in the number field sieve. In Proceedings of the Security 2nd International Conference on Advances in Information and Computer Security, IWSEC'07. Springer-Verlag: Berlin, Heidelberg, 2007; 58-73.
6. Hwang W, Kim D,. Load balanced block Lanczos algorithm over GF(2) for factorization of large keys. 13th International Conference on High Performance Computing, Bangalore, India, 2006; 375-386.
7. Kleinjung T, Nussbaum L, Thomé E,. Using a grid platform for slving large sparse linear systems over GF(2). 11th ACM/IEEE International Conference on Grid Computing (Grid 2010), Brussels Belgique, 2010; 161-168.
8. Kleinjung T, Bos JW, Lenstra AK, Osvik DA, Aoki K, Contini S, Franke J, Thomé E, Jermini P, Thiémard M, Leyland P, Montgomery PL, Timofeev A, Stockinger H,. A heterogeneous computing environment to solve the 768-bit RSA challenge. Cluster Computing 2010; 15: 53-68.
9. Nickolls J, Dally WJ,. The GPU computing era. IEEE Micro 2010; 30: 56-69.
10. Nickolls J, Buck I, Garland M, Skadron K,. Scalable parallel programming with CUDA. Queue 2008; 6: 40-53. DOI: 10.1145/1365490.1365500.
11. Bell N, Garland M,. Efficient sparse matrix-vector multiplication on CUDA. NVIDIA Technical Report NVR-2008-004, NVIDIA Corporation, 2008.
12. Boyer B, Dumas J-G, Giorgi P,. Exact sparse matrix-vector multiplication on GPU's and multicore architectures. Computing Research RepositoryComputation 2010; abs/1203.0103. abs/1004.3719.
13. Choi JW, Singh A, Vuduc RW,. Model-driven autotuning of sparse matrix-vector multiply on GPUs. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming 2010 January; 45: 115-126.
14. Monakov A, Lokhmotov A, Avetisyan A,. Automatically tuning sparse matrix-vector multiplication for GPU architectures. 5th International Conference on High Performance Embedded Architectures and Compilers, Pisa, Italy, 2010; 111-125.
15. Schmidt B, Aribowo H, Dang H-V,. Iterative sparse matrix-vector multiplication for integer factorization on GPUs. In Euro-Par (2), Vol. 6853, Jeannot E, Namyst R, Roman J, (eds), Lecture Notes in Computer Science. Springer: Berlin, Heidelberg, 2011; 413-424.
16. Thomé E,. Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm. Journal of Symbolic Computation 2002; 33: 757-775. DOI: 10.1006/jsco.2002.0533.
17. NVIDIA. CUDA C Programming Guide, 2011. Available from: http://developer.download.nvidia.com/compute/DevZone/docs/html/C/doc/ CUDA-C-Programming-Guide.pdf [Accessed on June 21, 2012].
18. Bell N, Garland M,. Cusp: Generic Parallel Algorithms for Sparse Matrix and Graph Computations. (2010). Available from: http://cusp-library.googlecode. com [Accessed on June 21, 2012], version 0.1.0.
19. Harris M,. Optimizing parallel reduction in CUDA, 2007. Available from: http://developer.download.nvidia.com/assets/cuda/files/reduction.pdf [Accessed on June 21, 2012].
20. Gaudry P, et al. CADO-NFS, 2010. Available from: http://cado-nfs.gforge. inria.fr/ [Accessed on June 21, 2012].
21. Bonenberger D, Krone M,. 2010. Factorization of RSA-170. Technical Report, Ostfalia University of Applied Sciences. Available from: http://public.fh-wolfenbuettel.de/~kronema/pdf/rsa170.pdf [Accessed on June 21, 2012].
22. Papadopoulos J,. Msieve, 2010. Available from: http://sourceforge.net/ projects/msieve/ [Accessed on June 21, 2012].
23. RSA190 factored, 2010. Available from: http://www.mersenneforum.org/ showthread.php?t=14177 [Accessed on June 21, 2012].