{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T13:33:17Z","timestamp":1751376797265},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319548753"},{"type":"electronic","value":"9783319548760"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-54876-0_16","type":"book-chapter","created":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T04:36:57Z","timestamp":1488343017000},"page":"199-213","source":"Crossref","is-referenced-by-count":5,"title":["Improving Side-Channel Attacks Against Pairing-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Damien","family":"Jauvart","sequence":"first","affiliation":[]},{"given":"Jacques J. A.","family":"Fournier","sequence":"additional","affiliation":[]},{"given":"Nadia","family":"El-Mrabet","sequence":"additional","affiliation":[]},{"given":"Louis","family":"Goubin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Bajard, J., Mrabet, N.: Pairing in cryptography: an arithmetic point of view. In: Architectures, and Implementations, Advanced Signal Processing Algorithms (2007)","DOI":"10.1117\/12.733789"},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-28632-5_5","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"J-C Bajard","year":"2004","unstructured":"Bajard, J.-C., Imbert, L., Liardet, P.-Y., Teglia, Y.: Leak resistant arithmetic. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 62\u201375. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-28632-5_5"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"PSLM Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol. 3897, pp. 319\u2013331. Springer, Heidelberg (2006). doi: 10.1007\/11693383_22"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36095-4_1","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"A Bauer","year":"2013","unstructured":"Bauer, A., Jaulmes, E., Prouff, E., Wild, J.: Horizontal and vertical side-channel attacks against secure RSA implementations. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 1\u201317. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-36095-4_1"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-40026-1_10","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"J Bl\u00f6mer","year":"2013","unstructured":"Bl\u00f6mer, J., G\u00fcnther, P., Liske, G.: Improved side channel attacks on pairing based cryptography. In: Prouff, E. (ed.) COSADE 2013. LNCS, vol. 7864, pp. 154\u2013168. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40026-1_10"},{"key":"16_CR6","volume-title":"Identity-Based Encryption from the Weil Pairing","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-Based Encryption from the Weil Pairing, vol. 32. Springer, Heidelberg (2001)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Booth, A.D.: A signed binary multiplication technique. Q. J. Mech. Appl. Math. 4(2), 236\u2013240 (1951)","DOI":"10.1093\/qjmam\/4.2.236"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Brickell, E.F.: A fast modular multiplication algorithm with application to two key cryptography. In: Chaum, D., Rivest, R.L., Sherman, A.T. (eds.) Advances in Cryptology, pp. 51\u201360. Springer, New York (1983)","DOI":"10.1007\/978-1-4757-0602-4_5"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-34931-7_9","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"C Clavier","year":"2012","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Giraud, C., Roussellet, M., Verneuil, V.: ROSETTA for single trace analysis. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 140\u2013155. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34931-7_9"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-17650-0_5","volume-title":"Information and Communications Security","author":"C Clavier","year":"2010","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Roussellet, M., Verneuil, V.: Horizontal correlation analysis on exponentiation. In: Soriano, M., Qing, S., L\u00f3pez, J. (eds.) ICICS 2010. LNCS, vol. 6476, pp. 46\u201361. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-17650-0_5"},{"issue":"23","key":"16_CR11","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1090\/S0002-9947-1969-0249212-8","volume":"142","author":"S Cook","year":"1969","unstructured":"Cook, S.: On the minimum computation time of functions. Trans. Am. Math. Soc. 142(23), 291\u2013291 (1969)","journal-title":"Trans. Am. Math. Soc."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-48059-5_25","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J-S Coron","year":"1999","unstructured":"Coron, J.-S.: Resistance against differential power analysis for elliptic curve cryptosystems. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 292\u2013302. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48059-5_25"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45472-1_12","volume-title":"Financial Cryptography","author":"J-S Coron","year":"2001","unstructured":"Coron, J.-S., Kocher, P., Naccache, D.: Statistics and secret leakage. In: Frankel, Y. (ed.) FC 2000. LNCS, vol. 1962, pp. 157\u2013173. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45472-1_12"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-73489-5_10","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"AJ Devegili","year":"2007","unstructured":"Devegili, A.J., Scott, M., Dahab, R.: Implementing cryptographic pairings over Barreto-Naehrig curves. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 197\u2013207. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73489-5_10"},{"issue":"23","key":"16_CR15","doi-asserted-by":"crossref","first-page":"1931","DOI":"10.1049\/el:19971293","volume":"33","author":"J-F Dhem","year":"1997","unstructured":"Dhem, J.-F., Joye, M., Quisquater, J.-J.: Normalisation in diminished-radix modulus transformation. Electron. Lett. 33(23), 1931 (1997)","journal-title":"Electron. Lett."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-540-40061-5_7","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"I Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.-S.: Tate pairing implementation for hyperelliptic curves $$y^{2}=x^{p}-x+d$$ . In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol. 2894, pp. 111\u2013123. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-40061-5_7"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"El Mrabet, N., Di Natale, G., Flottes, M.L.: A practical differential power analysis attack against the miller algorithm. In: PRIME, pp. 308\u2013311 (2009)","DOI":"10.1109\/RME.2009.5201339"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-24586-2_4","volume-title":"Security Aspects in Information Technology","author":"S Ghosh","year":"2011","unstructured":"Ghosh, S., Roychowdhury, D.: Security of prime field pairing cryptoprocessor against differential power attack. In: Joye, M., Mukhopadhyay, D., Tunstall, M. (eds.) InfoSecHiComNet 2011. LNCS, vol. 7011, pp. 16\u201329. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-24586-2_4"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/11894063_2","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2006","author":"B Gierlichs","year":"2006","unstructured":"Gierlichs, B., Lemke-Rust, K., Paar, C.: Templates vs. stochastic methods. In: Goubin, L., Matsui, M. (eds.) CHES 2006. LNCS, vol. 4249, pp. 15\u201329. Springer, Heidelberg (2006). doi: 10.1007\/11894063_2"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Hess, F., Smart, N.P., Vercauteren, F.: The Eta pairing revisited. IEEE Trans. Inf. Theor. 52, 4595\u20134602 (2006)","DOI":"10.1109\/TIT.2006.881709"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-01957-9_32","volume-title":"Applied Cryptography and Network Security","author":"M Hutter","year":"2009","unstructured":"Hutter, M., Medwed, M., Hein, D., Wolkerstorfer, J.: Attacking ECDSA-enabled RFID devices. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 519\u2013534. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-01957-9_32"},{"issue":"1","key":"16_CR22","first-page":"17","volume":"4","author":"M Joye","year":"2003","unstructured":"Joye, M.: Elliptic curves and side-channel analysis. ST J. Syst. Res. 4(1), 17\u201321 (2003)","journal-title":"ST J. Syst. Res."},{"key":"16_CR23","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. In: Soviet Physics Doklady, vol. 7, p. 595 (1963)"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11935070_11","volume-title":"Cryptology and Network Security","author":"TH Kim","year":"2006","unstructured":"Kim, T.H., Takagi, T., Han, D.-G., Kim, H.W., Lim, J.: Side channel attacks and countermeasures on pairing based cryptosystems over binary fields. In: Pointcheval, D., Mu, Y., Chen, K. (eds.) CANS 2006. LNCS, vol. 4301, pp. 168\u2013181. Springer, Heidelberg (2006). doi: 10.1007\/11935070_11"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11586821_2","volume-title":"Cryptography and Coding","author":"N Koblitz","year":"2005","unstructured":"Koblitz, N., Menezes, A.: Pairing-based cryptography at high security levels. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 13\u201336. Springer, Heidelberg (2005). doi: 10.1007\/11586821_2"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Advances in Cryptology - CRYPTO 1999, pp. 1\u201310 (1999)","DOI":"10.1007\/3-540-48405-1_25"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/3-540-44499-8_6","volume-title":"Cryptographic Hardware and Embedded Systems \u2014 CHES 2000","author":"R Mayer-Sommer","year":"2000","unstructured":"Mayer-Sommer, R.: Smartly analyzing the simplicity and the power of simple power analysis on smartcards. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2000. LNCS, vol. 1965, pp. 78\u201392. Springer, Heidelberg (2000). doi: 10.1007\/3-540-44499-8_6"},{"key":"16_CR28","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). doi: 10.1007\/3-540-39799-X_31"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Montgomery, P.L.: Modular multiplication without trial division (1985)","DOI":"10.2307\/2007970"},{"key":"16_CR30","unstructured":"Oswald, E.: On side-channel attacks and the application of algorithmic countermeasures. na (2003)"},{"key":"16_CR31","unstructured":"Page, D., Vercauteren, F.: Fault and Side-Channel Attacks on Pairing Based Cryptography (2004)"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-19475-7_36","volume-title":"Reconfigurable Computing: Architectures, Tools and Applications","author":"W Pan","year":"2011","unstructured":"Pan, W., Marnane, W.P.: A correlation power analysis attack against tate pairing on FPGA. In: Koch, A., Krishnamurthy, R., McAllister, J., Woods, R., El-Ghazawi, T. (eds.) ARC 2011. LNCS, vol. 6578, pp. 340\u2013349. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19475-7_36"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"Perin, G., Imbert, L., Maurine, P., Torres, L.: Vertical and horizontal correlation attacks on RNS-based exponentiations. J. Cryptographic Eng. 5(3), 1\u201315 (2015)","DOI":"10.1007\/s13389-015-0095-0"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-10175-0_11","volume-title":"Constructive Side-Channel Analysis and Secure Design","author":"G Perin","year":"2014","unstructured":"Perin, G., Imbert, L., Torres, L., Maurine, P.: Attacking randomized exponentiations using unsupervised learning. In: Prouff, E. (ed.) COSADE 2014. LNCS, vol. 8622, pp. 144\u2013160. Springer, Cham (2014). doi: 10.1007\/978-3-319-10175-0_11"},{"key":"16_CR35","unstructured":"Quisquater, J.-J.: Presentation at the rump session of Eurocrypt 90 (1990)"},{"key":"16_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-30556-9_23","volume-title":"Progress in Cryptology - INDOCRYPT 2004","author":"H Sato","year":"2004","unstructured":"Sato, H., Schepers, D., Takagi, T.: Exact analysis of montgomery multiplication. In: Canteaut, A., Viswanathan, K. (eds.) INDOCRYPT 2004. LNCS, vol. 3348, pp. 290\u2013304. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30556-9_23"},{"key":"16_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-30574-3_20","volume-title":"Topics in Cryptology \u2013 CT-RSA 2005","author":"M Scott","year":"2005","unstructured":"Scott, M.: Computing the tate pairing. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 293\u2013304. Springer, Heidelberg (2005). doi: 10.1007\/978-3-540-30574-3_20"},{"key":"16_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-25516-8_18","volume-title":"Cryptography and Coding","author":"M Scott","year":"2011","unstructured":"Scott, M.: On the efficient implementation of pairing-based protocols. In: Chen, L. (ed.) IMACC 2011. LNCS, vol. 7089, pp. 296\u2013308. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25516-8_18"},{"key":"16_CR39","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-09494-6","volume-title":"The Arithmetic of Elliptic Curves","author":"JH Silverman","year":"2009","unstructured":"Silverman, J.H.: The Arithmetic of Elliptic Curves. Graduate Texts in Mathematics, vol. 106, 2nd edn. Springer, New York (2009)","edition":"2"},{"key":"16_CR40","first-page":"714","volume":"3","author":"AL Toom","year":"1963","unstructured":"Toom, A.L.: The complexity of a scheme of functional elements realizing the multiplication of integers. Sov. Math. Dokl. 3, 714\u2013716 (1963)","journal-title":"Sov. Math. Dokl."},{"key":"16_CR41","doi-asserted-by":"crossref","unstructured":"Unterluggauer, T., Wenger, E.: practical attack on bilinear pairings to disclose the secrets of embedded devices. In: ARES, pp. 69\u201377 (2014)","DOI":"10.1109\/ARES.2014.16"},{"key":"16_CR42","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: Nguyen, P.Q. (ed.) VIETCRYPT 2006. LNCS, vol. 4341, pp. 99\u2013114. Springer, Heidelberg (2006). doi: 10.1007\/11958239_7"}],"container-title":["Lecture Notes in Computer Science","Risks and Security of Internet and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-54876-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T02:07:18Z","timestamp":1568858838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-54876-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319548753","9783319548760"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-54876-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}