{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:38:40Z","timestamp":1786981120994,"version":"3.56.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T00:00:00Z","timestamp":1669075200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,22]],"date-time":"2022-11-22T00:00:00Z","timestamp":1669075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-17-CE39-0007"],"award-info":[{"award-number":["ANR-17-CE39-0007"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-21-CE39-0009"],"award-info":[{"award-number":["ANR-21-CE39-0009"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10623-022-01153-w","type":"journal-article","created":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T02:03:12Z","timestamp":1669168992000},"page":"1351-1372","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["On the dimension and structure of the square of the dual of a Goppa code"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5165-5320","authenticated-orcid":false,"given":"Rocco","family":"Mora","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,11,22]]},"reference":[{"key":"1153_CR1","doi-asserted-by":"crossref","unstructured":"Becker A., Joux A., May A., Meurer A.: Decoding random binary linear codes in $$2^{n\/20}$$: how $$1+1=0$$ improves information set decoding. In: Advances in Cryptology\u2014EUROCRYPT\u00a02012, LNCS. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"1153_CR2","unstructured":"Bernstein D.J., Chou T., Lange T., von Maurich I., Mizoczki R., Niederhagen R., Persichetti E., Peters C., Schwabe P., Sendrier N., Szefer J., Wen W.: Classic McEliece: Conservative Code-Based Cryptography. Second Round Submission to the NIST Post-quantum Cryptography Call. https:\/\/classic.mceliece.org (2019)"},{"key":"1153_CR3","unstructured":"Both L., May A.: Optimizing BJMM with nearest neighbors: full decoding in $$2^{2\/21 n}$$ and McEliece security. In: WCC Workshop on Coding and Cryptography, September 2017. On Line Proceedings. http:\/\/wcc2017.suai.ru\/Proceedings_WCC2017.zip"},{"issue":"1","key":"1153_CR4","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"Canteaut A., Chabaud F.: 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 Trans. Inform. Theory 44(1), 367\u2013378 (1998).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"1153_CR5","doi-asserted-by":"publisher","first-page":"1159","DOI":"10.1109\/TIT.2015.2393251","volume":"61","author":"I Cascudo","year":"2015","unstructured":"Cascudo I., Cramer R., Mirandola D., Z\u00e9mor G.: Squares of random linear codes. IEEE Trans. Inform. Theory 61(3), 1159\u20131173 (2015).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1153_CR6","doi-asserted-by":"crossref","unstructured":"Courtois N., Finiasz M., Sendrier N.: How to achieve a McEliece-based digital signature scheme. In: Advances in Cryptology\u2014ASIACRYPT\u00a02001, Volume 2248 of LNCS, Gold Coast, Australia, pp. 157\u2013174. Springer (2001)","DOI":"10.1007\/3-540-45682-1_10"},{"key":"1153_CR7","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"2","author":"A Couvreur","year":"2014","unstructured":"Couvreur A., Gaborit P., Gauthier-Uma\u00f1a V., Otmani A., Tillich J.-P.: Distinguisher-based attacks on public-key cryptosystems using Reed\u2013Solomon codes. Des. Codes Cryptogr. 2, 641\u2013666 (2014).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"1153_CR8","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1109\/TIT.2016.2574841","volume":"63","author":"A Couvreur","year":"2017","unstructured":"Couvreur A., Otmani A., Tillich J.-P.: Polynomial time attack on wild McEliece over quadratic extensions. IEEE Trans. Inform. Theory 63(1), 404\u2013427 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"1153_CR9","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1109\/TIT.1975.1055435","volume":"21","author":"P Delsarte","year":"1975","unstructured":"Delsarte P.: On subfield subcodes of modified Reed\u2013Solomon codes. IEEE Trans. Inform. Theory 21(5), 575\u2013576 (1975).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1153_CR10","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re J.-C., Gauthier V., Otmani A., Perret L., Tillich J.-P.: A distinguisher for high rate McEliece cryptosystems. In: Proc. IEEE Inf. Theory Workshop\u2014ITW\u00a02011, Paraty, Brazil, pp. 282\u2013286 (2011)","DOI":"10.1109\/ITW.2011.6089437"},{"issue":"10","key":"1153_CR11","doi-asserted-by":"publisher","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"J-C Faug\u00e8re","year":"2013","unstructured":"Faug\u00e8re J.-C., Gauthier V., Otmani A., Perret L., Tillich J.-P.: A distinguisher for high rate McEliece cryptosystems. IEEE Trans. Inform. Theory 59(10), 6830\u20136844 (2013).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1153_CR12","doi-asserted-by":"crossref","unstructured":"Kachigar G., Tillich J.-P.: Quantum information set decoding algorithms. In: Post-quantum Cryptography\u00a02017, Volume 10346 of LNCS, Utrecht, The Netherlands, pp. 69\u201389. Springer (2017)","DOI":"10.1007\/978-3-319-59879-6_5"},{"key":"1153_CR13","doi-asserted-by":"crossref","unstructured":"Lee P.J., Brickell E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: Advances in Cryptology\u2014EUROCRYPT\u201988, Volume 330 of LNCS, pp. 275\u2013280. Springer (1988)","DOI":"10.1007\/3-540-45961-8_25"},{"key":"1153_CR14","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1986","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes, 5th edn North-Holland, Amsterdam (1986).","edition":"5"},{"issue":"1","key":"1153_CR15","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TIT.2016.2574841","volume":"63","author":"I M\u00e1rquez-Corbella","year":"2017","unstructured":"M\u00e1rquez-Corbella I., Pellikaan R.: Error-correcting pairs for a public-key cryptosystem. CBC 2012, code-based cryptography workshop, 2012. IEEE Trans. Inform. Theory 63(1), 404\u2013427 (2017).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1153_CR16","doi-asserted-by":"crossref","unstructured":"May A., Ozerov I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald E., Fischlin M. (eds.) Advances in Cryptology\u2014-EUROCRYPT\u00a02015, Volume 9056 of LNCS, pp. 203\u2013228. Springer (2015)","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"1153_CR17","doi-asserted-by":"crossref","unstructured":"May A., Meurer A., Thomae E.: Decoding random linear codes in $$O(2^{0.054n})$$. In: Lee D.H., Wang X. (eds.) Advances in Cryptology\u2014ASIACRYPT\u00a02011, Volume 7073 of LNCS, pp. 107\u2013124. Springer (2011)","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"1153_CR18","unstructured":"McEliece R.J.: A Public-Key System Based on Algebraic Coding Theory. DSN Progress Report 44, pp. 114\u2013116. Jet Propulsion Lab (1978)"},{"issue":"2","key":"1153_CR19","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N Patterson","year":"1975","unstructured":"Patterson N.: The algebraic decoding of Goppa codes. IEEE Trans. Inform. Theory 21(2), 203\u2013207 (1975).","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"1153_CR20","doi-asserted-by":"publisher","first-page":"3038","DOI":"10.1109\/TIT.2013.2237944","volume":"59","author":"H Randriambololona","year":"2013","unstructured":"Randriambololona H.: Asymptotically good binary linear codes with asymptotically good self-intersection spans. IEEE Trans. Inform. Theory 59(5), 3038\u20133045 (2013).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1153_CR21","doi-asserted-by":"crossref","unstructured":"Randriambololona H.: On products and powers of linear codes under componentwise multiplication. In: Algorithmic Arithmetic, Geometry, and Coding Theory, Volume 637 of Contemp. Math., pp. 3\u201378. American Mathematics Society, Providence (2015)","DOI":"10.1090\/conm\/637\/12749"},{"key":"1153_CR22","first-page":"59","volume-title":"Coding Theory and Cryptography III","author":"N Sendrier","year":"2010","unstructured":"Sendrier N.: On the use of structured codes in code based cryptography. In: Storme L., Nikova S., Preneel B. (eds.) Coding Theory and Cryptography III, pp. 59\u201368. The Royal Flemish Academy of Belgium for Science and the Arts, Bruxelles (2010)."},{"key":"1153_CR23","doi-asserted-by":"crossref","unstructured":"Stern J.: A method for finding codewords of small weight. In: Cohen G.D., Wolfmann J. (eds.) Coding Theory and Applications, Volume 388 of LNCS, pp. 106\u2013113. Springer (1988)","DOI":"10.1007\/BFb0019850"},{"key":"1153_CR24","doi-asserted-by":"crossref","unstructured":"Wieschebrink C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. In: Post-quantum Cryptography\u00a02010, Volume 6061 of LNCS, pp. 61\u201372. Springer (2010)","DOI":"10.1007\/978-3-642-12929-2_5"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01153-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01153-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01153-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T03:03:37Z","timestamp":1680663817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01153-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,22]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1153"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01153-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11,22]]},"assertion":[{"value":"26 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}