{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:33:09Z","timestamp":1760236389736,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2021,11,18]],"date-time":"2021-11-18T00:00:00Z","timestamp":1637193600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006595","name":"Unitatea Executiva Pentru Finantarea Invatamantului Superior a Cercetarii Dezvoltarii si Inovarii","doi-asserted-by":"publisher","award":["PN-III-P1-1.1-TE-2019-2245"],"award-info":[{"award-number":["PN-III-P1-1.1-TE-2019-2245"]}],"id":[{"id":"10.13039\/501100006595","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>The bounds presented at CHES 2017 based on Massey\u2019s guessing entropy represent the most scalable side-channel security evaluation method to date. In this paper, we present an improvement of this method, by determining the asymptotically optimal Massey-like inequality and then further refining it for finite support distributions. The impact of these results is highlighted for side-channel attack evaluations, demonstrating the improvements over the CHES 2017 bounds.<\/jats:p>","DOI":"10.3390\/e23111538","type":"journal-article","created":{"date-parts":[[2021,11,19]],"date-time":"2021-11-19T02:43:09Z","timestamp":1637289789000},"page":"1538","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Tight and Scalable Side-Channel Attack Evaluations through Asymptotically Optimal Massey-like Inequalities on Guessing Entropy"],"prefix":"10.3390","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5116-2822","authenticated-orcid":false,"given":"Andrei","family":"T\u0103n\u0103sescu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University Politehnica of Bucharest, Splaiul Independentei 313 (6), 060042 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marios O.","family":"Choudary","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University Politehnica of Bucharest, Splaiul Independentei 313 (6), 060042 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8681-8916","authenticated-orcid":false,"given":"Olivier","family":"Rioul","sequence":"additional","affiliation":[{"name":"LTCI, T\u00e9l\u00e9com Paris, Institut Polytechnique de Paris, 91120 Palaiseau, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pantelimon George","family":"Popescu","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University Politehnica of Bucharest, Splaiul Independentei 313 (6), 060042 Bucharest, Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2021,11,18]]},"reference":[{"key":"ref_1","unstructured":"Network and Security (2016). Cyber Security and Resilience of Smart Cars, Network and Security."},{"key":"ref_2","unstructured":"Network and Security (2020). Sectoral\/Thematic Threat Analysis: ENISA Thread Lanscape, Network and Security."},{"key":"ref_3","unstructured":"Garcia, F.D., Oswald, D., Kasper, T., and Pavlides, P. (2016). Lock It and Still Lose It\u2014On the (In)Security of Automotive Remote Keyless Entry Systems, USENIX Security Symposium."},{"key":"ref_4","first-page":"163","article-title":"Screaming Channels: When Electromagnetic Side Channels Meet Radio Transceivers","volume":"2018","author":"Camurati","year":"2018","journal-title":"ACM SIGSAC Conf. Comput. Commun. Secur. (CCS)"},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Standaert, F.X., Malkin, T.G., and Yung, M. (2009, January 26\u201330). A unified framework for the analysis of side-channel key recovery attacks. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cologne, Germany.","DOI":"10.1007\/978-3-642-01001-9_26"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Veyrat-Charvillon, N., Gerard, B., Renauld, M., and Standaert, F.X. (2012, January 15\u201316). An Optimal Key Enumeration Algorithm and Its Application to Side-Channel Attacks. Proceedings of the Selected Areas of Cryptography: 2012, Windsor, ON, Canada.","DOI":"10.1007\/978-3-642-35999-6_25"},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Veyrat-Charvillon, N., Gerard, B., and Standaert, F.X. (2013, January 26\u201330). Security evaluations beyond computing power. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece.","DOI":"10.1007\/978-3-642-38348-9_8"},{"key":"ref_8","unstructured":"Bernstein, D.J., Lange, T., and van Vredendaal, C. (2021, June 01). Tighter, Faster, Simpler Side-Channel Security Evaluations beyond Computing Power. ePrint Archive, Available online: https:\/\/eprint.iacr.org\/2015\/221."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Glowacz, C., Grosso, V., Poussier, R., Sch\u00fcth, J., and Standaert, F.X. (2015, January 8\u201311). Simpler and more efficient rank estimation for side-channel security assessment. Proceedings of the International Workshop on Fast Software Encryption, Istanbul, Turkey.","DOI":"10.1007\/978-3-662-48116-5_6"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Poussier, R., Standaert, F.X., and Grosso, V. (2016, January 17\u201319). Simple key enumeration (and rank estimation) using histograms: An integrated approach. Proceedings of the International Conference on Cryptographic Hardware and Embedded Systems (CHES), Santa Barbara, CA, USA.","DOI":"10.1007\/978-3-662-53140-2_4"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"David, L., and Wool, A. (2017, January 14\u201317). A Bounded-Space Near-Optimal Key Enumeration Algorithm for Multi-subkey Side-Channel Attacks. Proceedings of the Cryptographers\u2019 Track at the RSA Conference, San Francisco, CA, USA.","DOI":"10.1007\/978-3-319-52153-4_18"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Choudary, M.O., and Popescu, P.G. (2017, January 25\u201328). Back to Massey: Impressively fast, scalable and tight security evaluation tools. Proceedings of the 2017 International Conference on Cryptographic Hardware and Embedded Systems (CHES), Taipei, Taiwan.","DOI":"10.1007\/978-3-319-66787-4_18"},{"key":"ref_13","unstructured":"Massey, J.L. (July, January 27). Guessing and entropy. Proceedings of the 1994 IEEE International Symposium on Information Theory (ISIT), Trondheim, Norway."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Grosso, V. (2018, January 12\u201314). Scalable key rank estimation (and key enumeration) algorithm for large keys. Proceedings of the International Conference on Smart Card Research and Advanced Applications, Montpellier, France.","DOI":"10.1007\/978-3-030-15462-2_6"},{"key":"ref_15","unstructured":"Popescu, P.G., and Choudary, M.O. (2019, January 7\u201312). Refinement of Massey Inequality. Proceedings of the 2019 IEEE International Symposium on Information Theory (ISIT), Paris, France."},{"key":"ref_16","unstructured":"Rioul, O. (2013). On Guessing, unpublished note."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"De Ch\u00e9risey, E., Guilley, S., Rioul, O., and Piantanida, P. (2019, January 25\u201328). Best Information is Most Successful. Proceedings of the 2019 International Conference on Cryptographic Hardware and Embedded Systems (CHES), Atlanta, GA, USA.","DOI":"10.46586\/tches.v2019.i2.49-79"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"T\u0103n\u0103sescu, A., and Popescu, P.G. (2020). Exploiting the Massey Gap. Entropy, 22.","DOI":"10.3390\/e22121398"},{"key":"ref_19","unstructured":"Rioul, O. (2021). Variations on a Theme by Massey. arXiv."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"2154","DOI":"10.1109\/TIFS.2013.2285522","article-title":"Constrained Search for a Class of Good Bijective S-Boxes With Improved DPA Resistivity","volume":"8","author":"Mazumdar","year":"2013","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1109\/TIFS.2017.2757440","article-title":"Efficient, portable template attacks","volume":"13","author":"Choudary","year":"2017","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Carr\u00e9, S., Guilley, S., and Rioul, O. (2020, January 1\u20133). Persistent fault analysis with few encryptions. Proceedings of the 2020 International Workshop on Constructive Side-Channel Analysis and Secure Design (COSADE), Lugano, Switzerland.","DOI":"10.1007\/978-3-030-68773-1_1"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Chari, S., Rao, J.R., and Rohatgi, P. (2002, January 13\u201315). Template Attacks. Proceedings of the 2003 Cryptographic Hardware and Embedded Systems (CHES), Redwood Shores, CA, USA.","DOI":"10.1007\/3-540-36400-5_3"},{"key":"ref_24","unstructured":"(2021, June 01). The Common Criteria Web Site. Available online: https:\/\/www.commoncriteriaportal.org\/."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/18.481781","article-title":"An inequality on guessing and its application to sequential decoding","volume":"42","author":"Arikan","year":"1996","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"4323","DOI":"10.1109\/TIT.2018.2803162","article-title":"Improved bounds on lossless source coding and guessing moments via R\u00e9nyi measures","volume":"64","author":"Sason","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1674","DOI":"10.1109\/TIT.2019.2937318","article-title":"On the conditional smooth R\u00e9nyi entropy and its applications in guessing and source coding","volume":"66","author":"Kuzuoka","year":"2019","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Huleihel, W., Salamatian, S., and M\u00e9dard, M. (2017, January 25\u201330). Guessing with limited memory. Proceedings of the 2017 IEEE International Symposium on Information Theory (ISIT), Aachen, Germany.","DOI":"10.1109\/ISIT.2017.8006930"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/11\/1538\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T07:32:30Z","timestamp":1760167950000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/23\/11\/1538"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,18]]},"references-count":28,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2021,11]]}},"alternative-id":["e23111538"],"URL":"https:\/\/doi.org\/10.3390\/e23111538","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2021,11,18]]}}}