{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:42:36Z","timestamp":1725601356804},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642233968"},{"type":"electronic","value":"9783642233975"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23397-5_41","type":"book-chapter","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T07:40:06Z","timestamp":1313653206000},"page":"413-424","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Iterative Sparse Matrix-Vector Multiplication for Integer Factorization on GPUs"],"prefix":"10.1007","author":[{"given":"Bertil","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Aribowo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoang-Vu","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Aoki, K., Franke, J., Kleinjung, T., Lenstra, A.K., Osvik, D.A.: A Kilobit Special Number Field Sieve Factorization.. In: ASIACRYPT (2007)","DOI":"10.1007\/978-3-540-76900-2_1"},{"key":"41_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-540-75651-4_5","volume-title":"Advances in Information and Computer Security","author":"K. Aoki","year":"2007","unstructured":"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.\u00a04752, pp. 58\u201373. Springer, Heidelberg (2007)"},{"key":"41_CR3","unstructured":"Bell, N., Garland, M.: Efficient Sparse Matrix-Vector Multiplication on CUDA. NVIDIA Technical Report NVR-2008-004, NVIDIA Corporation (December 2008)"},{"key":"41_CR4","unstructured":"Bell, N., Garland, M.: Cusp: Generic Parallel Algorithms for Sparse Matrix and Graph Computations, version 0.1.0 (2010), \n                    \n                      http:\/\/cusp-library.googlecode.com"},{"key":"41_CR5","unstructured":"Bonenberger, D., Krone, M.: Factorization of rsa-170. Tech. rep., Ostfalia University of Applied Sciences (2010), \n                    \n                      http:\/\/public.rz.fh-wolfenbuettel.de\/~kronema\/pdf\/rsa170.pdf"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Boyer, B., Dumas, J.G., Giorgi, P.: Exact Sparse Matrix-Vector Multiplication on GPU\u2019s and Multicore Architectures. CoRR abs\/1004.3719 (2010)","DOI":"10.1145\/1837210.1837224"},{"key":"41_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1145\/1837853.1693471","volume":"45","author":"J.W. Choi","year":"2010","unstructured":"Choi, J.W., Singh, A., Vuduc, R.W.: Model-driven autotuning of sparse matrix-vector multiply on GPUs. SIGPLAN Not.\u00a045, 115\u2013126 (2010)","journal-title":"SIGPLAN Not."},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Coppersmith, D.: Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm. Mathematics of Computation 62 (1994)","DOI":"10.2307\/2153413"},{"key":"41_CR9","unstructured":"Gaudry, P., et al.: CADO-NFS (2010), \n                    \n                      http:\/\/cado-nfs.gforge.inria.fr\/"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Hwang, W., Kim, D.: Load Balanced Block Lanczos Algorithm over GF(2) for Factorization of Large Keys. In: HiPC, pp. 375\u2013386 (2006)","DOI":"10.1007\/11945918_38"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Kleinjung, T., Nussbaum, L., Thom\u00e9, 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)","DOI":"10.1109\/GRID.2010.5697952"},{"key":"41_CR12","doi-asserted-by":"crossref","unstructured":"Kleinjung, T., et al.: A Heterogeneous Computing Environment to Solve the 768-bit RSA Challenge. Cluster Computing (2010)","DOI":"10.1007\/s10586-010-0149-0"},{"key":"41_CR13","doi-asserted-by":"crossref","unstructured":"Kleinjung, T., et al.: Factorization of a 768-Bit RSA Modulus. In: International Crytology Conference, pp. 333\u2013350 (2010)","DOI":"10.1007\/978-3-642-14623-7_18"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Monakov, A., Lokhmotov, A., Avetisyan, A.: Automatically Tuning Sparse Matrix-Vector Multiplication for GPU Architectures. In: HiPEAC, pp. 111\u2013125 (2010)","DOI":"10.1007\/978-3-642-11515-8_10"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Montgomery, P.L.: A Block Lanczos Algorithm for Finding Dependencies Over GF(2). In: Theory and Application of Cryptographic Techniques, pp. 106\u2013120 (1995)","DOI":"10.1007\/3-540-49264-X_9"},{"key":"41_CR16","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1365490.1365500","volume":"6","author":"J. Nickolls","year":"2008","unstructured":"Nickolls, J., Buck, I., Garland, M., Skadron, K.: Scalable Parallel Programming with CUDA. Queue\u00a06, 40\u201353 (2008)","journal-title":"Queue"},{"key":"41_CR17","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/MM.2010.41","volume":"30","author":"J. Nickolls","year":"2010","unstructured":"Nickolls, J., Dally, W.J.: The GPU Computing Era. IEEE Micro.\u00a030, 56\u201369 (2010)","journal-title":"IEEE Micro."},{"key":"41_CR18","unstructured":"Papadopoulos, J.: Msieve (2010), \n                    \n                      http:\/\/sourceforge.net\/projects\/msieve\/"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2011 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23397-5_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:46:34Z","timestamp":1587343594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23397-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642233968","9783642233975"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23397-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}