{"id":"https://openalex.org/W6922883031","doi":"https://doi.org/10.13154/tosc.v2019.i4.147-170","title":"Lightweight Iterative MDS Matrices: How Small Can We Go?","display_name":"Lightweight Iterative MDS Matrices: How Small Can We Go?","publication_year":2020,"publication_date":"2020-01-31","ids":{"openalex":"https://openalex.org/W6922883031","doi":"https://doi.org/10.13154/tosc.v2019.i4.147-170"},"language":"en","primary_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/654210","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/654210","pdf_url":"https://lirias.kuleuven.be/bitstream/123456789/654210/2/8460-Article%20Text-4896-4-10-20200324.pdf","source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Transactions on Symmetric Cryptology, vol. 2019 (4), Art.No. 4, (147-170)","raw_type":"info:eu-repo/semantics/publishedVersion"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/bitstream/123456789/654210/2/8460-Article%20Text-4896-4-10-20200324.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Li, Shun","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Li, Shun","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sun, Siwei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Siwei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Shi, Danping","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shi, Danping","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Li, Chaoyun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Chaoyun","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hu, Lei","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Lei","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.37230669,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11955","display_name":"Urban and spatial planning","score":0.026200000196695328,"subfield":{"id":"https://openalex.org/subfields/2309","display_name":"Nature and Landscape Conservation"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11955","display_name":"Urban and spatial planning","score":0.026200000196695328,"subfield":{"id":"https://openalex.org/subfields/2309","display_name":"Nature and Landscape Conservation"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T13370","display_name":"Diverse Scientific and Economic Studies","score":0.025100000202655792,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13135","display_name":"Communism, Protests, Social Movements","score":0.02070000022649765,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6177999973297119},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5375999808311462},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.49459999799728394},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.482699990272522},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4309999942779541},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.42719998955726624}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6177999973297119},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5375999808311462},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5236999988555908},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.49459999799728394},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.482699990272522},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4706000089645386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4374000132083893},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4309999942779541},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.42719998955726624},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.39899998903274536},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.39559999108314514},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3831000030040741},{"id":"https://openalex.org/C85817219","wikidata":"https://www.wikidata.org/wiki/Q884772","display_name":"Block matrix","level":3,"score":0.3765000104904175},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36730000376701355},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.36039999127388},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3377000093460083},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.31850001215934753},{"id":"https://openalex.org/C190560348","wikidata":"https://www.wikidata.org/wiki/Q3245116","display_name":"Circuit design","level":2,"score":0.2669000029563904},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25870001316070557}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/654210","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/654210","pdf_url":"https://lirias.kuleuven.be/bitstream/123456789/654210/2/8460-Article%20Text-4896-4-10-20200324.pdf","source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Transactions on Symmetric Cryptology, vol. 2019 (4), Art.No. 4, (147-170)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:d38039936d574b20a559a629f8a6ef57","is_oa":true,"landing_page_url":"https://doaj.org/article/d38039936d574b20a559a629f8a6ef57","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Transactions on Symmetric Cryptology, Vol 2019, Iss 4 (2020)","raw_type":"article"},{"id":"doi:10.13154/tosc.v2019.i4.147-170","is_oa":true,"landing_page_url":"https://doi.org/10.13154/tosc.v2019.i4.147-170","pdf_url":null,"source":{"id":"https://openalex.org/S7407052971","display_name":"UB Bochum","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/654210","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/654210","pdf_url":"https://lirias.kuleuven.be/bitstream/123456789/654210/2/8460-Article%20Text-4896-4-10-20200324.pdf","source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Transactions on Symmetric Cryptology, vol. 2019 (4), Art.No. 4, (147-170)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.6705722212791443,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W6922883031.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"As":[0,250],"perfect":[1],"building":[2],"blocks":[3,100,129,139],"for":[4,101,164,196],"the":[5,12,25,39,72,76,91,96,116,151,178,188,192,208,216,244,247,253],"diffusion":[6],"layers":[7],"of":[8,14,31,68,78,95,98,191,194,219,246,255],"many":[9],"symmetric-key":[10,26],"primitives,":[11],"construction":[13],"MDS":[15,34,46,73,123,199,222],"matrices":[16,35,223],"with":[17,82,136,224],"lightweight":[18,220],"circuits":[19],"has":[20],"received":[21],"much":[22],"attention":[23],"from":[24],"community.":[27],"One":[28],"promising":[29],"way":[30],"realizing":[32],"low-cost":[33,43],"is":[36,60,154,161,181,259],"based":[37,206],"on":[38,207,229],"iterative":[40,122,198,221],"construction:":[41],"a":[42,51,102,147,251],"matrix":[44,107,125],"becomes":[45],"after":[47],"rising":[48],"it":[49],"to":[50,70,108,173,211,236,242],"certain":[52,197],"power.":[53],"To":[54],"be":[55,109],"more":[56],"specific,":[57],"if":[58],"At":[59,69],"MDS,":[61],"then":[62],"one":[63],"can":[64],"implement":[65],"A":[66],"instead":[67],"achieve":[71],"property":[74],"at":[75,141],"expense":[77],"an":[79],"increased":[80],"latency":[81,180],"t":[83],"clock":[84],"cycles.":[85],"In":[86],"this":[87,175],"work,":[88],"we":[89,113,157,185,214,233,240],"identify":[90,212],"exact":[92],"lower":[93,189],"bound":[94,153,190,245],"number":[97,193],"nonzero":[99,138],"4":[103,105,119,121,131,133],"\u00d7":[104,120,132],"block":[106,124],"potentially":[110],"iterative-MDS.":[111],"Subsequently,":[112],"show":[114],"that":[115,159],"theoretically":[117],"lightest":[118],"(whose":[126],"entries":[127],"or":[128],"are":[130,234],"binary":[134],"matrices)":[135],"minimal":[137],"costs":[140],"least":[142],"3":[143],"XOR":[144],"gates,":[145],"and":[146,170,205,227],"concrete":[148],"example":[149],"achieving":[150],"3-XOR":[152],"provided.":[155],"Moreover,":[156],"prove":[158],"there":[160],"no":[162],"hope":[163],"previous":[165,257],"constructions":[166],"(GFS,":[167],"LFS,":[168],"DSI,":[169],"spares":[171],"DSI)":[172],"beat":[174],"bound.":[176],"Since":[177],"circuit":[179],"another":[182],"important":[183],"factor,":[184],"also":[186],"consider":[187],"iterations":[195],"matrices.":[200],"Guided":[201],"by":[202],"these":[203],"bounds":[204],"ideas":[209],"employed":[210],"them,":[213],"explore":[215],"design":[217],"space":[218],"other":[225],"dimensions":[226],"report":[228],"improved":[230],"results.":[231],"Whenever":[232],"unable":[235],"find":[237],"better":[238],"results,":[239],"try":[241],"determine":[243],"optimal":[248],"solution.":[249],"result,":[252],"optimality":[254],"some":[256],"results":[258],"proved.":[260]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}