{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:50Z","timestamp":1773378170344,"version":"3.50.1"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834784","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2785-2790","source":"Crossref","is-referenced-by-count":1,"title":["Decoding of Generalized Concatenated Codes Over the One-Lee Error Channel for the McEliece Cryptosystem"],"prefix":"10.1109","author":[{"given":"Johann-Philipp","family":"Thiers","sequence":"first","affiliation":[{"name":"University of Applied Sciences,Institute for System Dynamics HTWG Konstanz,Germany"}]},{"given":"J\u00fcrgen","family":"Freudenberger","sequence":"additional","affiliation":[{"name":"University of Applied Sciences,Institute for System Dynamics HTWG Konstanz,Germany"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","article-title":"Decoding random linear codes in O(20.054n)","author":"may","year":"2011","journal-title":"Advances in Cryptology &#x2013; ASIACRYPT 2011"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","article-title":"A public-key cryptosystem based on binary Reed-Muller codes","volume":"4","author":"sidelnikov","year":"1994","journal-title":"Discrete Mathematics and Applications"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2020089"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148812"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography5010011"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography5040033"},{"key":"ref17","article-title":"A new path to code-based signatures via identification schemes with restricted errors","author":"baldi","year":"2020","journal-title":"arXiv preprint arXiv 2008 06439"},{"key":"ref18","article-title":"On the hardness of the Lee syndrome decoding problem","author":"weger","year":"2020","journal-title":"arXiv preprint arXiv 2002 12271"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"ref28","article-title":"On decoding using codewords of the dual code","author":"bossert","year":"2020","journal-title":"arXiv 2001 02956"},{"key":"ref4","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"42?44","author":"mceliece","year":"1978","journal-title":"DSN progress report"},{"key":"ref27","article-title":"Classic McEliece: conservative code-based cryptography","author":"bernstein","year":"2020","journal-title":"NIST PQC Competition"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057777"},{"key":"ref5","first-page":"159","article-title":"Knapsack-type cryptosystems and algebraic coding theory","volume":"15","author":"niederreiter","year":"1986","journal-title":"Probl Control Inf Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0019850"},{"key":"ref7","first-page":"275","article-title":"An observation on the security of McEliece&#x2019;s public-key cryptosystem","author":"lee","year":"1988","journal-title":"Advances in Cryptology &#x2014; EUROCRYPT &#x2019;97"},{"key":"ref2","first-page":"317","article-title":"Shor&#x2019;s discrete logarithm quantum algorithm for elliptic curves","volume":"3","author":"proos","year":"2003","journal-title":"Quantum Info Comput"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref20","first-page":"520","article-title":"Decoding random binary linear codes in 2n\/20: How 1 + 1 = 0 improves information set decoding","author":"becker","year":"2012","journal-title":"in Annual International Conference on the Theory and Applications of Cryptographic Techniques"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCE-Berlin53567.2021.9720027"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/a12100209"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2014.0278"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460100606"},{"key":"ref26","article-title":"On the structure of randomly permuted concatenated code","author":"sendrier","year":"1995","journal-title":"Ph D Dissertation"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.335966"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834784.pdf?arnumber=9834784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:37Z","timestamp":1773347797000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834784\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834784","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}