{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:52:17Z","timestamp":1771613537191,"version":"3.50.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2017,4,1]],"date-time":"2017-04-01T00:00:00Z","timestamp":1491004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1109\/lcomm.2016.2640271","type":"journal-article","created":{"date-parts":[[2016,12,16]],"date-time":"2016-12-16T08:11:27Z","timestamp":1481875887000},"page":"714-717","source":"Crossref","is-referenced-by-count":15,"title":["A New Variant of the McEliece Cryptosystem Based on QC-LDPC and QC-MDPC Codes"],"prefix":"10.1109","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8400-6316","authenticated-orcid":false,"given":"Hamza","family":"Moufek","sequence":"first","affiliation":[]},{"given":"Kenza","family":"Guenda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9919-0323","authenticated-orcid":false,"given":"T. Aaron","family":"Gulliver","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"ref11","first-page":"789","article-title":"A key recovery attack on MDPC with CCA security using decoding errors","volume":"10031","author":"guo","year":"2016","journal-title":"Advances in Cryptology"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1515\/1569392031905601"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2010.02.004"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-015-0099-x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.748992"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"ref17","first-page":"203","article-title":"On computing nearest neighbors with applications to decoding of binary linear codes","volume":"9056","author":"may","year":"2015","journal-title":"Advances in Cryptology"},{"key":"ref18","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","author":"mceliece","year":"1978"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053436"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11935230_4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1994.4.3.191"},{"key":"ref3","first-page":"520","article-title":"Decoding random binary linear codes in $2^{n\/20}$ : How 1 + 1 = 0 improves information set decoding","volume":"7237","author":"becker","year":"2012","journal-title":"Advances in Cryptology"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BFb0052237","article-title":"Failure of the McEliece public-key cryptosystem under message-resend and related-message attack","volume":"1294","author":"burton","year":"1997","journal-title":"Advances in Cryptology"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","article-title":"Attacking and defending the McEliece cryptosystem","volume":"5299","author":"bernstein","year":"2008","journal-title":"Post-Quantum Cryptography"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541522"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.651067"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31517-1_18"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.161"},{"key":"ref20","first-page":"347","article-title":"Cryptanalysis of the Sidelnikov cryptosystem","volume":"4515","author":"minder","year":"2007","journal-title":"Advances in Cryptology"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","article-title":"Compact McEliece keys from Goppa codes","volume":"5867","author":"misoczki","year":"2009","journal-title":"Selected Areas in Cryptography"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-009-0015-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866513"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2015.0064"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/7894297\/07784752.pdf?arnumber=7784752","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:20:23Z","timestamp":1642004423000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7784752\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":28,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2016.2640271","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}