{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T15:57:58Z","timestamp":1772467078401,"version":"3.50.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031174322","type":"print"},{"value":"9783031174339","type":"electronic"}],"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-3-031-17433-9_1","type":"book-chapter","created":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T18:11:08Z","timestamp":1664993468000},"page":"3-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Construction of\u00a0Recursive MDS Matrices Using DLS Matrices"],"prefix":"10.1007","author":[{"given":"Kishan Chand","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumit Kumar","family":"Pandey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4643-5117","authenticated-orcid":false,"given":"Susanta","family":"Samanta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,6]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46706-0_1","volume-title":"Fast Software Encryption","author":"D Augot","year":"2015","unstructured":"Augot, D., Finiasz, M.: Direct construction of recursive MDS diffusion layers using shortened BCH codes. In: Cid, C., Rechberger, C. (eds.) FSE 2014. LNCS, vol. 8540, pp. 3\u201317. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46706-0_1"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-030-26834-3_7","volume-title":"Advances in Information and Computer Security","author":"S Banik","year":"2019","unstructured":"Banik, S., Funabiki, Y., Isobe, T.: More results on shortest linear programs. In: Attrapadung, N., Yagi, T. (eds.) IWSEC 2019. LNCS, vol. 11689, pp. 109\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26834-3_7"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1007\/978-3-662-53018-4_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"C Beierle","year":"2016","unstructured":"Beierle, C., Kranz, T., Leander, G.: Lightweight multiplication in $$GF(2^n)$$ with applications to MDS matrices. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 625\u2013653. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_23"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-319-03515-4_18","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2013","author":"TP Berger","year":"2013","unstructured":"Berger, T.P.: Construction of recursive MDS diffusion layers from Gabidulin codes. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 274\u2013285. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03515-4_18"},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-012-9124-7","volume":"26","author":"J Boyar","year":"2012","unstructured":"Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptol. 26(2), 280\u2013312 (2012). https:\/\/doi.org\/10.1007\/s00145-012-9124-7","journal-title":"J. Cryptol."},{"key":"1_CR6","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04722-4","volume-title":"The Design of Rijndael: AES - The Advanced Encryption Standard","author":"J Daemen","year":"2002","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael: AES - The Advanced Encryption Standard. Information Security and Cryptography, Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-04722-4"},{"issue":"2","key":"1_CR7","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. Symm. Cryptol. 2018(2), 48\u201378 (2018)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-22792-9_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"J Guo","year":"2011","unstructured":"Guo, J., Peyrin, T., Poschmann, A.: The PHOTON family of lightweight hash functions. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 222\u2013239. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_13"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-23951-9_22","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"J Guo","year":"2011","unstructured":"Guo, J., Peyrin, T., Poschmann, A., Robshaw, M.: The LED block cipher. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol. 6917, pp. 326\u2013341. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23951-9_22"},{"issue":"4","key":"1_CR10","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."},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-35869-3_14","volume-title":"Security, Privacy, and Applied Cryptography Engineering","author":"KC Gupta","year":"2019","unstructured":"Gupta, K.C., Pandey, S.K., Samanta, S.: A few negative results on constructions of MDS matrices using low XOR matrices. In: Bhasin, S., Mendelson, A., Nandi, M. (eds.) SPACE 2019. LNCS, vol. 11947, pp. 195\u2013213. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35869-3_14"},{"key":"1_CR12","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. Designs Codes Cryptogr. 82, 77\u201394 (2017)","journal-title":"Designs Codes Cryptogr."},{"key":"1_CR13","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. Designs Codes Cryptogr. 82, 179\u2013195 (2017)","journal-title":"Designs Codes Cryptogr."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/s10623-018-0582-2","volume":"87","author":"KC Gupta","year":"2019","unstructured":"Gupta, K.C., Pandey, S.K., Venkateswarlu, A.: Almost involutory recursive MDS diffusion layers. Designs Codes Cryptogr. 87, 609\u2013626 (2019)","journal-title":"Designs Codes Cryptogr."},{"issue":"4","key":"1_CR15","doi-asserted-by":"publisher","first-page":"130","DOI":"10.46586\/tosc.v2017.i4.130-168","volume":"2017","author":"J Jean","year":"2017","unstructured":"Jean, J., Peyrin, T., Sim, S.M., Tourteaux, J.: Optimizing implementations of lightweight building blocks. IACR Trans. Symm. Cryptol. 2017(4), 130\u2013168 (2017)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.dam.2021.08.016","volume":"304","author":"A Kesarwani","year":"2021","unstructured":"Kesarwani, A., Pandey, S.K., Sarkar, S., Venkateswarlu, A.: Recursive MDS matrices over finite commutative rings. Discret. Appl. Math. 304, 384\u2013396 (2021)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"231","DOI":"10.46586\/tosc.v2019.i3.231-256","volume":"2019","author":"A Kesarwani","year":"2019","unstructured":"Kesarwani, A., Sarkar, S., Venkateswarlu, A.: Exhaustive search for various types of MDS matrices. IACR Trans. Symm. Cryptol. 2019(3), 231\u2013256 (2019)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-662-44709-3_24","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2014","author":"K Khoo","year":"2014","unstructured":"Khoo, K., Peyrin, T., Poschmann, A.Y., Yap, H.: FOAM: searching for hardware-optimal SPN structures and components with a fair comparison. In: Batina, L., Robshaw, M. (eds.) CHES 2014. LNCS, vol. 8731, pp. 433\u2013450. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44709-3_24"},{"issue":"4","key":"1_CR19","doi-asserted-by":"publisher","first-page":"188","DOI":"10.46586\/tosc.v2017.i4.188-211","volume":"2017","author":"T Kranz","year":"2017","unstructured":"Kranz, T., Leander, G., Stoffelen, K., Wiemer, F.: Shorter linear straight-line programs for MDS matrices. IACR Trans. Symm. Cryptol. 2017(4), 188\u2013211 (2017)","journal-title":"IACR Trans. Symm. Cryptol."},{"issue":"1","key":"1_CR20","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., Lei, H.: Constructing low-latency involutory MDS matrices with lightweight circuits. IACR Trans. Symm. Cryptol. 2019(1), 84\u2013117 (2019)","journal-title":"IACR Trans. Symm. Cryptol."},{"issue":"4","key":"1_CR21","first-page":"147","volume":"2019","author":"S Li","year":"2019","unstructured":"Li, S., Sun, S., Shi, D., Li, C., Lei, H.: Lightweight iterative MDS matrices: how small can we go? IACR Trans. Symm. Cryptol. 2019(4), 147\u2013170 (2019)","journal-title":"IACR Trans. Symm. Cryptol."},{"key":"1_CR22","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 (1977)"},{"key":"1_CR23","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, 1433\u20131452 (2021)","journal-title":"Des. Codes Crypt."},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-319-71667-1_14","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2017","author":"S Sarkar","year":"2017","unstructured":"Sarkar, S., Syed, H., Sadhukhan, R., Mukhopadhyay, D.: Lightweight design choices for LED-like block ciphers. In: Patra, A., Smart, N.P. (eds.) INDOCRYPT 2017. LNCS, vol. 10698, pp. 267\u2013281. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71667-1_14"},{"issue":"4","key":"1_CR25","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. Bell Syst. Tech. J. 28(4), 656\u2013715 (1949)","journal-title":"Bell Syst. Tech. J."},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-319-89339-6_4","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2018","author":"D Toh","year":"2018","unstructured":"Toh, D., Teo, J., Khoo, K., Sim, S.M.: Lightweight MDS serial-type matrices with minimal fixed XOR count. In: Joux, A., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2018. LNCS, vol. 10831, pp. 51\u201371. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89339-6_4"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-35999-6_23","volume-title":"Selected Areas in Cryptography","author":"S Wu","year":"2013","unstructured":"Wu, S., Wang, M., Wu, W.: Recursive diffusion layers for (lightweight) block ciphers and hash functions. In: Knudsen, L.R., Wu, H. (eds.) SAC 2012. LNCS, vol. 7707, pp. 355\u2013371. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-35999-6_23"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-319-06320-1_40","volume-title":"Information Security Practice and Experience","author":"H Xu","year":"2014","unstructured":"Xu, H., Tan, L., Lai, X.: On the recursive construction of MDS matrices for lightweight cryptography. In: Huang, X., Zhou, J. (eds.) ISPEC 2014. LNCS, vol. 8434, pp. 552\u2013563. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06320-1_40"},{"issue":"7","key":"1_CR29","doi-asserted-by":"publisher","first-page":"1453","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. Des. Codes Crypt. 89(7), 1453\u20131483 (2021). https:\/\/doi.org\/10.1007\/s10623-021-00879-3","journal-title":"Des. Codes Crypt."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - AFRICACRYPT 2022"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-17433-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,5]],"date-time":"2022-10-05T18:11:33Z","timestamp":1664993493000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-17433-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031174322","9783031174339"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-17433-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"6 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AFRICACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology in Africa","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Fes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"africacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/africacrypt2022.cs.ru.nl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}