{"id":"https://openalex.org/W4295066811","doi":"https://doi.org/10.46586/tosc.v2022.i3.403-447","title":"Low-Latency Boolean Functions and Bijective S-boxes","display_name":"Low-Latency Boolean Functions and Bijective S-boxes","publication_year":2022,"publication_date":"2022-09-09","ids":{"openalex":"https://openalex.org/W4295066811","doi":"https://doi.org/10.46586/tosc.v2022.i3.403-447"},"language":"en","primary_location":{"id":"doi:10.46586/tosc.v2022.i3.403-447","is_oa":true,"landing_page_url":"https://doi.org/10.46586/tosc.v2022.i3.403-447","pdf_url":"https://tosc.iacr.org/index.php/ToSC/article/download/9862/9361","source":{"id":"https://openalex.org/S4210236173","display_name":"IACR Transactions on Symmetric Cryptology","issn_l":"2519-173X","issn":["2519-173X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Transactions on Symmetric Cryptology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://tosc.iacr.org/index.php/ToSC/article/download/9862/9361","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078438173","display_name":"Shahram Rasoolzadeh","orcid":"https://orcid.org/0000-0001-6848-2227"},"institutions":[{"id":"https://openalex.org/I145872427","display_name":"Radboud University Nijmegen","ror":"https://ror.org/016xsfp80","country_code":"NL","type":"education","lineage":["https://openalex.org/I145872427"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Shahram Rasoolzadeh","raw_affiliation_strings":["Radboud University, Nijmegen, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Radboud University, Nijmegen, The Netherlands","institution_ids":["https://openalex.org/I145872427"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078438173"],"corresponding_institution_ids":["https://openalex.org/I145872427"],"apc_list":null,"apc_paid":null,"fwci":1.3678,"has_fulltext":true,"cited_by_count":12,"citation_normalized_percentile":{"value":0.83687855,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"403","last_page":"447"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9620000123977661,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.7506625652313232},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.6323267221450806},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6134830713272095},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.5489514470100403},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5012435913085938},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.48792001605033875},{"id":"https://openalex.org/keywords/boolean-network","display_name":"Boolean network","score":0.4840609133243561},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4810781180858612},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.4613819718360901},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42158833146095276},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4127497375011444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3816700577735901},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.29670023918151855}],"concepts":[{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7506625652313232},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.6323267221450806},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6134830713272095},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.5489514470100403},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5012435913085938},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.48792001605033875},{"id":"https://openalex.org/C134444547","wikidata":"https://www.wikidata.org/wiki/Q585230","display_name":"Boolean network","level":3,"score":0.4840609133243561},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4810781180858612},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.4613819718360901},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42158833146095276},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4127497375011444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3816700577735901},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.29670023918151855},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.46586/tosc.v2022.i3.403-447","is_oa":true,"landing_page_url":"https://doi.org/10.46586/tosc.v2022.i3.403-447","pdf_url":"https://tosc.iacr.org/index.php/ToSC/article/download/9862/9361","source":{"id":"https://openalex.org/S4210236173","display_name":"IACR Transactions on Symmetric Cryptology","issn_l":"2519-173X","issn":["2519-173X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Transactions on Symmetric Cryptology","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:7ae9bfa4f7564f68a0fba9e5418a1162","is_oa":true,"landing_page_url":"https://doaj.org/article/7ae9bfa4f7564f68a0fba9e5418a1162","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IACR Transactions on Symmetric Cryptology, Vol 2022, Iss 3 (2022)","raw_type":"article"},{"id":"pmh:oai:repository.ubn.ru.nl:2066/283369","is_oa":false,"landing_page_url":"https://hdl.handle.net/2066/283369","pdf_url":null,"source":{"id":"https://openalex.org/S4306401067","display_name":"Radboud Repository (Radboud University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I145872427","host_organization_name":"Radboud University Nijmegen","host_organization_lineage":["https://openalex.org/I145872427"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article / Letter to editor"},{"id":"pmh:ru:oai:repository.ubn.ru.nl:2066/283369","is_oa":true,"landing_page_url":"http://hdl.handle.net/2066/283369","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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, 2022, 403 - 447","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.46586/tosc.v2022.i3.403-447","is_oa":true,"landing_page_url":"https://doi.org/10.46586/tosc.v2022.i3.403-447","pdf_url":"https://tosc.iacr.org/index.php/ToSC/article/download/9862/9361","source":{"id":"https://openalex.org/S4210236173","display_name":"IACR Transactions on Symmetric Cryptology","issn_l":"2519-173X","issn":["2519-173X"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IACR Transactions on Symmetric Cryptology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3104861140","display_name":"Symmetric Cryptography with Asymmetric-hardware Leveraged Architecture (SCALAR)","funder_award_id":"612.001.851","funder_id":"https://openalex.org/F4320321800","funder_display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek"}],"funders":[{"id":"https://openalex.org/F4320309729","display_name":"Universit\u00e9 Catholique de Louvain","ror":"https://ror.org/02495e989"},{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4295066811.pdf","grobid_xml":"https://content.openalex.org/works/W4295066811.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W40376036","https://openalex.org/W1489021826","https://openalex.org/W1600295433","https://openalex.org/W2740336530","https://openalex.org/W2793458514","https://openalex.org/W3037774646","https://openalex.org/W3093954335","https://openalex.org/W3143950643","https://openalex.org/W3201598941","https://openalex.org/W4251810237"],"related_works":["https://openalex.org/W3204916073","https://openalex.org/W1487679090","https://openalex.org/W2011469629","https://openalex.org/W1991822629","https://openalex.org/W1597080238","https://openalex.org/W2055594799","https://openalex.org/W2106622045","https://openalex.org/W2234833091","https://openalex.org/W2735569833","https://openalex.org/W1976287608"],"abstract_inverted_index":{"In":[0],"this":[1,93],"paper,":[2],"we":[3,75,108,141],"study":[4],"the":[5,14,30,50,54,62,65,90,96,130],"gate":[6],"depth":[7],"complexity":[8,52,68,85,106,139],"of":[9,16,32,53,99,112,146],"(vectorial)":[10,55],"Boolean":[11,33,42,56,72],"functions":[12,43],"in":[13],"basis":[15],"{NAND,":[17],"NOR,":[18],"INV}":[19],"as":[20],"a":[21,70,102],"new":[22],"metric,":[23],"called":[24],"latency":[25,31,51,67,105,138],"complexity,":[26,46],"to":[27,39,48,59,79,89],"mathematically":[28],"measure":[29],"functions.":[34],"We":[35],"present":[36,76,109,142],"efficient":[37],"algorithms":[38],"find":[40,60],"all":[41,61],"with":[44,64,83,87,118,152],"low-latency":[45,84],"or":[47],"determine":[49],"functions,":[57],"and":[58,121,155],"circuits":[63],"minimum":[66,131],"for":[69,104,125,128,137],"given":[71],"function.":[73],"Then,":[74],"another":[77],"algorithm":[78,94],"build":[80],"bijective":[81],"S-boxes":[82,111,127,145],"which":[86],"respect":[88],"computation":[91],"cost,":[92],"overcomes":[95],"previous":[97],"methods":[98],"building":[100],"S-boxes.As":[101],"result,":[103],"3,":[107],"n-bit":[110,144],"3":[113],"\u2264":[114,116,148],"n":[115,149],"8":[117,151],"linearity":[119,153],"2n\u22121":[120],"uniformity":[122,133,156],"2n\u22122":[123,154],"(except":[124],"5-bit":[126],"whose":[129],"achievable":[132],"is":[134],"6).":[135],"Besides,":[136],"4,":[140],"several":[143],"5":[147],"<":[150],"2n\u22124.":[157]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}