{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T11:14:31Z","timestamp":1775042071256,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T00:00:00Z","timestamp":1467936000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptogr Eng"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s13389-016-0135-4","type":"journal-article","created":{"date-parts":[[2016,7,8]],"date-time":"2016-07-08T15:50:52Z","timestamp":1467993052000},"page":"273-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["SPA vulnerabilities of the binary extended Euclidean algorithm"],"prefix":"10.1007","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1544-6772","authenticated-orcid":false,"given":"Alejandro Cabrera","family":"Aldaya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6710-163X","authenticated-orcid":false,"given":"Alejandro J. Cabrera","family":"Sarmiento","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0700-0447","authenticated-orcid":false,"given":"Santiago","family":"S\u00e1nchez-Solano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,8]]},"reference":[{"key":"135_CR1","doi-asserted-by":"crossref","unstructured":"Ac\u0131i\u00e7mez, O., Gueron, S., Seifert, J.-P.: New branch prediction vulnerabilities in OpenSSL and necessary software countermeasures. In: Cryptography and Coding. Lecture Notes in Computer Science, vol. 4887, pp. 185\u2013203. Springer, Berlin Heidelberg (2007)","DOI":"10.1007\/978-3-540-77272-9_12"},{"key":"135_CR2","doi-asserted-by":"crossref","unstructured":"Ac\u0131i\u00e7mez, O., Ko\u00e7, \u00c7.K., Seifert, J.-P.: On the power of simple branch prediction analysis. In: Proceedings of the 2nd ACM Symposium on Information, Computer and Communications Security, ASIACCS \u201907, pp. 312\u2013320. ACM, New York, USA (2007)","DOI":"10.1145\/1229285.1266999"},{"key":"135_CR3","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Fouque, P.-A., G\u00e9rard, B., Kammerer, J.-G., Tibouchi, M., Zapalowicz, J.-C.: GLV\/GLS decomposition, power analysis, and attacks on ECDSA signatures with single-bit nonce Bias. In: Advances in Cryptology\u2014ASIACRYPT 2014. Lecture Notes in Computer Science, vol. 8873, pp. 262\u2013281. Springer, Berlin Heidelberg (2014)","DOI":"10.1007\/978-3-662-45611-8_14"},{"key":"135_CR4","doi-asserted-by":"crossref","unstructured":"Aravamuthan, S., Thumparthy, V.R.: A parallelization of ECDSA resistant to simple power analysis attacks. In: 2007 2nd International Conference on Communication Systems Software and Middleware. Institute of Electrical & Electronics Engineers (IEEE) (2007)","DOI":"10.1109\/COMSWA.2007.382592"},{"key":"135_CR5","unstructured":"ARM Limited. mbed TLS: Open Source Embbeded TLS Library. PolarSSL (2015) https:\/\/tls.mbed.org\/ . Accessed Oct 2015"},{"key":"135_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Curve25519: New Diffie\u2013Hellman speed records. In: Public Key Cryptography\u2014PKC 2006. Lecture Notes in Computer Science, vol. 3958, pp. 207\u2013228. Springer, Berlin Heidelberg (2006)","DOI":"10.1007\/11745853_14"},{"key":"135_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Venkatesan, R.: Hardness of computing the most significant bits of secret keys in Diffie\u2013Hellman and related schemes. In: Advances in Cryptology\u2014CRYPTO\u201996. Lecture Notes in Computer Science, vol. 1109, pp. 129\u2013142. Springer, Berlin Heidelberg (1996)","DOI":"10.1007\/3-540-68697-5_11"},{"issue":"4","key":"135_CR8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s13389-014-0084-8","volume":"4","author":"JW Bos","year":"2014","unstructured":"Bos, J.W.: Constant time modular inversion. J. Cryptogr. Eng. 4(4), 275\u2013281 (2014)","journal-title":"J. Cryptogr. Eng."},{"key":"135_CR9","unstructured":"ECC Brainpool: ECC Brainpool standard curves and curve generation (2005)"},{"key":"135_CR10","doi-asserted-by":"crossref","unstructured":"Brumley, B.B., Tuveri, N.: Remote timing attacks are still practical. In: 16th European Symposium on Research in Computer Security. Lecture Notes in Computer Science, vol. 6879, pp. 355\u2013371. Springer, Berlin Heidelberg (2011)","DOI":"10.1007\/978-3-642-23822-2_20"},{"key":"135_CR11","doi-asserted-by":"crossref","unstructured":"Chari, S., Rao, J.R., Rohatgi, P.: Template attacks. In: Cryptographic Hardware and Embedded Systems. Lecture Notes in Computer Science, vol. 2523, pp. 13\u201328. Springer, Berlin Heidelberg (2003)","DOI":"10.1007\/3-540-36400-5_3"},{"key":"135_CR12","unstructured":"Chartier, M.: Method to protect a binary GCD computation against SPA attacks. Patent WO\/2013\/092265, Gemalto SA (2013)"},{"issue":"1","key":"135_CR13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s13389-014-0072-z","volume":"4","author":"E Mulder De","year":"2014","unstructured":"De Mulder, E., 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. Cryptogr. Eng. 4(1), 33\u201345 (2014)","journal-title":"J. Cryptogr. Eng."},{"key":"135_CR14","doi-asserted-by":"crossref","unstructured":"Galindo, D., Gro\u00dfsch\u00e4dl, J., Liu, Z., Vadnala, P.K., Vivek, S.: Implementation of a leakage-resilient ElGamal key encapsulation mechanism. J. Cryptogr. Eng. (accepted) (2016)","DOI":"10.1007\/s13389-016-0121-x"},{"issue":"3","key":"135_CR15","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1011214926272","volume":"23","author":"NA Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.A., Smart, N.P.: Lattice attacks on digital signature schemes. Des. Codes Cryptogr. 23(3), 283\u2013290 (2001)","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"135_CR16","doi-asserted-by":"crossref","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"BS Kaliski","year":"1995","unstructured":"Kaliski, B.S.: The Montgomery inverse and its applications. IEEE Trans. Comput. 44(8), 1064\u20131065 (1995)","journal-title":"IEEE Trans. Comput."},{"key":"135_CR17","volume-title":"The Art of Computer Programming, Volume 2 (3rd Ed.) Seminumerical Algorithms","author":"DE Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 2 (3rd Ed.) Seminumerical Algorithms. Addison-Wesley Longman Publishing Co Inc, Boston (1997)"},{"key":"135_CR18","doi-asserted-by":"crossref","unstructured":"Kocher, P., Jaffe, J., Jun B.: Differential power analysis. In: Advances in Cryptology (CRYPTO\u201999). Lecture Notes in Computer Science, vol. 1666 , pp. 388\u2013397. Springer, Berlin Heidelberg (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"key":"135_CR19","doi-asserted-by":"publisher","unstructured":"Liskov, M.: Fermat\u2019s little theorem. In: Encyclopedia of Cryptography and Security. Springer (2005). doi: 10.1007\/0-387-23483-7-161","DOI":"10.1007\/0-387-23483-7-161"},{"key":"135_CR20","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, J., Dahab, R.: Fast multiplication on elliptic curves over GF( $$2^{m}$$ 2 m ) without precomputation. In: Cryptographic Hardware and Embedded Systems. Lecture Notes in Computer Science, vol. 1717, pp. 316\u2013327. Springer, Berlin Heidelberg (1999)","DOI":"10.1007\/3-540-48059-5_27"},{"key":"135_CR21","volume-title":"Handbook of Applied Cryptography","author":"AJ Menezes","year":"1997","unstructured":"Menezes, A.J., Van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press Inc, Boca Raton (1997)"},{"key":"135_CR22","unstructured":"Morita Tech Co.: SAKURA-G Development Board (2013) http:\/\/satoh.cs.uec.ac.jp\/SAKURA\/hardware\/SAKURA-G.html . Accessed Aug 2015"},{"key":"135_CR23","doi-asserted-by":"crossref","unstructured":"Naccache, D., Nguyen, P.Q., Tunstall, M., Whelan, C.: Experimenting with faults, lattices and the DSA. In: Public Key Cryptography\u2014PKC 2005. Lecture Notes in Computer Science, vol. 3386, pp. 16\u201328. Springer, Berlin Heidelberg (2005)","DOI":"10.1007\/978-3-540-30580-4_3"},{"key":"135_CR24","doi-asserted-by":"publisher","unstructured":"National Institute of Standards and Technology (NIST). FIPS-186-4: Digital Signature Standard (DSS), (2013). doi: 10.6028\/NIST.FIPS.186-4","DOI":"10.6028\/NIST.FIPS.186-4"},{"key":"135_CR25","doi-asserted-by":"crossref","unstructured":"Nguyen, P.Q., Shparlinski, I.E.: The insecurity of the digital signature algorithm with partially known nonces. J. Cryptol. 15(3), 151\u2013176 (2002)","DOI":"10.1007\/s00145-002-0021-3"},{"key":"135_CR26","unstructured":"OpenSSL Development Community: OpenSSL: The Open Source toolkit for SSL\/TLS (2014) https:\/\/www.openssl.org\/ . Accessed Oct 2015"},{"issue":"3","key":"135_CR27","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0021-9991(67)90047-2","volume":"1","author":"J Stein","year":"1967","unstructured":"Stein, J.: Computational problems associated with Racah algebra. J. Comput. Phys. 1(3), 397\u2013405 (1967)","journal-title":"J. Comput. Phys."},{"key":"135_CR28","unstructured":"Tektronix: Mixed Signal Oscilloscopes: MSO3000, DPO3000 Series Datasheet (2013) http:\/\/www.tek.com\/sites\/tek.com\/files\/media\/media\/resources\/MSO3000-DPO3000-Mixed-Signal-Oscilloscope-Datasheet-11.pdf . Accessed Aug 2015"},{"issue":"4","key":"135_CR29","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1007\/PL00009246","volume":"22","author":"B Vall\u00e9e","year":"1998","unstructured":"Vall\u00e9e, B.: Dynamics of the binary Euclidean algorithm: functional analysis and operators. Algorithmica 22(4), 660\u2013685 (1998)","journal-title":"Algorithmica"},{"key":"135_CR30","unstructured":"Shoup, V. NTL: A Library for doing Number Theory, v9.3.0 (2015) http:\/\/www.shoup.net\/ntl\/ . Accessed Oct 2015"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-016-0135-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-016-0135-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-016-0135-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-016-0135-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T04:58:47Z","timestamp":1692421127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-016-0135-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,8]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["135"],"URL":"https:\/\/doi.org\/10.1007\/s13389-016-0135-4","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"value":"2190-8508","type":"print"},{"value":"2190-8516","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,8]]}}}