{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:20:59Z","timestamp":1750220459879,"version":"3.41.0"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"2s","license":[{"start":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T00:00:00Z","timestamp":1621296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Beijing Natural Science Foundation","award":["4202070"],"award-info":[{"award-number":["4202070"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62002021, 61872040"],"award-info":[{"award-number":["62002021, 61872040"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Cryptography Development Fund","award":["MMJJ20170201"],"award-info":[{"award-number":["MMJJ20170201"]}]},{"name":"Henan Key Laboratory of Network Cryptography Technology","award":["LNCT2020-A09"],"award-info":[{"award-number":["LNCT2020-A09"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Multimedia Comput. Commun. Appl."],"published-print":{"date-parts":[[2021,6,21]]},"abstract":"<jats:p>Side-channel analysis achieves key recovery by analyzing physical signals generated during the operation of cryptographic devices. Power consumption is one kind of these signals and can be regarded as a multimedia form. In recent years, many artificial intelligence technologies have been combined with classical side-channel analysis methods to improve the efficiency and accuracy. A simple genetic algorithm was employed in Correlation Power Analysis (CPA) when apply to cryptographic algorithms implemented in parallel. However, premature convergence caused failure in recovering the whole key, especially when plenty of large S-boxes were employed in the target primitive, such as in the case of AES.<\/jats:p>\n          <jats:p>\n            In this article, we investigate the reason of premature convergence and propose a Multiple Sieve Method (MS-CPA), which overcomes this problem and reduces the number of traces required in correlation power analysis. Our method can be adjusted to combine with key enumeration algorithms and further improves the efficiency. Simulation experimental results depict that our method reduces the required number of traces by\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            and\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            , compared to classic CPA and the Simple-Genetic-Algorithm-based CPA (SGA-CPA), respectively, when the success rate is fixed to\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            . Real experiments performed on SAKURA-G confirm that the number of traces required for recovering the correct key in our method is almost equal to the minimum number that makes the correlation coefficients of correct keys stand out from the wrong ones and is much less than the numbers of traces required in CPA and SGA-CPA. When combining with key enumeration algorithms, our method has better performance. For the traces number being 200 (noise standard deviation\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            ), the attacks success rate of our method is\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            , which is much higher than the classic CPA with key enumeration (\n            <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>\n                  \n                <\/jats:tex-math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>\n            success rate). Moreover, we adjust our method to work on that DPA contest v1 dataset and achieve a better result (40.04 traces) than the winning proposal (42.42 traces).\n          <\/jats:p>","DOI":"10.1145\/3433165","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T14:43:16Z","timestamp":1621348996000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["A Multiple Sieve Approach Based on Artificial Intelligent Techniques and Correlation Power Analysis"],"prefix":"10.1145","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6416-7203","authenticated-orcid":false,"given":"Yaoling","family":"Ding","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology and State Key Laboratory of Cryptology, Beijing, China"}]},{"given":"Liehuang","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}]},{"given":"An","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology and State Key Laboratory of Cryptology, Beijing, China"}]},{"given":"Yuan","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}]},{"given":"Yongjuan","family":"Wang","sequence":"additional","affiliation":[{"name":"Institute of Cyberspace Security, Information Engineering University, Zhengzhou, China"}]},{"given":"Siu Ming","family":"Yiu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Hong Kong, China"}]},{"given":"Keke","family":"Gai","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Beijing Institute of Technology, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2021,5,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37288-9_18"},{"key":"e_1_2_1_2_1","first-page":"221","article-title":"Tighter, faster, simpler side-channel security evaluations beyond computing power","volume":"2015","author":"Bernstein Daniel J.","year":"2015","unstructured":"Daniel J. Bernstein , Tanja Lange , and Christine van Vredendaal . 2015 . Tighter, faster, simpler side-channel security evaluations beyond computing power . IACR Cryptol. ePrint Arch. 2015 (2015), 221 . Daniel J. Bernstein, Tanja Lange, and Christine van Vredendaal. 2015. Tighter, faster, simpler side-channel security evaluations beyond computing power. IACR Cryptol. ePrint Arch. 2015 (2015), 221.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31301-6_19"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28632-5_2"},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the Annual Conference on Cryptographic Hardware and Embedded Systems - CHES","author":"Cagli Eleonora","year":"2017","unstructured":"Eleonora Cagli , C\u00e9cile Dumas , and Emmanuel Prouff . 2017 . Convolutional neural networks with data augmentation against jitter-based countermeasures - Profiling attacks without pre-processing . In Proceedings of the Annual Conference on Cryptographic Hardware and Embedded Systems - CHES 2017, Wieland Fischer and Naofumi Homma (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 45\u201368. Eleonora Cagli, C\u00e9cile Dumas, and Emmanuel Prouff. 2017. Convolutional neural networks with data augmentation against jitter-based countermeasures - Profiling attacks without pre-processing. In Proceedings of the Annual Conference on Cryptographic Hardware and Embedded Systems - CHES 2017, Wieland Fischer and Naofumi Homma (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 45\u201368."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/648255.752740"},{"key":"e_1_2_1_7_1","volume-title":"Less than 50 traces allow to recover the key. CHES Special Session 1","author":"Clavier Christophe","year":"2009","unstructured":"Christophe Clavier . 2009. Less than 50 traces allow to recover the key. CHES Special Session 1 ( 2009 ). Christophe Clavier. 2009. Less than 50 traces allow to recover the key. CHES Special Session 1 (2009)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49301-4_22"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/560131"},{"key":"e_1_2_1_10_1","volume-title":"RSA Conference. Springer, 311\u2013327","author":"David Liron","year":"2017","unstructured":"Liron David and Avishai Wool . 2017 . A bounded-space near-optimal key enumeration algorithm for multi-subkey side-channel attacks. In Cryptographers\u2019 Track at the RSA Conference. Springer, 311\u2013327 . Liron David and Avishai Wool. 2017. A bounded-space near-optimal key enumeration algorithm for multi-subkey side-channel attacks. In Cryptographers\u2019 Track at the RSA Conference. Springer, 311\u2013327."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.12.046"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_16"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85053-3_27"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48116-5_6"},{"key":"e_1_2_1_15_1","volume-title":"DPA Contest","author":"TELECOM ParisTech SEN Research Group","year":"2008","unstructured":"TELECOM ParisTech SEN Research Group . 2008. DPA Contest ( 1 st edition) ( 2008 -2009). http:\/\/www.dpacontest.org. TELECOM ParisTech SEN Research Group. 2008. DPA Contest (1st edition) (2008-2009). http:\/\/www.dpacontest.org.","edition":"1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2017.2757921"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29912-4_18"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the International Conference on Smart Card Research and Advanced Applications. Springer, 79\u201393","author":"Heyszl Johann","year":"2013","unstructured":"Johann Heyszl , Andreas Ibing , Stefan Mangard , Fabrizio De Santis , and Georg Sigl . 2013 . Clustering algorithms for non-profiled single-execution attacks on exponentiations . In Proceedings of the International Conference on Smart Card Research and Advanced Applications. Springer, 79\u201393 . Johann Heyszl, Andreas Ibing, Stefan Mangard, Fabrizio De Santis, and Georg Sigl. 2013. Clustering algorithms for non-profiled single-execution attacks on exponentiations. In Proceedings of the International Conference on Smart Card Research and Advanced Applications. Springer, 79\u201393."},{"volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"Holland John Henry","key":"e_1_2_1_19_1","unstructured":"John Henry Holland . 1975. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence . University of Michigan Press , Ann Arbor, MI . John Henry Holland. 1975. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. University of Michigan Press, Ann Arbor, MI."},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the Second International Workshop on Constructive SideChannel Analysis and Secure Design. Center for Advanced Security Research, Darmstadt, 99\u2013104","author":"Hospodar Gabriel","year":"2011","unstructured":"Gabriel Hospodar , E. D. Mulder , Benedikt Gierlichs , Ingrid Verbauwhede , and Joos Vandewalle . 2011 . Least squares support vector machines for side-channel analysis . In Proceedings of the Second International Workshop on Constructive SideChannel Analysis and Secure Design. Center for Advanced Security Research, Darmstadt, 99\u2013104 . Gabriel Hospodar, E. D. Mulder, Benedikt Gierlichs, Ingrid Verbauwhede, and Joos Vandewalle. 2011. Least squares support vector machines for side-channel analysis. In Proceedings of the Second International Workshop on Constructive SideChannel Analysis and Secure Design. Center for Advanced Security Research, Darmstadt, 99\u2013104."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/646764.703989"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/11894063_14"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74735-2_2"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the Second International Workshop on Constructive Side Channel Analysis and Secure Design. Center for Advanced Security Research, Darmstadt, 29\u201341","author":"Lerman Liran","year":"2011","unstructured":"Liran Lerman , Gianluca Bontempi , and Olivier Markowitch . 2011 . Side channel attack: An approach based on machine learning . In Proceedings of the Second International Workshop on Constructive Side Channel Analysis and Secure Design. Center for Advanced Security Research, Darmstadt, 29\u201341 . Liran Lerman, Gianluca Bontempi, and Olivier Markowitch. 2011. Side channel attack: An approach based on machine learning. In Proceedings of the Second International Workshop on Constructive Side Channel Analysis and Secure Design. Center for Advanced Security Research, Darmstadt, 29\u201341."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40026-1_12"},{"key":"e_1_2_1_26_1","first-page":"609","article-title":"How low can you go? Using side-channel data to enhance brute-force key recovery","volume":"2016","author":"Longo Jake","year":"2016","unstructured":"Jake Longo , Daniel P. Martin , Luke Mather , Elisabeth Oswald , Benjamin Sach , and Martijn Stam . 2016 . How low can you go? Using side-channel data to enhance brute-force key recovery . IACR Cryptology ePrint Archive 2016 (2016), 609 . Jake Longo, Daniel P. Martin, Luke Mather, Elisabeth Oswald, Benjamin Sach, and Martijn Stam. 2016. How low can you go? Using side-channel data to enhance brute-force key recovery. IACR Cryptology ePrint Archive 2016 (2016), 609.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48800-3_13"},{"key":"e_1_2_1_28_1","first-page":"586","article-title":"Innovative method of the power analysis","volume":"22","author":"Martinasek Zdenek","year":"2013","unstructured":"Zdenek Martinasek and Vaclav Zeman . 2013 . Innovative method of the power analysis . Radioengineering 22 , 2 (2013), 586 \u2013 594 . Zdenek Martinasek and Vaclav Zeman. 2013. Innovative method of the power analysis. Radioengineering 22, 2 (2013), 586\u2013594.","journal-title":"Radioengineering"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1267115.1267132"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80052-3"},{"key":"e_1_2_1_31_1","volume-title":"Data Sncryption standard","author":"National Bureau of Standards. 1977.","year":"1977","unstructured":"National Bureau of Standards. 1977. Data Sncryption standard . Federal Information Processing Standards Publications ( 1977 ). National Bureau of Standards. 1977. Data Sncryption standard. Federal Information Processing Standards Publications (1977)."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2017.7966373"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31271-2_8"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53140-2_4"},{"volume-title":"A new class of collision attacks and its application to DES","author":"Schramm Kai","key":"e_1_2_1_35_1","unstructured":"Kai Schramm , Thomas J. Wollinger , and Christof Paar . 2003. A new class of collision attacks and its application to DES . In Fast Software Encryption, Thomas Johansson (Ed.). Springer Berlin Heidelberg , Berlin, Heidelberg , 206\u2013222. Kai Schramm, Thomas J. Wollinger, and Christof Paar. 2003. A new class of collision attacks and its application to DES. In Fast Software Encryption, Thomas Johansson (Ed.). Springer Berlin Heidelberg, Berlin, Heidelberg, 206\u2013222."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.46586\/tches.v2019.i2.107-131"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the International Conference on Selected Areas in Cryptography. Springer, 390\u2013406","author":"Veyrat-Charvillon Nicolas","year":"2012","unstructured":"Nicolas Veyrat-Charvillon , Beno\u00eet G\u00e9rard , Mathieu Renauld , and Fran\u00e7ois-Xavier Standaert . 2012 . An optimal key enumeration algorithm and its application to side-channel attacks . In Proceedings of the International Conference on Selected Areas in Cryptography. Springer, 390\u2013406 . Nicolas Veyrat-Charvillon, Beno\u00eet G\u00e9rard, Mathieu Renauld, and Fran\u00e7ois-Xavier Standaert. 2012. An optimal key enumeration algorithm and its application to side-channel attacks. In Proceedings of the International Conference on Selected Areas in Cryptography. Springer, 390\u2013406."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_8"},{"volume-title":"yet sufficient? How to determine whether limited side channel information enables key recovery","author":"Ye Xin","key":"e_1_2_1_39_1","unstructured":"Xin Ye , Thomas Eisenbarth , and William Martin . 2015. Bounded , yet sufficient? How to determine whether limited side channel information enables key recovery . In Smart Card Research and Advanced Applications, Marc Joye and Amir Moradi (Eds.). Springer International Publishing , Cham , 215\u2013232. Xin Ye, Thomas Eisenbarth, and William Martin. 2015. Bounded, yet sufficient? How to determine whether limited side channel information enables key recovery. In Smart Card Research and Advanced Applications, Marc Joye and Amir Moradi (Eds.). Springer International Publishing, Cham, 215\u2013232."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1308"}],"container-title":["ACM Transactions on Multimedia Computing, Communications, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3433165","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3433165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:10Z","timestamp":1750193290000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3433165"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,18]]},"references-count":40,"journal-issue":{"issue":"2s","published-print":{"date-parts":[[2021,6,21]]}},"alternative-id":["10.1145\/3433165"],"URL":"https:\/\/doi.org\/10.1145\/3433165","relation":{},"ISSN":["1551-6857","1551-6865"],"issn-type":[{"type":"print","value":"1551-6857"},{"type":"electronic","value":"1551-6865"}],"subject":[],"published":{"date-parts":[[2021,5,18]]},"assertion":[{"value":"2020-05-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}