{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:12:49Z","timestamp":1764173569069},"publisher-location":"Berlin, Heidelberg","reference-count":78,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642033551"},{"type":"electronic","value":"9783642033568"}],"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-03356-8_19","type":"book-chapter","created":{"date-parts":[[2009,8,18]],"date-time":"2009-08-18T14:00:39Z","timestamp":1250604039000},"page":"317-336","source":"Crossref","is-referenced-by-count":73,"title":["Batch Binary Edwards"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"Digital signature standard (DSS). Federal Information Processing Standard 186-2. National Institute of Standards and Technology (2000), http:\/\/csrc.nist.gov\/publications\/fips\/ , Citations in this document: \u00a7 3"},{"key":"#cr-split#-19_CR2.1","unstructured":"Standard specifications for public key cryptography. IEEE, Los Alamitos (2000);"},{"key":"#cr-split#-19_CR2.2","unstructured":"Citations in this document: ??3"},{"key":"19_CR3","unstructured":"Information theory workshop, ITW 2006, Chengdu. IEEE, Los Alamitos (2006), See [67]"},{"key":"19_CR4","unstructured":"SPEED: software performance enhancement for encryption and decryption (2007), http:\/\/www.hyperelliptic.org\/SPEED , See [35]"},{"key":"19_CR5","unstructured":"Design, automation & test in Europe conference & exhibition, 2007. In: DATE 2007. IEEE, Los Alamitos (2007), See [57]"},{"key":"19_CR6","unstructured":"Fifth international conference on information technology: new generations (ITNG 2008), Las Vegas, Nevada, USA, April 7-8, 2008. IEEE, Los Alamitos (2008), See [37]"},{"key":"19_CR7","unstructured":"Fifth workshop on fault diagnosis and tolerance in cryptography (FDTC 2008). IEEE, Los Alamitos (2008), See [31]"},{"key":"#cr-split#-19_CR8.1","doi-asserted-by":"crossref","unstructured":"Aoki, K., Hoshino, F., Kobayashi, T.: A cyclic window algorithm for ECC defined over extension fields. In: [58], pp. 62???73 (2001);","DOI":"10.1007\/3-540-45600-7_8"},{"key":"#cr-split#-19_CR8.2","unstructured":"Citations in this document: ??1"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Aoki, K., Hoshino, F., Kobayashi, T., Oguro, H.: Elliptic curve arithmetic using SIMD. In: [27], pp. 235\u2013247 (2001), Citations in this document: \u00a71, \u00a71","DOI":"10.1007\/3-540-45439-X_16"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"D.V. Bailey","year":"2001","unstructured":"Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology\u00a014, 153\u2013176 (2001); ISSN 0933-2790, Citations in this document: \u00a71","journal-title":"Journal of Cryptology"},{"key":"19_CR11","unstructured":"Bernstein, D.J.: Fast multiplication (2000), http:\/\/cr.yp.to\/talks.html#2000.08.14 , Citations in this document: \u00a72"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: [69], pp. 207\u2013228 (2006), http:\/\/cr.yp.to\/papers.html#curve25519 , Citations in this document: \u00a71, \u00a71, \u00a71, \u00a73, \u00a73","DOI":"10.1007\/11745853_14"},{"key":"19_CR13","unstructured":"Bernstein, D.J.: Can we avoid tests for zero in fast elliptic-curve arithmetic (2006), http:\/\/cr.yp.to\/papers.html#curvezero , Citations in this document: \u00a71"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: [49], pp. 29\u201350 (2007), http:\/\/cr.yp.to\/papers.html#newelliptic , Citations in this document: \u00a71","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"19_CR15","unstructured":"Bernstein, D.J., Lange, T. (eds.): eBACS: ECRYPT Benchmarking of Cryptographic Systems (2009), http:\/\/bench.cr.yp.to (accessed June 3, 2009); Citations in this document: \u00a71"},{"key":"19_CR16","unstructured":"Bernstein, D.J., Lange, T., Farashahi, R. R.: Binary Edwards curves. In: [55], pp. 244\u2013265 (2008), http:\/\/cr.yp.to\/papers.html#edwards2 , Citations in this document: \u00a71, \u00a71, \u00a71, \u00a73, \u00a73, \u00a73, \u00a73, \u00a73, \u00a73, \u00a73, \u00a73"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Fast Software Encryption","year":"1997","unstructured":"Biham, E. (ed.): FSE 1997. LNCS, vol.\u00a01267. Springer, Heidelberg (1997); ISBN 3-540-63247-6, See [18]"},{"key":"#cr-split#-19_CR18.1","doi-asserted-by":"crossref","unstructured":"Biham, E.: A fast new DES implementation in software. In: [17], pp. 260???272 (1997);","DOI":"10.1007\/BFb0052352"},{"key":"#cr-split#-19_CR18.2","unstructured":"Citations in this document: ??1"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Bodrato, M.: Towards optimal Toom-Cook multiplication for univariate and multivariate polynomials in characteristic 2 and 0. In: [23], pp. 116\u2013133 (2007), http:\/\/bodrato.it\/papers\/#WAIFI2007 , Citations in this document: \u00a72","DOI":"10.1007\/978-3-540-73074-3_10"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. Journal of Symbolic Computation\u00a024, 235\u2013265 (1997); Citations in this document: \u00a73","journal-title":"Journal of Symbolic Computation"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Boyd, C., Montague, P., Nguyen, K.: Elliptic curve based password authenticated key exchange protocols. In: [66], pp. 487\u2013501 (2001), http:\/\/sky.fit.qut.edu.au\/~boydc\/papers\/ , Citations in this document: \u00a73","DOI":"10.1007\/3-540-47719-5_38"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Brent, R.P., Gaudry, P., Thom\u00e9, E., Zimmermann, P.: Faster multiplication in GF(2)[x]. In: [65], pp. 153\u2013166, http:\/\/wwwmaths.anu.edu.au\/~brent\/pub\/pub232.html , Citations in this document: \u00a71, \u00a72","DOI":"10.1007\/978-3-540-79456-1_10"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","volume-title":"Arithmetic of Finite Fields","year":"2007","unstructured":"Carlet, C., Sunar, B. (eds.): WAIFI 2007. LNCS, vol.\u00a04547. Springer, Heidelberg (2007); ISBN 978-3-540-73073-6, See [19]"},{"key":"#cr-split#-19_CR24.1","doi-asserted-by":"crossref","unstructured":"Chang, N.S., Kim, C.H., Park, Y.-H., Lim, J.: A non-redundant and efficient architecture for Karatsuba-Ofman algorithm. In: [70], pp. 288???299 (2005);","DOI":"10.1007\/11556992_21"},{"key":"#cr-split#-19_CR24.2","unstructured":"Citations in this document: ??2"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Chevassut, O., Fouque, P.-A., Gaudry, P., Pointcheval, D.: The Twist-AUgmented technique for key exchange. In: [69], pp. 410\u2013426 (2006), http:\/\/www.loria.fr\/~gaudry\/papers.en.html , Citations in this document: \u00a73","DOI":"10.1007\/11745853_27"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D.V. Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Advances in Applied Mathematics\u00a07, 385\u2013434 (1986); MR 88h:11094, Citations in this document: \u00a73","journal-title":"Advances in Applied Mathematics"},{"key":"19_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Information Security","year":"2001","unstructured":"Davida, G.I., Frankel, Y. (eds.): ISC 2001. LNCS, vol.\u00a02200. Springer, Heidelberg (2001); ISBN 978-3-540-42662-2, See [9]"},{"key":"19_CR28","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 , Citations in this document: \u00a73","journal-title":"Bulletin of the American Mathematical Society"},{"key":"19_CR29","unstructured":"Fan, H., Sun, J., Gu, M., Lam., K.-Y.: Overlap-free Karatsuba-Ofman polynomial multiplication algorithms for hardware implementations (October 7, 2008), http:\/\/eprint.iacr.org\/2007\/393 , Citations in this document: \u00a72"},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1109\/TC.2004.43","volume":"53","author":"K. Fong","year":"2004","unstructured":"Fong, K., Hankerson, D., L\u00f3pez, J., Menezes, A.: Field inversion and point halving revisited. IEEE Transactions on Computers\u00a053, 1047\u20131059 (2004), http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2003\/tech_reports2003.html , ISSN 0018\u20139340, Citations in this document: \u00a71","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Lercier, R., R\u00e9al, D., Valette, F.: Fault attack on elliptic curve with Montgomery ladder implementation. In: [7], pp. 92\u201398 (2008), http:\/\/www.di.ens.fr\/~fouque\/index-pub.html , Citations in this document: \u00a73","DOI":"10.1109\/FDTC.2008.15"},{"key":"19_CR32","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: Faster integer multiplication. In: [42], pp. 57\u201366 (2007), http:\/\/www.cse.psu.edu\/~furer\/ , Citations in this document: \u00a72","DOI":"10.1145\/1250790.1250800"},{"key":"19_CR33","doi-asserted-by":"crossref","unstructured":"Galbraith, S., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: [43], pp. 518\u2013535 (2009), http:\/\/eprint.iacr.org\/2008\/194 , Citations in this document: \u00a71, \u00a73","DOI":"10.1007\/978-3-642-01001-9_30"},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: [46], pp. 190\u2013200 (2001), MR 2003h:14043, Citations in this document: \u00a73","DOI":"10.1007\/3-540-44647-8_11"},{"key":"19_CR35","unstructured":"Gaudry, P., Thom\u00e9, E.: The mpFq library and implementing curve-based key exchanges. In: [4], pp. 49\u201364 (2007), http:\/\/www.loria.fr\/~gaudry\/papers.en.html , Citations in this document: \u00a71, \u00a71, \u00a71"},{"key":"#cr-split#-19_CR36.1","doi-asserted-by":"crossref","unstructured":"G??neysu, T., Paar, C.: Ultra high performance ECC over NIST primes on commercial FPGAs. In: [55], pp. 62???78 (2008);","DOI":"10.1007\/978-3-540-85053-3_5"},{"key":"#cr-split#-19_CR36.2","unstructured":"Citations in this document: ??1, ??1"},{"key":"#cr-split#-19_CR37.1","doi-asserted-by":"crossref","unstructured":"Gueron, S., Kounavis, M.E.: A technique for accelerating characteristic 2 elliptic curve cryptography. In: [6], pp. 265???272 (2008);","DOI":"10.1109\/ITNG.2008.193"},{"key":"#cr-split#-19_CR37.2","unstructured":"Citations in this document: ??1"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Hankerson, D., Hernandez, J.L., Menezes, A.: Software implementation of elliptic curve cryptography over binary fields. In: [48], pp. 1\u201324 (2000), http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2000\/corr2000-42.ps , Citations in this document: \u00a71, \u00a71","DOI":"10.1007\/3-540-44499-8_1"},{"key":"19_CR39","unstructured":"Hankerson, D., Karabina, K., Menezes., A.: Analyzing the Galbraith\u2013Lin\u2013Scott point multiplication method for elliptic curves over binary fields (2008), http:\/\/eprint.iacr.org\/2008\/334 , Citations in this document: \u00a71, \u00a73"},{"key":"19_CR40","unstructured":"Intel Corporation, Carry-less multiplication and its usage for computing the GCM mode (2008), http:\/\/software.intel.com\/en-us\/articles\/carry-less-multiplication-and-its-usage-for-computing-the-gcm-mode , Citations in this document: \u00a71"},{"key":"19_CR41","unstructured":"Intel Corporation, Intel Advanced Vector Extensions programming reference (2008), http:\/\/softwarecommunity.intel.com\/isn\/downloads\/intelavx\/Intel-AVX-Programming-Reference-31943302.pdf , Citations in this document: \u00a71"},{"volume-title":"Proceedings of the 39th annual ACM symposium on theory of computing","year":"2007","key":"19_CR42","unstructured":"Johnson, D.S., Feige, U. (eds.): Proceedings of the 39th annual ACM symposium on theory of computing, San Diego, California, USA, June 11\u201313. Association for Computing Machinery, New York (2007); ISBN 978\u20131\u201359593\u2013631\u20138, See [32]"},{"key":"19_CR43","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2009, 28th annual international conference on the theory and applications of cryptographic techniques","year":"2009","unstructured":"Joux, A. (ed.): EUROCRYPT 2009. LNCS, vol.\u00a05479. Springer, Heidelberg (2009); ISBN 978-3-642-01000-2, See [33]"},{"key":"19_CR44","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00196911","volume":"3","author":"B.S. Kaliski Jr.","year":"1991","unstructured":"Kaliski Jr., B.S.: One-way permutations on elliptic curves. Journal of Cryptology\u00a03, 187\u2013199 (1991), Citations in this document: \u00a73","journal-title":"Journal of Cryptology"},{"key":"19_CR45","first-page":"595","volume":"7","author":"A.A. Karatsuba","year":"1963","unstructured":"Karatsuba, A.A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Physics Doklady\u00a07, 595\u2013596 (1963), http:\/\/cr.yp.to\/bib\/entries.html#1963\/karatsuba , ISSN 0038\u20135689, Citations in this document: \u00a72, \u00a72","journal-title":"Soviet Physics Doklady"},{"key":"19_CR46","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2001","year":"2001","unstructured":"Kilian, J. (ed.): CRYPTO 2001. LNCS, vol.\u00a02139. Springer, Heidelberg (2001); ISBN 3-540-42456-3. MR 2003d:94002, See [34]"},{"key":"19_CR47","unstructured":"Koblitz, A.H., Koblitz, N., Menezes, A.: Elliptic curve cryptography: the serpentine course of a paradigm shift (2008), http:\/\/eprint.iacr.org\/2008\/390 , Citations in this document: \u00a73"},{"key":"19_CR48","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2000","year":"2000","unstructured":"Ko\u00e7, \u00c7.K., Paar, C. (eds.): CHES 2000. LNCS, vol.\u00a01965. Springer, Heidelberg (2000); ISBN 3-540-42521-7, See [38]"},{"key":"19_CR49","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); ISBN 978-3-540-76899-9, See [14]"},{"key":"19_CR50","doi-asserted-by":"crossref","unstructured":"Matsui, M., Nakajima, J.: On the power of bitslice implementation on Intel Core2 processor. In: [56], pp. 121\u2013134 (2007), Citations in this document: \u00a71","DOI":"10.1007\/978-3-540-74735-2_9"},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"Menezes, A., Qu, M.: Analysis of the Weil descent attack of Gaudry, Hess and Smart. In: [54], pp. 308\u2013318 (2001), Citations in this document: \u00a73","DOI":"10.1007\/3-540-45353-9_23"},{"key":"19_CR52","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, 243\u2013264 (1987), http:\/\/links.jstor.org\/sici?sici=0025-571819870148:177243:STPAEC2.0.CO;2-3 ; ISSN 0025-5718. MR 88e:11130, Citations in this document: \u00a71, \u00a73, \u00a73, \u00a73, \u00a73","journal-title":"Mathematics of Computation"},{"key":"19_CR53","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1109\/TC.2005.49","volume":"54","author":"P.L. Montgomery","year":"2005","unstructured":"Montgomery, P.L.: Five, six, and seven-term Karatsuba-like formulae. IEEE Transactions on Computers\u00a054, 362\u2013369 (2005); Citations in this document: \u00a72","journal-title":"IEEE Transactions on Computers"},{"key":"19_CR54","series-title":"Lecture Notes in Computer Science","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","year":"2008","unstructured":"Naccache, D. (ed.): CT-RSA 2008. LNCS, vol.\u00a04964. Springer, Heidelberg (2008); ISBN 3-540-41898-9. MR 2003a:94039, See [51]"},{"key":"19_CR55","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 [16], [36]"},{"key":"19_CR56","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","year":"2007","unstructured":"Paillier, P., Verbauwhede, I. (eds.): CHES 2007. LNCS, vol.\u00a04727. Springer, Heidelberg (2007); ISBN 978-3-540-74734-5, See [50]"},{"key":"19_CR57","doi-asserted-by":"crossref","unstructured":"Peter, S., Langend\u00f6rfer, P.: An efficient polynomial multiplier in GF(2 m ) and its application to ECC designs. In: [5] (2007), http:\/\/ieeexplore.ieee.org\/xpl\/freeabs_all.jsp?isnumber=4211749&arnumber=4211979&count=305&index=229 , Citations in this document: \u00a72","DOI":"10.1109\/DATE.2007.364469"},{"key":"19_CR58","series-title":"Lecture Notes in Computer Science","volume-title":"Information and Communications Security","year":"2001","unstructured":"Qing, S., Okamoto, T., Zhou, J. (eds.): ICICS 2001. LNCS, vol.\u00a02229. Springer, Heidelberg (2001); ISBN 3-540-42880-1, See [8]"},{"key":"#cr-split#-19_CR59.1","unstructured":"Rodr??guez-Henr??quez, F., Ko??, ??.K.: On fully parallel Karatsuba multipliers for GF(2 m. In: [60], pp. 405???410 (2003);"},{"key":"#cr-split#-19_CR59.2","unstructured":"Citations in this document: ??2, ??2"},{"key":"19_CR60","unstructured":"Sahni, S. (ed.): Proceedings of the international conference on computer science and technology. Acta Press (2003); See [59]"},{"key":"19_CR61","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00289470","volume":"7","author":"A. Sch\u00f6nhage","year":"1977","unstructured":"Sch\u00f6nhage, A.: Schnelle Multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristik 2. Acta Informatica\u00a07, 395\u2013398 (1977), http:\/\/cr.yp.to\/bib\/entries.html#1977\/schoenhage , ISSN 0001\u20135903. MR 55:9604, Citations in this document: \u00a72","journal-title":"Acta Informatica"},{"key":"19_CR62","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation gro\u00dfer Zahlen. Computing\u00a07, 281\u2013292 (1971), http:\/\/cr.yp.to\/bib\/entries.html#1971\/schoenhage-mult , ISSN 0010\u2013485X. MR 45:1431. Citations in this document: \u00a72","journal-title":"Computing"},{"key":"19_CR63","unstructured":"Stein, W. (ed.): Sage Mathematics Software (Version 3.2.3) The Sage Group (2009), http:\/\/www.sagemath.org , Citations in this document: \u00a71"},{"key":"19_CR64","first-page":"714","volume":"3","author":"A.L. Toom","year":"1963","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Soviet Mathematics Doklady\u00a03, 714\u2013716 (1963); ISSN 0197\u20136788. Citations in this document: \u00a72","journal-title":"Soviet Mathematics Doklady"},{"key":"19_CR65","series-title":"Lecture Notes in Computer Science","volume-title":"Algorithmic Number Theory","year":"2008","unstructured":"van der Poorten, A.J., Stein, A. (eds.): ANTS-VIII 2008. LNCS, vol.\u00a05011. Springer, Heidelberg (2008); ISBN 978-3-540-79455-4, See [22]"},{"key":"19_CR66","series-title":"Lecture Notes in Computer Science","volume-title":"Information Security and Privacy","year":"2001","unstructured":"Varadharajan, V., Mu, Y. (eds.): ACISP 2001. LNCS, vol.\u00a02119. Springer, Heidelberg (2001); ISBN 978-3-540-42300-3, See [21]"},{"key":"#cr-split#-19_CR67.1","unstructured":"von zur Gathen, J., Shokrollahi, J.: Fast arithmetic for polynomials over $\\mathord{\\text{\\bf F}}_2$ in hardware. In: [3], pp. 107???111 (2006);"},{"key":"#cr-split#-19_CR67.2","unstructured":"Citations in this document: ??2, ??2, ??2"},{"key":"19_CR68","unstructured":"Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba algorithm for efficient implementations (2006), http:\/\/eprint.iacr.org\/2006\/224 , Citations in this document: \u00a72"},{"key":"19_CR69","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography - PKC 2006","year":"2006","unstructured":"Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.): PKC 2006. LNCS, vol.\u00a03958. Springer, Heidelberg (2006); ISBN 978-3-540-33851-2, See [12], [25]"},{"key":"19_CR70","series-title":"Lecture Notes in Computer Science","volume-title":"Information Security","year":"2005","unstructured":"Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.): ISC 2005. LNCS, vol.\u00a03650. Springer, Heidelberg (2005); ISBN 3-540-29001-X, See [24]"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - CRYPTO 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03356-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T02:10:41Z","timestamp":1558491041000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03356-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033551","9783642033568"],"references-count":78,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03356-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}