{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T21:34:28Z","timestamp":1767994468970,"version":"3.49.0"},"reference-count":31,"publisher":"International Association for Cryptologic Research","issue":"1","license":[{"start":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T00:00:00Z","timestamp":1736726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2025,3,11]]},"abstract":"<jats:p>  In this paper, we study MDS matrices that are specifically designed to prevent the occurrence of related differentials. We investigate MDS matrices with a Hadamard structure and demonstrate that it is possible to construct 4 X 4 Hadamard matrices that effectively eliminate related differentials. Incorporating these matrices into the linear layer of AES-like block-ciphers\/hash functions significantly mitigates the attacks that exploit the related differentials property. The central contribution of this paper is to identify crucial underlying relations that determine whether a given 4 X 4 Hadamard matrix exhibits related differentials. By satisfying these relations, the matrix ensures the presence of related differentials, whereas failing to meet them leads to the absence of such differentials. This offers effective mitigation of recently reported attacks on reduced-round AES. Furthermore, we propose a faster search technique to exhaustively verify the presence or absence of related differentials in 8 X 8 Hadamard matrices over finite field of characteristic 2 which requires checking only a subset of involutory matrices in the set. Although most existing studies on constructing MDS matrices primarily focus on lightweight hardware\/software implementations, our research additionally introduces a novel perspective by emphasizing the importance of MDS matrix construction in relation to their resistance against differential cryptanalysis. <\/jats:p>","DOI":"10.62056\/a6ksdk5vt","type":"journal-article","created":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:23:17Z","timestamp":1744147397000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":1,"title":["Construction of Hadamard-based MixColumns Matrices Resistant to Related-Differential Cryptanalysis"],"prefix":"10.62056","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4584-3194","authenticated-orcid":false,"given":"Sonu","family":"Jha","sequence":"first","affiliation":[{"name":"Norwegian University of Science and Technology","place":["Gl\u00f8shaugen, Trondheim, 7034, Norway"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7663-8321","authenticated-orcid":false,"given":"Shun","family":"Li","sequence":"additional","affiliation":[{"name":"Chinese Academy of Sciences","place":["52 Sanlihe Rd, Beijing, 100045, China"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7078-6139","authenticated-orcid":false,"given":"Danilo","family":"Gligoroski","sequence":"additional","affiliation":[{"name":"Norwegian University of Science and Technology","place":["Gl\u00f8shaugen, Trondheim, 7034, Norway"]}]}],"member":"48349","published-online":{"date-parts":[[2025,4,8]]},"reference":[{"key":"ref1:joan2002design","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","article-title":"The design of Rijndael: AES-the advanced encryption\n  standard","author":"Joan Daemen","year":"2002","journal-title":"Information Security and Cryptography"},{"key":"ref2:ccds:DaemenR091","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s12095-008-0003-x","article-title":"New Criteria for Linear Maps in AES-like Ciphers","volume":"1","author":"Joan Daemen","year":"2009","journal-title":"Cryptogr. Commun."},{"key":"ref3:2022:487","doi-asserted-by":"publisher","first-page":"43","DOI":"10.46586\/tosc.v2022.i2.43-62","article-title":"New Key-Recovery Attack on Reduced-Round AES","volume":"2022","author":"Navid Ghaedi Bardeh","year":"2022","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"ref4:AC:RonBarHel17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-319-70694-8_8","article-title":"Yoyo Tricks with AES","volume":"10624","author":"Sondre R\u00f8njom","year":"2017"},{"key":"ref5:guo2011photon","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-22792-9_13","article-title":"The PHOTON family of lightweight hash functions","author":"Jian Guo","year":"2011"},{"key":"ref6:guo2011led","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-23951-9_22","article-title":"The LED block cipher","author":"Jian Guo","year":"2011"},{"key":"ref7:SAC:WuWanWu12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-35999-6_23","article-title":"Recursive Diffusion Layers for (Lightweight) Block Ciphers\n  and Hash Functions","volume":"7707","author":"Shengbao Wu","year":"2013"},{"key":"ref8:berger2013construction","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-319-03515-4_18","article-title":"Construction of recursive MDS diffusion layers from\n  Gabidulin codes","author":"Thierry P Berger","year":"2013"},{"key":"ref9:augot2015direct","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46706-0_1","article-title":"Direct construction of recursive MDS diffusion layers using\n  shortened BCH codes","author":"Daniel Augot","year":"2014"},{"key":"ref10:cauchois2016direct","doi-asserted-by":"publisher","DOI":"10.13154\/TOSC.V2016.I2.80-98","article-title":"Direct construction of quasi-involutory recursive-like MDS\n  matrices from 2-cyclic codes","author":"Victor Cauchois","year":"2016","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"ref11:gupta2017towards","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/S10623-016-0261-0","article-title":"Towards a general construction of recursive MDS diffusion\n  layers","volume":"82","author":"Kishan Chand Gupta","year":"2017","journal-title":"Designs, Codes and Cryptography"},{"key":"ref12:toh2018lightweight","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-89339-6_4","article-title":"Lightweight MDS serial-type matrices with minimal fixed XOR\n  count","author":"Dylan Toh","year":"2018"},{"key":"ref13:light","doi-asserted-by":"publisher","first-page":"147","DOI":"10.13154\/tosc.v2019.i4.147-170","article-title":"Lightweight Iterative MDS Matrices: How Small Can We Go?","volume":"2019, Issue 4","author":"Shun Li","year":"2020","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"ref14:hadamardeqv","isbn-type":"print","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-48116-5_23","article-title":"Lightweight MDS Involution Matrices","author":"Siang Meng Sim","year":"2015","ISBN":"https:\/\/id.crossref.org\/isbn\/9783662481165"},{"key":"ref15:DBLP:conf\/crypto\/BeierleKL16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-662-53018-4_23","article-title":"Lightweight Multiplication in GF(2n) with Applications\n  to MDS Matrices","volume":"9814","author":"Christof Beierle","year":"2016"},{"key":"ref16:DBLP:conf\/fse\/LiuS16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-52993-5_6","article-title":"Lightweight MDS Generalized Circulant Matrices","volume":"9783","author":"Meicheng Liu","year":"2016"},{"key":"ref17:DBLP:conf\/fse\/LiW16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-52993-5_7","article-title":"On the Construction of Lightweight Circulant Involutory\n  MDS Matrices","volume":"9783","author":"Yongqiang Li","year":"2016"},{"key":"ref18:DBLP:conf\/africacrypt\/SarkarS16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-319-31517-1_9","article-title":"A Deeper Understanding of the XOR Count Distribution in\n  the Context of Lightweight Cryptography","volume":"9646","author":"Sumanta Sarkar","year":"2016"},{"key":"ref19:DBLP:journals\/tosc\/SarkarS16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.13154\/tosc.v2016.i1.95-113","article-title":"Lightweight Diffusion Layer: Importance of Toeplitz\n  Matrices","volume":"2016","author":"Sumanta Sarkar","year":"2016","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref20:DBLP:journals\/tosc\/LiW17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.13154\/tosc.v2017.i1.129-155","article-title":"Design of Lightweight Linear Diffusion Layers from Near-MDS\n  Matrices","volume":"2017","author":"Chaoyun Li","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref21:DBLP:conf\/acisp\/SarkarS17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-59870-3_1","article-title":"Analysis of Toeplitz MDS Matrices","volume":"10343","author":"Sumanta Sarkar","year":"2017"},{"key":"ref22:DBLP:journals\/tosc\/JeanPST17","doi-asserted-by":"publisher","first-page":"130","DOI":"10.13154\/tosc.v2017.i4.130-168","article-title":"Optimizing Implementations of Lightweight Building Blocks","volume":"2017","author":"J\u00e9r\u00e9my Jean","year":"2017","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref23:kranz2017shorter","doi-asserted-by":"publisher","first-page":"188","DOI":"10.13154\/TOSC.V2017.I4.188-211","article-title":"Shorter linear straight-line programs for MDS matrices","author":"Thorsten Kranz","year":"2017","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"ref24:DBLP:journals\/tosc\/ZhouWS18","doi-asserted-by":"publisher","first-page":"180","DOI":"10.13154\/tosc.v2018.i1.180-200","article-title":"On Efficient Constructions of Lightweight MDS Matrices","volume":"2018","author":"Lijing Zhou","year":"2018","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref25:DBLP:journals\/tosc\/DuvalL18","doi-asserted-by":"publisher","first-page":"48","DOI":"10.13154\/tosc.v2018.i2.48-78","article-title":"MDS Matrices with Lightweight Circuits","volume":"2018","author":"S\u00e9bastien Duval","year":"2018","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref26:li2019constructing","doi-asserted-by":"publisher","first-page":"84","DOI":"10.13154\/TOSC.V2019.I1.84-117","article-title":"Constructing low-latency involutory MDS matrices with\n  lightweight circuits","author":"Shun Li","year":"2019","journal-title":"IACR Transactions on Symmetric Cryptology"},{"key":"ref27:Anubis","volume-title":"The Anubis block cipher","author":"Paulo Barreto","year":"2000"},{"key":"ref28:hadamard","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1049\/iet-ifs.2017.0156","article-title":"Generalisation of Hadamard matrix to generate involutory MDS\n  matrices for lightweight cryptography","volume":"12","author":"Meltem Kurt Pehlivano\u011flu","year":"2018","journal-title":"IET Information Security"},{"key":"ref29:MacWilliams1977","volume-title":"The Theory of Error-Correcting Codes","author":"F. Jessie MacWilliams","year":"1977"},{"key":"ref30:AES","volume-title":"Advanced Encryption Standard (AES)","year":"2001"},{"key":"ref31:ToSC:XZLBZ20","doi-asserted-by":"publisher","first-page":"120","DOI":"10.13154\/tosc.v2020.i2.120-145","article-title":"Optimizing Implementations of Linear Layers","volume":"2020","author":"Zejun Xiang","year":"2020","journal-title":"IACR Trans. Symm. Cryptol.","ISSN":"https:\/\/id.crossref.org\/issn\/2519-173X","issn-type":"electronic"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T21:25:31Z","timestamp":1744147531000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/1\/37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,8]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,4,8]]}},"URL":"https:\/\/doi.org\/10.62056\/a6ksdk5vt","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,8]]},"assertion":[{"value":"2025-01-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-03-11","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-1-60"}}