{"id":"https://openalex.org/W4415367922","doi":"https://doi.org/10.1109/isit63088.2025.11195347","title":"On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography","display_name":"On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367922","doi":"https://doi.org/10.1109/isit63088.2025.11195347"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195347","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195347","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://handle.uba.uva.nl/personal/pure/en/publications/on-the-independence-assumption-in-quasicyclic-codebased-cryptography(b6a9dd70-d0c4-4bc9-a9e1-2e627fec9c63).html","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038074457","display_name":"Maxime Bombar","orcid":"https://orcid.org/0000-0001-9081-6094"},"institutions":[{"id":"https://openalex.org/I4210166017","display_name":"Institut de Math\u00e9matiques de Bordeaux","ror":"https://ror.org/05m3r1b84","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I15057530","https://openalex.org/I4210141950","https://openalex.org/I4210160189","https://openalex.org/I4210166017"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Maxime Bombar","raw_affiliation_strings":["Insitut de Mathématiques de Bordeaux,France"],"affiliations":[{"raw_affiliation_string":"Insitut de Mathématiques de Bordeaux,France","institution_ids":["https://openalex.org/I4210166017"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5065218643","display_name":"Nicolas Resch","orcid":"https://orcid.org/0000-0002-5133-5631"},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Nicolas Resch","raw_affiliation_strings":["University of Amsterdam,The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam,The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5115792317","display_name":"Emiel Wiedijk","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Emiel Wiedijk","raw_affiliation_strings":["University of Amsterdam,The Netherlands"],"affiliations":[{"raw_affiliation_string":"University of Amsterdam,The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038074457"],"corresponding_institution_ids":["https://openalex.org/I4210166017"],"apc_list":null,"apc_paid":null,"fwci":2.1733,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.9085278,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9998999834060669,"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.9998999834060669,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11797","display_name":"graph theory and CDMA systems","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.6812999844551086},{"id":"https://openalex.org/keywords/cryptosystem","display_name":"Cryptosystem","score":0.5680999755859375},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.5436000227928162},{"id":"https://openalex.org/keywords/hamming-weight","display_name":"Hamming weight","score":0.45500001311302185},{"id":"https://openalex.org/keywords/independence","display_name":"Independence (probability theory)","score":0.4438999891281128},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4375},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4081000089645386}],"concepts":[{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.6812999844551086},{"id":"https://openalex.org/C6295992","wikidata":"https://www.wikidata.org/wiki/Q976521","display_name":"Cryptosystem","level":3,"score":0.5680999755859375},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5496000051498413},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.5436000227928162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4810999929904938},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.45500001311302185},{"id":"https://openalex.org/C35651441","wikidata":"https://www.wikidata.org/wiki/Q625303","display_name":"Independence (probability theory)","level":2,"score":0.4438999891281128},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4108999967575073},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4081000089645386},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3806000053882599},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37040001153945923},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3495999872684479},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.34209999442100525},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.3082999885082245},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.29089999198913574},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.2752000093460083},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C17137986","wikidata":"https://www.wikidata.org/wiki/Q215067","display_name":"Orthogonality","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.25279998779296875}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit63088.2025.11195347","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195347","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:dare.uva.nl:openaire/b6a9dd70-d0c4-4bc9-a9e1-2e627fec9c63","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/on-the-independence-assumption-in-quasicyclic-codebased-cryptography(b6a9dd70-d0c4-4bc9-a9e1-2e627fec9c63).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bombar, M, Resch, N & Wiedijk, E 2025, On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography. in 2025 IEEE International Symposium on Information Theory (ISIT 2025) : Ann Arbor, Michigan, USA, 22-27 June 2025. Piscataway, NJ, pp. 294-299, 2025 IEEE International Symposium on Information Theory, ISIT 2025, Ann Arbor, United States, 22/06/25. https://doi.org/10.1109/ISIT63088.2025.11195347","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:HAL:hal-05466410v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-05466410","pdf_url":null,"source":{"id":"https://openalex.org/S4406922461","display_name":"SPIRE - Sciences Po Institutional REpository","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","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT 2025 - IEEE International Symposium on Information Theory, Jun 2025, Ann Arbor, United States. pp.1-6, ⟨10.1109/ISIT63088.2025.11195347⟩","raw_type":"Conference papers"},{"id":"pmh:oai:dare.uva.nl:publications/b6a9dd70-d0c4-4bc9-a9e1-2e627fec9c63","is_oa":true,"landing_page_url":"https://hdl.handle.net/11245.1/b6a9dd70-d0c4-4bc9-a9e1-2e627fec9c63","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"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":"Bombar, M, Resch, N & Wiedijk, E 2025, On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography. in 2025 IEEE International Symposium on Information Theory (ISIT 2025) : Ann Arbor, Michigan, USA, 22-27 June 2025. Piscataway, NJ, pp. 294-299, 2025 IEEE International Symposium on Information Theory, ISIT 2025, Ann Arbor, United States, 22/06/25. https://doi.org/10.1109/ISIT63088.2025.11195347","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:dare.uva.nl:openaire/b6a9dd70-d0c4-4bc9-a9e1-2e627fec9c63","is_oa":true,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/on-the-independence-assumption-in-quasicyclic-codebased-cryptography(b6a9dd70-d0c4-4bc9-a9e1-2e627fec9c63).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bombar, M, Resch, N & Wiedijk, E 2025, On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography. in 2025 IEEE International Symposium on Information Theory (ISIT 2025) : Ann Arbor, Michigan, USA, 22-27 June 2025. Piscataway, NJ, pp. 294-299, 2025 IEEE International Symposium on Information Theory, ISIT 2025, Ann Arbor, United States, 22/06/25. https://doi.org/10.1109/ISIT63088.2025.11195347","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1961257075","https://openalex.org/W2061949491","https://openalex.org/W2089477764","https://openalex.org/W2138911560","https://openalex.org/W2508277776","https://openalex.org/W2798359482","https://openalex.org/W2913980229","https://openalex.org/W2951783141","https://openalex.org/W4389071861","https://openalex.org/W4401228631"],"related_works":[],"abstract_inverted_index":{"This":[0],"work":[1],"investigates":[2],"the":[3,16,26,41,63,89,92,106,111,123,126],"security":[4,37],"of":[5,28,35,43,91,108,116,125,138],"code-based":[6],"cryptosystems":[7],"such":[8,117],"as":[9,54,69],"BIKE":[10],"and":[11,23,57,75],"HQC,":[12],"which":[13],"are":[14],"among":[15],"most":[17],"promising":[18],"candidates":[19],"for":[20,141,147],"post-quantum":[21],"cryptography":[22],"rely":[24],"on":[25],"hardness":[27],"decoding":[29],"quasi-cyclic":[30,148],"codes.":[31,149],"A":[32],"critical":[33],"aspect":[34],"their":[36],"analysis":[38],"involves":[39],"understanding":[40],"distribution":[42,68],"elements":[44],"formed":[45],"by":[46],"combining":[47],"sparse":[48],"polynomials":[49],"(say":[50],"with":[51,72],"coordinates":[52,74],"modeled":[53],"i.i.d.":[55],"Bernoulli)":[56],"fixed":[58],"circulant":[59],"blocks.":[60],"In":[61],"particular,":[62],"HQC":[64,109],"documentation":[65],"models":[66],"this":[67,84,102],"a":[70],"vector":[71],"independent":[73],"correct":[76],"marginal":[77],"distributions.":[78],"However,":[79],"we":[80,135],"identify":[81],"cases":[82],"where":[83],"modeling":[85],"fails,":[86],"revealing":[87],"that":[88,122],"behavior":[90,124],"resulting":[93],"noise":[94,127],"is":[95,128],"more":[96,129],"complex":[97],"than":[98,131],"previously":[99,132],"anticipated.":[100],"While":[101],"does":[103,120],"not":[104],"invalidate":[105],"conclusion":[107],"regarding":[110],"(empirically":[112],"verified)":[113],"Hamming":[114],"weight":[115],"elements,":[118],"it":[119],"suggest":[121],"subtle":[130],"predicted.":[133],"Lastly,":[134],"discuss":[136],"implications":[137],"our":[139],"result":[140],"potential":[142],"worst-case":[143],"to":[144],"average-case":[145],"reductions":[146]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-04-24T08:23:43.765630","created_date":"2025-10-21T00:00:00"}