{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:56:24Z","timestamp":1774976184810,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":56,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819987290","type":"print"},{"value":"9789819987306","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-981-99-8730-6_1","type":"book-chapter","created":{"date-parts":[[2023,12,17]],"date-time":"2023-12-17T07:02:04Z","timestamp":1702796524000},"page":"3-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["A New Approach Based on\u00a0Quadratic Forms to\u00a0Attack the\u00a0McEliece Cryptosystem"],"prefix":"10.1007","author":[{"given":"Alain","family":"Couvreur","sequence":"first","affiliation":[]},{"given":"Rocco","family":"Mora","sequence":"additional","affiliation":[]},{"given":"Jean-Pierre","family":"Tillich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,18]]},"reference":[{"key":"1_CR1","unstructured":"Albrecht, M., et al.: Classic McEliece (merger of Classic McEliece and NTS-KEM) (2022). https:\/\/classic.mceliece.org. Fourth round finalist of the NIST post-quantum cryptography call"},{"key":"1_CR2","unstructured":"Bardet, M.: \u00c9tude des syst\u00e8mes alg\u00e9briques surd\u00e9termin\u00e9s. Applications aux codes correcteurs et \u00e0 la cryptographie. Ph.D. thesis, Universit\u00e9 Paris VI (2004). http:\/\/tel.archives-ouvertes.fr\/tel-00449609\/en\/"},{"key":"1_CR3","unstructured":"Banegas, G., et al.: DAGS: key encapsulation for dyadic GS codes (2017). https:\/\/csrc.nist.gov\/CSRC\/media\/Projects\/Post-Quantum-Cryptography\/documents\/round-1\/submissions\/DAGS.zip. First round submission to the NIST post-quantum cryptography call"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bardet, M., Briaud, P., Bros, M., Gaborit, P., Tillich, J.-P.: Revisiting algebraic attacks on MinRank and on the rank decoding problem (2022). arXiv:2208.05471","DOI":"10.1007\/s10623-023-01265-x"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-030-64837-4_17","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"M Bardet","year":"2020","unstructured":"Bardet, M., et al.: Improvements of algebraic attacks for solving the rank decoding and MinRank problems. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12491, pp. 507\u2013536. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64837-4_17"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-030-03326-2_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"\u00c9 Barelli","year":"2018","unstructured":"Barelli, \u00c9., Couvreur, A.: An efficient structural attack on NIST submission DAGS. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 93\u2013118. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_4"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"TP Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 77\u201397. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02384-2_6"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-12929-2_6","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2010","unstructured":"Bernstein, D.J.: Grover vs.\u00a0McEliece. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 73\u201380. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12929-2_6"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jsc.2014.09.025","volume":"70","author":"M Bardet","year":"2015","unstructured":"Bardet, M., Faug\u00e8re, J.-C., Salvy, B.: On the complexity of the F$${}_5$$ Gr\u00f6bner basis algorithm. J. Symbolic Comput. 70, 49\u201370 (2015)","journal-title":"J. Symbolic Comput."},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Becker","year":"2012","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: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 520\u2013536. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_31"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-25405-5_12","volume-title":"Post-Quantum Cryptography","author":"PSLM Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Lindner, R., Misoczki, R.: Monoidic codes in cryptography. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 179\u2013199. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_12"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-19574-7_10","volume-title":"Selected Areas in Cryptography","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 143\u2013158. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19574-7_10"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-25405-5_16","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece incognito. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 244\u2013254. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25405-5_16"},{"key":"1_CR14","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 (2017)"},{"key":"1_CR15","unstructured":"Bardet, M., Mora, R., Tillich, J.-P.: Polynomial time key-recovery attack on high rate random alternant codes. CoRR, abs\/2304.14757 (2023)"},{"key":"1_CR16","unstructured":"Couvreur, A., et al.: Big Quake (2017). https:\/\/bigquake.inria.fr. NIST Round 1 submission for Post-Quantum Cryptography"},{"issue":"1","key":"1_CR17","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. Inf. Theory 44(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1_CR18","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":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_10"},{"issue":"2","key":"1_CR20","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","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-Solomon codes. Des. Codes Cryptogr. 73(2), 641\u2013666 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR21","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":"1_CR22","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."},{"issue":"1","key":"1_CR23","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. Inf. Theory 63(1), 404\u2013427 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-29360-8_10","volume-title":"Post-Quantum Cryptography","author":"R Canto Torres","year":"2016","unstructured":"Canto Torres, R., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 144\u2013161. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_10"},{"issue":"1","key":"1_CR25","first-page":"17","volume":"25","author":"I Dumer","year":"1989","unstructured":"Dumer, I.: Two decoding algorithms for linear codes. Probl. Inf. Transm. 25(1), 17\u201323 (1989)","journal-title":"Probl. Inf. Transm."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C.: A new efficient algorithm for computing Gr\u00f6bner bases without reduction to zero: F5. In: Proceedings ISSAC 2002, pp. 75\u201383. ACM Press (2002)","DOI":"10.1145\/780506.780516"},{"key":"1_CR27","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, ITW 2011, Paraty, Brasil, pp. 282\u2013286 (2011)","DOI":"10.1109\/ITW.2011.6089437"},{"issue":"10","key":"1_CR28","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. Inf. Theory 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-85174-5_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"J-C Faug\u00e8re","year":"2008","unstructured":"Faug\u00e8re, J.-C., Levy-dit-Vehel, F., Perret, L.: Cryptanalysis of MinRank. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 280\u2013296. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_16"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13190-5_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J-C Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 279\u2013298. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_14"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-662-45611-8_2","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"J-C Faug\u00e8re","year":"2014","unstructured":"Faug\u00e8re, J.-C., Perret, L., de Portzamparc, F.: Algebraic attack against variants of McEliece with Goppa polynomial of a special form. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8873, pp. 21\u201341. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45611-8_2"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., El Din, M.S., Spaenlehauer, P.-J.: Computing loci of rank defects of linear matrices using Gr\u00f6bner bases and applications to cryptology. In: International Symposium on Symbolic and Algebraic Computation, ISSAC 2010, Munich, Germany, 25\u201328 July 2010, pp. 257\u2013264 (2010)","DOI":"10.1145\/1837934.1837984"},{"key":"1_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-44448-3_4","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"L Goubin","year":"2000","unstructured":"Goubin, L., Courtois, N.T.: Cryptanalysis of the TTM cryptosystem. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 44\u201357. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44448-3_4"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-18487-1_22","volume-title":"Algebra, Arithmetic and Geometry with Applications","author":"SR Ghorpade","year":"2004","unstructured":"Ghorpade, S.R., Krattenthaler, C.: The Hilbert series of Pfaffian rings. In: Christensen, C., Sathaye, A., Sundaram, G., Bajaj, C. (eds.) Algebra, Arithmetic and Geometry with Applications, pp. 337\u2013356. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-642-18487-1_22"},{"key":"1_CR35","unstructured":"Gauthier-Uma\u00f1a, V., Leander, G.: Practical key recovery attacks on two McEliece variants. IACR Cryptology ePrint Archive, Report 2009\/509 (2009)"},{"issue":"1","key":"1_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0001-8708(92)90050-U","volume":"96","author":"J Herzog","year":"1992","unstructured":"Herzog, J., Trung, N.V.: Gr\u00f6bner bases and multiplicity of determinantal and Pfaffian ideals. Adv. Math. 96(1), 1\u201337 (1992)","journal-title":"Adv. Math."},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-48405-1_2","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"A Kipnis","year":"1999","unstructured":"Kipnis, A., Shamir, A.: Cryptanalysis of the HFE public key cryptosystem by relinearization. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 19\u201330. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_2"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-319-59879-6_5","volume-title":"Post-Quantum Cryptography","author":"G Kachigar","year":"2017","unstructured":"Kachigar, G., Tillich, J.-P.: Quantum information set decoding algorithms. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 69\u201389. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_5"},{"issue":"3","key":"1_CR39","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":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected Areas in Cryptography","author":"R Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 376\u2013392. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-05445-7_24"},{"key":"1_CR41","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":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$\\tilde{\\cal{O}}(2^{0.054n})$$. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 107\u2013124. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_6"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-662-46800-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"A May","year":"2015","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 203\u2013228. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_9"},{"key":"1_CR44","unstructured":"M\u00e1rquez-Corbella, I., Pellikaan, R.: Error-correcting pairs for a public-key cryptosystem. CBC 2012, Code-based Cryptography Workshop (2012). http:\/\/www.win.tue.nl\/ruudp\/paper\/59.pdf"},{"key":"1_CR45","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. North-Holland, Amsterdam (1986)"},{"key":"1_CR46","series-title":"Graduate Texts in Mathematics","volume-title":"Combinatorial Commutative Algebra","author":"E Miller","year":"2005","unstructured":"Miller, E., Sturmfels, B.: Combinatorial Commutative Algebra. Graduate Texts in Mathematics, vol. 227. Springer, New York (2005)"},{"key":"1_CR47","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: Workshop on Coding Theory and Cryptography, WCC 2022 (2022)","DOI":"10.1007\/s10623-022-01153-w"},{"issue":"5","key":"1_CR48","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"},{"issue":"2","key":"1_CR49","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"4","key":"1_CR50","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Goldwasser, S. (ed.) FOCS, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"4","key":"1_CR52","first-page":"439","volume":"1","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On the insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Math. Appl. 1(4), 439\u2013444 (1992)","journal-title":"Discrete Math. Appl."},{"key":"1_CR53","series-title":"Lecture Notes in Computer Science","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: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 106\u2013113. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0019850"},{"key":"1_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-030-25510-7_10","volume-title":"Post-Quantum Cryptography","author":"J Verbel","year":"2019","unstructured":"Verbel, J., Baena, J., Cabarcas, D., Perlner, R., Smith-Tone, D.: On the complexity of \u201csuperdetermined\u2019\u2019 minrank instances. In: Ding, J., Steinwandt, R. (eds.) PQCrypto 2019. LNCS, vol. 11505, pp. 167\u2013186. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25510-7_10"},{"issue":"1","key":"1_CR55","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TIT.1986.1057137","volume":"32","author":"D Wiedemann","year":"1986","unstructured":"Wiedemann, D.: Solving sparse linear equations over finite fields. IEEE Trans. Inf. Theory 32(1), 54\u201362 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"Wimmer, M.: Algorithm923: efficient numerical computation of the Pfaffian for dense and banded skew-symmetric matrices. ACM Trans. Math. Softw. 38(4) (2012)","DOI":"10.1145\/2331130.2331138"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8730-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T01:02:37Z","timestamp":1765933357000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8730-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819987290","9789819987306"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8730-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"18 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"375","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"106","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}