{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T15:57:59Z","timestamp":1772467079403,"version":"3.50.1"},"reference-count":19,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&amp;D Program of China","award":["2020YFC1522900"],"award-info":[{"award-number":["2020YFC1522900"]}]},{"name":"National Key R&amp;D Program of China","award":["2020JDJQ0076"],"award-info":[{"award-number":["2020JDJQ0076"]}]},{"name":"National Key R&amp;D Program of China","award":["2021ZYD0011"],"award-info":[{"award-number":["2021ZYD0011"]}]},{"name":"Sichuan Science and Technology Program","award":["2020YFC1522900"],"award-info":[{"award-number":["2020YFC1522900"]}]},{"name":"Sichuan Science and Technology Program","award":["2020JDJQ0076"],"award-info":[{"award-number":["2020JDJQ0076"]}]},{"name":"Sichuan Science and Technology Program","award":["2021ZYD0011"],"award-info":[{"award-number":["2021ZYD0011"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Maximum distance separable (MDS) codes have the maximum branch number in cryptography, and they are generally used in diffusion layers of symmetric ciphers. The diffusion layer of the Advanced Encryption Standard (AES) uses the circulant MDS matrix with the row element of {2;3;1;1} in F28. It is the simplest MDS matrix in \u00a0F2n4, recorded as A=Circ(2;3;1;1). In this paper, we study the more extensive MDS constructions of A in F2n4. By transforming the element multiplication operation in the finite field into the bit-level operation, we propose a multivariable operation definition based on simple operations, such as cyclic shift, shift, and XOR. We apply this multivariable operation to more lightweight MDS constructions of A and discuss the classification of the MDS clusters. We also give an example of the MDS cluster of A. Without changing the structure, elements, and the implementation cost of the known MDS matrix, the number of existing MDS transformations is expanded to n2\/2 times that of its original. The constructions in this paper provide rich component materials for the design of lightweight cryptographic algorithms.<\/jats:p>","DOI":"10.3390\/info13070347","type":"journal-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T11:32:23Z","timestamp":1658143943000},"page":"347","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["More Constructions of Light MDS Transforms Based on Known MDS Circulant Matrices"],"prefix":"10.3390","volume":"13","author":[{"given":"Jin-Bo","family":"Wang","sequence":"first","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Institute of Southwestern Communication, Chengdu 610041, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You","family":"Wu","sequence":"additional","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Institute of Southwestern Communication, Chengdu 610041, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Science and Technology on Communication Security Laboratory, Institute of Southwestern Communication, Chengdu 610041, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Daemen, J., and Rijmen, V. (2002). The Design of Rijndael: AES. The Advanced Encryption Standard. Information Security and Cryptography, Springer.","DOI":"10.1007\/978-3-662-04722-4"},{"key":"ref_3","unstructured":"(2016, November 18). Specification of SMS4, Block Cipher for WLAN Products-SMS4 (In Chinese) [EB\/OL], Available online: https:\/\/sca.gov.cn\/sca\/c100061\/201611\/1002423\/files\/330480f731f64e1ea75138211ea0dc27.pdf,."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"2098","DOI":"10.1109\/TC.2014.2346180","article-title":"On compact cauchy matrices for substitution-permutation networks","volume":"64","author":"Cui","year":"2015","journal-title":"IEEE Trans. Comput."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10623-018-0582-2","article-title":"Almost involutory recursive MDS diffusion layers","volume":"87","author":"Gupta","year":"2019","journal-title":"Des. Codes Cryptogr."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.ipl.2019.02.013","article-title":"A new matrix form to generate all 3 \u00d7 3 involutory MDS matrices over","volume":"147","author":"Akleylek","year":"2019","journal-title":"Inf. Processing Lett."},{"key":"ref_7","first-page":"121","article-title":"On the Constructions of Lightweight Circulant Involutory MDS Matrices","volume":"Volume 5","author":"Li","year":"2016","journal-title":"Proceedings of the Fast Software Encryption\u201423rd International Conference, FSE 2016, LNCS 9783"},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Liu, M., and Sim, S.M. (2016, January 20\u201323). Lightweight MDS generalized circulant matrices. Proceedings of the Fast Software Encryption 23rd International Conference. FSE 2016, Bochum, Germany. Revised Selected Papers.","DOI":"10.1007\/978-3-662-52993-5_6"},{"key":"ref_9","first-page":"653","article-title":"Design and Analysis of Lightweight Linear MDS Transformation","volume":"51","author":"Dong","year":"2018","journal-title":"Commun. Technol."},{"key":"ref_10","first-page":"306","article-title":"The optimal permutation in cryptography based on cyclic-shift linear transform","volume":"c2007","author":"Wang","year":"2007","journal-title":"China Crypt."},{"key":"ref_11","first-page":"48","article-title":"MDS Matrices with Lightweight Circuits. IACR Trans","volume":"2018","year":"2018","journal-title":"Symmetric Cryptol."},{"key":"#cr-split#-ref_12.1","unstructured":"Christof, B., Thorsten, K., and Gregor, L. (2016). Lightweight Multiplication in GF"},{"key":"#cr-split#-ref_12.2","unstructured":"(2n) with Applications to MDS Matrices, Springer. CRYPTO 2016. LNCS 9814."},{"key":"ref_13","unstructured":"Roy, B., and Meier, W. (2014). Improving Immunity of Feistel Ciphers against Differential Cryptanalysis by Using Multiple MDS Matrices, Springer. FSE 2014, LNCS 3017."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"120","DOI":"10.46586\/tosc.v2020.i2.120-145","article-title":"Optimizing Implementations of Linear Layers","volume":"2","author":"Xiang","year":"2020","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Lin, D., Xiang, Z., Zeng, X., and Zhang, S. (2021, January 17\u201320). A Framework to Optimize Implementations of Matrices. Proceedings of the CT-RSA 2021: Cryptographers\u2019 Track at the RSA Conference 2021, San Francisco, CA, USA.","DOI":"10.1007\/978-3-030-75539-3_25"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1515\/gcc-2019-2011","article-title":"Randomized Nonlinear Software oriented MDS Diffusion Layers","volume":"11","author":"Shamsabad","year":"2019","journal-title":"Groups Complex. Cryptol."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1515\/gcc-2019-2011","article-title":"A Family of Nonlinear MDS Diffusion Layers","volume":"11","author":"Shanmsabad","year":"2019","journal-title":"Groups Complex. Cryptol."},{"key":"ref_18","unstructured":"Wu, Y., Dong, X.-F., Wang, J.-B., and Zhang, W.-Z. (2021\u20141, January 29). Construction of MDS Matrices Based on the Primitive Elements of the Finite Field. Proceedings of the 2021 International Conference on Networking and Network Applications (NaNA), Lijiang, China."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/7\/347\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:52:42Z","timestamp":1760140362000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/7\/347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":19,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["info13070347"],"URL":"https:\/\/doi.org\/10.3390\/info13070347","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,18]]}}}