{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:07:35Z","timestamp":1775732855082,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032226976","type":"print"},{"value":"9783032226983","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22698-3_9","type":"book-chapter","created":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:24:02Z","timestamp":1775730242000},"page":"275-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Breaking McEliece Keys Using Brute Force"],"prefix":"10.1007","author":[{"given":"Lorenz","family":"Panny","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,10]]},"reference":[{"key":"9_CR1","unstructured":"Albrecht, M., Bard, G.: The M4RI Library. The M4RI\u00a0Team (2025). https:\/\/bitbucket.org\/malb\/m4ri"},{"key":"9_CR2","unstructured":"Albrecht, M.R., et al.: Classic McEliece: conservative code-based cryptography. Tech. rep. (2022). https:\/\/classic.mceliece.org\/mceliece-rationale-20221023.pdf"},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1006\/ffta.2000.0277","volume":"6","author":"TP Berger","year":"2000","unstructured":"Berger, T.P.: On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes, and extended Goppa codes. Finite Fields Appl. 6(3), 255\u2013281 (2000). https:\/\/doi.org\/10.1006\/ffta.2000.0277","journal-title":"Finite Fields Appl."},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Bernstein, D.J.: Understanding binary-Goppa decoding. IACR Commun. Cryptol. 1(1) (2024). https:\/\/doi.org\/10.62056\/angy4fe-3","DOI":"10.62056\/angy4fe-3"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: PQCrypto 2008. LNCS, vol.\u00a05299, pp. 31\u201346. Springer (2008). https:\/\/ia.cr\/2018\/318","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"9_CR6","first-page":"487","volume":"194","author":"\u0412\u041b \u0410\u0440\u043b\u0430\u0437\u0430\u0440\u043e\u0432","year":"1970","unstructured":"\u0410\u0440\u043b\u0430\u0437\u0430\u0440\u043e\u0432, \u0412\u041b, \u0414\u0438\u043d\u0438\u0446, \u0415\u0410, \u041a\u0440\u043e\u043d\u0440\u043e\u0434, \u041c\u0410, \u0424\u0430\u0440\u0430\u0434\u0436\u0435\u0432, \u0418\u0410: \u041e\u0431 \u044d\u043a\u043e\u043d\u043e\u043c\u043d\u043e\u043c \u043f\u043e\u0441\u0442\u0440\u043e\u0435\u043d\u0438\u0438 \u0442\u0440\u0430\u043d\u0437\u0438\u0442\u0438\u0432\u043d\u043e\u0433\u043e \u0437\u0430\u043c\u044b\u043a\u0430\u043d\u0438\u044f \u043e\u0440\u0438\u0435\u043d\u0442\u0438\u0440\u043e\u0432\u0430\u043d\u043d\u043e\u0433\u043e \u0433\u0440\u0430\u0444\u0430. \u0414\u043e\u043a\u043b\u0430\u0434\u044b \u0410\u043a\u0430\u0434\u0435\u043c\u0438\u0438 \u041d\u0430\u0443\u043a \u0421\u0421\u0421\u0420 194, 487\u2013488 (1970)","journal-title":"\u0414\u043e\u043a\u043b\u0430\u0434\u044b \u0410\u043a\u0430\u0434\u0435\u043c\u0438\u0438 \u041d\u0430\u0443\u043a \u0421\u0421\u0421\u0420"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Gibson, J.K.: Equivalent Goppa codes and trapdoors to McEliece\u2019s public key cryptosystem. In: EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 517\u2013521. Springer (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_46","DOI":"10.1007\/3-540-46416-6_46"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1109\/18.915687","volume":"47","author":"P Loidreau","year":"2001","unstructured":"Loidreau, P., Sendrier, N.: Weak keys in the McEliece public-key cryptosystem. IEEE Trans. Inf. Theory 47(3), 1207\u20131211 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR9","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Company, 3 edn. (1981)"},{"key":"9_CR10","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. The Deep Space Network Progress Report 42-44 (1978). https:\/\/ipnpr.jpl.nasa.gov\/progress_report\/42-44\/44N.PDF"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Moreno, O.: Symmetries of binary Goppa codes (corresp.). IEEE Trans. Inf. Theory 25(5), 609\u2013612 (1979). https:\/\/doi.org\/10.1109\/tit.1979.1056089","DOI":"10.1109\/tit.1979.1056089"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.) Post-Quantum Cryptography, pp. 95\u2013145. Springer (2009)","DOI":"10.1007\/978-3-540-88702-7_4"},{"issue":"2","key":"9_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"NJ Patterson","year":"1975","unstructured":"Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theory 21(2), 203\u2013207 (1975). https:\/\/doi.org\/10.1109\/TIT.1975.1055350","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: On the dimension of the hull. SIAM J. Discrete Math. 10(2), 282\u2013293 (1997). https:\/\/inria.hal.science\/inria-00074009\/document","DOI":"10.1137\/S0895480195294027"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: The support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000). https:\/\/inria.hal.science\/inria-00073037\/document","DOI":"10.1109\/18.850662"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22698-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T10:24:05Z","timestamp":1775730245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22698-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032226976","9783032226983"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22698-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"10 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Saint-Malo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}