{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:12:46Z","timestamp":1743066766341,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":27,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811668890"},{"type":"electronic","value":"9789811668906"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-6890-6_53","type":"book-chapter","created":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:02:28Z","timestamp":1646488948000},"page":"725-736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Construction of $$4 \\times 4$$ Lightweight Involutory MDS Matrices Over $$\\mathbb {F}_{2^{8}}$$"],"prefix":"10.1007","author":[{"given":"Meltem","family":"Kurt Pehlivano\u011flu","sequence":"first","affiliation":[]},{"given":"Fatma","family":"B\u00fcy\u00fcksara\u00e7o\u011flu Sakalli","sequence":"additional","affiliation":[]},{"given":"Sedat","family":"Akleylek","sequence":"additional","affiliation":[]},{"given":"Muharrem","family":"Tolga Sakalli","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,6]]},"reference":[{"key":"53_CR1","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 CE (1949) Communication theory of secrecy systems. Bell Syst Tech J 28:656\u2013715","journal-title":"Bell Syst Tech J"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Daemen J, Rijmen V (2002) The design of Rijndael: AES- the advanced encryption standard. In: Information security and cryptography. 1st edn. Springer","DOI":"10.1007\/978-3-662-04722-4_1"},{"key":"53_CR3","doi-asserted-by":"publisher","first-page":"84","DOI":"10.46586\/tosc.v2019.i1.84-117","volume":"1","author":"S Li","year":"2019","unstructured":"Li S, Sun S, Li C, Wei Z, Hu L (2019) Constructing low-latency involutory MDS matrices with lightweight circuits. IACR Trans Symmetric Cryptol 1:84\u2013117","journal-title":"IACR Trans Symmetric Cryptol"},{"key":"53_CR4","doi-asserted-by":"publisher","unstructured":"Sim SM, Khoo K, Oggier F, Peyrin T (2015) Lightweight MDS involution matrices. In: Leander G (ed) Fast software encryption FSE 2015, LNCS, vol 9054. Springer, Heidelberg, pp 471\u2013493. https:\/\/doi.org\/10.1007\/978-3-662-48116-5_23","DOI":"10.1007\/978-3-662-48116-5_23"},{"key":"53_CR5","unstructured":"Youssef AM, Mister S, Tavares SE (1997) On the design of linear transformation for substitution permutation encryption networks. In: Selected areas in cryptography (SAC). Ottawa Ontario, Canada, pp 40\u201348"},{"key":"53_CR6","doi-asserted-by":"publisher","unstructured":"Guo J, Peyrin T, Poschmann A (2011) The PHOTON family of lightweight hash functions. In: Rogaway P (ed) Advances in cryptology\u2014CRYPTO 2011. CRYPTO 2011. LNCS, vol 6841. Springer, Heidelberg, pp 222\u2013239. https:\/\/doi.org\/10.1007\/978-3-642-22792-9_13","DOI":"10.1007\/978-3-642-22792-9_13"},{"issue":"9","key":"53_CR7","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1109\/LCOMM.2004.833807","volume":"8","author":"J Lacan","year":"2004","unstructured":"Lacan J, Fimes J (2004) Systematic MDS erasure codes based on Vandermonde matrices. IEEE Commun Lett 8(9):570\u2013572","journal-title":"IEEE Commun Lett"},{"key":"53_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.ipl.2019.02.013","volume":"147","author":"GG Guzel","year":"2019","unstructured":"Guzel GG, Sakalli MT, Akleylek S, Rijmen V, Cengellenmis Y (2019) A new matrix form to generate all $$3 \\times 3$$ involutory MDS matrices over $$\\mathbb{F}_{2^{m}}$$. Inf Process Lett 147:61\u201368","journal-title":"Inf Process Lett"},{"key":"53_CR9","doi-asserted-by":"publisher","unstructured":"Sajadieh M, Dakhilalian M, Mala H, Sepehrdad P (2012) Recursive diffusion layers for block ciphers and hash functions. In: Canteaut A (ed) Fast software encryption. FSE 2012. LNCS, vol 7549. Springer, Heidelberg, pp 385\u2013401. https:\/\/doi.org\/10.1007\/978-3-642-34047-5_22","DOI":"10.1007\/978-3-642-34047-5_22"},{"key":"53_CR10","doi-asserted-by":"publisher","first-page":"779","DOI":"10.3934\/amc.2019045","volume":"13","author":"KC Gupta","year":"2019","unstructured":"Gupta KC, Pandey SK, Ray IG, Samanta S (2019) Cryptographically significant MDS matrices over finite fields: a brief survey and some generalized results. Adv Math Commun 13:779\u2013843","journal-title":"Adv Math Commun"},{"issue":"4","key":"53_CR11","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1049\/iet-ifs.2017.0156","volume":"12","author":"MK Pehlivanoglu","year":"2018","unstructured":"Pehlivanoglu MK, Sakalli MT, Akleylek S, Duru N, Rijmen V (2018) Generalisation of Hadamard matrix to generate involutory MDS matrices for lightweight cryprography. IET Inf Secur 12(4):348\u2013355","journal-title":"IET Inf Secur"},{"issue":"1","key":"53_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.3906\/elk-1906-151","volume":"28","author":"MT Sakalli","year":"2020","unstructured":"Sakalli MT, Akleylek S, Akkanat K, Rijmen V (2020) On the automorphisms and isomorphisms of MDS matrices and their efficient implementations. Turk J Electr Comput Sci 28(1):275\u2013287","journal-title":"Turk J Electr Comput Sci"},{"key":"53_CR13","doi-asserted-by":"publisher","unstructured":"Khoo K, Peyrin T, Poschmann AY, Yap H (2014) FOAM: searching for hardware-optimal SPN structures and components with a fair comparison. In: Batina L, Robshaw M (eds) Cryptographic hardware and embedded systems\u2014CHES 2014. CHES 2014. Lecture notes in computer science, vol 8731. Springer, Heidelberg, pp 433\u2013450. https:\/\/doi.org\/10.1007\/978-3-662-44709-3_24","DOI":"10.1007\/978-3-662-44709-3_24"},{"key":"53_CR14","doi-asserted-by":"crossref","unstructured":"Boyar J, Find MG, Peralta R (2019) Small low-depth circuits for cryptographic application. Cryptogr Commun 11(109)","DOI":"10.1007\/s12095-018-0296-3"},{"key":"53_CR15","doi-asserted-by":"publisher","unstructured":"Beierle C, Kranz T, Leander G (2016) Lightweight multiplication in $$GF(2^{n})$$ with applications to MDS matrices. In: Robshaw M, Katz J (eds) Advances in cryptology\u2014CRYPTO 2016. CRYPTO 2016. Lecture notes in computer science, vol 9814. Springer, Heidelberg, pp 625\u2013653. https:\/\/doi.org\/10.1007\/978-3-662-53018-4_23","DOI":"10.1007\/978-3-662-53018-4_23"},{"key":"53_CR16","doi-asserted-by":"publisher","unstructured":"Liu M, Sim SM (2016) Lightweight MDS generalized circulant matrices. In: Peyrin T (ed) Fast software encryption. FSE 2016. Lecture notes in computer science, vol 9783. Springer, Berlin, Heidelberg, pp 101\u2013120. https:\/\/doi.org\/10.1007\/978-3-662-52993-5_6","DOI":"10.1007\/978-3-662-52993-5_6"},{"issue":"1","key":"53_CR17","doi-asserted-by":"publisher","first-page":"129","DOI":"10.46586\/tosc.v2017.i1.129-155","volume":"2017","author":"C Li","year":"2017","unstructured":"Li C, Wang Q (2017) Design of lightweight linear diffusion layers from near-MDS matrices. IACR Trans Symmetric Cryptol 2017(1):129\u2013155","journal-title":"IACR Trans Symmetric Cryptol"},{"issue":"1","key":"53_CR18","doi-asserted-by":"publisher","first-page":"180","DOI":"10.46586\/tosc.v2018.i1.180-200","volume":"2018","author":"L Zhou","year":"2018","unstructured":"Zhou L, Wang L, Sun Y (2018) On efficient constructions of lightweight MDS matrices. IACR Trans Symmetric Cryptol 2018(1):180\u2013200","journal-title":"IACR Trans Symmetric Cryptol"},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Paar C (1997) Optimized arithmetic for reed-solomon encoders. In: Proceedings of IEEE international symposium on information theory, p 250","DOI":"10.1109\/ISIT.1997.613165"},{"key":"53_CR20","doi-asserted-by":"publisher","unstructured":"Boyar J, Peralta R (2010) A new combinational logic minimization technique with applications to cryptology. In: Festa P (ed) Experimental algorithms. SEA 2010. LNCS, vol 6049. Springer, Heidelberg, pp 178\u2013189. https:\/\/doi.org\/10.1007\/978-3-642-13193-6_16","DOI":"10.1007\/978-3-642-13193-6_16"},{"key":"53_CR21","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 (2013) Logic minimization techniques with applications to cryptology. J Cryptol 26:280\u2013312","journal-title":"J Cryptol"},{"issue":"1","key":"53_CR22","doi-asserted-by":"publisher","first-page":"84","DOI":"10.46586\/tosc.v2019.i1.84-117","volume":"2019","author":"S Li","year":"2019","unstructured":"Li S, Sun S, Li C, Wei Z, Hu L (2019) Constructing low-latency involutory MDS matrices with lightweight circuits. IACR Trans Symmetric Cryptol 2019(1):84\u2013117","journal-title":"IACR Trans Symmetric Cryptol"},{"issue":"2","key":"53_CR23","first-page":"94","volume":"9","author":"FB Sakalli","year":"2020","unstructured":"Sakalli FB, Aydin O, Tuncay G, Pehlivanoglu MK, Guzel GG, Sakalli MT (2020) On lightweight 4x4 MDS matrices over binary field extensions. Int J Inf Secur Sci 9(2):94\u2013103","journal-title":"Int J Inf Secur Sci"},{"key":"53_CR24","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s11424-019-8125-0","volume":"33","author":"J Bai","year":"2020","unstructured":"Bai J, Sun Y, Wang D (2020) On the construction of involutory MDS matrices over $$\\mathbb{F}_{2^m}$$. J Syst Sci Complex 33:836\u2013848","journal-title":"J Syst Sci Complex"},{"key":"53_CR25","doi-asserted-by":"publisher","unstructured":"Shirai T, Shibutani K, Akishita T, Moriai S, Iwata T (2007) The 128-Bit blockcipher CLEFIA (extended abstract). In: Biryukov A (ed) Fast software encryption. FSE 2007. Lecture notes in computer science, vol 4593. Springer, Heidelberg, pp 181\u2013195. https:\/\/doi.org\/10.1007\/978-3-540-74619-5_12","DOI":"10.1007\/978-3-540-74619-5_12"},{"key":"53_CR26","doi-asserted-by":"publisher","unstructured":"Junod P, Vaudenay S (2004) FOX : a new family of block ciphers. In: Handschuh H, Hasan MA (eds) Selected areas in cryptography. SAC 2004. LNCS, vol 3357. Springer, Heidelberg, pp 114\u2013129. https:\/\/doi.org\/10.1007\/978-3-540-30564-4_8","DOI":"10.1007\/978-3-540-30564-4_8"},{"key":"53_CR27","unstructured":"Barreto P, Rijmen V (2000) The ANUBIS block cipher. In: First open NESSIE workshop"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Seventh International Conference on Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-6890-6_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,5]],"date-time":"2022-03-05T14:09:25Z","timestamp":1646489365000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-6890-6_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9789811668890","9789811668906"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-6890-6_53","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}