{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:56:24Z","timestamp":1774976184889,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/iscc.2013.6754945","type":"proceedings-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T22:14:57Z","timestamp":1394230497000},"page":"000197-000202","source":"Crossref","is-referenced-by-count":12,"title":["Improving the efficiency of the LDPC code-based McEliece cryptosystem through irregular codes"],"prefix":"10.1109","author":[{"given":"Marco","family":"Baldi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Bianchi","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Maturo","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Chiaraluce","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/18.485714","article-title":"Iterative decoding of binary block and convolutional codes","volume":"42","author":"hagenauer","year":"1996","journal-title":"IEEE Trans Inform Theory"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161953"},{"key":"18","author":"johnson","year":"2010","journal-title":"Iterative Error Correction"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.161"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/18.910575"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866513"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.030712.100173"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2187515"},{"key":"21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low-Density Parity-Check Codes"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2009.2016498"},{"key":"22","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","article-title":"Information-set decoding for linear codes over Fq","volume":"6061","author":"peters","year":"2010","journal-title":"Post-Quantum Cryptography Ser Lecture Notes in Computer Science"},{"key":"23","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)","volume":"7073","author":"may","year":"2011","journal-title":"Lecture Notes in Computer Science"},{"key":"24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-29011-4_31","article-title":"Decoding random binary linear codes in 2n\/20: How 1 + 1 = 0 improves information set decoding","author":"becker","year":"2012","journal-title":"Lecture Notes in Computer Science"},{"key":"25","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","article-title":"Smaller decoding exponents: Ball-collision decoding","volume":"6841","author":"bernstein","year":"0","journal-title":"Lecture Notes in Computer Science"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1080\/19393551003649016"},{"key":"3","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","article-title":"A new analysis of the McEliece cryptosystem based on QC-LDPC codes security and cryptography for networks, ser","volume":"5229","author":"baldi","year":"2008","journal-title":"Lecture Notes in Computer Science"},{"key":"2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","article-title":"Attacking and defending the McEliece cryptosystem Post-Quantum Cryp-tography, ser","volume":"5299","author":"bernstein","year":"2008","journal-title":"Lecture Notes in Computer Science"},{"key":"1","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","author":"mceliece","year":"1978","journal-title":"DSN progress report"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.091212.121230"},{"key":"7","author":"biasi","year":"2012","journal-title":"Scaling Efficient Code-based Cryptosystems for Embedded Platforms"},{"key":"6","author":"misoczki","year":"2012","journal-title":"MDPC-McEliece New McEliece Variants from Moderate Density Parity-check Codes"},{"key":"5","article-title":"Optimization of the parity-check matrix density in QCLDPC code-based McEliece cryptosystems","author":"baldi","year":"2013","journal-title":"Proc IEEE ICC 2013-Workshop on Information Security over Noisy and Lossy Communication Systems"},{"key":"4","article-title":"Security and complexity of the McEliece cryptosystem based on QCLDPC codes","author":"baldi","year":"2012","journal-title":"IET Information Security"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2009.05.070047"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"}],"event":{"name":"2013 IEEE Symposium on Computers and Communications (ISCC)","location":"Split, Croatia","start":{"date-parts":[[2013,7,7]]},"end":{"date-parts":[[2013,7,10]]}},"container-title":["2013 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6746555\/6754912\/06754945.pdf?arnumber=6754945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T08:02:44Z","timestamp":1565251364000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6754945\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/iscc.2013.6754945","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}