{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T22:22:29Z","timestamp":1768342949444,"version":"3.49.0"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002347","name":"German Federal Ministry of Research and Education (BMBF) as part of the PENTA Project 17013 XSR-FMC","doi-asserted-by":"publisher","award":["16ES1045"],"award-info":[{"award-number":["16ES1045"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hyperstone GmbH"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Open J. Commun. Soc."],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/ojcoms.2022.3206395","type":"journal-article","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T19:41:54Z","timestamp":1663098114000},"page":"1528-1539","source":"Crossref","is-referenced-by-count":8,"title":["Code-Based Cryptography With Generalized Concatenated Codes for Restricted Error Values"],"prefix":"10.1109","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4318-2660","authenticated-orcid":false,"given":"Johann-Philipp","family":"Thiers","sequence":"first","affiliation":[{"name":"Institute for System Dynamics, HTWG Konstanz, University of Applied Sciences, Konstanz, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5913-4981","authenticated-orcid":false,"given":"Jurgen","family":"Freudenberger","sequence":"additional","affiliation":[{"name":"Institute for System Dynamics, HTWG Konstanz, University of Applied Sciences, Konstanz, Germany"}]}],"member":"263","reference":[{"key":"ref39","article-title":"McEliece needs a break—Solving McEliece-1284 and quasi-cyclic-2918 with modern ISD","author":"esser","year":"2021"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.3390\/a12100209"},{"key":"ref33","article-title":"Status report on the second round of the NIST post-quantum cryptography standardization process","author":"alagic","year":"2020"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2018.5207"},{"key":"ref31","author":"aragon","year":"2021","journal-title":"Bike Bit flipping key encapsulation"},{"key":"ref30","author":"bernstein","year":"2020","journal-title":"Classic McEliece conservative code-based cryptography"},{"key":"ref37","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":"Proc Annu Int Conf Theory Appl Cryptograph Techn"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_2"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MCE.2022.3192126"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437456"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56932-1_26"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834784"},{"key":"ref2","first-page":"317","article-title":"Shor’s discrete logarithm quantum algorithm for elliptic curves","volume":"3","author":"proos","year":"2003","journal-title":"Quantum Inf Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref20","article-title":"Analysis of low-density parity-check codes over finite integer rings for the Lee channel","author":"bariffi","year":"2021","journal-title":"arXiv 2105 08372"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography5010011"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.3390\/cryptography5040033"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2736284"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40349-1_16"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICCE-Berlin53567.2021.9720027"},{"key":"ref25","article-title":"On the structure of randomly permuted concatenated code","author":"sendrier","year":"1995"},{"key":"ref50","author":"macwilliams","year":"2006","journal-title":"The Theory of Error Correcting Codes"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1049\/cds2.12026"},{"key":"ref10","first-page":"107","article-title":"Decoding random linear codes in O(20.054n)","author":"may","year":"2011","journal-title":"Proc Advances in Cryptology (ASIACRYPT)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1994.4.3.191"},{"key":"ref40","author":"forney","year":"1965","journal-title":"Concatenated Codes"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.4.439"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_20"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9148812"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-021-01002-2"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2020089"},{"key":"ref18","article-title":"A new path to code-based signatures via identification schemes with restricted errors","author":"baldi","year":"2020","journal-title":"arXiv 2008 06403"},{"key":"ref19","article-title":"On the hardness of the Lee syndrome decoding problem","author":"weger","year":"2020","journal-title":"arXiv 2002 12785"},{"key":"ref4","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","author":"mceliece","year":"1978"},{"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’s public-key cryptosystem","author":"lee","year":"1988","journal-title":"Advances in Cryptology (EUROCRYPT)"},{"key":"ref49","article-title":"Hamming quasi-cyclic (HQC)","author":"melchor","year":"2020"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-98365-9_4"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cds.2014.0278"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3158329"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/IPEC.2012.6522627"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICCE-Berlin53567.2021.9720026"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s002000050104"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460100606"},{"key":"ref43","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"}],"container-title":["IEEE Open Journal of the Communications Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8782661\/9702748\/09888779.pdf?arnumber=9888779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,14]],"date-time":"2022-10-14T20:10:52Z","timestamp":1665778252000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9888779\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":51,"URL":"https:\/\/doi.org\/10.1109\/ojcoms.2022.3206395","relation":{},"ISSN":["2644-125X"],"issn-type":[{"value":"2644-125X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}