{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:05Z","timestamp":1772283605302,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"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 Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/tit.2013.2272036","type":"journal-article","created":{"date-parts":[[2013,7,3]],"date-time":"2013-07-03T23:46:59Z","timestamp":1372895219000},"page":"6830-6844","source":"Crossref","is-referenced-by-count":72,"title":["A Distinguisher for High-Rate McEliece Cryptosystems"],"prefix":"10.1109","volume":"59","author":[{"given":"Jean-Charles","family":"Faugere","sequence":"first","affiliation":[]},{"given":"Valerie","family":"Gauthier-Umana","sequence":"additional","affiliation":[]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/780506.780516"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9175-9"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-44586-2_2","article-title":"Semantically secure McEliece public-key cryptosystems-conversions for McEliece PKC","volume":"1992","author":"kobara","year":"2001","journal-title":"Proc 4th Int Workshop Practice Theory Public Key Cryptography"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_43"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(99)00005-5"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-05445-7_24","article-title":"Compact McEliece keys from Goppa codes","author":"misoczki","year":"2009","journal-title":"Select Areas Cryptogr"},{"key":"ref35","first-page":"77","article-title":"Reducing key length of the McEliece cryptosystem","volume":"5580","author":"berger","year":"2009","journal-title":"Progr Cryptology?Second Int Conf Cryptology Africa"},{"key":"ref34","first-page":"240","article-title":"A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model","author":"dowsley","year":"2009","journal-title":"Proc Cryptographers' Track RSA Conf Topics Cryptology"},{"key":"ref10","first-page":"107","article-title":"Decoding random linear codes in <formula formulatype=\"inline\"><tex Notation=\"TeX\">$ {\\tilde {O}}(2^{0.054n})$<\/tex> <\/formula>","volume":"7073","author":"may","year":"2011","journal-title":"Proc 17th Int Conf Theory Appl Cryptology Inf Security"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<197::AID-RSA2>3.3.CO;2-B"},{"key":"ref11","first-page":"520","article-title":"Decoding random binary linear codes in <formula formulatype=\"inline\"><tex Notation=\"TeX\">$2^{n\/20}$<\/tex> <\/formula>: How <formula formulatype=\"inline\"><tex Notation=\"TeX\">$1 + 1 = 0$<\/tex><\/formula> improves information set decoding","volume":"7237","author":"becker","year":"2012","journal-title":"Proc 14th Annu Int Conf Theory Appl Cryptogr Technol"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46416-6_46"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.915687"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-008-9175-9"},{"key":"ref16","first-page":"240","article-title":"A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model","author":"dowsley","year":"2009","journal-title":"Proc Topics in Cryptology"},{"key":"ref17","first-page":"65","article-title":"Towards a concrete security proof of Courtois, Finiasz and Sendrier signature scheme","author":"dallot","year":"2007","journal-title":"Proc Research in Cryptology"},{"key":"ref18","first-page":"88","article-title":"Security bounds for the design of code-based cryptosystems","volume":"5912","author":"finiasz","year":"2009","journal-title":"Proc 9th Int Conf Theory Appl Cryptology Inf Security"},{"key":"ref19","first-page":"279","article-title":"Algebraic cryptanalysis of McEliece variants with compact keys","volume":"6110","author":"faug\ufffdre","year":"2010","journal-title":"Proc 14th Annu Int Conf Theory Appl Cryptogr Technol"},{"key":"ref28","first-page":"59","article-title":"On the use of structured codes in code based cryptography","author":"sendrier","year":"2009","journal-title":"Advances in Coding Theory and Cryptography 3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45961-8_25"},{"key":"ref27","first-page":"187","article-title":"Cryptanalysis of the original McEliece cryptosystem","author":"canteaut","year":"1998","journal-title":"Adv Cryptology"},{"key":"ref3","author":"mceliece","year":"1978","journal-title":"A public-key system based on algebraic coding theory"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/18.850662"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.21270"},{"key":"ref8","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":"Proc Int Workshop Post-Quantum Cryptography"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.651067"},{"key":"ref2","first-page":"157","article-title":"How to achieve a McEliece-based digital signature scheme","volume":"2248","author":"courtois","year":"2001","journal-title":"Proc 9th Int Conf Theory Appl Cryptology Inf Security"},{"key":"ref9","first-page":"743","article-title":"Smaller decoding exponents: Ball-collision decoding","volume":"6841","author":"bernstein","year":"2011","journal-title":"Proc 31st Annu Conf Adv Cryptology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2011.6089437"},{"key":"ref20","first-page":"24","article-title":"A new class of linear correcting codes","volume":"6","author":"goppa","year":"1970","journal-title":"Probl Peredachi Inf"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055350"},{"key":"ref21","author":"macwilliams","year":"1986","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref42","first-page":"181","article-title":"Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes","author":"couvreur","year":"2013","journal-title":"Proc Int Workshop Coding Cryptography"},{"key":"ref24","first-page":"169","article-title":"A further improvement of the work factor in an attempt at breaking McEliece's cryptosystem","author":"canteaut","year":"1994","journal-title":"EUROCODE"},{"key":"ref41","article-title":"Error-correcting pairs for a public-key cryptosystem","author":"marquez-corbella","year":"2012","journal-title":"Proc Code-based Cryptography Workshop"},{"key":"ref23","first-page":"119","article-title":"On the McEliece public-key cryptosystem","author":"van tilburg","year":"1990","journal-title":"Proc 8th Annu Int Cryptology Conf Adv Cryptology"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.556688"},{"key":"ref43","volume":"6841","year":"2011","journal-title":"Advances in Cryptology?CRYPTO 2011?31st Annual Cryptology Conference Santa Barbara CA USA August 14?18 2011"},{"key":"ref25","author":"canteaut","year":"1995","journal-title":"Improvements of the attacks on cryptosystems based on error-correcting codes"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/6595627\/06553164.pdf?arnumber=6553164","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:47:50Z","timestamp":1638218870000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6553164\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":43,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2013.2272036","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10]]}}}