{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:56:10Z","timestamp":1774976170777,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T00:00:00Z","timestamp":1745020800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T00:00:00Z","timestamp":1745020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"BARRACUDA","award":["ANR-21-CE39-0009-BARRACUDA"],"award-info":[{"award-number":["ANR-21-CE39-0009-BARRACUDA"]}]},{"name":"BARRACUDA","award":["ANR-21-CE39-0009-BARRACUDA"],"award-info":[{"award-number":["ANR-21-CE39-0009-BARRACUDA"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s10623-025-01626-8","type":"journal-article","created":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T06:18:36Z","timestamp":1745043516000},"page":"3083-3105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Understanding the new distinguisher of alternant codes at degree 2"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2440-8568","authenticated-orcid":false,"given":"Axel","family":"Lemoine","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5165-5320","authenticated-orcid":false,"given":"Rocco","family":"Mora","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1709-1792","authenticated-orcid":false,"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,19]]},"reference":[{"key":"1626_CR1","unstructured":"Albrecht M., Bernstein D.J., Chou T., Cid C., Gilcher J., Lange T., Maram V., von Maurich I., Mizoczki R., Niederhagen R., Persichetti E., Paterson K., Peters C., Schwabe P., Sendrier N., Szefer J., Tjhai C.J., Tomlinson M., Wen W.: Classic McEliece (merger of Classic McEliece and NTS-KEM). https:\/\/classic.mceliece.org, November 2022. Fourth round finalist of the NIST post-quantum cryptography call (2022)."},{"key":"1626_CR2","volume-title":"Algebraic Complexity Theory, Volume 315 of Grundlehren der mathematischen Wissenschaften","author":"P B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser P., Clausen M., Shokrollahi M.A.: Algebraic Complexity Theory, Volume 315 of Grundlehren der mathematischen Wissenschaften. Springer, Berlin (1997)."},{"issue":"6","key":"1626_CR3","doi-asserted-by":"publisher","first-page":"4492","DOI":"10.1109\/TIT.2023.3334592","volume":"70","author":"M Bardet","year":"2024","unstructured":"Bardet M., Mora R., Tillich J.-P.: Polynomial time key-recovery attack on high rate random alternant codes. IEEE Trans. Inf. Theory 70(6), 4492\u20134511 (2024).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1626_CR4","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. Inf. Theory 61(3), 1159\u20131173 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1626_CR5","doi-asserted-by":"crossref","unstructured":"Couvreur A., Mora R., Tillich J.-P.: A new approach based on quadratic forms to attack the McEliece cryptosystem. In: Guo J., Steinfeld R. (eds.) Advances in Cryptology\u2014ASIACRYPT 2023\u201429th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4-8, 2023, Proceedings, Part IV, Volume 14441 of LNCS, pp. 3\u201338. Springer (2023).","DOI":"10.1007\/978-981-99-8730-6_1"},{"key":"1626_CR6","doi-asserted-by":"crossref","unstructured":"Couvreur A., Mora R., Tillich J.-P.: A new approach based on quadratic forms to attack the McEliece cryptosystem. arXiv Preprint arXiv:2306.10294 (2023).","DOI":"10.1007\/978-981-99-8730-6_1"},{"key":"1626_CR7","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.ffa.2014.04.007","volume":"29","author":"A Couvreur","year":"2014","unstructured":"Couvreur A., Otmani A., Tillich J.-P.: New identities relating wild Goppa codes. Finite Fields Appl. 29, 178\u2013197 (2014).","journal-title":"Finite Fields Appl."},{"key":"1626_CR8","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: Proceedings of the IEEE Information Theory Workshop\u2014ITW\u00a02011, Paraty, Brasil, October 2011, pp. 282\u2013286 (2011).","DOI":"10.1109\/ITW.2011.6089437"},{"key":"1626_CR9","unstructured":"McEliece R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab, 1978. DSN Progress Report 44."},{"key":"1626_CR10","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"},{"key":"1626_CR11","doi-asserted-by":"crossref","unstructured":"Mora R., Tillich J.-P.: On the dimension and structure of the square of the dual of a Goppa code. In: WCC 2022\u2014Workshop on Coding Theory and Cryptography (2022).","DOI":"10.1007\/s10623-022-01153-w"},{"issue":"4","key":"1626_CR12","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1007\/s10623-022-01153-w","volume":"91","author":"R Mora","year":"2023","unstructured":"Mora R., Tillich J.-P.: On the dimension and structure of the square of the dual of a Goppa code. Des. Codes Cryptogr. 91(4), 1351\u20131372 (2023).","journal-title":"Des. Codes Cryptogr."},{"key":"1626_CR13","doi-asserted-by":"crossref","unstructured":"Randriambololona H.: The syzygy distinguisher. CoRR arXiv:2407.15740 (2024).","DOI":"10.1007\/978-3-031-91095-1_12"},{"key":"1626_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01446461","volume":"19","author":"Veronese","year":"1882","unstructured":"Veronese: Behandlung der projectivischen verh\u00e4ltnisse der r\u00e4ume von verschiedenen dimensionen durch das princip des projicirens und schneidens. Mathematische Annalen 19, 161\u2013234 (1882).","journal-title":"Mathematische Annalen"},{"issue":"4","key":"1626_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2331130.2331138","volume":"38","author":"M Wimmer","year":"2012","unstructured":"Wimmer M.: Algorithm923: efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices. ACM Trans. Math. Softw. 38(4), 1\u201317 (2012).","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01626-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01626-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01626-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T12:09:01Z","timestamp":1757160541000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01626-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,19]]},"references-count":15,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["1626"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01626-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,19]]},"assertion":[{"value":"15 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2025","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 declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}