{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T04:15:47Z","timestamp":1774671347464,"version":"3.50.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319715001","type":"print"},{"value":"9783319715018","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-71501-8_10","type":"book-chapter","created":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T07:46:46Z","timestamp":1511250406000},"page":"170-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Secure and Efficient Implementation of the Quotient Digital Signature Algorithm (qDSA)"],"prefix":"10.1007","author":[{"given":"Armando","family":"Faz-Hern\u00e1ndez","sequence":"first","affiliation":[]},{"given":"Hayato","family":"Fujii","sequence":"additional","affiliation":[]},{"given":"Diego F.","family":"Aranha","sequence":"additional","affiliation":[]},{"given":"Julio","family":"L\u00f3pez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,22]]},"reference":[{"key":"10_CR1","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":"DJ 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. 3958, pp. 207\u2013228. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_14"},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s13389-012-0027-1","volume":"2","author":"DJ Bernstein","year":"2012","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.Y.: High-speed high-security signatures. J. Cryptogr. Eng. 2(2), 77\u201389 (2012). https:\/\/doi.org\/10.1007\/s13389-012-0027-1","journal-title":"J. Cryptogr. Eng."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-44598-6_8","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"I Biehl","year":"2000","unstructured":"Biehl, I., Meyer, B., M\u00fcller, V.: Differential fault attacks on elliptic curve cryptosystems. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 131\u2013146. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_8"},{"key":"10_CR4","unstructured":"Brumley, D., Boneh, D.: Remote timing attacks are practical. In: Proceedings of the 12th Conference on USENIX Security Symposium, USENIX Association, pp. 1\u201313, August 2003. https:\/\/www.usenix.org\/conference\/12th-usenix-security-symposium\/remote-timing-attacks-are-practical"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-31301-6_8","volume-title":"Selected Areas in Cryptography - SAC 2015","author":"T Chou","year":"2016","unstructured":"Chou, T.: Sandy2x: new curve25519 speed records. In: Dunkelman, O., Keliher, L. (eds.) SAC 2015. LNCS, vol. 9566, pp. 145\u2013160. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31301-6_8"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Costello, C., Smith, B.: Montgomery curves and their arithmetic. J. Cryptogr. Eng. (Special Issue on Montgomery Arithmetic) 1\u201314 (2017). http:\/\/dx.doi.org\/10.1007\/s13389-017-0157-6","DOI":"10.1007\/s13389-017-0157-6"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Egele, M., Brumley, D., Fratantonio, Y., Kruegel, C.: An empirical study of cryptographic misuse in Android applications. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS 2013, pp. 73\u201384. ACM, New York (2013). http:\/\/doi.acm.org\/10.1145\/2508859.2516693","DOI":"10.1145\/2508859.2516693"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Fahl, S., Harbach, M., Muders, T., Baumg\u00e4rtner, L., Freisleben, B., Smith, M.: Why Eve and Mallory love Android: an analysis of Android SSL (in)security. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security, CCS 2012, pp. 50\u201361. ACM, New York (2012). http:\/\/doi.acm.org\/10.1145\/2382196.2382205","DOI":"10.1145\/2382196.2382205"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-23951-9_10","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"J Fan","year":"2011","unstructured":"Fan, J., Gierlichs, B., Vercauteren, F.: To infinity and beyond: combined attack on ECC using points of low order. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 143\u2013159. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_10"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s13389-014-0085-7","volume":"5","author":"A Faz-Hern\u00e1ndez","year":"2015","unstructured":"Faz-Hern\u00e1ndez, A., Longa, P., S\u00e1nchez, A.H.: Efficient and secure algorithms for GLV-based scalar multiplication and their implementation on GLV-GLS curves (extended version). J. Cryptogr. Eng. 5(1), 31\u201352 (2015). https:\/\/doi.org\/10.1007\/s13389-014-0085-7","journal-title":"J. Cryptogr. Eng."},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11689522_2","volume-title":"Information Security Practice and Experience","author":"M Feng","year":"2006","unstructured":"Feng, M., Zhu, B.B., Zhao, C., Li, S.: Signed MSB-set comb method for elliptic curve point multiplication. In: Chen, K., Deng, R., Lai, X., Zhou, J. (eds.) ISPEC 2006. LNCS, vol. 3903, pp. 13\u201324. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11689522_2"},{"key":"10_CR12","unstructured":"Fujii, H., Aranha, D.F.: Curve25519 for the cortex-M4 and beyond. In: Progress in Cryptology - LATINCRYPT 2017: 5th International Conference on Cryptology and Information Security in Latin America 2017, Proceedings. LNCS, Springer International Publishing, September 2017, to appear"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s13389-011-0012-0","volume":"1","author":"RR Goundar","year":"2011","unstructured":"Goundar, R.R., Joye, M., Miyaji, A., Rivain, M., Venelli, A.: Scalar multiplication on Weierstra\u00df elliptic curves from Co-Z arithmetic. J. Cryptogr. Eng. 1(2), 161 (2011). https:\/\/doi.org\/10.1007\/s13389-011-0012-0","journal-title":"J. Cryptogr. Eng."},{"key":"10_CR14","unstructured":"Hamburg, M.: Fast and compact elliptic-curve cryptography. Cryptology ePrint Archive, Report 2012\/309, May 2012. http:\/\/eprint.iacr.org\/2012\/309"},{"key":"10_CR15","unstructured":"Hedabou, M., Pinel, P., B\u00e9n\u00e9teau, L.: A comb method to render ECC resistant against Side Channel Attacks. Cryptology ePrint Archive, Report 2004\/342, December 2004. http:\/\/eprint.iacr.org\/2004\/342"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-319-24174-6_21","volume-title":"Computer Security \u2013 ESORICS 2015","author":"T Jager","year":"2015","unstructured":"Jager, T., Schwenk, J., Somorovsky, J.: Practical invalid curve attacks on TLS-ECDH. In: Pernul, G., Ryan, P.Y.A., Weippl, E. (eds.) ESORICS 2015. LNCS, vol. 9326, pp. 407\u2013425. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24174-6_21"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s102070100002","volume":"1","author":"D Johnson","year":"2001","unstructured":"Johnson, D., Menezes, A., Vanstone, S.: The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Secur. 1(1), 36\u201363 (2001). https:\/\/doi.org\/10.1007\/s102070100002","journal-title":"Int. J. Inf. Secur."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Josefsson, S., Liusvaara, I.: Edwards-Curve Digital Signature Algorithm (EdDSA). RFC 8032, January 2017. https:\/\/dx.doi.org\/10.17487\/rfc8032","DOI":"10.17487\/RFC8032"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-74735-2_10","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"M Joye","year":"2007","unstructured":"Joye, M.: Highly regular right-to-left algorithms for scalar multiplication. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 135\u2013147. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74735-2_10"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology \u2014 CRYPTO 96","author":"PC Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 104\u2013113. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_9"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-48658-5_11","volume-title":"Advances in Cryptology \u2014 CRYPTO 94","author":"CH Lim","year":"1994","unstructured":"Lim, C.H., Lee, P.J.: More flexible exponentiation with precomputation. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 95\u2013107. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48658-5_11"},{"issue":"177","key":"10_CR22","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"PL Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the pollard and elliptic curve methods of factorization. Math. Comput. 48(177), 243\u2013264 (1987). https:\/\/doi.org\/10.2307\/2007888","journal-title":"Math. Comput."},{"key":"10_CR23","unstructured":"Moon, A.: Implementations of a fast Elliptic-curve Digital Signature Algorithm, March 2012. https:\/\/github.com\/floodyberry\/ed25519-donna"},{"key":"10_CR24","unstructured":"NIST: Digital Signature Standard (DSS). Technical report FIPS 186\u20131, National Institute for Standards and Technology, December 1998"},{"key":"10_CR25","unstructured":"NIST: Digital Signature Standard (DSS). Technical report FIPS 186\u20132, National Institute of Standards and Technology, January 2000. http:\/\/csrc.nist.gov\/publications\/fips\/archive\/fips186-2\/fips186-2.pdf"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"NIST: SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. Technical report FIPS-202, National Institute of Standards and Technology, August 2015. http:\/\/dx.doi.org\/10.6028\/NIST.FIPS.202","DOI":"10.6028\/NIST.FIPS.202"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44709-1_12","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2001","author":"K Okeya","year":"2001","unstructured":"Okeya, K., Sakurai, K.: Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a montgomery-form elliptic curve. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 126\u2013141. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44709-1_12"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-319-13051-4_20","volume-title":"Selected Areas in Cryptography \u2013 SAC 2014","author":"T Oliveira","year":"2014","unstructured":"Oliveira, T., Aranha, D.F., L\u00f3pez, J., Rodr\u00edguez-Henr\u00edquez, F.: Fast point multiplication algorithms for binary elliptic curves with and without precomputation. In: Joux, A., Youssef, A. (eds.) SAC 2014. LNCS, vol. 8781, pp. 324\u2013344. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13051-4_20"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Oliveira, T., L\u00f3pez, J., H\u0131\u015f\u0131l, H., Faz-Hern\u00e1ndez, A., Rodr\u00edguez-Henr\u00edquez, F.: How to (pre-)compute a ladder. In: Selected Areas in Cryptography - SAC 2017: 24th International Conference, Ottawa, Ontario, Canada, 16\u201318 August 2017, Revised Selected Papers, Springer International Publishing, August 2017, to appear","DOI":"10.1007\/978-3-319-72565-9_9"},{"key":"10_CR30","unstructured":"Perrin, T.: The XEdDSA and VXEdDSA Signature Schemes. Technical report, Open Whisper Systems, October 2016. https:\/\/whispersystems.org\/docs\/specifications\/xeddsa\/xeddsa.pdf"},{"key":"10_CR31","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 7.6) (2017). http:\/\/www.sagemath.org"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Renes, J., Smith, B.: qDSA: small and secure digital signatures with curve-based Diffie-Hellman key pairs. In: Advances in Cryptology - ASIACRYPT 2017: 23nd International Conference on the Theory and Application of Cryptology and Information Security, Hong Kong, China, 3\u20137 December 2017, December 2017, to appear","DOI":"10.1007\/978-3-319-70697-9_10"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Rescorla, E., Dierks, T.: The Transport Layer Security (TLS) Protocol Version 1.2. RFC 5246, August 2008. https:\/\/dx.doi.org\/10.17487\/rfc5246","DOI":"10.17487\/rfc5246"},{"issue":"2","key":"10_CR34","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978). https:\/\/doi.org\/10.1145\/359340.359342","journal-title":"Commun. ACM"},{"issue":"3","key":"10_CR35","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"J. Cryptol."},{"issue":"1","key":"10_CR36","doi-asserted-by":"publisher","first-page":"27","DOI":"10.6109\/jicce.2015.13.1.027","volume":"13","author":"H Seo","year":"2015","unstructured":"Seo, H., Kim, H.: Consecutive operand-caching method for multiprecision multiplication, revisited. J. Inf. Commun. Convergence Eng. 13(1), 27\u201335 (2015). https:\/\/doi.org\/10.6109\/jicce.2015.13.1.027","journal-title":"J. Inf. Commun. Convergence Eng."},{"key":"10_CR37","unstructured":"Spagni, R.: Disclosure of a Major Bug in CryptoNote Based Currencies, May 2017. Announment on https:\/\/getmonero.org\/2017\/05\/17\/disclosure-of-a-major-bug-in-cryptonote-based-currencies.html"},{"issue":"3","key":"10_CR38","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s13389-011-0017-8","volume":"1","author":"J Taverne","year":"2011","unstructured":"Taverne, J., Faz-Hern\u00e1ndez, A., Aranha, D.F., Rodr\u00edguez-Henr\u00edquez, F., Hankerson, D., L\u00f3pez, J.: Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. J. Cryptogr. Eng. 1(3), 187 (2011). https:\/\/doi.org\/10.1007\/s13389-011-0017-8","journal-title":"J. Cryptogr. Eng."},{"key":"10_CR39","unstructured":"The OpenSSL Project: OpenSSL: The Open Source toolkit for SSL\/TLS, April 2003. www.openssl.org"},{"issue":"1","key":"10_CR40","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00145-009-9049-y","volume":"23","author":"E Tromer","year":"2010","unstructured":"Tromer, E., Osvik, D.A., Shamir, A.: Efficient cache attacks on AES, and countermeasures. J. Cryptol. 23(1), 37\u201371 (2010). https:\/\/doi.org\/10.1007\/s00145-009-9049-y","journal-title":"J. Cryptol."},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Turner, S., Langley, A., Hamburg, M.: Elliptic Curves for Security. RFC 7748, January 2016. https:\/\/dx.doi.org\/10.17487\/rfc7748","DOI":"10.17487\/RFC7748"},{"issue":"9","key":"10_CR42","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1109\/12.869328","volume":"49","author":"SM Yen","year":"2000","unstructured":"Yen, S.M., Joye, M.: Checking before output may not be enough against fault-based cryptanalysis. IEEE Trans. Comput. 49(9), 967\u2013970 (2000). https:\/\/doi.org\/10.1109\/12.869328","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Applied Cryptography Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71501-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:49:57Z","timestamp":1709819397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71501-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319715001","9783319715018"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71501-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"22 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPACE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security, Privacy, and Applied Cryptography Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Goa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"space2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.space.dbcegoa.ac.in\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}