{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:04:00Z","timestamp":1746417840461,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":59,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44709-3_19","type":"book-chapter","created":{"date-parts":[[2014,9,12]],"date-time":"2014-09-12T11:03:00Z","timestamp":1410519780000},"page":"335-352","source":"Crossref","is-referenced-by-count":4,"title":["Cofactorization on Graphics Processing Units"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Miele","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joppe W.","family":"Bos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Kleinjung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arjen K.","family":"Lenstra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Antao, S., Bajard, J.-C., Sousa, L.: Elliptic curve point multiplication on GPUs. In: 2010 21st IEEE International Conference on Application-specific Systems Architectures and Processors (ASAP), pp. 192\u2013199 (2010)","key":"19_CR1","DOI":"10.1109\/ASAP.2010.5541000"},{"doi-asserted-by":"crossref","unstructured":"Barbulescu, R., Bos, J.W., Bouvier, C., Kleinjung, T., Montgomery, P.L.: Finding ECM-friendly curves through a study of Galois properties. In: Howe, E.W., Kedlaya, K.S. (eds.) ANTS 2012. The Open Book Series, vol.\u00a01, pp. 63\u201386. Mathematical Sciences Publishers (2013)","key":"19_CR2","DOI":"10.2140\/obs.2013.1.63"},{"key":"19_CR3","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":"D.J. 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.\u00a06212, pp. 61\u201380. Springer, Heidelberg (2010)"},{"issue":"282","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1090\/S0025-5718-2012-02633-0","volume":"82","author":"D.J. Bernstein","year":"2013","unstructured":"Bernstein, D.J., Birkner, P., Lange, T., Peters, C.: ECM using Edwards curves. Mathematics of Computation\u00a082(282), 1139\u20131179 (2013)","journal-title":"Mathematics of Computation"},{"unstructured":"Bernstein, D.J., Chen, H.-C., Chen, M.-S., Cheng, C.-M., Hsiao, C.-H., Lange, T., Lin, Z.-C., Yang, B.-Y.: The billion-mulmod-per-second PC. In: Special-purpose Hardware for Attacking Cryptographic Systems \u2013 SHARCS 2009, pp. 131\u2013144 (2009)","key":"19_CR5"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-642-17401-8_23","volume-title":"Progress in Cryptology - INDOCRYPT 2010","author":"D.J. Bernstein","year":"2010","unstructured":"Bernstein, D.J., Chen, H.-C., Cheng, C.-M., Lange, T., Niederhagen, R., Schwabe, P., Yang, B.-Y.: ECC2K-130 on NVIDIA gPUs. In: Gong, G., Gupta, K.C. (eds.) INDOCRYPT 2010. LNCS, vol.\u00a06498, pp. 328\u2013346. Springer, Heidelberg (2010)"},{"key":"19_CR7","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":"D.J. 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.\u00a05479, pp. 483\u2013501. Springer, Heidelberg (2009)"},{"unstructured":"Bevand, M.: MD5 Chosen-Prefix Collisions on GPUs. Black Hat (2009); Whitepaper","key":"19_CR8"},{"issue":"5","key":"19_CR9","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1007\/s10766-012-0198-5","volume":"40","author":"J.W. Bos","year":"2012","unstructured":"Bos, J.W.: Low-latency elliptic curve scalar multiplication. International Journal of Parallel Programming\u00a040(5), 532\u2013550 (2012)","journal-title":"International Journal of Parallel Programming"},{"key":"19_CR10","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":"J.W. Bos","year":"2012","unstructured":"Bos, J.W., Kleinjung, T.: ECM at work. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 467\u2013484. Springer, Heidelberg (2012)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-15031-9_19","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"J.W. Bos","year":"2010","unstructured":"Bos, J.W., Stefan, D.: Performance analysis of the SHA-3 candidates on exotic multi-core architectures. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol.\u00a06225, pp. 279\u2013293. Springer, Heidelberg (2010)"},{"key":"19_CR12","first-page":"149","volume":"8","author":"R.P. Brent","year":"1986","unstructured":"Brent, R.P.: Some integer factorization algorithms using elliptic curves. Australian Computer Science Communications\u00a08, 149\u2013163 (1986)","journal-title":"Australian Computer Science Communications"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1007\/978-3-642-01970-8_92","volume-title":"Computational Science \u2013 ICCS 2009","author":"S. Collange","year":"2009","unstructured":"Collange, S., Defour, D., Tisserand, A.: Power consumption of gPUs from a software perspective. In: Allen, G., Nabrzyski, J., Seidel, E., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds.) ICCS 2009, Part I. LNCS, vol.\u00a05544, pp. 914\u2013923. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"de Meulenaer, G., Gosset, F., de Dormale, G.M., Quisquater, J.-J.: Integer factorization based on elliptic curve method: Towards better exploitation of reconfigurable hardware. In: Field-Programmable Custom Computing Machines \u2013 FCCM 2007, pp. 197\u2013206. IEEE Computer Society (2007)","key":"19_CR14","DOI":"10.1109\/FCCM.2007.12"},{"key":"19_CR15","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)","journal-title":"Bulletin of the American Mathematical Society"},{"unstructured":"Franke, J., Kleinjung, T.: GNFS for linux. Software (2012)","key":"19_CR16"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11894063_10","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"K. Gaj","year":"2006","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: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol.\u00a04249, pp. 119\u2013133. Springer, Heidelberg (2006)"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-33383-5_21","volume-title":"Information Security","author":"J. Gilger","year":"2012","unstructured":"Gilger, J., Barnickel, J., Meyer, U.: GPU-acceleration of block ciphers in the openSSL cryptographic library. In: Gollmann, D., Freiling, F.C. (eds.) ISC 2012. LNCS, vol.\u00a07483, pp. 338\u2013353. Springer, Heidelberg (2012)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1109\/TC.2008.80","volume":"57","author":"T. G\u00fcneysu","year":"2008","unstructured":"G\u00fcneysu, T., Kasper, T., Novotny, M., Paar, C., Rupp, A.: Cryptanalysis with COPACOBANA. IEEE Transactions on Computers\u00a057, 1498\u20131513 (2008)","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-74735-2_15","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"O. Harrison","year":"2007","unstructured":"Harrison, O., Waldron, J.: AES encryption implementation and analysis on commodity graphics processing units. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol.\u00a04727, pp. 209\u2013226. Springer, Heidelberg (2007)"},{"unstructured":"Harrison, O., Waldron, J.: Practical symmetric key cryptography on modern graphics hardware. In: Proceedings of the 17th Conference on Security Symposium, pp. 195\u2013209. USENIX Association (2008)","key":"19_CR21"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-02384-2_22","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"O. Harrison","year":"2009","unstructured":"Harrison, O., Waldron, J.: Efficient acceleration of asymmetric cryptography on graphics hardware. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 350\u2013367. Springer, Heidelberg (2009)"},{"key":"19_CR23","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.\u00a05350, pp. 326\u2013343. Springer, Heidelberg (2008)"},{"issue":"2","key":"19_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1006\/jsco.1993.1012","volume":"15","author":"T. Jebelean","year":"1993","unstructured":"Jebelean, T.: An algorithm for exact division. Journal of Symbolic Computation\u00a015(2), 169\u2013180 (1993)","journal-title":"Journal of Symbolic Computation"},{"unstructured":"Karatsuba, A.A., Ofman, Y.: Multiplication of many-digital numbers by automatic computers. In: Number 145 in Proceedings of the USSR Academy of Science, pp. 293\u2013294 (1962)","key":"19_CR25"},{"unstructured":"Kleinjung, T.: Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers. In: Special-purpose Hardware for Attacking Cryptographic Systems \u2013 SHARCS 2006 (2006)","key":"19_CR26"},{"key":"19_CR27","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., Aoki, K., Franke, J., Lenstra, A.K., Thom\u00e9, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit RSA modulus. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 333\u2013350. Springer, Heidelberg (2010)"},{"unstructured":"Kruppa, A.: A software implementation of ECM for NFS. Research Report RR-7041, INRIA (2009), http:\/\/hal.inria.fr\/inria-00419094\/PDF\/RR-7041.pdf","key":"19_CR28"},{"doi-asserted-by":"crossref","unstructured":"Leboeuf, K., Muscedere, R., Ahmadi, M.: A GPU implementation of the Montgomery multiplication algorithm for elliptic curve cryptography. In: IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2593\u20132596 (2013)","key":"19_CR29","DOI":"10.1109\/ISCAS.2013.6572409"},{"key":"19_CR30","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0091534","volume-title":"The Development of the Number Field Sieve","author":"A.K. Lenstra","year":"1993","unstructured":"Lenstra, A.K., Lenstra Jr., H.W.: The Development of the Number Field Sieve. Lecture Notes in Mathematics, vol.\u00a01554. Springer, Heidelberg (1993)"},{"issue":"3","key":"19_CR31","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(3), 649\u2013673 (1987)","journal-title":"Annals of Mathematics"},{"key":"19_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-05445-7_11","volume-title":"Selected Areas in Cryptography","author":"D. Loebenberger","year":"2009","unstructured":"Loebenberger, D., Putzka, J.: Optimization strategies for hardware-based cofactorization. In: Jacobson Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.\u00a05867, pp. 170\u2013181. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Manavski, S.: CUDA compatible GPU as an efficient hardware accelerator for AES cryptography. In: IEEE International Conference on Signal Processing and Communications, ICSPC 2007, pp. 65\u201368 (2007)","key":"19_CR33","DOI":"10.1109\/ICSPC.2007.4728256"},{"doi-asserted-by":"crossref","unstructured":"Miele, A., Bos, J.W., Kleinjung, T., Lenstra, A.K.: Cofactorization on graphics processing units. Cryptology ePrint Archive, Report 2014\/397 (2014), http:\/\/eprint.iacr.org\/","key":"19_CR34","DOI":"10.1007\/978-3-662-44709-3_19"},{"doi-asserted-by":"crossref","unstructured":"Miller, G.L.: Riemann\u2019s hypothesis and tests for primality. In: Proceedings of Seventh Annual ACM Symposium on Theory of Computing, STOC 1975, pp. 234\u2013239. ACM (1975)","key":"19_CR35","DOI":"10.1145\/800116.803773"},{"issue":"170","key":"19_CR36","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(170), 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"issue":"177","key":"19_CR37","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048(177), 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"unstructured":"Montgomery, P.L.: An FFT extension of the elliptic curve method of factorization. PhD thesis, University of California (1992)","key":"19_CR38"},{"issue":"190","key":"19_CR39","first-page":"839","volume":"54","author":"P.L. Montgomery","year":"1990","unstructured":"Montgomery, P.L., Silverman, R.D.: An FFT extension to the p-1 factoring algorithm. Mathematics of Computation\u00a054(190), 839\u2013854 (1990)","journal-title":"Mathematics of Computation"},{"key":"19_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-77272-9_22","volume-title":"Cryptography and Coding","author":"A. Moss","year":"2007","unstructured":"Moss, A., Page, D., Smart, N.P.: Toward acceleration of RSA using 3D graphics hardware. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol.\u00a04887, pp. 364\u2013383. Springer, Heidelberg (2007)"},{"unstructured":"NVIDIA. Fermi architecture whitepaper (2010), http:\/\/www.nvidia.com\/content\/PDF\/fermi_white_papers\/NVIDIA_Fermi_Compute_Architecture_Whitepaper.pdf","key":"19_CR41"},{"unstructured":"NVIDIA. Cuda programming guide 5 (2013), http:\/\/docs.nvidia.com\/cuda\/cuda-c-programming-guide\/index.html","key":"19_CR42"},{"unstructured":"NVIDIA. Parallel thread execution isa version 3.2 (2013), http:\/\/docs.nvidia.com\/cuda\/parallel-thread-execution\/index.html","key":"19_CR43"},{"unstructured":"NVIDIA Developer Zone (2011), https:\/\/devtalk.nvidia.com\/default\/topic\/491799\/gtx-590-cuda-power-tests\/","key":"19_CR44"},{"key":"19_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-13858-4_5","volume-title":"Fast Software Encryption","author":"D.A. Osvik","year":"2010","unstructured":"Osvik, D.A., Bos, J.W., Stefan, D., Canright, D.: Fast software AES encryption. In: Hong, S., Iwata, T. (eds.) FSE 2010. LNCS, vol.\u00a06147, pp. 75\u201393. Springer, Heidelberg (2010)"},{"issue":"1","key":"19_CR46","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(1), 67\u201378 (2005)","journal-title":"IEE Proceedings on Information Security"},{"doi-asserted-by":"crossref","unstructured":"Pollard, J.M.: The lattice sieve. pp. 43\u201349 in [30]","key":"19_CR47","DOI":"10.1007\/BFb0091538"},{"key":"19_CR48","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J.M. Pollard","year":"1974","unstructured":"Pollard, J.M.: Theorems on factorization and primality testing. Proceedings of the Cambridge Philosophical Society\u00a076, 521\u2013528 (1974)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"issue":"3","key":"19_CR49","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01933667","volume":"15","author":"J.M. Pollard","year":"1975","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT Numerical Mathematics\u00a015(3), 331\u2013334 (1975)","journal-title":"BIT Numerical Mathematics"},{"key":"19_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-39757-4_17","volume-title":"Advances in Cryptology","author":"C. Pomerance","year":"1985","unstructured":"Pomerance, C.: The quadratic sieve factoring algorithm. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol.\u00a0209, pp. 169\u2013182. Springer, Heidelberg (1985)"},{"doi-asserted-by":"crossref","unstructured":"Pomerance, C.: A tale of two sieves. Biscuits of Number Theory\u00a085 (2008)","key":"19_CR51","DOI":"10.1090\/dol\/034\/15"},{"issue":"1","key":"19_CR52","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"M.O. Rabin","year":"1980","unstructured":"Rabin, M.O.: Probabilistic algorithm for testing primality. Journal of Number Theory\u00a012(1), 128\u2013138 (1980)","journal-title":"Journal of Number Theory"},{"doi-asserted-by":"crossref","unstructured":"Shanks, D.: Class number, a theory of factorization, and genera. In: Lewis, D.J. (ed.) Symposia in Pure Mathematics, vol.\u00a020, pp. 415\u2013440. American Mathematical Society (1971)","key":"19_CR53","DOI":"10.1090\/pspum\/020\/0316385"},{"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: Field-Programmable Custom Computing Machines \u2013 FCCM 2005, pp. 107\u2013116. IEEE Computer Society (2005)","key":"19_CR54","DOI":"10.1109\/FCCM.2005.40"},{"key":"19_CR55","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.\u00a05154, pp. 79\u201399. Springer, Heidelberg (2008)"},{"unstructured":"Xin, G.: Fast smoothness test. Semester project report (June 2013)","key":"19_CR56"},{"key":"19_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-76900-2_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"J. Yang","year":"2007","unstructured":"Yang, J., Goodman, J.: Symmetric key cryptography on modern graphics hardware. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 249\u2013264. Springer, Heidelberg (2007)"},{"key":"19_CR58","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.\u00a04076, pp. 525\u2013542. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Zimmermann, R., G\u00fcneysu, T., Paar, C.: High-performance integer factoring with reconfigurable devices. In: Field Programmable Logic and Applications \u2013 FPL 2010, pp. 83\u201388. IEEE (2010)","key":"19_CR59","DOI":"10.1109\/FPL.2010.26"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44709-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T16:11:32Z","timestamp":1746375092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44709-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":59,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44709-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}