{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T17:49:10Z","timestamp":1780336150328,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":48,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642239502","type":"print"},{"value":"9783642239519","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23951-9_9","type":"book-chapter","created":{"date-parts":[[2011,9,26]],"date-time":"2011-09-26T05:17:11Z","timestamp":1317014231000},"page":"124-142","source":"Crossref","is-referenced-by-count":131,"title":["High-Speed High-Security Signatures"],"prefix":"10.1007","author":[{"given":"Daniel J.","family":"Bernstein","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Niels","family":"Duif","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tanja","family":"Lange","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter","family":"Schwabe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"\u2014 (no editor), Technical guideline TR-03111, elliptic curve cryptography (2009), Citations in this document:"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/11693383_21","volume-title":"Selected Areas in Cryptography","author":"A. Antipa","year":"2006","unstructured":"Antipa, A., Brown, D.R.L., Gallant, R.P., Lambert, R., Struik, R., Vanstone, S.A.: Accelerated verification of ECDSA signatures. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 307\u2013318. Springer, Heidelberg (2006), Citations in this document:"},{"key":"9_CR3","unstructured":"Barwood, G.: Digital signatures using elliptic curves, message 32f519ad.19609226@news.dial.pipex.com posted to sci.crypt (1997), http:\/\/groups.google.com\/group\/sci.crypt\/msg\/b28aba37180dd6c6 , Citations in this document:"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/BFb0054130","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Fast batch verification for modular exponentiation and digital signatures. In: Nyberg, K. (ed.) Eurocrypt \u201998. LNCS, vol.\u00a01403, pp. 236\u2013250. Springer, Heidelberg (1998), Citations in this document:"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: CCS 2006, pp. 390\u2013399 (2006), Citations in this document:","DOI":"10.1145\/1180405.1180453"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"D.J. Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: new Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 207\u2013228. Springer, Heidelberg (2006), Citations in this document:"},{"key":"9_CR7","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":"D.J. 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.\u00a05023, pp. 389\u2013405. Springer, Heidelberg (2008), Citations in this document:"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"D.J. Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"9_CR9","unstructured":"Bernstein, D.J., Lange, T. (eds.): eBACS: ECRYPT Benchmarking of Cryptographic Systems (2011), http:\/\/bench.cr.yp.to\/ebats.html (accessed July 4, 2011), Citations in this document:"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-13797-6_2","volume-title":"Arithmetic of Finite Fields","author":"J.W. Bos","year":"2010","unstructured":"Bos, J.W.: High-performance modular multiplication on the Cell processor. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol.\u00a06087, pp. 7\u201324. Springer, Heidelberg (2010), Citations in this document:"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-47555-9_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201992","author":"E.F. Brickell","year":"1993","unstructured":"Brickell, E.F., Gordon, D.M., McCurley, K.S., Wilson, D.B.: Fast exponentiation with precomputation (extended abstract). In: Rueppel, R.A. (ed.) Eurocrypt \u201992. LNCS, vol.\u00a0658, pp. 200\u2013207. Springer, Heidelberg (1993), Citations in this document:"},{"key":"#cr-split#-9_CR12.1","doi-asserted-by":"crossref","unstructured":"5. Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A.: Software implementation of the NIST elliptic curves over prime fields (2000)","DOI":"10.1007\/3-540-44499-8_1"},{"key":"#cr-split#-9_CR12.2","unstructured":"6. see also newer version [13], http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/2000\/corr2000-56.ps, Citations in this document:"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Brown","year":"2001","unstructured":"Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A.: Software implementation of the NIST elliptic curves over prime fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 250\u2013265. Springer, Heidelberg (2001); see also older version [12]. MR 1907102"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-642-10366-7_39","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"B.B. Brumley","year":"2009","unstructured":"Brumley, B.B., Hakala, R.M.: Cache-timing template attacks. In: Matsui, M. (ed.) Asiacrypt 2009. LNCS, vol.\u00a05912, pp. 667\u2013684. Springer, Heidelberg (2009), Citations in this document:"},{"key":"9_CR15","unstructured":"\u201cBushing\u201d, \u201cmarcan\u201d Cantero, H.M., Boessenkool, S., Peter, S.: PS3 epic fail (2010), http:\/\/events.ccc.de\/congress\/2010\/Fahrplan\/attachments\/1780_27c3_console_hacking_2010.pdf , Citations in this document:"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01937350","volume":"27","author":"S. Carlsson","year":"1987","unstructured":"Carlsson, S.: Average-case results on heapsort. BIT\u00a027, 2\u201317 (1987), Citations in this document:","journal-title":"BIT"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-02384-2_23","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"N. Costigan","year":"2009","unstructured":"Costigan, N., Schwabe, P.: Fast elliptic-curve cryptography on the Cell Broadband Engine. In: Preneel, B. (ed.) Africacrypt 2009. LNCS, vol.\u00a05580, pp. 368\u2013385. Springer, Heidelberg (2009), Citations in this document:"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BFb0053453","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"P. Rooij de","year":"1995","unstructured":"de Rooij, P.: Efficient exponentiation using precomputation and vector addition chains. In: De Santis, A. (ed.) Eurocrypt \u201994. LNCS, vol.\u00a0950, pp. 389\u2013399. Springer, Heidelberg (1995), Citations in this document:"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-74143-5_1","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"V. Dubois","year":"2007","unstructured":"Dubois, V., Fouque, P.-A., Shamir, A., Stern, J.: Practical cryptanalysis of SFLASH. In: Menezes, A. (ed.) Crypto 2007. LNCS, vol.\u00a04622, pp. 1\u201312. Springer, Heidelberg (2007), Citations in this document:"},{"key":"9_CR20","unstructured":"Duif, N.: Smart card implementation of a digital signature scheme for Twisted Edwards curves, M.A. thesis, Technische Universiteit Eindhoven (2011), Citations in this document:"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory\u00a031, 469\u2013472 (1985), Citations in this document:","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1007\/978-3-642-01001-9_30","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"S.D. Galbraith","year":"2009","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. In: Joux, A. (ed.) Eurocrypt 2009. LNCS, vol.\u00a05479, pp. 518\u2013535. Springer, Heidelberg (2009), Citations in this document:"},{"key":"9_CR23","unstructured":"Gaudry, P., Thom\u00e9, E.: The mpFq library and implementing curve-based key exchanges. In: SPEED 2007, pp. 49\u201364 (2007), Citations in this document:"},{"key":"9_CR24","unstructured":"Gligoroski, D., Odeg\u00f8ard, R.S., Jensen, R.E., Perret, L., Faug\u00e8re, J.-C., Knapskog, S.J., Markovski, S.: The digital signature scheme MQQ-SIG (2010), Citations in this document:"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00145-007-0549-3","volume":"20","author":"E.-J. Goh","year":"2007","unstructured":"Goh, E.-J., Jarecki, S., Katz, J., Wang, N.: Efficient signature schemes with tight reductions to the Diffie-Hellman problems. Journal of Cryptology\u00a020, 493\u2013514 (2007), See [31]","journal-title":"Journal of Cryptology"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-17373-8_17","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"R. Granger","year":"2010","unstructured":"Granger, R.: On the static Diffie-Hellman problem on elliptic curves over extension fields. In: Abe, M. (ed.) Asiacrypt 2010. LNCS, vol.\u00a06477, pp. 283\u2013302. Springer, Heidelberg (2010), Citations in this document:"},{"key":"9_CR27","unstructured":"Hisil, H.: Elliptic curves, group law, and efficient computation, Ph.D. thesis, Queensland University of Technology (2010), Citations in this document:"},{"key":"9_CR28","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), Citations in this document:"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Joux, A., Vitse, V.: Elliptic curve discrete logarithm problem over small degree extension fields. Application to the static Diffie-Hellman problem on E(F $_{q^5}$ ) (2010), Citations in this document:","DOI":"10.1007\/s00145-011-9116-z"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"K\u00e4sper, E.: Fast elliptic curve cryptography in OpenSSL. In: RLCPS 2011 (to appear, 2011), Citations in this document:","DOI":"10.1007\/978-3-642-29889-9_4"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Katz, J., Wang, N.: Efficiency improvements for signature schemes with tight security reductions. In: CCS 2003, pp. 155\u2013164 (2003); portions incorporated into [25], Citations in this document:","DOI":"10.1145\/948109.948132"},{"key":"9_CR32","volume-title":"The art of computer programming, volume 3: sorting and searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The art of computer programming, volume 3: sorting and searching, 2nd edn. Addison-Wesley, Reading (1998), Citations in this document:","edition":"2"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"C.H. Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 95\u2013107. Springer, Heidelberg (1994), Citations in this document:"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-642-15031-9_6","volume-title":"Cryptographic Hardware and Embedded Systems, CHES 2010","author":"P. Longa","year":"2010","unstructured":"Longa, P., Gebotys, C.: Efficient techniques for high-speed elliptic curve cryptography. In: Mangard, S., Standaert, F.-X. (eds.) CHES 2010. LNCS, vol.\u00a06225, pp. 80\u201394. Springer, Heidelberg (2010), Citations in this document:"},{"key":"9_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-48892-8_6","volume-title":"Selected Areas in Cryptography","author":"D. M\u2019Ra\u00efhi","year":"1999","unstructured":"M\u2019Ra\u00efhi, D., Naccache, D., Pointcheval, D., Vaudenay, S.: Computational alternatives to random number generators. In: Tavares, S., Meijer, H. (eds.) SAC \u201998. LNCS, vol.\u00a01556, pp. 72\u201380. Springer, Heidelberg (1999), Citations in this document:"},{"key":"9_CR36","unstructured":"Naccache, D., M\u2019Ra\u00efhi, D., Levy-dit-Vehel, F.: Patent application WO\/1998\/051038: pseudo-random generator based on a hash coding function for cryptographic systems requiring random drawing (1997), Citations in this document:"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0053426","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"D. Naccache","year":"1995","unstructured":"Naccache, D., M\u2019Ra\u00efhi, D., Vaudenay, S., Raphaeli, D.: Can D.S.A. be improved? Complexity trade-offs with the digital signature standard. In: De Santis, A. (ed.) Eurocrypt \u201994. LNCS, vol.\u00a0950, pp. 77\u201385. Springer, Heidelberg (1995), Citations in this document:"},{"key":"9_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-14712-8_7","volume-title":"Progress in Cryptology \u2013 LATINCRYPT 2010","author":"M. Naehrig","year":"2010","unstructured":"Naehrig, M., Niederhagen, R., Schwabe, P.: New software speed records for cryptographic pairings. In: Abdalla, M., Barreto, P.S.L.M. (eds.) Latincrypt 2010. LNCS, vol.\u00a06212, pp. 109\u2013123. Springer, Heidelberg (2010), Citations in this document:"},{"key":"9_CR39","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1515\/JMC.2009.004","volume":"3","author":"G. Neven","year":"2009","unstructured":"Neven, G., Smart, N.P., Warinschi, B.: Hash function requirements for Schnorr signatures. Journal of Mathematical Cryptology\u00a03, 69\u201387 (2009), Citations in this document:","journal-title":"Journal of Mathematical Cryptology"},{"key":"9_CR40","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1023\/A:1025436905711","volume":"30","author":"P.Q. Nguyen","year":"2003","unstructured":"Nguyen, P.Q., Shparlinski, I.: The insecurity of the elliptic curve digital signature algorithm with partially known nonces. Designs, Codes and Cryptography\u00a030, 201\u2013217 (2003), Citations in this document:","journal-title":"Designs, Codes and Cryptography"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Pippenger, N.: On the evaluation of powers and related problems (preliminary version). In: FOCS \u201976, pp. 258\u2013263 (1976), Citations in this document:","DOI":"10.1109\/SFCS.1976.21"},{"key":"9_CR42","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D., Stern, J.: Security arguments for digital signatures and blind signatures. Journal of Cryptology\u00a013, 361\u2013396 (2000), Citations in this document:","journal-title":"Journal of Cryptology"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Rangasamy, J., Stebila, D., Boyd, C., Gonz\u00e1lez Nieto, J.: An integrated approach to cryptographic mitigation of denial-of-service attacks. In: ASIACCS 2011 (2011), Citations in this document:","DOI":"10.1145\/1966913.1966929"},{"key":"9_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"C.-P. Schnorr","year":"1990","unstructured":"Schnorr, C.-P.: Efficient identification and signatures for smart cards. In: Brassard, G. (ed.) Crypto \u201989. LNCS, vol.\u00a0435, pp. 239\u2013252. Springer, Heidelberg (1990), Citations in this document:"},{"key":"9_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45708-9_7","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Stern","year":"2002","unstructured":"Stern, J., Pointcheval, D., Malone-Lee, J., Smart, N.P.: Flaws in applying proof methodologies to signature schemes. In: Yung, M. (ed.) Crypto 2002. LNCS, vol.\u00a02442, pp. 93\u2013110. Springer, Heidelberg (2002), Citations in this document:"},{"key":"9_CR46","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0304-3975(93)90364-Y","volume":"118","author":"I. Wegener","year":"1993","unstructured":"Wegener, I.: Bottom-up-heapsort, a new variant of heapsort, beating, on average, quicksort (if n is not very small). Theoretical Computer Science\u00a0118, 81\u201398 (1993), Citations in this document:","journal-title":"Theoretical Computer Science"},{"key":"9_CR47","unstructured":"Wigley, J.: Removing need for rng in signatures, message 5gov5d$pad@wapping.ecs.soton.ac.uk posted to sci.crypt (1997), http:\/\/groups.google.com\/group\/sci.crypt\/msg\/a6da45bcc8939a89 , Citations in this document:"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems \u2013 CHES 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23951-9_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,12]],"date-time":"2025-03-12T01:15:37Z","timestamp":1741742137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23951-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239502","9783642239519"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23951-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}