{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T12:59:31Z","timestamp":1794488371450,"version":"4.9.1"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662456071","type":"print"},{"value":"9783662456088","type":"electronic"}],"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-45611-8_14","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T05:34:07Z","timestamp":1415943247000},"page":"262-281","source":"Crossref","is-referenced-by-count":31,"title":["GLV\/GLS Decomposition, Power Analysis, and Attacks on ECDSA Signatures with Single-Bit Nonce Bias"],"prefix":"10.1007","author":[{"given":"Diego F.","family":"Aranha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre-Alain","family":"Fouque","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Beno\u00eet","family":"G\u00e9rard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Gabriel","family":"Kammerer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Christophe","family":"Zapalowicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Aranha, D.F., Gouv\u00eaa, C.P.L.: RELIC is an Efficient LIbrary for Cryptography, \n                    \n                      http:\/\/code.google.com\/p\/relic-toolkit\/"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/1468075.1468121","volume-title":"Proceedings of the Spring Joint Computer Conference, AFIPS 1968 (Spring)","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E.: Sorting networks and their applications. In: Proceedings of the Spring Joint Computer Conference, AFIPS 1968 (Spring), pp. 307\u2013314. ACM, New York (1968)"},{"key":"14_CR3","unstructured":"Bleichenbacher, D.: On the generation of one-time keys in DL signature schemes. Presentation at IEEE P1363 Working Group Meeting (2000)"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A. Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM\u00a050(4), 506\u2013519 (2003)","journal-title":"J. ACM"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-642-40349-1_19","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"J.W. Bos","year":"2013","unstructured":"Bos, J.W., Costello, C., Hisil, H., Lauter, K.: High-Performance Scalar Multiplication Using 8-Dimensional GLV\/GLS Decomposition. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol.\u00a08086, pp. 331\u2013348. Springer, Heidelberg (2013)"},{"key":"14_CR6","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)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-02384-2_24","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"B.B. Brumley","year":"2009","unstructured":"Brumley, B.B., Nyberg, K.: On Modular Decomposition of Integers. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 386\u2013402. Springer, Heidelberg (2009)"},{"key":"14_CR8","unstructured":"Certicom Research. Standards for efficient cryptography, SEC 1: Elliptic curve cryptography, Version 1.0 (September 2000)"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-25385-0_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"Y. Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: Better Lattice Security Estimates. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 1\u201320. Springer, Heidelberg (2011)"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-55220-5_11","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"C. Costello","year":"2014","unstructured":"Costello, C., Hisil, H., Smith, B.: Faster Compact Diffie\u2013Hellman: Endomorphisms on the x-line. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 183\u2013200. Springer, Heidelberg (2014)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"David, H.A., Nagaraja, H.N.: Order Statistics. Wiley (2003)","DOI":"10.1002\/0471722162"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Frigo, M., Johnson, S.G.: The design and implementation of FFTW3. Proceedings of the IEEE\u00a093(2), 216\u2013231 (2005); Special issue on Program Generation, Optimization, and Platform Adaptation","DOI":"10.1109\/JPROC.2004.840301"},{"issue":"3","key":"14_CR13","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00145-010-9065-y","volume":"24","author":"S.D. Galbraith","year":"2011","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. J. Cryptology\u00a024(3), 446\u2013469 (2011)","journal-title":"J. Cryptology"},{"key":"14_CR14","unstructured":"Gallant, R.: Efficient multiplication on curves having an endomorphism of norm 1. In: Workshop on Elliptic Curve Cryptography (1999)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R.P. Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Guillevic, A., Ionica, S.: Four-Dimensional GLV via the Weil Restriction. In: Sako, Sarkar (eds.) [30], pp. 79\u201396","DOI":"10.1007\/978-3-642-42033-7_5"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"N. Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N., Smart, N.P.: Lattice Attacks on Digital Signature Schemes. Des. Codes Cryptography\u00a023(3), 283\u2013290 (2001)","journal-title":"Des. Codes Cryptography"},{"key":"14_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/11832072_24","volume-title":"Security and Cryptography for Networks","author":"\u00c9. Levieil","year":"2006","unstructured":"Levieil, \u00c9., Fouque, P.-A.: An Improved LPN Algorithm. In: De Prisco, R., Yung, M. (eds.) SCN 2006. LNCS, vol.\u00a04116, pp. 348\u2013359. Springer, Heidelberg (2006)"},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-642-36095-4_19","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"M. Liu","year":"2013","unstructured":"Liu, M., Nguyen, P.Q.: Solving BDD by enumeration: An update. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol.\u00a07779, pp. 293\u2013309. Springer, Heidelberg (2013)"},{"key":"14_CR20","unstructured":"McKean, H., Moll, V.: Elliptic curves: function theory, geometry, arithmetic. Cambridge University Press (1999)"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s13389-014-0072-z","volume":"4","author":"E.D. Mulder","year":"2014","unstructured":"Mulder, E.D., Hutter, M., Marson, M.E., Pearson, P.: Using Bleichenbacher\u2019s solution to the hidden number problem to attack nonce leaks in 384-bit ECDSA: extended version. J. Cryptographic Engineering\u00a04(1), 33\u201345 (2014)","journal-title":"J. Cryptographic Engineering"},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30580-4_3","volume-title":"Public Key Cryptography - PKC 2005","author":"D. Naccache","year":"2005","unstructured":"Naccache, D., Nguy\u00ean, P.Q., Tunstall, M., Whelan, C.: Experimenting with Faults, Lattices and the DSA. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 16\u201328. Springer, Heidelberg (2005)"},{"issue":"3","key":"14_CR23","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s00145-002-0021-3","volume":"15","author":"P.Q. Nguyen","year":"2002","unstructured":"Nguyen, P.Q., Shparlinski, I.: The Insecurity of the Digital Signature Algorithm with Partially Known Nonces. J. Cryptology\u00a015(3), 151\u2013176 (2002)","journal-title":"J. Cryptology"},{"issue":"2","key":"14_CR24","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. Des. Codes Cryptography\u00a030(2), 201\u2013217 (2003)","journal-title":"Des. Codes Cryptography"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-540-24847-7_26","volume-title":"Algorithmic Number Theory","author":"P.Q. Nguy\u00ean","year":"2004","unstructured":"Nguy\u00ean, P.Q., Stehl\u00e9, D.: Low-Dimensional Lattice Basis Reduction Revisited. In: Buell, D.A. (ed.) ANTS 2004. LNCS, vol.\u00a03076, pp. 338\u2013357. Springer, Heidelberg (2004)"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Tibouchi, M.: Lattice-Based Fault Attacks on Signatures. In: Fault Analysis in Cryptography. Information Security and Cryptography, pp. 201\u2013220. Springer (2012)","DOI":"10.1007\/978-3-642-29656-7_12"},{"issue":"1","key":"14_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s13389-013-0069-z","volume":"4","author":"T. Oliveira","year":"2014","unstructured":"Oliveira, T., L\u00f3pez, J., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F.: Two is the fastest prime: lambda coordinates for binary elliptic curves. J. Cryptographic Engineering\u00a04(1), 3\u201317 (2014)","journal-title":"J. Cryptographic Engineering"},{"key":"14_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/3-540-45664-3_23","volume-title":"Public Key Cryptography","author":"Y.-H. Park","year":"2002","unstructured":"Park, Y.-H., Jeong, S., Kim, C.H., Lim, J.: An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 323\u2013334. Springer, Heidelberg (2002)"},{"issue":"4","key":"14_CR29","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s001450010010","volume":"13","author":"J.M. Pollard","year":"2000","unstructured":"Pollard, J.M.: Kangaroos, monopoly and discrete logarithms. J. Cryptology\u00a013(4), 437\u2013447 (2000)","journal-title":"J. Cryptology"},{"key":"14_CR30","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - ASIACRYPT 2013","year":"2013","unstructured":"Sako, K., Sarkar, P. (eds.): ASIACRYPT 2013, Part I. LNCS, vol.\u00a08269. Springer, Heidelberg (2013)"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Smith, B.: Families of Fast Elliptic Curves from \u211a-curves. In: Sako, Sarkar (eds.) [30], pp. 61\u201378","DOI":"10.1007\/978-3-642-42033-7_4"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Wenger, E., Gro\u00dfsch\u00e4dl, J.: An 8-bit AVR-based elliptic curve cryptographic RISC processor for the Internet of Things. In: MICRO Workshops, pp. 39\u201346. IEEE Computer Society (2012)","DOI":"10.1109\/MICROW.2012.20"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45611-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T12:19:41Z","timestamp":1559045981000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45611-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45611-8_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}