{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:09:06Z","timestamp":1742954946646,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319896403"},{"type":"electronic","value":"9783319896410"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-89641-0_6","type":"book-chapter","created":{"date-parts":[[2018,4,10]],"date-time":"2018-04-10T07:23:34Z","timestamp":1523345014000},"page":"101-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Lattice-Based Fault Attacks Against ECMQV"],"prefix":"10.1007","author":[{"given":"Weiqiong","family":"Cao","sequence":"first","affiliation":[]},{"given":"Hua","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jingyi","family":"Feng","sequence":"additional","affiliation":[]},{"given":"Limin","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Wenling","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,11]]},"reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201985 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417\u2013426. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-39799-X_31"},{"key":"6_CR2","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"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10623-003-1160-8","volume":"36","author":"M Ciet","year":"2005","unstructured":"Ciet, M., Joye, M.: Elliptic curve cryptosystems in the presence of permanent and transient faults. Des. Codes Crypt. 36(1), 33\u201343 (2005)","journal-title":"Des. Codes Crypt."},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-07536-5_11","volume-title":"Applied Cryptography and Network Security","author":"T Kim","year":"2014","unstructured":"Kim, T., Tibouchi, M.: Bit-flip faults on elliptic curve base fields, revisited. In: Boureanu, I., Owesarski, P., Vaudenay, S. (eds.) ACNS 2014. LNCS, vol. 8479, pp. 163\u2013180. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07536-5_11"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11889700_4","volume-title":"Fault Diagnosis and Tolerance in Cryptography","author":"J Bl\u00f6mer","year":"2006","unstructured":"Bl\u00f6mer, J., Otto, M., Seifert, J.-P.: Sign change fault attacks on elliptic curve cryptosystems. In: Breveglieri, L., Koren, I., Naccache, D., Seifert, J.-P. (eds.) FDTC 2006. LNCS, vol. 4236, pp. 36\u201352. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11889700_4"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Schmidt, J., Medwed, M.: A fault attack on ECDSA. In: 2009 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), pp. 93\u201399. IEEE (2009)","DOI":"10.1109\/FDTC.2009.38"},{"key":"6_CR7","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":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1022595222606","volume":"28","author":"HM Elkamchouchi","year":"2003","unstructured":"Elkamchouchi, H.M., Abu Elkair, E.F.: An efficient protocol for authenticated key agreement. Des. Codes Crypt. 28(2), 119\u2013134 (2003)","journal-title":"Des. Codes Crypt."},{"key":"6_CR9","unstructured":"IEEE Std: 1363-2000 - IEEE standard specifications for public-key cryptography, pp. 1\u2013228. IEEE Computer Society, August 2000"},{"key":"6_CR10","unstructured":"Alberta Teachers\u2019 Association: Public key cryptography for the financial services industry, key agreement and key transport using elliptic curve cryptography. Speculum 81(2), 566\u2013569 (2006)"},{"key":"6_CR11","unstructured":"Office of State Commercial Cryptgraphy Administration: Public Key Cryptographic Algorithm SM2 Based on Elliptic Curves (2010, in Chinese). http:\/\/www.oscca.gov.cn\/UpFile\/2010122214822692.pdf"},{"issue":"2","key":"6_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0898-1221(03)90025-3","volume":"46","author":"HT Yeh","year":"2003","unstructured":"Yeh, H.T., Sun, H.M., Hwang, T.: Improved authenticated multiple-key agreement protocol. Comput. Math. Appl. 46(2), 207\u2013211 (2003)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1145\/501978.501981","volume":"4","author":"BS Kaliski","year":"2001","unstructured":"Kaliski, B.S.: An unknown key-share attack on the MQV key agreement protocol. ACM Trans. Inf. Syst. Secur. 4(3), 275\u2013288 (2001)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-36288-6_16","volume-title":"Public Key Cryptography \u2014 PKC 2003","author":"A Antipa","year":"2003","unstructured":"Antipa, A., Brown, D., Menezes, A., Struik, R., Vanstone, S.: Validation of elliptic curve public keys. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol. 2567, pp. 211\u2013223. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36288-6_16"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/10958513_19","volume-title":"Information Security","author":"PJ Leadbitter","year":"2003","unstructured":"Leadbitter, P.J., Smart, N.P.: Analysis of the insecurity of ECMQV with partially known nonces. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol. 2851, pp. 240\u2013251. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/10958513_19"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/11941378_11","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"A Menezes","year":"2006","unstructured":"Menezes, A., Ustaoglu, B.: On the importance of public-key validation in the MQV and HMQV key agreement protocols. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 133\u2013147. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11941378_11"},{"issue":"1","key":"6_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1515\/JMC.2007.004","volume":"1","author":"A Menezes","year":"2007","unstructured":"Menezes, A.: Another look at HMQV. JMC 1(1), 47\u201364 (2007)","journal-title":"JMC"},{"key":"6_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/b97644","volume-title":"Guide to Elliptic Curve Cryptography","author":"D Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A.J., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/b97644"},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"HW Lenstra","year":"1982","unstructured":"Lenstra, H.W., Lenstra, A.K., Lovfiasz, L.: Factoring polynomials with rational coefficients. Mathematische Ann. 261, 515\u2013534 (1982)","journal-title":"Mathematische Ann."},{"issue":"2\u20133","key":"6_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"CP Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53(2\u20133), 201\u2013224 (1987)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem (shortened version). Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/10722028_4","volume-title":"Algorithmic Number Theory","author":"PQ Nguyen","year":"2000","unstructured":"Nguyen, P.Q., Stern, J.: Lattice reduction in cryptology: an update. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 85\u2013112. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722028_4"},{"key":"6_CR23","unstructured":"Ajtai, M.: Generating random lattices according to the invariant distribution. Draft of March (2006)"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-10175-0_6","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"A Battistello","year":"2014","unstructured":"Battistello, A.: Common points on elliptic curves: the Achilles\u2019 heel of fault attack countermeasures. In: Prouff, E. (ed.) COSADE 2014. LNCS, vol. 8622, pp. 69\u201381. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10175-0_6"},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R Schoof","year":"1995","unstructured":"Schoof, R.: Counting points on elliptic curves over finite fields. J. de Theorie des Nombres de Bordeaux 7(1), 219\u2013254 (1995)","journal-title":"J. de Theorie des Nombres de Bordeaux"},{"issue":"3","key":"6_CR26","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1504\/IJACT.2012.045590","volume":"2","author":"JW Bos","year":"2012","unstructured":"Bos, J.W., Kaihara, M.E., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Int. J. Appl. Crypt. 2(3), 212\u2013228 (2012)","journal-title":"Int. J. Appl. Crypt."},{"key":"6_CR27","unstructured":"Shoup, V.: Number Theory C++ Library (NTL) version 9.6.4. (2016). http:\/\/www.shoup.net\/ntl\/"}],"container-title":["Lecture Notes in Computer Science","Constructive Side-Channel Analysis and Secure Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89641-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:19:46Z","timestamp":1709824786000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89641-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319896403","9783319896410"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89641-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"11 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COSADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Constructive Side-Channel Analysis and Secure Design","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cosade2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cosade.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}