{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:08:22Z","timestamp":1761894502241,"version":"build-2065373602"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3623939","type":"journal-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:57:35Z","timestamp":1760983055000},"page":"184122-184132","source":"Crossref","is-referenced-by-count":0,"title":["Analyzing IND-CPA Security of HQC Codes Using k-Nearest Neighbors"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-7881-1817","authenticated-orcid":false,"given":"Emilio","family":"Volpe","sequence":"first","affiliation":[{"name":"Factored AI, Medellín, Antioquia, Colombia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0909-7091","authenticated-orcid":false,"given":"Val\u00e9rie","family":"Gauthier-Uma\u00f1a","sequence":"additional","affiliation":[{"name":"Department of Systems and Computing Engineering, Universidad de los Andes, Bogotá, Colombia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"issue":"3","key":"ref3","first-page":"24","article-title":"A new class of linear correcting codes","volume":"6","author":"Goppa","year":"1970","journal-title":"Probl. Peredachi Inf."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/s0036144598347011"},{"key":"ref5","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume-title":"DSN Prog. Rep.","volume":"44","author":"McEliece","year":"1978"},{"key":"ref6","first-page":"2591","article-title":"Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes","volume-title":"Proc. IEEE Int. Symp. Inf. Theory (ISIT)","author":"Baldi"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1994.4.3.191"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_41"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.4.439"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9003-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2272036"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437530"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834599"},{"key":"ref16","first-page":"38695","article-title":"Error correction code transformer","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Choukroun"},{"issue":"4","key":"ref17","first-page":"13","article-title":"Hamming quasi-cyclic (HQC)","volume":"2","author":"Melchor","year":"2017","journal-title":"NIST PQC Round"},{"volume-title":"NIST Selects HQC As Fifth Algorithm for Post-quantum Encryption","year":"2025","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253512"},{"key":"ref20","article-title":"AI for code-based cryptography","volume-title":"Cryptol. ePrint Arch.","author":"Malhou","year":"2025"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053964"},{"issue":"4","key":"ref22","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","volume":"42","author":"Malkov","year":"2020","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"ref23","volume-title":"The Theory Error-Correcting Codes","volume":"16","author":"MacWilliams","year":"1977"},{"key":"ref24","volume-title":"A Course Error-Correcting Codes","volume":"1","author":"Justesen","year":"2004"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_43"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2323"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1126\/science.290.5500.2319"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1031596100"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020217"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/tbdata.2025.3618474"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11208634.pdf?arnumber=11208634","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:28:59Z","timestamp":1761888539000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11208634\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3623939","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}