{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:30:45Z","timestamp":1757313045017,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:00:00Z","timestamp":1692144000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T00:00:00Z","timestamp":1692144000000},"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":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,10]]},"DOI":"10.1007\/s12190-023-01907-2","type":"journal-article","created":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T15:01:43Z","timestamp":1692198103000},"page":"3871-3891","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Introducing a new connection between the entries of MDS matrices constructed by generalized Cauchy matrices in $$GF(2^q)$$"],"prefix":"10.1007","volume":"69","author":[{"given":"Narjes","family":"Mohsenifar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1445-1593","authenticated-orcid":false,"given":"Mahdi","family":"Sajadieh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"1907_CR1","doi-asserted-by":"crossref","unstructured":"Banik, S., Funabiki, Y., Isobe, T.: More results on shortest linear programs. In: International Workshop on Security, pp. 109\u2013128. Springer (2019)","DOI":"10.1007\/978-3-030-26834-3_7"},{"key":"1907_CR2","unstructured":"Barreto, P.S.L.M.: The Anubis Block Cipher. NESSIE (2000)"},{"key":"1907_CR3","first-page":"106","volume":"97","author":"PSLM Barreto","year":"2000","unstructured":"Barreto, P.S.L.M., Rijmen, V.: The Khazad legacy-level block cipher. NESSIE 97, 106 (2000)","journal-title":"NESSIE"},{"key":"1907_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.46586\/tosc.v2022.i4.243-265","volume":"20","author":"C Beierle","year":"2022","unstructured":"Beierle, C., Felke, P., Leander, G., R\u00f8njom, S.: Decomposing linear layers. IACR Trans. Symmetric Cryptol. 20, 243\u2013265 (2022)","journal-title":"IACR Trans. Symmetric Cryptol."},{"issue":"2","key":"1907_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"26","author":"J Boyar","year":"2013","unstructured":"Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptol. 26(2), 280\u2013312 (2013)","journal-title":"J. Cryptol."},{"issue":"2","key":"1907_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10623-018-0520-3","volume":"87","author":"V Cauchois","year":"2019","unstructured":"Cauchois, V., Loidreau, P.: On circulant involutory MDS matrices. Des. Codes Crypt. 87(2), 249\u2013260 (2019)","journal-title":"Des. Codes Crypt."},{"key":"1907_CR7","doi-asserted-by":"crossref","unstructured":"Chand Gupta, K., Ghosh Ray, I.: On constructions of involutory MDS matrices. In: International Conference on Cryptology in Africa, pp. 43\u201360. Springer (2013)","DOI":"10.1007\/978-3-642-38553-7_3"},{"key":"1907_CR8","doi-asserted-by":"crossref","unstructured":"Chand Gupta, K., Ghosh Ray, I.: On constructions of circulant MDS matrices for lightweight cryptography. In: International Conference on Information Security Practice and Experience, pp. 564\u2013576. Springer (2014)","DOI":"10.1007\/978-3-319-06320-1_41"},{"issue":"7","key":"1907_CR9","doi-asserted-by":"publisher","first-page":"2098","DOI":"10.1109\/TC.2014.2346180","volume":"64","author":"T Cui","year":"2014","unstructured":"Cui, T., Jin, C., Kong, Z.: On compact Cauchy matrices for substitution-permutation networks. IEEE Trans. Comput. 64(7), 2098\u20132102 (2014)","journal-title":"IEEE Trans. Comput."},{"key":"1907_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael, vol. 2. Springer (2002)"},{"issue":"2","key":"1907_CR11","doi-asserted-by":"publisher","first-page":"48","DOI":"10.46586\/tosc.v2018.i2.48-78","volume":"2018","author":"S Duval","year":"2018","unstructured":"Duval, S., Leurent, G.: MDS matrices with lightweight circuits. IACR Trans. Symmetric Cryptol. 2018(2), 48\u201378 (2018)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1907_CR12","doi-asserted-by":"crossref","unstructured":"Guo, J., Peyrin, T., Poschmann, A.: The photon family of lightweight hash functions. In: Annual Cryptology Conference, pp. 222\u2013239. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_13"},{"key":"1907_CR13","first-page":"4","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 (2019)","journal-title":"Adv. Math. Commun."},{"issue":"1","key":"1907_CR14","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10623-016-0233-4","volume":"82","author":"KC Gupta","year":"2017","unstructured":"Gupta, K.C., Pandey, S.K., Venkateswarlu, A.: On the direct construction of recursive MDS matrices. Des. Codes Crypt. 82(1), 77\u201394 (2017)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"1907_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10623-016-0261-0","volume":"82","author":"KC Gupta","year":"2017","unstructured":"Gupta, K.C., Pandey, S.K., Venkateswarlu, A.: Towards a general construction of recursive MDS diffusion layers. Des. Codes Crypt. 82(1), 179\u2013195 (2017)","journal-title":"Des. Codes Crypt."},{"key":"1907_CR16","doi-asserted-by":"crossref","unstructured":"Gupta, K.C., Ray, I.G.: On constructions of MDS matrices from companion matrices for lightweight cryptography. In: International Conference on Availability, Reliability, and Security, pp. 29\u201343. Springer (2013)","DOI":"10.1007\/978-3-642-40588-4_3"},{"issue":"2","key":"1907_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s12095-014-0116-3","volume":"7","author":"KC Gupta","year":"2015","unstructured":"Gupta, K.C., Ray, I.G.: Cryptographically significant MDS matrices based on circulant and circulant-like matrices for lightweight applications. Cryptogr. Commun. 7(2), 257\u2013287 (2015)","journal-title":"Cryptogr. Commun."},{"key":"1907_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ipl.2019.02.013","volume":"147","author":"GG Guzel","year":"2019","unstructured":"Guzel, G.G., Sakalli, M.T., Akleylek, S., Rijmen, V., Cengellenmis, Y.: A new matrix form to generate all $$3\\times 3$$ involutory MDS matrices over f2m. Inf. Process. Lett. 147, 61\u201368 (2019)","journal-title":"Inf. Process. Lett."},{"key":"1907_CR19","doi-asserted-by":"crossref","unstructured":"Junod, P., Vaudenay, S.: Fox: a new family of block ciphers. In: International Workshop on Selected Areas in Cryptography, pp. 114\u2013129. Springer (2004)","DOI":"10.1007\/978-3-540-30564-4_8"},{"key":"1907_CR20","doi-asserted-by":"publisher","first-page":"188","DOI":"10.46586\/tosc.v2017.i4.188-211","volume":"18","author":"T Kranz","year":"2017","unstructured":"Kranz, T., Leander, G., Stoffelen, K., Wiemer, F.: Shorter linear straight-line programs for MDS matrices. IACR Trans. Symmetric Cryptol. 18, 188\u2013211 (2017)","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"1907_CR21","doi-asserted-by":"crossref","unstructured":"Li, S., Sun, S., Shi, D., Li, C., Hu, L.: Lightweight iterative MDS matrices: how small can we go? Cryptology. ePrint Archive (2019)","DOI":"10.46586\/tosc.v2019.i4.147-170"},{"issue":"4","key":"1907_CR22","doi-asserted-by":"publisher","first-page":"589","DOI":"10.3934\/amc.2020084","volume":"15","author":"M Mousavi","year":"2021","unstructured":"Mousavi, M., Zaghian, A., Esmaeili, M.: Involutory-multiple-lightweight MDS matrices based on Cauchy-type matrices. Adv. Math. Commun. 15(4), 589 (2021)","journal-title":"Adv. Math. Commun."},{"key":"1907_CR23","doi-asserted-by":"crossref","unstructured":"Paar, C.: Optimized arithmetic for Reed\u2013Solomon encoders. In: Proceedings of IEEE International Symposium on Information Theory, p. 250. IEEE (1997)","DOI":"10.1109\/ISIT.1997.613165"},{"key":"1907_CR24","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., Sakall\u0131, F.B., Akleylek, S., Sakall\u0131, 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":"1907_CR25","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":"1907_CR26","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1109\/TIT.1985.1057113","volume":"31","author":"RM Roth","year":"1985","unstructured":"Roth, R.M., Seroussi, G.: On generator matrices of MDS codes (corresp.). IEEE Trans. Inf. Theory 31(6), 826\u2013830 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1907_CR27","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$$). Des. Codes Crypt. 64(3), 287\u2013308 (2012)","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"1907_CR28","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/s00145-013-9163-8","volume":"28","author":"M Sajadieh","year":"2015","unstructured":"Sajadieh, M., Dakhilalian, M., Mala, H., Sepehrdad, P.: Efficient recursive diffusion layers for block ciphers and hash functions. J. Cryptol. 28(2), 240\u2013256 (2015)","journal-title":"J. Cryptol."},{"issue":"7","key":"1907_CR29","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1007\/s10623-021-00876-6","volume":"89","author":"M Sajadieh","year":"2021","unstructured":"Sajadieh, M., Mousavi, M.: Construction of MDS matrices from generalized Feistel structures. Des. Codes Crypt. 89(7), 1433\u20131452 (2021)","journal-title":"Des. Codes Crypt."},{"key":"1907_CR30","first-page":"203","volume":"32","author":"QQ Tan","year":"2020","unstructured":"Tan, Q.Q., Peyrin, T.: Improved heuristics for short linear programs. IACR Trans. Cryptogr. Hardw. Embed. Syst. 32, 203\u2013230 (2020)","journal-title":"IACR Trans. Cryptogr. Hardw. Embed. Syst."},{"key":"1907_CR31","doi-asserted-by":"publisher","first-page":"120","DOI":"10.46586\/tosc.v2020.i2.120-145","volume":"8","author":"Z Xiang","year":"2020","unstructured":"Xiang, Z., Zeng, X., Lin, D., Bao, Z., Zhang, S.: Optimizing implementations of linear layers. IACR Trans. Symmetric Cryptol. 8, 120\u2013145 (2020)","journal-title":"IACR Trans. Symmetric Cryptol."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01907-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01907-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01907-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T07:02:45Z","timestamp":1729926165000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01907-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,16]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["1907"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01907-2","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,8,16]]},"assertion":[{"value":"13 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 July 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 August 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2023","order":4,"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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}