{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T12:40:25Z","timestamp":1651840825962},"reference-count":18,"publisher":"IGI Global","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,10]]},"abstract":"<jats:p>This article is concerned with the problem of constructing lightweight MDS matrices. The authors present a new construction of 4 \u00d7 4 MDS matrices over GL(F2, m) for any integer m. They give sufficient and necessary conditions to determine whether the construction is an MDS matrix. Further, for any even number m \u2265 4, they construct lightweight MDS matrices in this structure. Applying Horner's rule to implement MDS matrices, the authors constructions need only 8+4\u00d73\u00d7m XOR operations.<\/jats:p>","DOI":"10.4018\/ijdcf.2019100106","type":"journal-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T10:10:22Z","timestamp":1569579022000},"page":"82-96","source":"Crossref","is-referenced-by-count":0,"title":["Applying Horner's Rule to Optimize Lightweight MDS Matrices"],"prefix":"10.4018","volume":"11","author":[{"given":"Jian","family":"Bai","sequence":"first","affiliation":[{"name":"Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Yao","family":"Sun","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Ting","family":"Li","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, China"}]},{"given":"Dingkang","family":"Wang","sequence":"additional","affiliation":[{"name":"Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China"}]}],"member":"2432","reference":[{"key":"IJDCF.2019100106-0","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53018-4_23"},{"key":"IJDCF.2019100106-1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06320-1_41"},{"key":"IJDCF.2019100106-2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0052343"},{"key":"IJDCF.2019100106-3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4"},{"key":"IJDCF.2019100106-4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_13"},{"key":"IJDCF.2019100106-5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23951-9_22"},{"key":"IJDCF.2019100106-6","doi-asserted-by":"crossref","unstructured":"Jean, J., Peyrin, T., Sim, S., & Tourteaux, J. (2017). Optimizing implementations of lightweight building blocks. IACR Transactions on Symmetric Cryptology, (4), 130\u2013168.","DOI":"10.46586\/tosc.v2017.i4.130-168"},{"key":"IJDCF.2019100106-7","first-page":"84","article-title":"Perfect DiffusionPrimitives for Block Ciphers","author":"P.Junod","year":"2005","journal-title":"Selected Areas in Cryptography. SAC 2004"},{"key":"IJDCF.2019100106-8","first-page":"433","article-title":"Foam: Searching for hardware-optimal spn structures and components with a fair comparison","volume":"Vol. 8731","author":"K.Khoo","year":"2014","journal-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014. CHES 2014"},{"key":"IJDCF.2019100106-9","doi-asserted-by":"crossref","unstructured":"Kranz, T., Leander, G., Stoffelen, K., and Wiemer, F. (2017). Shorter linear straight-line programs for MDS matrices. IACR Transactions on Symmetric Cryptology, (4), 188\u2013211.","DOI":"10.46586\/tosc.v2017.i4.188-211"},{"key":"IJDCF.2019100106-10","unstructured":"Li, T., & Bai, J. sun, Y., Wang, D., & Lin, D. (2016). The lightest 4 \u00d7 4 MDS matrices over Gl(4, F2). Cryptology ePrint Archive. Retrieved from https:\/\/print.iacr.org\/2016\/686"},{"key":"IJDCF.2019100106-11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-52993-5_7"},{"key":"IJDCF.2019100106-12","author":"F. J.MacWilliams","year":"1977","journal-title":"The theory of error-correcting codes"},{"key":"IJDCF.2019100106-13","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-013-9163-8"},{"key":"IJDCF.2019100106-14","doi-asserted-by":"crossref","unstructured":"Sarkar, S. & Syed, H. (2016). Lightweight diffusion layer: Importance of to eplitz matrices. IACR Transactions Symmetric Cryptology, (1), 95-113.","DOI":"10.46586\/tosc.v2016.i1.95-113"},{"key":"IJDCF.2019100106-15","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb00928.x"},{"key":"IJDCF.2019100106-16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89339-6_4"},{"key":"IJDCF.2019100106-17","first-page":"355","article-title":"Recursive Diffusion Layers for (Lightweight) Block Ciphers and Hash Functions","author":"S.Wu","year":"2013","journal-title":"Selected Areas in Cryptography. SAC 2012"}],"container-title":["International Journal of Digital Crime and Forensics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=238886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T12:02:23Z","timestamp":1651838543000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJDCF.2019100106"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":18,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.4018\/ijdcf.2019100106","relation":{},"ISSN":["1941-6210","1941-6229"],"issn-type":[{"value":"1941-6210","type":"print"},{"value":"1941-6229","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}