{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T04:22:34Z","timestamp":1775794954015,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195347","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography"],"prefix":"10.1109","author":[{"given":"Maxime","family":"Bombar","sequence":"first","affiliation":[{"name":"Insitut de Mathématiques de Bordeaux,France"}]},{"given":"Nicolas","family":"Resch","sequence":"additional","affiliation":[{"name":"University of Amsterdam,The Netherlands"}]},{"given":"Emiel","family":"Wiedijk","sequence":"additional","affiliation":[{"name":"University of Amsterdam,The Netherlands"}]}],"member":"263","reference":[{"key":"ref1","article-title":"BIKE","volume":"5.1","author":"Aguilar Melchor","year":"2022","journal-title":"Round 4 Submission to the NIST Post-Quantum Cryptography Call"},{"key":"ref2","article-title":"HQC","author":"Aguilar Melchor","year":"2022","journal-title":"Round 4 Submission to the NIST Post-Quantum Cryptography Call"},{"key":"ref3","article-title":"Classic McEliece (merger of Classic McEliece and NTS-KEM)","author":"Albrecht","year":"2022","journal-title":"fourth round finalist of the NIST post-quantum cryptography call"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-68339-9_22"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8739-9_9"},{"key":"ref7","author":"Kawachi","journal-title":"Hamming Weight of Product of Random Sparse Polynomials"},{"key":"ref8","author":"Bombar","year":"2025","journal-title":"On the independence assumption in quasi-cyclic code-based cryptography"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0079123"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2896192"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309990642"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.21252"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541857"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488680"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_21"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195347.pdf?arnumber=11195347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:59Z","timestamp":1773347399000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195347\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195347","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}