{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T10:10:46Z","timestamp":1772014246690,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T00:00:00Z","timestamp":1732147200000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s12095-024-00756-5","type":"journal-article","created":{"date-parts":[[2024,11,21]],"date-time":"2024-11-21T04:56:55Z","timestamp":1732165015000},"page":"5-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the counting of involutory MDS matrices"],"prefix":"10.1007","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4643-5117","authenticated-orcid":false,"given":"Susanta","family":"Samanta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,21]]},"reference":[{"issue":"3","key":"756_CR1","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s11424-019-8125-0","volume":"33","author":"Jian Bai","year":"2020","unstructured":"Bai, Jian, Sun, Yao, Wang, Dingkang: On the Construction of Involutory MDS matrices over $$\\mathbb{F} _{2^m}$$. J. Syst. Sci. Complexity 33(3), 836\u2013848 (Jun2020)","journal-title":"J. Syst. Sci. Complexity"},{"key":"756_CR2","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-662-48800-3_17","volume-title":"Advances in Cryptology - ASIACRYPT 2015","author":"S Banik","year":"2015","unstructured":"Banik, S., Bogdanov, A., Isobe, T., Shibutani, K., Hiwatari, H., Akishita, T., Regazzoni, F.: Midori: A Block Cipher for Low Energy. In: Iwata, T., Cheon, J.H. (eds.) Advances in Cryptology - ASIACRYPT 2015, pp. 411\u2013436. Heidelberg, Springer, Berlin Heidelberg, Berlin (2015)"},{"key":"756_CR3","unstructured":"Barreto, P.\u00a0S.L.M., Rijmen, V.: The ANUBIS Block Cipher. Submission to the NESSIE Project, 2000., (2000)"},{"key":"756_CR4","unstructured":"Barreto, P.\u00a0S.L.M., Rijmen, V.: The KHAZAD Legacy-Level Block Cipher. Submission to the NESSIE Project, 2000., (2000)"},{"key":"756_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-662-53008-5_5","volume-title":"Advances in Cryptology - CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., Jean, J., K\u00f6lbl, S., Leander, G., Moradi, A., Peyrin, T., Sasaki, Y., Sasdrich, P., Sim, S.M.: The SKINNY family of block ciphers and its low-latency variant MANTIS. In: Robshaw, M., Katz, J. (eds.) Advances in Cryptology - CRYPTO 2016, pp. 123\u2013153. Heidelberg, Springer, Berlin Heidelberg, Berlin (2016)"},{"key":"756_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael: AES - The Advanced Encryption Standard","author":"Joan Daemen","year":"2002","unstructured":"Daemen, Joan, Rijmen, Vincent: The Design of Rijndael: AES - The Advanced Encryption Standard. Springer, Information Security and Cryptography (2002)"},{"issue":"4","key":"756_CR7","doi-asserted-by":"publisher","first-page":"779","DOI":"10.3934\/amc.2019045","volume":"13","author":"KC Gupta","year":"2019","unstructured":"Gupta, K.C., Pandey, S.K., Ray, I.G., Samanta, S.: Cryptographically significant MDS matrices over finite fields: A brief survey and some generalized results. Adv. Math. Commun. 13(4), 779\u2013843 (2019)","journal-title":"Adv. Math. Commun."},{"issue":"2","key":"756_CR8","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s12095-023-00667-x","volume":"16","author":"KC Gupta","year":"2023","unstructured":"Gupta, K.C., Pandey, S.K., Samanta, S.: On the construction of near-MDS matrices. Cryptograph. Commun. 16(2), 249\u2013283 (2023)","journal-title":"Cryptograph. Commun."},{"key":"756_CR9","unstructured":"Gupta, K.\u00a0C., Pandey, S.\u00a0K., Samanta, S.: On the Direct Construction of MDS and Near-MDS Matrices. (2023). arXiv:2306.12848, https:\/\/arxiv.org\/abs\/2306.12848"},{"key":"756_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s12095-014-0116-3","volume":"7","author":"Kishan Chand Gupta and Indranil Ghosh Ray","year":"2015","unstructured":"Kishan Chand Gupta and Indranil Ghosh Ray: Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications. Cryptogr. Commun. 7, 257\u2013287 (2015)","journal-title":"Cryptogr. Commun."},{"key":"756_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ipl.2019.02.013","volume":"147","author":"GG G\u00fczel","year":"2019","unstructured":"G\u00fczel, G.G., Sakall\u0131, M.T., Akleylek, S., Rijmen, V., \u00c7engellenmi\u015f, Y.: A new matrix form to generate all $$3\\times 3$$ involutory MDS matrices over $$\\mathbb{F} _{2^m}$$. Inf. Process. Lett. 147, 61\u201368 (2019)","journal-title":"Inf. Process. Lett."},{"key":"756_CR12","first-page":"84","volume-title":"Selected Areas in Cryptography","author":"P Junod","year":"2005","unstructured":"Junod, P., Vaudenay, S.: Perfect diffusion primitives for block ciphers. In: Handschuh, H., Hasan, M.A. (eds.) Selected Areas in Cryptography, pp. 84\u201399. Heidelberg, Springer, Berlin Heidelberg, Berlin (2005)"},{"key":"756_CR13","doi-asserted-by":"crossref","unstructured":"Kumar, Y., Mishra, P.\u00a0R., Samanta, S., Gaur, A.: A systematic construction approach for all $$4\\times 4$$ involutory MDS matrices. J. Appl. Math. Comput. (2024)","DOI":"10.1007\/s12190-024-02142-z"},{"key":"756_CR14","doi-asserted-by":"crossref","unstructured":"Kumar, Y., Mishra, P.\u00a0R., Samanta, S., Gupta, K.\u00a0C., Gaur, A.: Construction of all MDS and involutory MDS matrices. Adv. Math. Commun. (2024)","DOI":"10.3934\/amc.2024033"},{"key":"756_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-24633-6_11","volume-title":"Finite Fields and Applications","author":"J Lacan","year":"2004","unstructured":"Lacan, J., Fimes, J.: A construction of matrices with no singular square submatrices. In: Mullen, G.L., Poli, A., Stichtenoth, H. (eds.) Finite Fields and Applications, pp. 145\u2013147. Heidelberg, Springer, Berlin Heidelberg, Berlin (2004)"},{"issue":"1","key":"756_CR16","doi-asserted-by":"publisher","first-page":"129","DOI":"10.46586\/tosc.v2017.i1.129-155","volume":"2017","author":"Chaoyun Li","year":"2017","unstructured":"Li, Chaoyun, Wang, Qingju: Design of lightweight linear diffusion layers from near-mds matrices. IACR Trans Symm Cryptol 2017(1), 129\u2013155 (2017)","journal-title":"IACR Trans Symm Cryptol"},{"key":"756_CR17","doi-asserted-by":"publisher","first-page":"84","DOI":"10.46586\/tosc.v2019.i1.84-117","volume":"03","author":"S Li","year":"2019","unstructured":"Li, S., Sun, S., Li, C., Wei, Z., Hu, L.: Constructing low-latency involutory mds matrices with lightweight circuits. IACR Trans. Symm. Cryptol. 03, 84\u2013117 (2019)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"756_CR18","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-662-52993-5_6","volume-title":"Fast Software Encryption","author":"M Liu","year":"2016","unstructured":"Liu, M., Sim, S.M.: Lightweight MDS generalized circulant matrices. In: Peyrin, T. (ed.) Fast Software Encryption, pp. 101\u2013120. Heidelberg, Springer, Berlin Heidelberg, Berlin (2016)"},{"key":"756_CR19","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland Publishing Co., Amsterdam-New York-Oxford (1977)"},{"key":"756_CR20","doi-asserted-by":"publisher","first-page":"32708","DOI":"10.1109\/ACCESS.2023.3262924","volume":"11","author":"MK Pehlivano\u011flu","year":"2023","unstructured":"Pehlivano\u011flu, M.K., Sakalli, F.B., Akleylek, S., Sakalli, M.T.: On the construction of new lightweight involutory MDS matrices in generalized subfield form. IEEE Access 11, 32708\u201332715 (2023)","journal-title":"IEEE Access"},{"issue":"4","key":"756_CR21","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1049\/iet-ifs.2017.0156","volume":"12","author":"MK Pehlivano\u011flu","year":"2018","unstructured":"Pehlivano\u011flu, M.K., Sakall\u0131, M.T., Akleylek, S., Duru, N., Rijmen, V.: Generalisation of Hadamard matrix to generate involutory MDS matrices for lightweight cryptography. IET Inf. Secur. 12(4), 348\u2013355 (2018)","journal-title":"IET Inf. Secur."},{"issue":"6","key":"756_CR22","doi-asserted-by":"publisher","first-page":"1314","DOI":"10.1109\/18.45291","volume":"35","author":"Ron M Roth","year":"1989","unstructured":"Roth, Ron M., Lempel, Abraham: On MDS codes via Cauchy matrices. IEEE Trans. Inf. Theory 35(6), 1314\u20131319 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"756_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10623-011-9578-x","volume":"64","author":"M Sajadieh","year":"2012","unstructured":"Sajadieh, M., Dakhilalian, M., Mala, H., Omoomi, B.: On construction of involutory MDS matrices from Vandermonde matrices in $$GF(2^q)$$. Designs, Codes and Cryptography 64(3), 287\u2013308 (2012)","journal-title":"Designs, Codes and Cryptography"},{"key":"756_CR24","first-page":"94","volume":"9","author":"FB Sakalli","year":"2020","unstructured":"Sakalli, F.B., Aydin, O., Tuncay, G., Pehlivanoglu, M.K., Guzel, G.G., Sakalli, M.T.: On lightweight $$4 \\times 4$$ MDS matrices over binary field extensions. Int. J. Inf. Secur. Sci. 9, 94\u2013103 (2020)","journal-title":"Int. J. Inf. Secur. Sci."},{"issue":"1","key":"756_CR25","doi-asserted-by":"publisher","first-page":"275","DOI":"10.3906\/elk-1906-151","volume":"28","author":"MT Sakalli","year":"2020","unstructured":"Sakalli, M.T., Akleylek, S., Akkanat, K., Rijmen, V.: On the automorphisms and isomorphisms of MDS matrices and their efficient implementations. Turkish J. Electr. Eng. Comput. Sci. 28(1), 275\u2013287 (2020)","journal-title":"Turkish J. Electr. Eng. Comput. Sci."},{"issue":"4","key":"756_CR26","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. The Bell Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"The Bell Syst. Tech. J."},{"key":"756_CR27","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-540-74619-5_12","volume-title":"Fast Software Encryption","author":"T Shirai","year":"2007","unstructured":"Shirai, T., Shibutani, K., Akishita, T., Moriai, S., Iwata, T.: The 128-bit Blockcipher CLEFIA (Extended Abstract). In: Biryukov, A. (ed.) Fast Software Encryption, pp. 181\u2013195. Heidelberg, Springer, Berlin Heidelberg, Berlin (2007)"},{"key":"756_CR28","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-48116-5_23","volume-title":"Fast Software Encryption","author":"SM Sim","year":"2015","unstructured":"Sim, S.M., Khoo, K., Oggier, F., Peyrin, T.: Lightweight MDS involution matrices. In: Leander, G. (ed.) Fast Software Encryption, pp. 471\u2013493. Heidelberg, Springer, Berlin Heidelberg, Berlin (2015)"},{"key":"756_CR29","doi-asserted-by":"publisher","first-page":"e1577","DOI":"10.7717\/peerj-cs.1577","volume":"9","author":"G Tuncay","year":"2023","unstructured":"Tuncay, G., Sakalli, F.B., Pehlivanoglu, M.K., Yilmazg\u00fc\u00e7, G.G., Akleylek, S., Sakalli, M.T.: A new hybrid method combining search and direct based construction ideas to generate all $$4\\times 4$$ involutory maximum distance separable (MDS) matrices over binary field extensions. PeerJ Comput. Sci. 9, e1577 (2023)","journal-title":"PeerJ Comput. Sci."},{"key":"756_CR30","first-page":"289","volume":"79","author":"G Viswanath","year":"2006","unstructured":"Viswanath, G., Rajan, B.S.: A Matrix Characterization of Near-MDS codes. Ars Comb. 79, 289\u2013294 (2006)","journal-title":"Ars Comb."},{"issue":"4","key":"756_CR31","doi-asserted-by":"publisher","first-page":"845","DOI":"10.3934\/amc.2021025","volume":"17","author":"Shi Wang","year":"2023","unstructured":"Wang, Shi, Li, Yongqiang, Tian, Shizhu, Zeng, Xiangyong: Four by four MDS matrices with the fewest XOR gates based on words. Adv. Math. Commun. 17(4), 845\u2013872 (2023)","journal-title":"Adv. Math. Commun."},{"issue":"07","key":"756_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10623-021-00879-3","volume":"89","author":"Y Yang","year":"2021","unstructured":"Yang, Y., Zeng, X., Wang, S.: Construction of lightweight involutory MDS matrices. Designs, Codes and Cryptography 89(07), 1\u201331 (2021)","journal-title":"Designs, Codes and Cryptography"},{"key":"756_CR33","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-031-61489-7_8","volume-title":"Applied Cryptography and Network Security Workshops","author":"Z Zhao","year":"2024","unstructured":"Zhao, Z., Liu, Q., Fan, Y., Wang, M.: Construction of $$4\\times 4$$ lightweight low-latency involutory MDS matrices. In: Andreoni, M. (ed.) Applied Cryptography and Network Security Workshops, pp. 119\u2013140. Cham, Springer Nature Switzerland (2024)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00756-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00756-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00756-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T09:19:57Z","timestamp":1772011197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00756-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,21]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["756"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00756-5","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,21]]},"assertion":[{"value":"1 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 November 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}