{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:23:18Z","timestamp":1740122598982,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T00:00:00Z","timestamp":1642464000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,3]]},"DOI":"10.1007\/s10623-021-01002-2","type":"journal-article","created":{"date-parts":[[2022,1,18]],"date-time":"2022-01-18T11:03:13Z","timestamp":1642503793000},"page":"695-717","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the design and security of Lee metric McEliece cryptosystems"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1218-9133","authenticated-orcid":false,"given":"Terry Shue Chien","family":"Lau","sequence":"first","affiliation":[]},{"given":"Chik How","family":"Tan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,18]]},"reference":[{"key":"1002_CR1","doi-asserted-by":"crossref","unstructured":"Baldi M., Chiaraluce F., Garello R., Mininni F.: Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem. In: 2007 IEEE International Conference on Communications, pp. 951\u2014956 (2007).","DOI":"10.1109\/ICC.2007.161"},{"key":"1002_CR2","doi-asserted-by":"crossref","unstructured":"Becker A., Joux A., May A., Meurer, A.: Decoding random binary linear codes in 2n\/20: How 1 + 1 = 0 improves information set decoding. In: Proc. Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2012), pp. 520\u2013536 (2012).","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"1002_CR3","doi-asserted-by":"crossref","unstructured":"Berger T.P., Gueye C.T., Klamti J.B., Ruatta O.: Designing a public key cryptosystem based on quasi-cyclic subspace subcodes of Reed-Solomoncodes. In: International Conference on Algebra, Codes and Cryptology, pp. 97\u2013113 (2019).","DOI":"10.1007\/978-3-030-36237-9_6"},{"issue":"3","key":"1002_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp E., McEliece R., Tilborg H.V.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1002_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein D.J., Lange T., Peters C.: Smaller decoding exponents: ball-collision decoding. In: Proc. Annual Cryptology Conference (CRYPTO 2011), pp. 743\u2013760 (2011).","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"1002_CR6","doi-asserted-by":"crossref","unstructured":"Guo Q., Johansson T., Stankovski P.: A key recovery attack on MDPC with CCA security using decoding errors. In: Proc. 22nd Int. Conf. Theory Appl. Cryptol. Inf. Secur., Hanoi, Vietnam, pp. 789\u2013815 (2016).","DOI":"10.1007\/978-3-662-53887-6_29"},{"key":"1002_CR7","doi-asserted-by":"crossref","unstructured":"Gueye C.T., Klamti J.B., Hirose S.: Generalization of bjmm-isd using may-ozerov nearest neighbor algorithm over an arbitrary finite field $${\\mathbb{F}}_q$$. Cryptology and Information Security. In: Proc. Codes, pp. 96\u2013109 (2017).","DOI":"10.1007\/978-3-319-55589-8_7"},{"key":"1002_CR8","doi-asserted-by":"crossref","unstructured":"Hirose S.: May-ozerov algorithm for nearest-neighbor problem over $$\\mathbb{F}_q$$ and its application to information set decoding. In: Proc. International Conference for Information Technology and Communications, pp. 115\u2013126 (2016).","DOI":"10.1007\/978-3-319-47238-6_8"},{"key":"1002_CR9","doi-asserted-by":"publisher","unstructured":"Horlemann Trautmann A.-L., Weger V.: information set decoding in the lee metric with applications to cryptography. Adv. Math. Commun. https:\/\/doi.org\/10.3934\/amc.2020089 (2020).","DOI":"10.3934\/amc.2020089"},{"issue":"2","key":"1002_CR10","doi-asserted-by":"crossref","first-page":"195","DOI":"10.13069\/jacodesmath.729477","volume":"7","author":"C Interlando","year":"2020","unstructured":"Interlando C., Khathuria K., Rohrer N., Rosenthal J., Weger V.: Generalization of the ball-collision algorithm. J. Algebra Comb. Discret. Struct. Appl. 7(2), 195\u2013207 (2020).","journal-title":"J. Algebra Comb. Discret. Struct. Appl."},{"issue":"2","key":"1002_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.3934\/amc.2020053","volume":"15","author":"K Khathuria","year":"2021","unstructured":"Khathuria K., Rosenthal J., Weger V.: Encryption scheme based on expanded Reed\u2013Solomon codes. Adv. Math. Commun. 15(2), 207\u2013218 (2021).","journal-title":"Adv. Math. Commun."},{"key":"1002_CR12","unstructured":"Lau Terry S.C.: SAGEMATH Code for Plaintext Recovery Attack on the Lee metric McEliece Public Key Encryption Scheme. https:\/\/github.com\/terrylsc\/Plaintext.Recovery.Attack-LeeMetricPKE."},{"key":"1002_CR13","doi-asserted-by":"crossref","unstructured":"Lee P.J., Brickell, E.F.: An observation on the security of mcelieces public-key cryptosystem. In: Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT 1988), pp. 275\u2013280 (1988).","DOI":"10.1007\/3-540-45961-8_25"},{"issue":"5","key":"1002_CR14","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"JS Leon","year":"1988","unstructured":"Leon J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inf. Theory 34(5), 1354\u20131359 (1988).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1002_CR15","doi-asserted-by":"crossref","unstructured":"May A., Ozerov I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Proc. Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT 2015), pp. 203\u2013228 (2015).","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"1002_CR16","volume-title":"A Public-Key Cryptosystem Based on Algebraic Coding Theory. Technical Report, DSN Progress Report","author":"RJ McEliece","year":"1978","unstructured":"McEliece R.J.: A Public-Key Cryptosystem Based on Algebraic Coding Theory. Technical Report, DSN Progress Report. Jet Propulsion Laboratory, Pasadena (1978)."},{"key":"1002_CR17","doi-asserted-by":"crossref","unstructured":"Misoczki R., Tillich J.-P., Sendrier N., Barreto P.S.L.M.: MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes. In: IEEE International Symposium on Information Theory (ISIT 2013), pp. 2069\u20132073 (2013).","DOI":"10.1109\/ISIT.2013.6620590"},{"issue":"1","key":"1002_CR18","first-page":"47","volume":"4","author":"R Niebuhr","year":"2017","unstructured":"Niebuhr R., Persichetti E., Cayrel P.-L., Bulygin S., Buchmann J.: On lower bounds for information set decoding over $${\\mathbb{F}}_q$$ and on the effect of partial knowledge. Int. J. Inf. Coding Theory 4(1), 47\u201378 (2017).","journal-title":"Int. J. Inf. Coding Theory"},{"key":"1002_CR19","doi-asserted-by":"crossref","unstructured":"Peters C.: Information-set decoding for linear codes over $${\\mathbb{F}}_q$$. In: Proc. Post-Quantum Cryptography (PQCrypto 2010), pp. 81\u201394 (2010).","DOI":"10.1007\/978-3-642-12929-2_7"},{"issue":"5","key":"1002_CR20","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange E.: The use of information sets in decoding cyclic codes. IRE Trans. Inf. Theory 8(5), 5\u20139 (1962).","journal-title":"IRE Trans. Inf. Theory"},{"key":"1002_CR21","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J Stern","year":"1989","unstructured":"Stern J.: A method for finding codewords of small weight. In: Coding Theory and Applications, pp. 106\u2013113. Springer, New York (1989)."},{"key":"1002_CR22","unstructured":"Weger V., Khathuria K., Horlemann Trautmann A.-L., Battaglioni M., Santini P., Persichetti E.: On the Hardness of the Lee Syndrome Decoding Problem, version 4. arXiv.org, https:\/\/arxiv.org\/abs\/2002.12785v4."},{"key":"1002_CR23","unstructured":"Weger V., Santini P., Battaglioni M., Horlemann Trautmann A.-L.: NP-Complete problems for Lee metric codes, version 1. arXiv.org, https:\/\/arxiv.org\/abs\/2002.12785v1."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01002-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-01002-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-01002-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T14:35:12Z","timestamp":1726497312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-01002-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,18]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,3]]}},"alternative-id":["1002"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-01002-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,1,18]]},"assertion":[{"value":"9 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}