{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T07:20:22Z","timestamp":1776842422174,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":51,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642010002","type":"print"},{"value":"9783642010019","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01001-9_28","type":"book-chapter","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T12:38:25Z","timestamp":1239799105000},"page":"483-501","source":"Crossref","is-referenced-by-count":41,"title":["ECM on Graphics Cards"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tien-Ren","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen-Mou","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"#cr-split#-28_CR1.1","unstructured":"13th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2005), Napa, CA, USA, April 17???20, 2005. IEEE Computer Society, Los Alamitos (2005);"},{"key":"#cr-split#-28_CR1.2","unstructured":"ISBN 0-7695-2445-1. See [44]"},{"key":"28_CR2","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 [31], pp. 1\u201312 (2007) (Cited in \u00a71, \u00a71)","DOI":"10.1007\/978-3-540-76900-2_1"},{"key":"#cr-split#-28_CR3.1","doi-asserted-by":"crossref","unstructured":"Atkin, A.O.L., Morain, F.: Finding suitable curves for the elliptic curve method of factorization. Mathematics of Computation??60, 399???405 (1993);","DOI":"10.2307\/2153176"},{"key":"#cr-split#-28_CR3.2","unstructured":"ISSN 0025-5718, MR 93k:11115, http:\/\/www.lix.polytechnique.fr\/~morain\/Articles\/articles.english.html (Cited in ??2.2)"},{"key":"28_CR4","unstructured":"Bahr, F., Boehm, M., Franke, J., Kleinjung, T.: Subject: rsa200 (2005), http:\/\/www.crypto-world.com\/announcements\/rsa200.txt (Cited in \u00a71)"},{"key":"28_CR5","unstructured":"Bahr, F., Franke, J., Kleinjung, T.: Discrete logarithms in GF(p) - 160 digits (2007), http:\/\/www.nabble.com\/ (Cited in \u00a71)"},{"key":"28_CR6","unstructured":"Bernstein, D.J.: How to build the 2009.01.23 standard workstation, http:\/\/cr.yp.to\/hardware\/build-20090123.html (Cited in \u00a76)"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted Edwards Curves. In: AFRICACRYPT [47], pp. 389\u2013405 (2008), http:\/\/eprint.iacr.org\/2008\/013 (Cited in \u00a72.2)","DOI":"10.1007\/978-3-540-68164-9_26"},{"key":"28_CR8","unstructured":"Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: ECM using Edwards curves (2008), http:\/\/eprint.iacr.org\/2008\/016 (Cited in \u00a72, \u00a72.2, \u00a72.2, \u00a72.2)"},{"key":"28_CR9","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database (2008), http:\/\/hyperelliptic.org\/EFD (Cited in \u00a72.2, \u00a75)"},{"key":"28_CR10","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: ASIACRYPT 2007 [31], pp. 29\u201350 (2007), http:\/\/cr.yp.to\/papers.html#newelliptic (Cited in \u00a72.2, \u00a72.2)"},{"key":"28_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2003","year":"2003","unstructured":"Boneh, D. (ed.): CRYPTO 2003. LNCS, vol.\u00a02729. Springer, Heidelberg (2003); ISBN 3-540-40674- 3. See [43]"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Cavallar, S., Dodson, B., Lenstra, A.K., Leyland, P.C., Lioen, W.M., Montgomery, P.L., Murphy, B., te Riele, H., Zimmermann, P.: Factorization of RSA-140 Using the Number Field Sieve. In: ASIACRYPT 1999 [33], pp. 195\u2013207 (1999) (Cited in \u00a71)","DOI":"10.1007\/978-3-540-48000-6_16"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Cavallar, S., Dodson, B., Lenstra, A.K., Lioen, W.M., Montgomery, P.L., Murphy, B., te Riele, H., Aardal, K., Gilchrist, J., Guillerm, G., Leyland, P.C., Marchand, J., Morain, F., Muffett, A., Putnam, C., Putnam, C., Zimmermann, P.: Factorization of a 512-Bit RSA Modulus. In: EUROCRYPT 2000 [41], pp. 1\u201318 (2000) (Cited in \u00a71, \u00a71)","DOI":"10.1007\/3-540-45539-6_1"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Cook, D.L., Ioannidis, J., Keromytis, A.D., Luck, J.: CryptoGraphics: Secret Key Cryptography Using Graphics Cards. In: CT-RSA 2005 [36], pp. 334\u2013350 (2005) (Cited in \u00a73)","DOI":"10.1007\/978-3-540-30574-3_23"},{"key":"28_CR15","volume-title":"Advances in Information Security","author":"D.L. Cook","year":"2006","unstructured":"Cook, D.L., Keromytis, A.D.: CryptoGraphics: Exploiting Graphics Cards For Security. In: Advances in Information Security, vol.\u00a020. Springer, Heidelberg (2006); ISBN 978-0- 387-29015-7 (Cited in \u00a73)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Cowie, J., Dodson, B., Elkenbracht-Huizing, R.M., Lenstra, A.K., Montgomery, P.L., Zayer, J.: A World Wide Number Field Sieve Factoring Record: On to 512 Bits. In: ASIACRYPT 1996 [28], pp. 382\u2013394 (1996) (Cited in \u00a71)","DOI":"10.1007\/BFb0034863"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2006","year":"2006","unstructured":"Dwork, C. (ed.): CRYPTO 2006. LNCS, vol.\u00a04117. Springer, Heidelberg (2006); ISBN 3-540- 37432-9. See [27]"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"H.M. Edwards","year":"2007","unstructured":"Edwards, H.M.: A normal form for elliptic curves. Bulletin of the American Mathematical Society\u00a044, 393\u2013422 (2007), http:\/\/www.ams.org\/bull\/2007-44-03\/S0273-0979-07-01153-6\/home.html (Cited in \u00a72.2)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Franke, J., Kleinjung, T., Paar, C., Pelzl, J., Priplata, C., Stahlke, C.: SHARK: A Realizable Special Hardware Sieving Device for Factoring 1024-Bit Integers. In: CHES 2005 [42], pp. 119\u2013130 (2005) (Cited in \u00a71, \u00a71)","DOI":"10.1007\/11545262_9"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Gaj, K., Kwon, S., Baier, P., Kohlbrenner, P., Le, H., Khaleeluddin, M., Bachimanchi, R.: Implementing the Elliptic Curve Method of Factoring in Reconfigurable Hardware. In: CHES 2006 [23], pp. 119\u2013133 (2006) (Cited in \u00a71)","DOI":"10.1007\/11894063_10"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptography and Coding","year":"2007","unstructured":"Galbraith, S.D. (ed.): Cryptography and Coding 2007. LNCS, vol.\u00a04887. Springer, Heidelberg (2007); ISBN 978-3-540-77271-2. See [38]"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Geiselmann, W., Shamir, A., Steinwandt, R., Tromer, E.: Scalable Hardware for Sparse Systems of Linear Equations, with Applications to Integer Factorization. In: CHES 2005 [42], pp. 131\u2013146 (2005) (Cited in \u00a71)","DOI":"10.1007\/11545262_10"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","year":"2006","unstructured":"Goubin, L., Matsui, M. (eds.): CHES 2006. LNCS, vol.\u00a04249. Springer, Heidelberg (2006); ISBN 3- 540-46559-6. See [20]"},{"key":"28_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Number Theory","year":"2006","unstructured":"Hess, F., Pauli, S., Pohst, M.E. (eds.): ANTS 2006. LNCS, vol.\u00a04076. Springer, Heidelberg (2006); ISBN 3- 540-36075-1. See [48]"},{"key":"28_CR25","unstructured":"Hisil, H., Wong, K., Carter, G., Dawson, E.: Faster group operations on elliptic curves (2007), http:\/\/eprint.iacr.org\/2007\/441 (Cited in \u00a72.2)"},{"key":"28_CR26","first-page":"953","volume":"72","author":"A. Joux","year":"2003","unstructured":"Joux, A., Lercier, R.: Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method, Mathematics of Computation\u00a072, 953\u2013967 (2003) (Cited in \u00a71)","journal-title":"A comparison with the Gaussian integer method, Mathematics of Computation"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Joux, A., Lercier, R., Smart, N.P., Vercauteren, F.: The Number Field Sieve in the Medium Prime Case. In: CRYPTO 2006 [17], pp. 326\u2013344 (2006) (Cited in \u00a71)","DOI":"10.1007\/11818175_19"},{"key":"28_CR28","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT \u201996","year":"1996","unstructured":"Kim, K., Matsumoto, T. (eds.): ASIACRYPT 1996. LNCS, vol.\u00a01163. Springer, Heidelberg (1996); ISBN 3-540-61872-4. See [16]"},{"key":"28_CR29","unstructured":"Kleinjung, T.: Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers. In: Proceedings of SHARCS 2006 (2006), http:\/\/www.math.uni-bonn.de\/people\/thor\/cof.ps (Cited in \u00a71, \u00a71)"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Koblitz, N., Menezes, A.: Pairing-Based Cryptography at High Security Levels. In: Coding and Cryptography [45], pp. 13\u201336 (2005) (Cited in \u00a71)","DOI":"10.1007\/11586821_2"},{"key":"28_CR31","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","year":"2007","unstructured":"Kurosawa, K. (ed.): ASIACRYPT 2007. LNCS, vol.\u00a04833. Springer, Heidelberg (2007); See [2], [10]"},{"key":"28_CR32","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT 2003","year":"2003","unstructured":"Laih, C.-S. (ed.): ASIACRYPT 2003. LNCS, vol.\u00a02894. Springer, Heidelberg (2003); ISBN 3-540-20592-6. See [35]"},{"key":"28_CR33","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","year":"1999","unstructured":"Lam, K.-Y., Okamoto, E., Xing, C. (eds.): ASIACRYPT 1999. LNCS, vol.\u00a01716. Springer, Heidelberg (1999); ISBN 3-540-66666-4. See [12]"},{"key":"28_CR34","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra Jr.","year":"1987","unstructured":"Lenstra Jr., H.W.: Factoring integers with elliptic curves. Annals of Mathematics\u00a0126, 649\u2013673 (1987); ISSN 0003-486X, MR 89g:11125, http:\/\/links.jstor.org\/sici?sici=0003-486X1987112:126:3649:FIWEC2.0.CO;2-V (Cited \u00a71)","journal-title":"Annals of Mathematics"},{"key":"28_CR35","doi-asserted-by":"crossref","unstructured":"Lenstra, A.K., Tromer, E., Shamir, A., Kortsmit, W., Dodson, B., Hughes, J., Leyland, P.C.: Factoring Estimates for a 1024-Bit RSA Modulus. In: ASIACRYPT 2003 [32], pp. 55\u201374 (2003) (Cited in \u00a71)","DOI":"10.1007\/978-3-540-40061-5_4"},{"key":"28_CR36","series-title":"Lecture Notes in Computer Science","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","year":"2005","unstructured":"Menezes, A.J. (ed.): CT-RSA 2005. LNCS, vol.\u00a03376. Springer, Heidelberg (2005); ISBN 3- 540-24399-2. See [14]"},{"key":"28_CR37","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044, 519\u2013521 (1985), http:\/\/www.jstor.org\/pss\/2007970 (Cited in \u00a74.1)","journal-title":"Mathematics of Computation"},{"key":"28_CR38","doi-asserted-by":"crossref","unstructured":"Moss, A., Page, D., Smart, N.P.: Toward Acceleration of RSA Using 3D Graphics Hardware. In: Cryptography and Coding 2007 [21], pp. 364\u2013383 (2007) (Cited in \u00a73)","DOI":"10.1007\/978-3-540-77272-9_22"},{"key":"28_CR39","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","year":"2008","unstructured":"Oswald, E., Rohatgi, P. (eds.): CHES 2008. LNCS, vol.\u00a05154. Springer, Heidelberg (2008); ISBN 978-3-540-85052-6. See [46]"},{"key":"28_CR40","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1049\/ip-ifs:20055018","volume":"152","author":"J. Pelzl","year":"2005","unstructured":"Pelzl, J., \u0160imka, M., Kleinjung, T., Franke, J., Priplata, C., Stahlke, C., Drutarovsk\u00fd, M., Fischer, V., Paar, C.: Area-time efficient hardware architecture for factoring integers with the elliptic curve method. IEE Proceedings on Information Security\u00a0152, 67\u201378 (2005) (Cited in \u00a71)","journal-title":"IEE Proceedings on Information Security"},{"key":"28_CR41","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2000","year":"2000","unstructured":"Preneel, B. (ed.): EUROCRYPT 2000. LNCS, vol.\u00a01807. Springer, Heidelberg (2000); ISBN 3-540-67517-5. See [13]"},{"key":"28_CR42","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","year":"2005","unstructured":"Rao, J.R., Sunar, B. (eds.): CHES 2005. LNCS, vol.\u00a03659. Springer, Heidelberg (2005); ISBN 3-540-28474-5. See [19], [22]"},{"key":"28_CR43","doi-asserted-by":"crossref","unstructured":"Shamir, A., Tromer, E.: Factoring Large Numbers with the TWIRL Device. In: CRYPTO 2003 [11], pp. 1\u201326 (2003) (Cited in \u00a71)","DOI":"10.1007\/978-3-540-45146-4_1"},{"key":"28_CR44","doi-asserted-by":"crossref","unstructured":"\u0160imka, M., Pelzl, J., Kleinjung, T., Franke, J., Priplata, C., Stahlke, C., Drutarovsk\u00fd, M., Fischer, V.: Hardware Factorization Based on Elliptic Curve Method. In: FCCM 2005 [1], pp. 107\u2013116 (2005) (Cited in \u00a71)","DOI":"10.1109\/FCCM.2005.40"},{"key":"28_CR45","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptography and Coding","year":"2005","unstructured":"Smart, N.P. (ed.): Cryptography and Coding 2005. LNCS, vol.\u00a03796. Springer, Heidelberg (2005); See [30]"},{"key":"28_CR46","doi-asserted-by":"crossref","unstructured":"Szerwinski, R., G\u00fcneysu, T.: Exploiting the Power of GPUs for Asymmetric Cryptography. In: CHES 2008 [39], pp. 79\u201399 (2008) (Cited in \u00a73.1, \u00a76, \u00a72)","DOI":"10.1007\/978-3-540-85053-3_6"},{"key":"28_CR47","series-title":"Lecture Notes in Computer Science","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","year":"2008","unstructured":"Vaudenay, S. (ed.): AFRICACRYPT 2008. LNCS, vol.\u00a05023. Springer, Heidelberg (2008); ISBN 978-3- 540-68159-5. See [7]"},{"key":"28_CR48","doi-asserted-by":"crossref","unstructured":"Zimmermann, P., Dodson, B.: 20 Years of ECM. In: ANTS 2006 [24], pp. 525\u2013542 (2006) (Cited in \u00a72)","DOI":"10.1007\/11792086_37"},{"key":"28_CR49","unstructured":"Zimmermann, P.: 50 largest factors found by ECM, http:\/\/www.loria.fr\/~zimmerma\/records\/top50.html (Cited in \u00a71)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01001-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,8]],"date-time":"2025-02-08T23:42:58Z","timestamp":1739058178000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01001-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010002","9783642010019"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01001-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}