{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T03:05:05Z","timestamp":1763435105689,"version":"build-2065373602"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,2,19]],"date-time":"2022-02-19T00:00:00Z","timestamp":1645228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,2,19]],"date-time":"2022-02-19T00:00:00Z","timestamp":1645228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2019MF054"],"award-info":[{"award-number":["ZR2019MF054"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902091"],"award-info":[{"award-number":["61902091"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Research Foundation of Harbin Institute of Technology","award":["HIT.NSRIF.2020099"],"award-info":[{"award-number":["HIT.NSRIF.2020099"]}]},{"DOI":"10.13039\/501100012558","name":"Foundation of Science and Technology on Information Assurance Laboratory","doi-asserted-by":"publisher","award":["KJ-17-004"],"award-info":[{"award-number":["KJ-17-004"]}],"id":[{"id":"10.13039\/501100012558","id-type":"DOI","asserted-by":"publisher"}]},{"name":"2017 Weihai University Co-construction Project"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11235-022-00881-7","type":"journal-article","created":{"date-parts":[[2022,2,19]],"date-time":"2022-02-19T15:04:42Z","timestamp":1645283082000},"page":"17-32","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An improved McEliece cryptosystem based on QC-MDPC code with compact key size"],"prefix":"10.1007","volume":"80","author":[{"given":"Jie","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1543-9433","authenticated-orcid":false,"given":"Xiaojun","family":"Tong","sequence":"additional","affiliation":[]},{"given":"Zhu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Miao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,2,19]]},"reference":[{"key":"881_CR1","first-page":"417","volume-title":"On public key encryption from noisy codewords. Public-key cryptography\u2013PKC","author":"E Ben-Sasson","year":"2016","unstructured":"Ben-Sasson, E., Ben-Tov, I., Damgard, I., et al. (2016). On public key encryption from noisy codewords. Public-key cryptography\u2013PKC (pp. 417\u2013446). Springer."},{"issue":"6","key":"881_CR2","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/LWC.2017.2735401","volume":"6","author":"AMR Hooshmand","year":"2017","unstructured":"Hooshmand, A. M. R. (2017). Efficient polar code-based physical layer encryption scheme. IEEE Wireless Communications Letters, 6(6), 710\u2013713.","journal-title":"IEEE Wireless Communications Letters"},{"key":"881_CR3","first-page":"4380","volume":"7","author":"Lu Xinjin","year":"2018","unstructured":"Xinjin, Lu., Lei, J., Li, W., Lai, Ke., & Pan, Z. (2018). Physical layer encryption algorithm based on polar codes and chaotic sequences. IEEE Access, 7, 4380\u20134390.","journal-title":"IEEE Access"},{"key":"881_CR4","first-page":"114","volume":"44","author":"RJ McEliece","year":"1978","unstructured":"McEliece, R. J. (1978). A public-key cryptosystem based on algebraic coding theory. Deep Space Network Progress Report, 44, 114\u2013116.","journal-title":"Deep Space Network Progress Report"},{"issue":"3","key":"881_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E. R., McEliece, R. J., & Van Tilborg, H. C. A. (1978). On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory, 24(3), 384\u2013386.","journal-title":"IEEE Transactions on Information Theory"},{"key":"881_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Introduction to post-quantum cryptography. Post-quantum cryptography","author":"DJ Bernstein","year":"2009","unstructured":"Bernstein, D. J. (2009). Introduction to post-quantum cryptography. Post-quantum cryptography (pp. 1\u201314). Springer."},{"key":"881_CR7","first-page":"275","volume":"330","author":"PJ Lee","year":"1988","unstructured":"Lee, P. J., & Brickell, E. F. (1988). An observation on the security of McEliece\u2019s public-key cryptosystem. EUROCRYPT 1988: Advances in Cryptology, 330, 275\u2013280.","journal-title":"EUROCRYPT 1988: Advances in Cryptology"},{"issue":"1","key":"881_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"Canteaut, A., & Chabaud, F. (1998). A new algorithm for finding minimum-weight words in a linear code: Application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Transactions on Information Theory., 44(1), 367\u2013378.","journal-title":"IEEE Transactions on Information Theory."},{"issue":"2","key":"881_CR9","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H. (1986). Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, 15(2), 159\u2013166.","journal-title":"Problems of Control and Information Theory"},{"issue":"1","key":"881_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/18.272496","volume":"40","author":"Y Li","year":"1994","unstructured":"Li, Y., Deng, R., & Wang, X. M. (1994). On the equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Transactions on Information, 40(1), 271\u2013273.","journal-title":"IEEE Transactions on Information"},{"key":"881_CR11","doi-asserted-by":"crossref","unstructured":"Monico, C., Rosenthal, J., & Shokrollahi, A. (2000). Using low density parity check codes in the McEliece cryptosystem. In IEEE international symposium on information theory (p. 215).","DOI":"10.1109\/ISIT.2000.866513"},{"issue":"2","key":"881_CR12","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/18.910577","volume":"47","author":"T Richardson","year":"2001","unstructured":"Richardson, T., & Urbanke, R. (2001). The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information, 47(2), 599\u2013618.","journal-title":"IEEE Transactions on Information"},{"key":"881_CR13","unstructured":"Gaborit, P. (2005). Shorter keys for code based cryptography. In Proceedings of the 2005 international workshop on coding and cryptography (WCC 2005) (pp. 81\u201391)."},{"key":"881_CR14","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F., & Garello, R. (2006). On the usage of quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In International conference on communications & electronics (pp. 305\u2013310).","DOI":"10.1109\/CCE.2006.350824"},{"key":"881_CR15","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F., Garello, R., & Mininni, F. (2007). Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In IEEE international conference on communications (pp. 951\u2013956).","DOI":"10.1109\/ICC.2007.161"},{"key":"881_CR16","doi-asserted-by":"crossref","unstructured":"Baldi, M. & Chiaraluce, F. (2007). Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In IEEE international symposium on information theory (pp. 2591\u20132595).","DOI":"10.1109\/ISIT.2007.4557609"},{"issue":"2","key":"881_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/LCOMM.2002.808375","volume":"7","author":"SJ Johnson","year":"2003","unstructured":"Johnson, S. J., & Weller, S. R. (2003). A family of irregular LDPC codes with low encoding complexity. IEEE Communications Letters, 7(2), 79\u201381.","journal-title":"IEEE Communications Letters"},{"issue":"2","key":"881_CR18","first-page":"1036","volume":"2","author":"T Xia","year":"2005","unstructured":"Xia, T., & Xia, B. (2005). Quasi-cyclic codes from extended difference families. Wireless Communications and Networking Conference., 2(2), 1036\u20131040.","journal-title":"Wireless Communications and Networking Conference."},{"issue":"2","key":"881_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A Otmani","year":"2010","unstructured":"Otmani, A., Tillich, J.-P., & Dallot, L. (2010). Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Mathematics in Computer Science, 3(2), 129\u2013140.","journal-title":"Mathematics in Computer Science"},{"key":"881_CR20","first-page":"106","volume":"56","author":"J Stern","year":"1988","unstructured":"Stern, J. (1988). A method for finding codewords of small weight. International Colloquium on Coding Theory and Applications, 56, 106\u2013113.","journal-title":"International Colloquium on Coding Theory and Applications"},{"key":"881_CR21","first-page":"160","volume":"23","author":"M Baldi","year":"2009","unstructured":"Baldi, M. (2009). LDPC codes in the McEliece cryptosystem: Attacks and countermeasures. NATO Science for Peace and Security Series\u2014D: Information and Communication Security, 23, 160\u2013174.","journal-title":"NATO Science for Peace and Security Series\u2014D: Information and Communication Security"},{"key":"881_CR22","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J. C., Otmani, A., Perret, L., & Tillich, J.-P. (2010). Algebraic cryptanalysis of McEliece variants with compact keys. In International conference on theory & applications of cryptographic tichniques (Vol. 6110, pp. 279\u2013298).","DOI":"10.1007\/978-3-642-13190-5_14"},{"issue":"1","key":"881_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-015-0036-z","volume":"79","author":"JC Faug\u00e8re","year":"2016","unstructured":"Faug\u00e8re, J. C., Otmani, A., Perret, L., de Portzamparc, F., & Tillich, J.-P. (2016). Structural cryptanalysis of McEliece schemes with compact keys. Designs Codes and Cryptography, 79(1), 87\u2013112.","journal-title":"Designs Codes and Cryptography"},{"issue":"1","key":"881_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-014-9187-8","volume":"29","author":"M Baldi","year":"2016","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., & Schipani, D. (2016). Enhanced public key security for the McEliece cryptosystem. Journal of Cryptology., 29(1), 1\u201327.","journal-title":"Journal of Cryptology."},{"key":"881_CR25","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J., Sendrier, N., & Barreto, P. S. L. M. (2013). MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In IEEE international symposium on information theory (pp. 2069\u20132073).","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"4","key":"881_CR26","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1109\/LCOMM.2016.2640271","volume":"21","author":"H Moufek","year":"2017","unstructured":"Moufek, H., Guenda, K., & Aaron Gulliver, T. (2017). A new variant of the McEliece cryptosystem based on QC-LDPC and QC-MDPC codes. IEEE Communications Letters, 21(4), 714\u2013717.","journal-title":"IEEE Communications Letters"},{"key":"881_CR27","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-319-11659-4_16","volume":"8772","author":"I von Maurich","year":"2014","unstructured":"von Maurich, I., & G\u00fcneysu, T. (2014). Towards side-channel resistant implementations of QC-MDPC McEliece encryption on constrained devices. Lecture Notes in Computer Science, 8772, 266\u2013282.","journal-title":"Lecture Notes in Computer Science"},{"key":"881_CR28","doi-asserted-by":"crossref","unstructured":"Fab\u0161i\u010d, T., Hromada, V., Stankovski, P., Zajac, P., Guo, Q., & Johansson, T. (2017). A reaction attack on the QC-LDPC McEliece cryptosystem. In International workshop on post-quantum cryptography (pp. 51\u201368).","DOI":"10.1007\/978-3-319-59879-6_4"},{"key":"881_CR29","doi-asserted-by":"crossref","unstructured":"Kobara, K. & Imai, H. (2001). Semantically secure McEliece public-key cryptosystems-conversions for McEliece PKC. In PKC '01 Proceedings of the 4th international workshop on practice and theory in public key cryptography: Public key cryptography 1992 (1) (pp. 19\u201335).","DOI":"10.1007\/3-540-44586-2_2"},{"key":"881_CR30","unstructured":"Aragon, N., Barreto, P. S. L. M., & Bettaieb, S., et al. (2018) BIKE: bit flipping key encapsulation. https:\/\/bikesuite.org\/files\/BIKE.pdf. 2018-10-22."},{"key":"881_CR31","unstructured":"Baldi, M., Barenghi, A., Chiaraluce, F., et al. (2017). LEDApkc: Low-dEnsity parity-check coDe-bAsed public-key cryptosystem. https:\/\/www.ledacrypt.org\/documents\/LEDApkc_spec_latest.pdf. 2017-11-30."},{"key":"881_CR32","unstructured":"Bernstein, D. J., Chou, T., Lange, T., et al. (2017). Classic McEliece: conservative code-based cryptography. https:\/\/classic.mceliece.org\/nist\/mceliece-20171129.pdf. 2017-11-29."},{"key":"881_CR33","doi-asserted-by":"crossref","unstructured":"Baldi, M., Santini, P., & Chiaraluce, F. (2016). Soft McEliece: MDPC code-based McEliece cryptosystems with very compact keys through real-valued intentional errors. In IEEE international symposium on information theory (pp. 795\u2013799).","DOI":"10.1109\/ISIT.2016.7541408"},{"key":"881_CR34","first-page":"789","volume-title":"A key recovery attack on MDPC with CCA security using decoding errors","author":"Q Guo","year":"2016","unstructured":"Guo, Q., Johansson, T., & Stankovski, P. (2016). A key recovery attack on MDPC with CCA security using decoding errors (pp. 789\u2013815). Springer."},{"key":"881_CR35","unstructured":"Aragon, N., Barreto, P., Bettaieb, S., et al. (2020). BIKE: bit flipping key encapsulation: round 3 submission. https:\/\/bikesuite.org\/files\/round2\/spec\/BIKE-Spec-2020.02.07.1.pdf. 2020-02-07."},{"key":"881_CR36","unstructured":"Chou, T., Cid, C., UiB, S., et al. (2020). Classic McEliece: conservative code-based cryptography, 10 October 2020. https:\/\/classic.mceliece.org\/nist\/mceliece-20201010.pdf. 2020-10-10."},{"key":"881_CR37","first-page":"135","volume":"1","author":"F Biraud","year":"1978","unstructured":"Biraud, F., Bermond, J. C., Kotzig, A., & Turgeon, J. (1978). On a combinatorial problem of antennas in radioastronomy. Combinatorics, 1, 135\u2013149.","journal-title":"Combinatorics"},{"issue":"5","key":"881_CR38","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E. (1962). The use of information sets in decoding cyclic codes. Ire Transactions on Information Theory, 8(5), 5\u20139.","journal-title":"Ire Transactions on Information Theory"},{"key":"881_CR39","first-page":"275","volume-title":"An observation on the security of McEliece\u2019s public-key cryptosystem. Workshop on the theory and application of cryptographic techniques","author":"PJ Lee","year":"1988","unstructured":"Lee, P. J., & Brickell, E. F. (1988). An observation on the security of McEliece\u2019s public-key cryptosystem. Workshop on the theory and application of cryptographic techniques (pp. 275\u2013280). Springer."},{"issue":"5","key":"881_CR40","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"JS Leon","year":"1988","unstructured":"Leon, J. S. (1988). A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory, 34(5), 1354\u20131359.","journal-title":"IEEE Transactions on Information Theory"},{"key":"881_CR41","doi-asserted-by":"crossref","unstructured":"Stern, J. (1988). A method for finding codewords of small weight. In International colloquium on coding theory and applications (pp. 106\u2013113). Springer.","DOI":"10.1007\/BFb0019850"},{"key":"881_CR42","doi-asserted-by":"crossref","unstructured":"Finiasz, M. & Sendrier, N. (2009). Security bounds for the design of code-based cryptosystems. In International conference on the theory and application of cryptology and information security (pp. 88\u2013105). Springer.","DOI":"10.1007\/978-3-642-10366-7_6"},{"key":"881_CR43","doi-asserted-by":"crossref","unstructured":"May, A., Meurer, A., & Thomae, E. (2011). Decoding random linear codes in O (20.054n). Advances in cryptology (lecture notes in computer science) (Vol. 7073, pp. 107\u2013124).","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"881_CR44","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume":"56","author":"A Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., & Meurer, A. (2012). Decoding random binary linear codes in 2n\/20: How 1 + 1 = 0 improves information set decoding. EUROCRYPT 2012: Advances in Cryptology-EUROCRYPT, 56, 520\u2013536.","journal-title":"EUROCRYPT 2012: Advances in Cryptology-EUROCRYPT"},{"key":"881_CR45","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume":"9056","author":"A May","year":"2015","unstructured":"May, A., & Ozerov, I. (2015). On computing nearest neighbors with applications to decoding of binary linear codes. Advances in Cryptology (Lecture Notes in Computer Science), 9056, 203\u2013228.","journal-title":"Advances in Cryptology (Lecture Notes in Computer Science)"},{"issue":"1294","key":"881_CR46","first-page":"213","volume":"1294","author":"TA Berson","year":"1997","unstructured":"Berson, T. A. (1997). Failure of the McEliece public-key cryptosystem under message-resend and related-message attack. International Cryptology Conference, 1294(1294), 213\u2013220.","journal-title":"International Cryptology Conference"},{"key":"881_CR47","first-page":"273","volume":"10","author":"S Heyse","year":"2013","unstructured":"Heyse, S., Maurich, I. V., & Tim, G. (2013). Smaller keys for code-based cryptography: QC-MDPC McEliece implementations on embedded devices. Cryptographic Hardware and Embedded System, 10, 273\u2013292.","journal-title":"Cryptographic Hardware and Embedded System"},{"key":"881_CR48","doi-asserted-by":"crossref","unstructured":"Von Maurich, I., & G\u00fcneysu, T. (2014). Towards side-channel resistant implementations of QC-MDPC McEliece encryption on constrained devices. In International workshop on post-quantum cryptography (pp. 266\u2013282).","DOI":"10.1007\/978-3-319-11659-4_16"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-022-00881-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-022-00881-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-022-00881-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T19:18:07Z","timestamp":1649791087000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-022-00881-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,19]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["881"],"URL":"https:\/\/doi.org\/10.1007\/s11235-022-00881-7","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2022,2,19]]},"assertion":[{"value":"12 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}