{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:48:17Z","timestamp":1765356497593,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T00:00:00Z","timestamp":1547251200000},"content-version":"tdm","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":[[2020,4]]},"DOI":"10.1007\/s13389-018-00201-3","type":"journal-article","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T00:19:23Z","timestamp":1547252363000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Improving side-channel attacks against pairing-based cryptography"],"prefix":"10.1007","volume":"10","author":[{"given":"Damien","family":"Jauvart","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3840-584X","authenticated-orcid":false,"given":"Nadia","family":"El Mrabet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques J. A.","family":"Fournier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis","family":"Goubin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,12]]},"reference":[{"issue":"6","key":"201_CR1","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1109\/TDSC.2015.2507120","volume":"14","author":"R Azarderakhsh","year":"2017","unstructured":"Azarderakhsh, R., Fishbein, D., Grewal, G., Hu, S., Jao, D., Longa, P., Verma, R.: Fast software implementations of bilinear pairings. IEEE Trans. Dependable Sec. Comput. 14(6), 605\u2013619 (2017)","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"doi-asserted-by":"publisher","unstructured":"Barbulescu, R., Duquesne, S.: Updating key size estimations for pairings. J. Cryptol. (2018). \nhttps:\/\/doi.org\/10.1007\/s00145-018-9280-5","key":"201_CR2","DOI":"10.1007\/s00145-018-9280-5"},{"doi-asserted-by":"crossref","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: SAC\u201905, pp. 319\u2013331. Springer, Berlin (2005)","key":"201_CR3","DOI":"10.1007\/11693383_22"},{"doi-asserted-by":"crossref","unstructured":"Bauer, A., Jaulmes, E., Prouff, E., Wild, J.: Horizontal and vertical side-channel attacks against secure RSA implementations. In: Cryptographers Track at the RSA Conference, pp. 1\u201317. Springer, Berlin (2013)","key":"201_CR4","DOI":"10.1007\/978-3-642-36095-4_1"},{"doi-asserted-by":"crossref","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: ICPBC, pp. 21\u201339. Springer, Berlin (2010)","key":"201_CR5","DOI":"10.1007\/978-3-642-17455-1_2"},{"doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., G\u00fcnther, P., Liske, G.: Improved side channel attacks on pairing based cryptography. In: COSADE, pp. 154\u2013168. Springer, Berlin (2013)","key":"201_CR6","DOI":"10.1007\/978-3-642-40026-1_10"},{"key":"201_CR7","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, Berlin (2001)"},{"doi-asserted-by":"crossref","unstructured":"Brier, E., Clavier, C., Olivier, F.: Correlation power analysis with a leakage model. In: CHES, pp. 16\u201329. Springer, Berlin (2004)","key":"201_CR8","DOI":"10.1007\/978-3-540-28632-5_2"},{"doi-asserted-by":"crossref","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Giraud, C., Roussellet, M., Verneuil, V.: ROSETTA for single trace analysis. In: International Conference on Cryptology in India, pp. 140\u2013155. Springer, Berlin (2012)","key":"201_CR9","DOI":"10.1007\/978-3-642-34931-7_9"},{"doi-asserted-by":"crossref","unstructured":"Coron, J.: Resistance against differential power analysis for elliptic curve cryptosystems. In: CHES, pp. 292\u2013302. Springer, Berlin (1999)","key":"201_CR10","DOI":"10.1007\/3-540-48059-5_25"},{"doi-asserted-by":"crossref","unstructured":"Coron, J.-S., Kocher, P., Naccache, D.: Statistics and secret leakage. In: Financial Cryptography, pp. 157\u2013173. Springer, Berlin (2000)","key":"201_CR11","DOI":"10.1007\/3-540-45472-1_12"},{"doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Burmester, M.: Identity-based key infrastructures (iki). In: SEC, pp. 167\u2013176. Springer, Boston (2004)","key":"201_CR12","DOI":"10.1007\/1-4020-8143-X_11"},{"unstructured":"Dumas, J.-G., Lafourcade, P., Redon, P.: Architectures PKI et communications s\u00e9curis\u00e9es. Dunod. (2015). EAN 9782100726158","key":"201_CR13"},{"key":"201_CR14","first-page":"64","volume":"2004","author":"R Dutta","year":"2004","unstructured":"Dutta, R., Barua, R., Sarkar, P.: Pairing-based cryptographic protocols: a survey. IACR Cryptol. 2004, 64 (2004)","journal-title":"IACR Cryptol."},{"issue":"4","key":"201_CR15","first-page":"111","volume":"2003","author":"I Duursma","year":"2003","unstructured":"Duursma, I., Lee, H.: Tate pairing implementation for hyperelliptic curves \n$$y^2 = x^p - x + d$$\n\n\n\n\n\ny\n2\n\n=\n\nx\np\n\n-\nx\n+\nd\n\n\n\n\n. Adv. Cryptol. AsiaCrypt 2003(4), 111\u2013123 (2003)","journal-title":"Adv. Cryptol. AsiaCrypt"},{"doi-asserted-by":"crossref","unstructured":"El Mrabet, N., Di Natale, G., Flottes, M. Lise.: A practical differential power analysis attack against the Miller algorithm. In: PRIME, pp. 308\u2013311 (2009)","key":"201_CR16","DOI":"10.1109\/RME.2009.5201339"},{"key":"201_CR17","first-page":"16","volume-title":"Security of Prime Field Pairing Cryptoprocessor Against Differential Power Attack","author":"S Ghosh","year":"2011","unstructured":"Ghosh, S., Roychowdhury, D.: Security of Prime Field Pairing Cryptoprocessor Against Differential Power Attack, pp. 16\u201329. Springer, Berlin (2011)"},{"doi-asserted-by":"crossref","unstructured":"Gierlichs, B., Lemke-Rust, K., Paar, C.: Templates vs. stochastic methods. In: CHES, pp. 15\u201329. Springer, Berlin (2006)","key":"201_CR18","DOI":"10.1007\/11894063_2"},{"key":"201_CR19","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.P., Vercauteren, F.: The eta pairing revisited. IEEE Trans. Inf. Theory 52, 4595\u20134602 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"unstructured":"Jauvart, D.: S\u00e9curisation des algorithmes de couplages contre les attaques physiques. PhD thesis, Universit\u00e9 Paris-Saclay, (2017)","key":"201_CR20"},{"doi-asserted-by":"crossref","unstructured":"Jauvart, D., Fournier, J.J., El Mrabet, N., Goubin, L.: Improving side-channel attacks against pairing-based cryptography. In: CRiSIS, Springer, Cham (2016)","key":"201_CR21","DOI":"10.1007\/978-3-319-54876-0_16"},{"doi-asserted-by":"crossref","unstructured":"Jauvart, D., Fournier, J.J., Goubin, L.: First practical side-channel attack to defeat point randomization in secure implementations of pairing-based cryptography. In: SECRYPT, INSTICC, ICETE. ScitePress (2017)","key":"201_CR22","DOI":"10.5220\/0006425501040115"},{"doi-asserted-by":"publisher","unstructured":"Joux, A., Odlyzko, A.M., Pierrot, C.: The past, evolving present, and future of the discrete logarithm. In: Open Problems in Mathematics and Computational Science, pp. 5\u201336 (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-10683-0_2","key":"201_CR23","DOI":"10.1007\/978-3-319-10683-0_2"},{"doi-asserted-by":"crossref","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Lecture Notes in Computer Science CRYPTO (1), vol. 9814, pp. 543\u2013571. Springer, Berlin (2016)","key":"201_CR24","DOI":"10.1007\/978-3-662-53018-4_20"},{"doi-asserted-by":"crossref","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: Cryptology and Network Security, pp. 168\u2013181. Springer, Berlin (2006)","key":"201_CR25","DOI":"10.1007\/11935070_11"},{"issue":"3","key":"201_CR26","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"CK Koc","year":"1996","unstructured":"Koc, C.K., Acar, T., Kaliski, B.S.: Analyzing and comparing Montgomery multiplication algorithms. IEEE micro 16(3), 26\u201333 (1996)","journal-title":"IEEE micro"},{"doi-asserted-by":"crossref","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Advances in Cryptology\u2014CRYPTO\u201999, pp. 1\u201310. Springer, Berlin (1999)","key":"201_CR27","DOI":"10.1007\/3-540-48405-1_25"},{"key":"201_CR28","first-page":"231","volume-title":"Solving 114-bit ECDLP for a Barreto\u2013Naehrig Curve","author":"T Kusaka","year":"2018","unstructured":"Kusaka, T., Joichi, S., Ikuta, K., Khandaker, M.A.-A., Nogami, Y., Uehara, S., Yamai, N., Duquesne, S.: Information security and cryptology\u2014ICISC 2017. In: Kim, H., Kim, D.-C. (eds.) Solving 114-bit ECDLP for a Barreto\u2013Naehrig Curve, pp. 231\u2013244. Springer, Cham (2018)"},{"doi-asserted-by":"crossref","unstructured":"Mayer-Sommer, R.: Smartly analyzing the simplicity and the power of simple power analysis on smartcards. In: CHES, pp. 78\u201392. Springer, Berlin (2000)","key":"201_CR29","DOI":"10.1007\/3-540-44499-8_6"},{"unstructured":"Medwed, M., Herbst, C.: Randomizing the Montgomery multiplication to repel template attacks on multiplicative masking. In: Lecture Notes in Computer Science COSADE, vol. 9 (2010)","key":"201_CR30"},{"unstructured":"Miller, V.S.: Short programs for functions on curves. In: IBM Thomas J. Watson Research Center (1986)","key":"201_CR31"},{"issue":"9","key":"201_CR32","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 Trans. Comput. 55(9), 1075\u20131080 (2006). \nhttps:\/\/doi.org\/10.1109\/TC.2006.134","journal-title":"IEEE Trans. Comput."},{"doi-asserted-by":"crossref","unstructured":"Pan, W., Marnane, W.: A correlation power analysis attack against Tate pairing on FPGA. In: Reconfigurable Computing: Architectures, Tools and Applications, pp. 340\u2013349, Springer, Berlin (2011)","key":"201_CR33","DOI":"10.1007\/978-3-642-19475-7_36"},{"doi-asserted-by":"crossref","unstructured":"Quisquater, J.-J., Samyde, D.: Electromagnetic analysis (ema): measures and counter-measures for smart cards. In: Smart Card Programming and Security, pp. 200\u2013210. Springer, Berlin (2001)","key":"201_CR34","DOI":"10.1007\/3-540-45418-7_17"},{"doi-asserted-by":"crossref","unstructured":"Scott, M.: Computing the Tate pairing. In: CT-RSA, pp. 293\u2013304. Springer, Berlin (2005)","key":"201_CR35","DOI":"10.1007\/978-3-540-30574-3_20"},{"doi-asserted-by":"crossref","unstructured":"Scott, M., Benger, N., Charlemagne, M., Perez, L.J.D., Kachisa, E.J.: On the final exponentiation for calculating pairings on ordinary elliptic curves. In: International Conference on Pairing-Based Cryptography, pp. 78\u201388. Springer, Berlin (2009)","key":"201_CR36","DOI":"10.1007\/978-3-642-03298-1_6"},{"doi-asserted-by":"crossref","unstructured":"Shamir, A., et\u00a0al.: Identity-based cryptosystems and signature schemes. In: Crypto, vol. 84, pp. 47\u201353. Springer, Berlin (1984)","key":"201_CR37","DOI":"10.1007\/3-540-39568-7_5"},{"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)","key":"201_CR38","DOI":"10.1109\/ARES.2014.16"},{"key":"201_CR39","first-page":"99","volume":"2006","author":"C Whelan","year":"2006","unstructured":"Whelan, C., Scott, M.: Side channel analysis of practical pairing implementations: Which path is more secure? VIETCRYPT 2006, 99\u2013114 (2006)","journal-title":"VIETCRYPT"}],"container-title":["Journal of Cryptographic Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-00201-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13389-018-00201-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13389-018-00201-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T09:50:48Z","timestamp":1585821048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13389-018-00201-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,12]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s13389-018-00201-3","relation":{},"ISSN":["2190-8508","2190-8516"],"issn-type":[{"type":"print","value":"2190-8508"},{"type":"electronic","value":"2190-8516"}],"subject":[],"published":{"date-parts":[[2019,1,12]]},"assertion":[{"value":"6 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 December 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}