{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:59:57Z","timestamp":1743148797522,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403484"},{"type":"electronic","value":"9783642403491"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40349-1_21","type":"book-chapter","created":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T14:36:58Z","timestamp":1374244618000},"page":"365-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Inverting the Final Exponentiation of Tate Pairings on Ordinary Elliptic Curves Using Faults"],"prefix":"10.1007","author":[{"given":"Ronan","family":"Lashermes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Fournier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis","family":"Goubin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"21_CR1","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil pairing. SIAM J. of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. of Computing"},{"key":"21_CR2","unstructured":"Dutta, R., Barua, R., Sarkar, P.: Pairing-Based Cryptographic Protocols: A Survey. Cryptology ePrint Archive, Report 2004\/064 (2004), \n                      http:\/\/eprint.iacr.org\/"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"El Mrabet, N., Di Natale, G., Flottes, M.L., Rouzeyre, B., Bajard, J.C.: Differential Power Analysis against the Miller Algorithm. Technical report, Published in Prime 2009, IEEE Xplore (August 2008)","DOI":"10.1109\/RME.2009.5201339"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/11958239_7","volume-title":"Progress in Cryptology - VIETCRYPT 2006","author":"C. Whelan","year":"2006","unstructured":"Whelan, C., Scott, M.: Side channel analysis of practical pairing implementations: Which path is more secure? In: Nguy\u00ean, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol.\u00a04341, pp. 99\u2013114. Springer, Heidelberg (2006)"},{"issue":"9","key":"21_CR5","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1109\/TC.2006.134","volume":"55","author":"D. Page","year":"2006","unstructured":"Page, D., Vercauteren, F.: A Fault Attack on Pairing-Based Cryptography. IEEE Transactions on Computers\u00a055(9), 1075\u20131080 (2006)","journal-title":"IEEE Transactions on Computers"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-73489-5_12","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"C. Whelan","year":"2007","unstructured":"Whelan, C., Scott, M.: The Importance of the Final Exponentiation in Pairings when considering Fault Attacks. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 225\u2013246. Springer, Heidelberg (2007)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-02617-1_13","volume-title":"Advances in Information Security and Assurance","author":"N. El Mrabet","year":"2009","unstructured":"El Mrabet, N.: What about Vulnerability to a Fault Attack of the Miller\u2019s algorithm During an Identity Based Protocol? In: Park, J.H., Chen, H.-H., Atiquzzaman, M., Lee, C., Kim, T.-h., Yeo, S.-S. (eds.) ISA 2009. LNCS, vol.\u00a05576, pp. 122\u2013134. Springer, Heidelberg (2009)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Vercauteren, F.: The Hidden Root Problem. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 89\u201399. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85538-5_6"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-17455-1_2","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"J.-L. Beuchat","year":"2010","unstructured":"Beuchat, J.-L., Gonz\u00e1lez-D\u00edaz, J.E., Mitsunari, S., Okamoto, E., Rodr\u00edguez-Henr\u00edquez, F., Teruya, T.: High-Speed Software Implementation of the Optimal Ate Pairing over Barreto\u2013Naehrig Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 21\u201339. Springer, Heidelberg (2010)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-642-03298-1_6","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"M. Scott","year":"2009","unstructured":"Scott, M., Benger, N., Charlemagne, M., Dominguez Perez, L.J., Kachisa, E.J.: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 78\u201388. Springer, Heidelberg (2009)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45708-9_23","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"P.S.L.M. Barreto","year":"2002","unstructured":"Barreto, P.S.L.M., Kim, H.Y., Lynn, B., Scott, M.: Efficient algorithms for pairing-based cryptosystems. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 354\u2013369. Springer, Heidelberg (2002)"},{"issue":"10","key":"21_CR12","doi-asserted-by":"publisher","first-page":"4595","DOI":"10.1109\/TIT.2006.881709","volume":"52","author":"F. Hess","year":"2006","unstructured":"Hess, F., Smart, N., Vercauteren, F.: The Eta Pairing Revisited. IEEE Transactions on Information Theory\u00a052(10), 4595\u20134602 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"21_CR13","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/TIT.2009.2034881","volume":"56","author":"F. Vercauteren","year":"2010","unstructured":"Vercauteren, F.: Optimal Pairings. IEEE Transactions on Information Theory\u00a056(1), 455\u2013461 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR14","unstructured":"Kim, S., Cheon, J.H.: Fixed Argument Pairing Inversion on Elliptic Curves. Cryptology ePrint Archive, Report 2012\/657 (2012), \n                      http:\/\/eprint.iacr.org\/"},{"issue":"2","key":"21_CR15","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.1109\/TIT.2011.2173714","volume":"58","author":"N. Kanayama","year":"2012","unstructured":"Kanayama, N., Okamoto, E.: Approach to Pairing Inversions Without Solving Miller Inversion. IEEE Transactions on Information Theory\u00a058(2), 1248\u20131253 (2012)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"12","key":"21_CR16","doi-asserted-by":"publisher","first-page":"5719","DOI":"10.1109\/TIT.2008.2006431","volume":"54","author":"S. Galbraith","year":"2008","unstructured":"Galbraith, S., Hess, F., Vercauteren, F.: Aspects of Pairing Inversion. IEEE Transactions on Information Theory\u00a054(12), 5719\u20135728 (2008)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-73489-5_18","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"T. Satoh","year":"2007","unstructured":"Satoh, T.: On Pairing Inversion Problems. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 317\u2013328. Springer, Heidelberg (2007)"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/JPROC.2005.862424","volume":"94","author":"H. Bar-El","year":"2006","unstructured":"Bar-El, H., Choukri, H., Naccache, D., Tunstall, M., Whelan, C.: The Sorcerer\u2019s Apprentice Guide to Fault Attacks. Proceedings of the IEEE\u00a094(2), 370\u2013382 (2006)","journal-title":"Proceedings of the IEEE"},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Dehbaoui, A., Dutertre, J.M., Robisson, B., Tria, A.: Electromagnetic Transient Faults Injection on a Hardware and a Software Implementations of AES. In: FDTC, pp. 7\u201315. IEEE (2012)","DOI":"10.1109\/FDTC.2012.15"},{"key":"21_CR20","unstructured":"Stein, W., et al.: Sage Mathematics Software (Version 5.5). The Sage Development Team (2012), \n                      http:\/\/www.sagemath.org"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Ozturk, E., Gaubatz, G., Sunar, B.: Tate Pairing with Strong Fault Resiliency. In: Proceedings of FDTC 2007, pp. 103\u2013111. IEEE Computer Society (2007)","DOI":"10.1109\/FDTC.2007.18"},{"key":"21_CR22","first-page":"21","volume":"12","author":"S. Ghosh","year":"2011","unstructured":"Ghosh, S., Mukhopadhyay, D., Chowdhury, D.: Fault Attack and Countermeasures on Pairing Based Cryptography. International Journal Network Security\u00a012, 21\u201328 (2011)","journal-title":"International Journal Network Security"},{"key":"21_CR23","unstructured":"Certivox: Miracl library, v 5.6.1 (2012), \n                      https:\/\/certivox.com\/solutions\/miracl-crypto-sdk\/"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-68164-9_25","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2008","author":"M. Naehrig","year":"2008","unstructured":"Naehrig, M., Barreto, P.S.L.M., Schwabe, P.: On compressible pairings and their computation. In: Vaudenay, S. (ed.) AFRICACRYPT 2008. LNCS, vol.\u00a05023, pp. 371\u2013388. Springer, Heidelberg (2008)"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D.F. Aranha","year":"2011","unstructured":"Aranha, D.F., Karabina, K., Longa, P., Gebotys, C.H., L\u00f3pez, J.: Faster explicit formulas for computing pairings over ordinary curves. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 48\u201368. Springer, Heidelberg (2011)"},{"key":"21_CR26","doi-asserted-by":"crossref","unstructured":"Van Woudenberg, J., Witteman, M., Menarini, F.: Practical Optical Fault Injection on Secure Microcontrollers. In: 2011 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), pp. 91\u201399 (September 2011)","DOI":"10.1109\/FDTC.2011.12"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2013"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40349-1_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:35:41Z","timestamp":1630456541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-40349-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403484","9783642403491"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40349-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}