{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:01:16Z","timestamp":1786978876536,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":87,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031306334","type":"print"},{"value":"9783031306341","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-30634-1_20","type":"book-chapter","created":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T19:03:07Z","timestamp":1681498987000},"page":"596-627","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Effective and\u00a0Efficient Masking with\u00a0Low Noise Using Small-Mersenne-Prime Ciphers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2978-4067","authenticated-orcid":false,"given":"Lo\u00efc","family":"Masure","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5733-4341","authenticated-orcid":false,"given":"Pierrick","family":"M\u00e9aux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3809-9803","authenticated-orcid":false,"given":"Thorben","family":"Moos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7444-0285","authenticated-orcid":false,"given":"Fran\u00e7ois-Xavier","family":"Standaert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,15]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","unstructured":"Albrecht, M.R., et al.: Feistel structures for MPC, and more. In: ESORICS 2019 (2019). https:\/\/doi.org\/10.1007\/978-3-030-29962-0_8","DOI":"10.1007\/978-3-030-29962-0_8"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-662-53887-6_7","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"M Albrecht","year":"2016","unstructured":"Albrecht, M., Grassi, L., Rechberger, C., Roy, A., Tiessen, T.: MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10031, pp. 191\u2013219. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53887-6_7"},{"issue":"5","key":"20_CR3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/00029890.1986.11971821","volume":"93","author":"D Aldous","year":"1986","unstructured":"Aldous, D., Diaconis, P.: Shuffling cards and stopping times. Am. Math. Monthly 93(5), 333\u2013348 (1986). https:\/\/doi.org\/10.1080\/00029890.1986.11971821","journal-title":"Am. Math. Monthly"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Aly, A., Ashur, T., Ben-Sasson, E., Dhooghe, S., Szepieniec, A.: Design of symmetric-key primitives for advanced cryptographic protocols. ToSC (3) (2020). https:\/\/doi.org\/10.13154\/tosc.v2020.i3.1-45","DOI":"10.13154\/tosc.v2020.i3.1-45"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Andrychowicz, M., Dziembowski, S., Faust, S.: Circuit compilers with $$O(1\/\\log (n))$$ leakage rate. In: EUROCRYPT 2016 [43], pp. 586\u2013615. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_21","DOI":"10.1007\/978-3-662-49896-5_21"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s13389-021-00260-z","volume":"11","author":"JC Bajard","year":"2021","unstructured":"Bajard, J.C., Duquesne, S.: Montgomery-friendly primes and applications to cryptography. J. Cryptogr. Eng. 11(4), 399\u2013415 (2021). https:\/\/doi.org\/10.1007\/s13389-021-00260-z","journal-title":"J. Cryptogr. Eng."},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-319-70694-8_25","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"J Balasch","year":"2017","unstructured":"Balasch, J., Faust, S., Gierlichs, B., Paglialonga, C., Standaert, F.-X.: Consolidating inner product masking. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 724\u2013754. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_25"},{"key":"20_CR8","doi-asserted-by":"publisher","unstructured":"Balasch, J., Gierlichs, B., Grosso, V., Reparaz, O., Standaert, F.: On the cost of lazy engineering for masked software implementations. In: CARDIS (2014). https:\/\/doi.org\/10.1007\/978-3-319-16763-3_5","DOI":"10.1007\/978-3-319-16763-3_5"},{"key":"20_CR9","doi-asserted-by":"publisher","unstructured":"Barthe, G., Bela\u00efd, S., Cassiers, G., Fouque, P.A., Gr\u00e9goire, B., Standaert, F.X.: maskVerif: automated verification of higher-order masking in presence of physical defaults. In: ESORICS 2019 (2019). https:\/\/doi.org\/10.1007\/978-3-030-29959-0_15","DOI":"10.1007\/978-3-030-29959-0_15"},{"key":"20_CR10","doi-asserted-by":"publisher","unstructured":"Barthe, G., Bela\u00efd, S., Dupressoir, F., Fouque, P.A., Gr\u00e9goire, B., Strub, P.Y.: Verified proofs of higher-order masking. In: Oswald and Fischlin [74]. https:\/\/doi.org\/10.1007\/978-3-662-46800-5_18","DOI":"10.1007\/978-3-662-46800-5_18"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"Barthe, G., et al.: Strong non-interference and type-directed higher-order masking. In: CCS 2016 (2016). https:\/\/doi.org\/10.1145\/2976749.2978427","DOI":"10.1145\/2976749.2978427"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Battistello, A., Coron, J.S., Prouff, E., Zeitoun, R.: Horizontal side-channel attacks and countermeasures on the ISW masking scheme. In: CHES 2016 (2016). https:\/\/doi.org\/10.1007\/978-3-662-53140-2_2","DOI":"10.1007\/978-3-662-53140-2_2"},{"key":"20_CR13","doi-asserted-by":"publisher","unstructured":"Bela\u00efd, S., Benhamouda, F., Passel\u00e8gue, A., Prouff, E., Thillard, A., Vergnaud, D.: Randomness complexity of private circuits for multiplication. In: EUROCRYPT 2016 [43]. https:\/\/doi.org\/10.1007\/978-3-662-49896-5_22","DOI":"10.1007\/978-3-662-49896-5_22"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/BFb0052352","volume-title":"Fast Software Encryption","author":"E Biham","year":"1997","unstructured":"Biham, E.: A fast new DES implementation in software. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 260\u2013272. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052352"},{"key":"20_CR15","unstructured":"Biham, E. (ed.): FSE 1997, vol. 1267 (1997)"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-38424-3_1","volume-title":"Advances in Cryptology-CRYPT0\u2019 90","author":"E Biham","year":"1991","unstructured":"Biham, E., Shamir, A.: Differential cryptanalysis of DES-like cryptosystems. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 2\u201321. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-38424-3_1"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Bloem, R., Gro\u00df, H., Iusupov, R., K\u00f6nighofer, B., Mangard, S., Winter, J.: Formal verification of masked hardware implementations in the presence of glitches. In: Nielsen and Rijmen [71]. https:\/\/doi.org\/10.1007\/978-3-319-78375-8_11","DOI":"10.1007\/978-3-319-78375-8_11"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Bos, J.W., Costello, C., Hisil, H., Lauter, K.: Fast cryptography in genus 2. In: EUROCRYPT 2013 [42] (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_12","DOI":"10.1007\/978-3-642-38348-9_12"},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s13389-015-0097-y","volume":"6","author":"JW Bos","year":"2015","unstructured":"Bos, J.W., Costello, C., Longa, P., Naehrig, M.: Selecting elliptic curves for cryptography: an efficiency and security analysis. J. Cryptogr. Eng. 6(4), 259\u2013286 (2015). https:\/\/doi.org\/10.1007\/s13389-015-0097-y","journal-title":"J. Cryptogr. Eng."},{"key":"20_CR20","doi-asserted-by":"publisher","unstructured":"Bronchain, O., Standaert, F.X.: Breaking masked implementations with many shares on 32-bit software platforms. TCHES (3) (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i3.202-234","DOI":"10.46586\/tches.v2021.i3.202-234"},{"key":"20_CR21","doi-asserted-by":"publisher","unstructured":"Buhan, I., Schneider, T. (eds.): CARDIS 2022 (2023). https:\/\/doi.org\/10.1007\/978-3-031-25319-5","DOI":"10.1007\/978-3-031-25319-5"},{"key":"20_CR22","doi-asserted-by":"publisher","unstructured":"Carlet, C., Faug\u00e8re, J.C., Goyet, C., Renault, G.: Analysis of the algebraic side channel attack. JCEN 2(1). https:\/\/doi.org\/10.1007\/s13389-012-0028-0","DOI":"10.1007\/s13389-012-0028-0"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Cassiers, G., Gr\u00e9goire, B., Levi, I., Standaert, F.: Hardware private circuits: from trivial composition to full verification. IEEE Trans. Comput. 70(10) (2021). https:\/\/doi.org\/10.1109\/TC.2020.3022979","DOI":"10.1109\/TC.2020.3022979"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Cassiers, G., Standaert, F.X.: Provably secure hardware masking in the transition- and glitch-robust probing model: better safe than sorry. TCHES (2) (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i2.136-158","DOI":"10.46586\/tches.v2021.i2.136-158"},{"key":"20_CR25","doi-asserted-by":"publisher","unstructured":"Cassiers, G., Standaert, F.X.: Towards globally optimized masking: from low randomness to low noise rate. TCHES (2) (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i2.162-198","DOI":"10.13154\/tches.v2019.i2.162-198"},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Cassiers, G., Standaert, F.: Trivially and efficiently composing masked gadgets with probe isolating non-interference. TIFS 15 (2020). https:\/\/doi.org\/10.1109\/TIFS.2020.2971153","DOI":"10.1109\/TIFS.2020.2971153"},{"key":"20_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-48405-1_26","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"S Chari","year":"1999","unstructured":"Chari, S., Jutla, C.S., Rao, J.R., Rohatgi, P.: Towards sound approaches to counteract power-analysis attacks. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 398\u2013412. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_26"},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1007\/978-3-030-92078-4_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2021","author":"J Cho","year":"2021","unstructured":"Cho, J., et al.: Transciphering framework for approximate homomorphic encryption. In: Tibouchi, M., Wang, H. (eds.) ASIACRYPT 2021. LNCS, vol. 13092, pp. 640\u2013669. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92078-4_22"},{"key":"20_CR29","doi-asserted-by":"publisher","unstructured":"Choudary, O., Kuhn, M.G.: Efficient template attacks. In: CARDIS (2013). https:\/\/doi.org\/10.1007\/978-3-319-08302-5_17","DOI":"10.1007\/978-3-319-08302-5_17"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Coron, J.S., Giraud, C., Prouff, E., Renner, S., Rivain, M., Vadnala, P.K.: Conversion of security proofs from one leakage model to another: a new issue. In: COSADE 2012 (2012). https:\/\/doi.org\/10.1007\/978-3-642-29912-4_6","DOI":"10.1007\/978-3-642-29912-4_6"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Daemen, J., Rijmen, V.: The wide trail design strategy. In: IMACC (2001). https:\/\/doi.org\/10.1007\/3-540-45325-3_20","DOI":"10.1007\/3-540-45325-3_20"},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Information Security and Cryptography. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04722-4","DOI":"10.1007\/978-3-662-04722-4"},{"key":"20_CR33","doi-asserted-by":"publisher","unstructured":"de Ch\u00e9risey, E., Guilley, S., Rioul, O., Piantanida, P.: Best information is most successful. TCHES (2) (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i2.49-79","DOI":"10.13154\/tches.v2019.i2.49-79"},{"key":"20_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77886-6_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"C Dobraunig","year":"2021","unstructured":"Dobraunig, C., Grassi, L., Guinet, A., Kuijsters, D.: Ciminion: symmetric encryption based on toffoli-gates over large finite fields. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 3\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_1"},{"key":"20_CR35","unstructured":"Dobraunig, C., Grassi, L., Helminger, L., Rechberger, C., Schofnegger, M., Walch, R.: Pasta: a case for hybrid homomorphic encryption. Cryptology ePrint Archive, Report 2021\/731 (2021), https:\/\/eprint.iacr.org\/2021\/731"},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-55220-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Duc","year":"2014","unstructured":"Duc, A., Dziembowski, S., Faust, S.: Unifying leakage models: from probing attacks to noisy leakage. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 423\u2013440. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_24"},{"key":"20_CR37","doi-asserted-by":"publisher","unstructured":"Duc, A., Faust, S., Standaert, F.X.: Making masking security proofs concrete - or how to evaluate the security of any leaking device. In: Oswald and Fischlin [74]. https:\/\/doi.org\/10.1007\/978-3-662-46800-5_16","DOI":"10.1007\/978-3-662-46800-5_16"},{"key":"20_CR38","doi-asserted-by":"publisher","unstructured":"D\u00fcll, M., et al.: High-speed curve25519 on 8-bit, 16-bit, and 32-bit microcontrollers. Des. Codes Cryptogr. 77(2-3) (2015). https:\/\/doi.org\/10.1007\/s10623-015-0087-1","DOI":"10.1007\/s10623-015-0087-1"},{"key":"20_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-662-49890-3_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"F Durvaux","year":"2016","unstructured":"Durvaux, F., Standaert, F.-X.: From improved leakage detection to the detection of points of interests in leakage traces. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 240\u2013262. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_10"},{"key":"20_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-28914-9_13","volume-title":"Theory of Cryptography","author":"S Dziembowski","year":"2012","unstructured":"Dziembowski, S., Faust, S.: Leakage-resilient circuits without computational assumptions. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 230\u2013247. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_13"},{"key":"20_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-662-49099-0_11","volume-title":"Theory of Cryptography","author":"S Dziembowski","year":"2016","unstructured":"Dziembowski, S., Faust, S., Sk\u00f3rski, M.: Optimal amplification of noisy leakages. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 291\u2013318. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49099-0_11"},{"key":"20_CR42","unstructured":"EUROCRYPT 2013 (2013)"},{"key":"20_CR43","unstructured":"EUROCRYPT 2016 (2016)"},{"key":"20_CR44","doi-asserted-by":"publisher","unstructured":"Faust, S., Grosso, V., Pozo, S.M.D., Paglialonga, C., Standaert, F.X.: Composable masking schemes in the presence of physical defaults & the robust probing model. TCHES (3) (2018). https:\/\/doi.org\/10.13154\/tches.v2018.i3.89-120","DOI":"10.13154\/tches.v2018.i3.89-120"},{"key":"20_CR45","doi-asserted-by":"publisher","unstructured":"Fumaroli, G., Martinelli, A., Prouff, E., Rivain, M.: Affine masking against higher-order side channel analysis. In: SAC 2010 (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_18","DOI":"10.1007\/978-3-642-19574-7_18"},{"key":"20_CR46","doi-asserted-by":"publisher","unstructured":"Goubin, L., Patarin, J.: DES and differential power analysis (the \u201cduplication\" method). In: CHES 1999 (1999). https:\/\/doi.org\/10.1007\/3-540-48059-5_15","DOI":"10.1007\/3-540-48059-5_15"},{"key":"20_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/978-3-319-56620-7_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"D Goudarzi","year":"2017","unstructured":"Goudarzi, D., Rivain, M.: How fast can higher-order masking be in software? In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 567\u2013597. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_20"},{"key":"20_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-030-45724-2_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"L Grassi","year":"2020","unstructured":"Grassi, L., L\u00fcftenegger, R., Rechberger, C., Rotaru, D., Schofnegger, M.: On a generalization of substitution-permutation networks: the HADES design strategy. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12106, pp. 674\u2013704. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45724-2_23"},{"key":"20_CR49","doi-asserted-by":"publisher","unstructured":"Gr\u00e9goire, B., Papagiannopoulos, K., Schwabe, P., Stoffelen, K.: Vectorizing higher-order masking. In: COSADE 2018 (2018). https:\/\/doi.org\/10.1007\/978-3-319-89641-0_2","DOI":"10.1007\/978-3-319-89641-0_2"},{"key":"20_CR50","doi-asserted-by":"publisher","unstructured":"Gro\u00df, H., Mangard, S., Korak, T.: An efficient side-channel protected AES implementation with arbitrary protection order. In: CT-RSA 2017 (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_6","DOI":"10.1007\/978-3-319-52153-4_6"},{"key":"20_CR51","doi-asserted-by":"publisher","unstructured":"Grosso, V., Standaert, F.X.: Masking proofs are tight and how to exploit it in security evaluations. In: Nielsen and Rijmen [71]. https:\/\/doi.org\/10.1007\/978-3-319-78375-8_13","DOI":"10.1007\/978-3-319-78375-8_13"},{"key":"20_CR52","unstructured":"Hamburg, M.: Fast and compact elliptic-curve cryptography. IACR Cryptol. ePrint Arch, p. 309 (2012). http:\/\/eprint.iacr.org\/2012\/309"},{"key":"20_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-540-45146-4_27","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y Ishai","year":"2003","unstructured":"Ishai, Y., Sahai, A., Wagner, D.: Private circuits: securing hardware against probing attacks. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 463\u2013481. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_27"},{"key":"20_CR54","doi-asserted-by":"publisher","unstructured":"Ito, A., Ueno, R., Homma, N.: On the success rate of side-channel attacks on masked implementations: information-theoretical bounds and their practical usage. In: CCS 2022 (2022). https:\/\/doi.org\/10.1145\/3548606.3560579","DOI":"10.1145\/3548606.3560579"},{"key":"20_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BFb0052332","volume-title":"Fast Software Encryption","author":"T Jakobsen","year":"1997","unstructured":"Jakobsen, T., Knudsen, L.R.: The interpolation attack on block ciphers. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 28\u201340. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052332"},{"key":"20_CR56","doi-asserted-by":"publisher","unstructured":"Kloss, B.M.: Probability distributions on bicompact topological groups. Theory Prob. Appl. 4(3) (1959). https:\/\/doi.org\/10.1007\/s10623-015-0087-1","DOI":"10.1007\/s10623-015-0087-1"},{"key":"20_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1007\/978-3-030-64837-4_26","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"D Knichel","year":"2020","unstructured":"Knichel, D., Sasdrich, P., Moradi, A.: SILVER \u2013 statistical independence and\u00a0leakage verification. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 787\u2013816. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_26"},{"key":"20_CR58","doi-asserted-by":"publisher","unstructured":"Krachenfels, T., Ganji, F., Moradi, A., Tajik, S., Seifert, J.P.: Real-world snapshots vs. theory: questioning the t-probing security model. In: 2021 Symposium on Security and Privacy (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00029","DOI":"10.1109\/SP40001.2021.00029"},{"key":"20_CR59","unstructured":"Lipmaa, H., Rogaway, P., Wagner, D.: Ctr-mode encryption. In: First NIST Workshop on Modes of Operation, vol. 39. Citeseer. MD (2000)"},{"key":"20_CR60","doi-asserted-by":"publisher","unstructured":"Mangard, S.: Hardware countermeasures against DPA - a statistical analysis of their effectiveness. In: CT-RSA 2004 (2004). https:\/\/doi.org\/10.1007\/978-3-540-24660-2_18","DOI":"10.1007\/978-3-540-24660-2_18"},{"key":"20_CR61","doi-asserted-by":"publisher","unstructured":"Mangard, S., Popp, T., Gammel, B.M.: Side-channel leakage of masked CMOS gates. In: CT-RSA 2005 (2005). https:\/\/doi.org\/10.1007\/978-3-540-30574-3_24","DOI":"10.1007\/978-3-540-30574-3_24"},{"key":"20_CR62","doi-asserted-by":"publisher","unstructured":"Mangard, S., Pramstaller, N., Oswald, E.: Successfully attacking masked AES hardware implementations. In: CHES 2005 (2005). https:\/\/doi.org\/10.1007\/11545262_12","DOI":"10.1007\/11545262_12"},{"key":"20_CR63","doi-asserted-by":"publisher","unstructured":"Masure, L., Cristiani, V., Lecomte, M., Standaert, F.X.: Don\u2019t learn what you already know: scheme-aware modeling for profiling side-channel analysis against masking. TCHES (1) (2023). https:\/\/doi.org\/10.46586\/tches.v2023.i1.32-59","DOI":"10.46586\/tches.v2023.i1.32-59"},{"key":"20_CR64","doi-asserted-by":"publisher","unstructured":"Masure, L., Rioul, O., Standaert, F.: A nearly tight proof of Duc et al\u2019.s conjectured security bound for masked implementations. In: Buhan and Schneider [21]. https:\/\/doi.org\/10.1007\/978-3-031-25319-5_4","DOI":"10.1007\/978-3-031-25319-5_4"},{"key":"20_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/3-540-48285-7_33","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201993","author":"M Matsui","year":"1994","unstructured":"Matsui, M.: Linear cryptanalysis method for DES cipher. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 386\u2013397. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48285-7_33"},{"key":"20_CR66","doi-asserted-by":"publisher","unstructured":"Moos, T.: Static power SCA of sub-100 nm CMOS ASICs. TCHES (3) (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i3.202-232","DOI":"10.13154\/tches.v2019.i3.202-232"},{"key":"20_CR67","doi-asserted-by":"publisher","unstructured":"Moos, T., Moradi, A.: Countermeasures against static power attacks. TCHES (3) (2021). https:\/\/doi.org\/10.46586\/tches.v2021.i3.780-805","DOI":"10.46586\/tches.v2021.i3.780-805"},{"key":"20_CR68","doi-asserted-by":"publisher","unstructured":"Moos, T., Moradi, A., Richter, B.: Static power side-channel analysis of a threshold implementation prototype chip. In: DATE, pp. 1324\u20131329. IEEE (2017). https:\/\/doi.org\/10.23919\/DATE.2017.7927198","DOI":"10.23919\/DATE.2017.7927198"},{"key":"20_CR69","doi-asserted-by":"publisher","unstructured":"Moos, T., Moradi, A., Schneider, T., Standaert, F.X.: Glitch-resistant masking revisited. TCHES 2019(2), 256\u2013292 (2019). https:\/\/doi.org\/10.13154\/tches.v2019.i2.256-292","DOI":"10.13154\/tches.v2019.i2.256-292"},{"key":"20_CR70","doi-asserted-by":"publisher","unstructured":"Moradi, A.: Side-channel leakage through static power - should we care about in practice? In: CHES 2014 (2014). https:\/\/doi.org\/10.1007\/978-3-662-44709-3_31","DOI":"10.1007\/978-3-662-44709-3_31"},{"key":"20_CR71","unstructured":"Nielsen, J.B., Rijmen, V. (eds.): EUROCRYPT 2018, Part II, vol. 10821 (2018)"},{"issue":"2","key":"20_CR72","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/s00145-010-9085-7","volume":"24","author":"S Nikova","year":"2010","unstructured":"Nikova, S., Rijmen, V., Schl\u00e4ffer, M.: Secure hardware implementation of nonlinear functions in the presence of glitches. J. Cryptol. 24(2), 292\u2013321 (2010). https:\/\/doi.org\/10.1007\/s00145-010-9085-7","journal-title":"J. Cryptol."},{"key":"20_CR73","doi-asserted-by":"publisher","unstructured":"Oren, Y., Renauld, M., Standaert, F.X., Wool, A.: Algebraic side-channel attacks beyond the hamming weight leakage model. In: CHES 2012 (2012). https:\/\/doi.org\/10.1007\/978-3-642-33027-8_9","DOI":"10.1007\/978-3-642-33027-8_9"},{"key":"20_CR74","unstructured":"Oswald, E., Fischlin, M. (eds.): EUROCRYPT 2015, Part I, vol. 9056 (2015)"},{"key":"20_CR75","doi-asserted-by":"crossref","unstructured":"Pozo, S.M.D., Standaert, F., Kamel, D., Moradi, A.: Side-channel attacks from static power: when should we care? In: DATE. ACM (2015)","DOI":"10.7873\/DATE.2015.0712"},{"key":"20_CR76","doi-asserted-by":"publisher","unstructured":"Prouff, E., Rivain, M.: Masking against side-channel attacks: a formal security proof. In: EUROCRYPT 2013 [42]. https:\/\/doi.org\/10.1007\/978-3-642-38348-9_9","DOI":"10.1007\/978-3-642-38348-9_9"},{"key":"20_CR77","doi-asserted-by":"publisher","unstructured":"Renauld, M., Standaert, F.X., Veyrat-Charvillon, N.: Algebraic side-channel attacks on the AES: why time also matters in DPA. In: CHES 2009, pp. 97\u2013111 (2009). https:\/\/doi.org\/10.1007\/978-3-642-04138-9_8","DOI":"10.1007\/978-3-642-04138-9_8"},{"key":"20_CR78","doi-asserted-by":"publisher","unstructured":"Rijmen, V., Daemen, J., Preneel, B., Bossalaers, A., De Win, E.: The cipher SHARK. In: FSE 1996 (1996). https:\/\/doi.org\/10.1007\/3-540-60865-6_47","DOI":"10.1007\/3-540-60865-6_47"},{"key":"20_CR79","doi-asserted-by":"publisher","unstructured":"Rivain, M., Prouff, E.: Provably secure higher-order masking of AES. In: CHES 2010 (2010). https:\/\/doi.org\/10.1007\/978-3-642-15031-9_28","DOI":"10.1007\/978-3-642-15031-9_28"},{"key":"20_CR80","doi-asserted-by":"publisher","unstructured":"dos Santos, L.C., G\u00e9rard, F., Gro\u00dfsch\u00e4dl, J., Spignoli, L.: Rivain-prouff on steroids: faster and stronger masking of the AES. In: Buhan and Schneider [21]. https:\/\/doi.org\/10.1007\/978-3-031-25319-5_7","DOI":"10.1007\/978-3-031-25319-5_7"},{"issue":"2","key":"20_CR81","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s13389-016-0120-y","volume":"6","author":"T Schneider","year":"2016","unstructured":"Schneider, T., Moradi, A.: Leakage assessment methodology. J. Cryptogr. Eng. 6(2), 85\u201399 (2016). https:\/\/doi.org\/10.1007\/s13389-016-0120-y","journal-title":"J. Cryptogr. Eng."},{"key":"20_CR82","doi-asserted-by":"publisher","unstructured":"Standaert, F.: How (not) to use welch\u2019s t-test in side-channel security evaluations. In: CARDIS (2018). https:\/\/doi.org\/10.1007\/978-3-030-15462-2_5","DOI":"10.1007\/978-3-030-15462-2_5"},{"key":"20_CR83","doi-asserted-by":"publisher","unstructured":"Standaert, F.X., Archambeau, C.: Using subspace-based template attacks to compare and combine power and electromagnetic information leakages. In: CHES 2008 (2008). https:\/\/doi.org\/10.1007\/978-3-540-85053-3_26","DOI":"10.1007\/978-3-540-85053-3_26"},{"key":"20_CR84","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-01001-9_26","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"F-X Standaert","year":"2009","unstructured":"Standaert, F.-X., Malkin, T.G., Yung, M.: A unified framework for the analysis of side-channel key recovery attacks. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 443\u2013461. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_26"},{"key":"20_CR85","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-17373-8_7","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"F-X Standaert","year":"2010","unstructured":"Standaert, F.-X., et al.: The world is not enough: another look on second-order DPA. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 112\u2013129. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_7"},{"key":"20_CR86","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/978-3-662-45611-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"N Veyrat-Charvillon","year":"2014","unstructured":"Veyrat-Charvillon, N., G\u00e9rard, B., Standaert, F.-X.: Soft analytical side-channel attacks. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 282\u2013296. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_15"},{"key":"20_CR87","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-34618-8_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"C Whitnall","year":"2019","unstructured":"Whitnall, C., Oswald, E.: A critical analysis of ISO 17825 (\u2018testing methods for the mitigation of non-invasive attack classes against cryptographic modules\u2019). In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11923, pp. 256\u2013284. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34618-8_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30634-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,14]],"date-time":"2023-04-14T19:05:25Z","timestamp":1681499125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30634-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031306334","9783031306341"],"references-count":87,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30634-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"15 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}