Iterative sparse matrix-vector multiplication for integer factorization on GPUs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6853 LNCS, Issue PART 2, 2011, Pages 413-424

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

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

Block Wiedemann; CUDA; Factorization; Number Field Sieve; RSA; SpMV

Indexed keywords

BLOCK WIEDEMANN; CUDA; NUMBER FIELD SIEVE; RSA; SPMV;

ALGORITHMS; FACTORIZATION; LINEAR SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; SIEVES;

MATRIX ALGEBRA;

EID: 80052338487     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23397-5_41     Document Type: Conference Paper

References (18)

1. Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A Kilobit Special Number Field sieve factorization. In: ASIACRYPT (2007)
2. Aoki, K., Shimoyama, T., Ueda, H.: Experiments on the linear algebra step in the number field sieve. In: Miyaji, A., Kikuchi, H., Rannenberg, K. (eds.) IWSEC 2007. LNCS, vol. 4752, pp. 58-73. Springer, Heidelberg (2007)
3. Bell, N., Garland, M.: Efficient Sparse Matrix-Vector Multiplication on CUDA. NVIDIA Technical Report NVR-2008-004, NVIDIA Corporation (December 2008)
4. Bell, N., Garland, M.: Cusp: Generic Parallel Algorithms for Sparse Matrix and Graph Computations, version 0.1.0 (2010), http://cusp-library. googlecode.com
5. Bonenberger, D., Krone, M.: Factorization of rsa-170. Tech. rep., Ostfalia University of Applied Sciences (2010), http://public.rz.fh- wolfenbuettel.de/~kronema/pdf/rsa170.pdf
6. Boyer, B., Dumas, J.G., Giorgi, P.: Exact Sparse Matrix-Vector Multiplication on GPU's and Multicore Architectures. CoRR abs/1004.3719 (2010)
7. Choi, J.W., Singh, A., Vuduc, R.W.: Model-driven autotuning of sparse matrixvector multiply on GPUs. SIGPLAN Not. 45, 115-126 (2010)
8. Coppersmith, D.: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm. Mathematics of Computation 62 (1994)
9. Gaudry, P., et al.: CADO-NFS (2010), http://cado-nfs.gforge.inria.fr/
10. Hwang, W., Kim, D.: Load Balanced Block Lanczos Algorithm over GF(2) for Factorization of Large Keys. In: HiPC, pp. 375-386 (2006)
11. Kleinjung, T., Nussbaum, L., Thomé, E.: Using a grid platform for solving large sparse linear systems over GF(2). In: 11th ACM/IEEE International Conference on Grid Computing (Grid 2010), Brussels Belgique (October 2010)
12. Kleinjung, T., et al.: A Heterogeneous Computing Environment to Solve the 768-bit RSA Challenge. Cluster Computing (2010)
13. Kleinjung, T., et al.: Factorization of a 768-Bit RSA Modulus. In: International Crytology Conference, pp. 333-350 (2010)
14. Monakov, A., Lokhmotov, A., Avetisyan, A.: Automatically Tuning Sparse Matrix-Vector Multiplication for GPU Architectures. In: HiPEAC, pp. 111-125 (2010)
15. Montgomery, P.L.: A Block Lanczos Algorithm for Finding Dependencies Over GF(2). In: Theory and Application of Cryptographic Techniques, pp. 106-120 (1995)
16. Nickolls, J., Buck, I., Garland, M., Skadron, K.: Scalable Parallel Programming with CUDA. Queue 6, 40-53 (2008)
17. Nickolls, J., Dally, W.J.: The GPU Computing Era. IEEE Micro. 30, 56-69 (2010)
18. Papadopoulos, J.: Msieve (2010), http://sourceforge.net/projects/msieve/