{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:35:05Z","timestamp":1742916905708,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030654108"},{"type":"electronic","value":"9783030654115"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-65411-5_15","type":"book-chapter","created":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T02:22:57Z","timestamp":1607480577000},"page":"299-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Revisiting ECM on GPUs"],"prefix":"10.1007","author":[{"given":"Jonas","family":"Wloka","sequence":"first","affiliation":[]},{"given":"Jan","family":"Richter-Brockmann","sequence":"additional","affiliation":[]},{"given":"Colin","family":"Stahlke","sequence":"additional","affiliation":[]},{"given":"Thorsten","family":"Kleinjung","sequence":"additional","affiliation":[]},{"given":"Christine","family":"Priplata","sequence":"additional","affiliation":[]},{"given":"Tim","family":"G\u00fcneysu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,9]]},"reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1093\/comjnl\/bxr119","volume":"55","author":"S Antao","year":"2012","unstructured":"Antao, S., Bajard, J.C., Sousa, L.: RNS-based elliptic curve point multiplication for massive parallel architectures. Comput. J. 55(5), 629\u2013647 (2012)","journal-title":"Comput. J."},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Antao, S., Bajard, J.C., Sousa, L.: Elliptic curve point multiplication on GPUs. In: ASAP 2010\u201321st IEEE International Conference on Application-specific Systems, Architectures and Processors. IEEE, July 2010","DOI":"10.1109\/ASAP.2010.5541000"},{"key":"15_CR3","unstructured":"Barker, E.B., Dang, Q.H.: Recommendation for Key Management Part 3: Application-Specific Key Management Guidance. Technical Report NIST SP 800\u201357Pt3r1, National Institute of Standards and Technology, January 2015"},{"key":"15_CR4","unstructured":"Bernstein, D.J., et al.: The billion-mulmod-per-second PC. In: SHARCS 2009 Workshop Record (Proceedings 4th Workshop on Special-purpose Hardware for Attacking Cryptograhic Systems, Lausanne, Switserland, September 9\u201310, 2009) (2009)"},{"issue":"282","key":"15_CR5","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1090\/S0025-5718-2012-02633-0","volume":"82","author":"D Bernstein","year":"2013","unstructured":"Bernstein, D., Birkner, P., Lange, T., Peters, C.: ECM using edwards curves. Math. Comput. 82(282), 1139\u20131179 (2013)","journal-title":"Math. Comput."},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-540-68164-9_26","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Birkner, P., Joye, M., Lange, T., Peters, C.: Twisted edwards curves. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol. 5023, pp. 389\u2013405. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68164-9_26"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-14712-8_4","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"DJ Bernstein","year":"2010","unstructured":"Bernstein, D.J., Birkner, P., Lange, T.: Starfish on strike. In: Abdalla, M., Barreto, P.S.L.M. (eds.) LATINCRYPT 2010. LNCS, vol. 6212, pp. 61\u201380. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14712-8_4"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/978-3-642-01001-9_28","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D.J., Chen, T.-R., Cheng, C.-M., Lange, T., Yang, B.-Y.: ECM on graphics cards. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 483\u2013501. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_28"},{"key":"15_CR9","unstructured":"Bernstein, D.J., Chuengsatiansup, C., Lange, T.: Double-base scalar multiplication revisited. Cryptology ePrint Archive, Report 2017\/037 (2017). https:\/\/eprint.iacr.org\/2017\/037"},{"key":"15_CR10","unstructured":"Bernstein, D.J., Lange, T.: Explicit-Formulas Database. https:\/\/hyperelliptic.org\/EFD\/index.html"},{"issue":"5","key":"15_CR11","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/s10766-012-0198-5","volume":"40","author":"JW Bos","year":"2012","unstructured":"Bos, J.W.: Low-latency elliptic curve scalar multiplication. Int. J. Parallel Prog. 40(5), 532\u2013550 (2012)","journal-title":"Int. J. Parallel Prog."},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-642-34961-4_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"JW Bos","year":"2012","unstructured":"Bos, J.W., Kleinjung, T.: ECM at work. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 467\u2013484. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_29"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Boudot, F., Gaudry, P., Guillevic, A., Heninger, N., Thom\u00e9, E., Zimmermann, P.: Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment. Cryptology ePrint Archive, Report 2020\/697 (2020). https:\/\/eprint.iacr.org\/2020\/697","DOI":"10.1007\/978-3-030-56880-1_3"},{"key":"15_CR14","unstructured":"Bouvier, C., Imbert, L.: Faster cofactorization with ECM using mixed representations. Cryptology ePrint Archive, Report 2018\/669 (2018). https:\/\/eprint.iacr.org\/2018\/669"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-47555-9_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201992","author":"B Dixon","year":"1993","unstructured":"Dixon, B., Lenstra, A.K.: Massively parallel elliptic curve factoring. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 183\u2013193. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-47555-9_16"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Emmart, N., Luitjens, J., Weems, C., Woolley, C.: Optimizing Modular Multiplication for NVIDIA\u2019s Maxwell GPUs. In: 2016 IEEE 23nd Symposium on Computer Arithmetic (ARITH), pp. 47\u201354. IEEE, Silicon Valley, CA, USA, July 2016","DOI":"10.1109\/ARITH.2016.21"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"G\u00e9lin, A., Kleinjung, T., Lenstra, A.K.: Parametrizations for families of ecm-friendly curves. In: Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, ISSAC 2017, Kaiserslautern, Germany, July 25\u201328, 2017, pp. 165\u2013171 (2017)","DOI":"10.1145\/3087604.3087606"},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-39881-3_22","volume-title":"Security in Pervasive Computing","author":"J Gro\u00dfsch\u00e4dl","year":"2004","unstructured":"Gro\u00dfsch\u00e4dl, J., Kamendje, G.-A.: Optimized RISC architecture for multiple-precision modular arithmetic. In: Hutter, D., M\u00fcller, G., Stephan, W., Ullmann, M. (eds.) Security in Pervasive Computing. LNCS, vol. 2802, pp. 253\u2013270. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-39881-3_22"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-89255-7_20","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H Hisil","year":"2008","unstructured":"Hisil, H., Wong, K.K.-H., Carter, G., Dawson, E.: Twisted edwards curves revisited. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 326\u2013343. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89255-7_20"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"C Kaya Koc","year":"1996","unstructured":"Kaya Koc, C., Acar, T., Kaliski, B.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro 16(3), 26\u201333 (1996)","journal-title":"IEEE Micro"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-14623-7_18","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T Kleinjung","year":"2010","unstructured":"Kleinjung, T., et al.: Factorization of a 768-Bit RSA modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 333\u2013350. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_18"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10586-010-0149-0","volume":"15","author":"T Kleinjung","year":"2012","unstructured":"Kleinjung, T., et al.: A heterogeneous computing environment to solve the 768-bit RSA challenge. Cluster Comput. 15(1), 53\u201368 (2012)","journal-title":"Cluster Comput."},{"key":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-56620-7_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"T Kleinjung","year":"2017","unstructured":"Kleinjung, T., Diem, C., Lenstra, A.K., Priplata, C., Stahlke, C.: Computation of a 768-Bit prime field discrete logarithm. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 185\u2013201. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_7"},{"key":"15_CR24","unstructured":"Kruppa, A.: A Software Implementation of ECM for NFS. Research Report RR-7041, INRIA (2009). https:\/\/hal.inria.fr\/inria-00419094"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Leboeuf, K., Muscedere, R., Ahmadi, M.: A GPU implementation of the Montgomery multiplication algorithm for elliptic curve cryptography. In: 2013 IEEE International Symposium on Circuits and Systems (ISCAS2013), pp. 2593\u20132596, May 2013","DOI":"10.1109\/ISCAS.2013.6572409"},{"issue":"2\u20133","key":"15_CR26","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/A:1008397921377","volume":"19","author":"AK Lenstra","year":"2000","unstructured":"Lenstra, A.K.: Integer factoring. Des. Codes Crypt. 19(2\u20133), 101\u2013128 (2000). https:\/\/doi.org\/10.1023\/A:1008397921377","journal-title":"Des. Codes Crypt."},{"key":"15_CR27","unstructured":"Lenstra, A.K.: General purpose integer factoring. Cryptology ePrint Archive, Report 2017\/1087 (2017). https:\/\/eprint.iacr.org\/2017\/1087"},{"issue":"3","key":"15_CR28","doi-asserted-by":"publisher","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"HW Lenstra","year":"1987","unstructured":"Lenstra, H.W.: Factoring integers with elliptic curves. Ann. Math. 126(3), 649\u2013673 (1987). https:\/\/doi.org\/10.2307\/1971363","journal-title":"Ann. Math."},{"key":"15_CR29","unstructured":"Mah\u00e9, E.M., Chauvet, J.M.: Fast GPGPU-based elliptic curve scalar multiplication. Cryptology ePrint Archive, Report 2014\/198 (2014). https:\/\/eprint.iacr.org\/2014\/198"},{"key":"15_CR30","unstructured":"Miele, A.: On the analysis of public-key cryptologic algorithms (2015). https:\/\/infoscience.epfl.ch\/record\/207710"},{"key":"15_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-662-44709-3_19","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"A Miele","year":"2014","unstructured":"Miele, A., Bos, J.W., Kleinjung, T., Lenstra, A.K.: Cofactorization on graphics processing units. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 335\u2013352. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44709-3_19"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Neves, S., Araujo, F.: On the performance of GPU public-key cryptography. In: ASAP 2011\u201322nd IEEE International Conference on Application-specific Systems, Architectures and Processors, pp. 133\u2013140. September 2011","DOI":"10.1109\/ASAP.2011.6043261"},{"issue":"3","key":"15_CR33","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s13389-017-0161-x","volume":"8","author":"E Savas","year":"2018","unstructured":"Savas, E., Koc, C.K.: Montgomery inversion. J. Cryptographic Eng. 8(3), 201\u2013210 (2018)","journal-title":"J. Cryptographic Eng."},{"key":"15_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-85053-3_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"R Szerwinski","year":"2008","unstructured":"Szerwinski, R., G\u00fcneysu, T.: Exploiting the power of GPUs for asymmetric cryptography. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol. 5154, pp. 79\u201399. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85053-3_6"},{"key":"15_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-662-54970-4_19","volume-title":"Financial Cryptography and Data Security","author":"L Valenta","year":"2017","unstructured":"Valenta, L., Cohney, S., Liao, A., Fried, J., Bodduluri, S., Heninger, N.: Factoring as a service. In: Grossklags, J., Preneel, B. (eds.) FC 2016. LNCS, vol. 9603, pp. 321\u2013338. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54970-4_19"},{"key":"15_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-030-45727-3_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"W Yu","year":"2020","unstructured":"Yu, W., Musa, S.A., Li, B.: Double-base chains for scalar multiplications on elliptic curves. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 538\u2013565. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_18"},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/11792086_37","volume-title":"Algorithmic Number Theory","author":"P Zimmermann","year":"2006","unstructured":"Zimmermann, P., Dodson, B.: 20 years of ECM. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 525\u2013542. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_37"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-65411-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T19:13:33Z","timestamp":1671650013000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-65411-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030654108","9783030654115"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-65411-5_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cans2020.at","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"118","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}