{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:27:59Z","timestamp":1778128079489,"version":"3.51.4"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031584107","type":"print"},{"value":"9783031584114","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-58411-4_7","type":"book-chapter","created":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T12:01:44Z","timestamp":1715428904000},"page":"139-158","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Injective Rank Metric Trapdoor Functions with\u00a0Homogeneous Errors"],"prefix":"10.1007","author":[{"given":"\u00c9tienne","family":"Burle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Gaborit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Younes","family":"Hatri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,12]]},"reference":[{"key":"7_CR1","unstructured":"Aguilar Melchor, C., et al.: BIKE. Round 3 Submission to the NIST Post-Quantum Cryptography Call, v.\u00a04.2, September 2021"},{"key":"7_CR2","unstructured":"Aguilar Melchor, C., et al.: Rank quasi cyclic (RQC). Second Round submission to NIST Post-Quantum Cryptography call, April 2020"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Aguilar-Melchor, C., Aragon, N., Dyseryn, V., Gaborit, P., Zemor, G.: LRPC codes with multiple syndromes: near ideal-size KEMs without ideals. In: Cheon, J.H., Johansson, T. (eds.) Post-Quantum Cryptography. PQCrypto 2022. LNCS, vol. 13512, pp. 45\u201368. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17234-2_3","DOI":"10.1007\/978-3-031-17234-2_3"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: STOC \u201996 (1996)","DOI":"10.1145\/237814.237838"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), 11\u201314 October 2003, Cambridge, MA, USA, Proceedings, pp. 298\u2013307. IEEE Computer Society (2003)","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"7_CR6","unstructured":"Aragon, N., et al.: ROLLO (merger of Rank-Ouroboros, LAKE and LOCKER). Second round submission to the NIST post-quantum cryptography call, March 2019"},{"key":"7_CR7","unstructured":"Aragon, N., et al.: LowMS: a new rank metric code-based kem without ideal structure. Cryptology ePrint Archive, Paper 2022\/1596, 2022. https:\/\/eprint.iacr.org\/2022\/1596"},{"issue":"12","key":"7_CR8","doi-asserted-by":"publisher","first-page":"7697","DOI":"10.1109\/TIT.2019.2933535","volume":"65","author":"N Aragon","year":"2019","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Ruatta, O., Z\u00e9mor, G.: Low rank parity check codes: new decoding algorithms and applications to cryptography. IEEE Trans. Inform. Theory 65(12), 7697\u20137717 (2019)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.P.: A new algorithm for solving the rank syndrome decoding problem. In: 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, CO, USA, 17\u201322 June 2018, pp. 2421\u20132425. IEEE (2018)","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/978-3-030-81293-5_23","volume-title":"Post-Quantum Cryptography","author":"M Bardet","year":"2021","unstructured":"Bardet, M., Briaud, P.: An algebraic approach to the rank support learning problem. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 442\u2013462. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_23"},{"key":"7_CR11","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","DOI":"10.1007\/s10623-023-01265-x"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Bardet, M., Mora, R., Tillich, J.P.: Polynomial time attack on high rate random alternant codes. CoRR, abs\/2304.14757 (2023)","DOI":"10.1109\/TIT.2023.3334592"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Dorothy, E., Denning, R.P., Ravi, G., Ravi, S.S., Victoria, A. (eds.) CCS \u201993, Proceedings of the 1st ACM Conference on Computer and Communications Security, Fairfax, Virginia, USA, 3\u20135 November 1993, pp. 62\u201373. ACM (1993)","DOI":"10.1145\/168588.168596"},{"key":"7_CR14","unstructured":"Bidoux, L., Briaud, P., Bros, M., Gaborit, P.: RQC revisited and more cryptanalysis for rank-based cryptography. ArXiv, abs\/2207.01410, 2022"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-81293-5_1","volume-title":"Post-Quantum Cryptography","author":"M Bombar","year":"2021","unstructured":"Bombar, M., Couvreur, A.: Decoding supercodes of gabidulin codes and applications to cryptanalysis. In: Cheon, J.H., Tillich, J.-P. (eds.) PQCrypto 2021 2021. LNCS, vol. 12841, pp. 3\u201322. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81293-5_1"},{"key":"7_CR16","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":"7_CR17","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":"7_CR18","unstructured":"Couvreur, A., Gaborit, P., Gauthier-Umana, V., Otmani, A., Tillich, J.P.: Distinguisher-Based Attacks on Public-Key Cryptosystems Using Reed-Solomon Codes. In: International Workshop on Coding and Cryptography - WCC 2013, pp. 181\u2013193, Bergen, Norway, April 2013"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Couvreur, A., Mora, R., Tillich, J.P.: A new approach based on quadratic forms to attack the mceliece cryptosystem. CoRR, abs\/2306.10294, 2023","DOI":"10.1007\/978-981-99-8730-6_1"},{"key":"7_CR20","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":"7_CR21","doi-asserted-by":"crossref","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)","DOI":"10.1109\/TIT.2016.2574841"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-03326-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"T Debris-Alazard","year":"2018","unstructured":"Debris-Alazard, T., Tillich, J.-P.: Two attacks on rank metric code-based schemes: ranksign and an IBE scheme. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 62\u201392. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_3"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-24676-3_21","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"C Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Reingold, O.: Immunizing encryption schemes from decryption errors. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 342\u2013360. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_21"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Faugere, J.C., Gauthier-Umana, 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, pp. 282\u2013286, Paraty, Brasil, October 2011","DOI":"10.1109\/ITW.2011.6089437"},{"issue":"10","key":"7_CR25","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":"7_CR26","doi-asserted-by":"crossref","unstructured":"Faure, C., Loidreau, P.: A new public-key cryptosystem based on the problem of reconstructing p-polynomials. In: Coding and Cryptography, International Workshop, WCC 2005, Bergen, Norway, 14\u201318 March 2005. Revised Selected Papers, pp. 304\u2013315 (2005)","DOI":"10.1007\/11779360_24"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"J-B Fischer","year":"1996","unstructured":"Fischer, J.-B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 245\u2013255. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_22"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M., Rashwan, H., Honary, B.: On improving security of GPT cryptosystems. In: Proceedings of the IEEE International Symposium on Information Theory - ISIT, pp. 1110\u20131114. IEEE (2009)","DOI":"10.1109\/ISIT.2009.5206029"},{"issue":"1","key":"7_CR29","first-page":"3","volume":"21","author":"EM Gabidulin","year":"1985","unstructured":"Gabidulin, E.M.: Theory of codes with maximum rank distance. Problemy Peredachi Informatsii 21(1), 3\u201316 (1985)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"2","key":"7_CR30","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10623-007-9160-8","volume":"48","author":"EM Gabidulin","year":"2008","unstructured":"Gabidulin, E.M.: Attacks and counter-attacks on the GPT public key cryptosystem. Des. Codes Cryptogr. 48(2), 171\u2013177 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/S1571-0653(04)00168-4","volume":"6","author":"EM Gabidulin","year":"2001","unstructured":"Gabidulin, E.M., Ourivski, A.V.: Modified GPT PKC with right scrambler. Electron. Notes Discret. Math. 6, 168\u2013177 (2001)","journal-title":"Electron. Notes Discret. Math."},{"issue":"12","key":"7_CR32","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1109\/TIT.2003.820038","volume":"49","author":"EM Gabidulin","year":"2003","unstructured":"Gabidulin, E.M., Ourivski, A.V., Honary, B., Ammar, B.: Reducible rank codes and their applications to cryptography. IEEE Trans. Inform. Theory 49(12), 3289\u20133293 (2003)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their applications to cryptography. In: Advances in Cryptology - EUROCRYPT\u201991, number 547 in LNCS, pp. 482\u2013489, Brighton, April 1991","DOI":"10.1007\/3-540-46416-6_41"},{"key":"7_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-63697-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"P Gaborit","year":"2017","unstructured":"Gaborit, P., Hauteville, A., Phan, D.H., Tillich, J.-P.: Identity-based encryption from codes with rank metric. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 194\u2013224. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_7"},{"key":"7_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-29360-8_2","volume-title":"Post-Quantum Cryptography","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Hauteville, A., Tillich, J.-P.: RankSynd a PRNG based on rank metric. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 18\u201328. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-29360-8_2"},{"issue":"7","key":"7_CR36","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1007\/s10623-017-0402-0","volume":"86","author":"P Gaborit","year":"2018","unstructured":"Gaborit, P., Otmani, A., Tal\u00e9-Kalachi, H.: Polynomial-time key recovery attack on the Faure-Loidreau scheme based on Gabidulin codes. Des. Codes Cryptogr. 86(7), 1391\u20131403 (2018)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"7_CR37","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inform. Theory 62(2), 1006\u20131019 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR38","unstructured":"Philippe, G., Gilles, Z.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE IT, 2016"},{"key":"7_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-319-96881-0_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"S Garg","year":"2018","unstructured":"Garg, S., Hajiabadi, M.: Trapdoor functions from the computational Diffie-Hellman assumption. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10992, pp. 362\u2013391. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_13"},{"key":"7_CR40","unstructured":"Gauthier, V., Otmani, A., Tillich, J.P.: A distinguisher-based attack of a homomorphic encryption scheme relying on Reed-Solomon codes. CoRR, abs\/1203.6686, 2012"},{"key":"7_CR41","unstructured":"Gauthier, V., Otmani, A., Tillich, J.P.: A distinguisher-based attack on a variant of McEliece\u2019s cryptosystem based on Reed-Solomon codes. CoRR, abs\/1204.6459, 2012"},{"issue":"1","key":"7_CR42","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BF01390769","volume":"6","author":"K Gibson","year":"1995","unstructured":"Gibson, K.: Severely denting the Gabidulin version of the McEliece public key cryptosystem. Des. Codes Cryptogr. 6(1), 37\u201345 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-68339-9_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201996","author":"K Gibson","year":"1996","unstructured":"Gibson, K.: The security of the gabidulin public key cryptosystem. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 212\u2013223. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_19"},{"key":"7_CR44","unstructured":"Goldreich, O.: The Foundations of Cryptography - volume 1, Basic Techniques. Cambridge University Press, Cambridge (2001)"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Oded, G., Leonid, A.L.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 25\u201332. ACM (1989)","DOI":"10.1145\/73007.73010"},{"key":"7_CR46","doi-asserted-by":"crossref","unstructured":"Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","DOI":"10.1137\/S0097539793244708"},{"key":"7_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/978-3-319-70500-2_12","volume-title":"Theory of Cryptography","author":"D Hofheinz","year":"2017","unstructured":"Hofheinz, D., H\u00f6velmanns, K., Kiltz, E.: A modular analysis of the Fujisaki-Okamoto transformation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 341\u2013371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_12"},{"key":"7_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/978-3-030-56784-2_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"S Hohenberger","year":"2020","unstructured":"Hohenberger, S., Koppula, V., Waters, B.: Chosen ciphertext security from injective trapdoor functions. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 836\u2013866. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_28"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. In: 30th Annual Symposium on Foundations of Computer Science, North Carolina, USA, 30 October\u20131 November 1989, pp. 236\u2013241. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63484"},{"key":"7_CR50","unstructured":"Lavauzelle, J., Loidreau, P., Pham, B.D.: RAMESSES, a Rank Metric Encryption Scheme with Short Keys. working paper or preprint, January 2020"},{"key":"7_CR51","unstructured":"Pierre, L.: Properties of codes in rank metric, 2006"},{"key":"7_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-59879-6_1","volume-title":"Post-Quantum Cryptography","author":"P Loidreau","year":"2017","unstructured":"Loidreau, P.: A new rank metric codes based encryption scheme. In: Lange, T., Takagi, T. (eds.) PQCrypto 2017. LNCS, vol. 10346, pp. 3\u201317. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59879-6_1"},{"key":"7_CR53","unstructured":"Robert, J.M.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab, 1978. DSN Progress Report 44"},{"issue":"4","key":"7_CR54","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":"7_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-18681-8_14","volume-title":"Codes, Cryptology, and Information Security","author":"A Otmani","year":"2015","unstructured":"Otmani, A., Kalachi, H.T.: Square code attack on a modified sidelnikov cryptosystem. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E.M. (eds.) C2SI 2015. LNCS, vol. 9084, pp. 173\u2013183. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18681-8_14"},{"issue":"9","key":"7_CR56","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1007\/s10623-017-0434-5","volume":"86","author":"A Otmani","year":"2018","unstructured":"Otmani, A., Tal\u00e9-Kalachi, H., Ndjeya, S.: Improved cryptanalysis of rank metric schemes based on Gabidulin codes. Des. Codes Cryptogr. 86(9), 1983\u20131996 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"7_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/11779360_15","volume-title":"Coding and Cryptography","author":"R Overbeck","year":"2006","unstructured":"Overbeck, R.: Extending Gibson\u2019s attacks on the GPT cryptosystem. In: Ytrehus, \u00d8. (ed.) WCC 2005. LNCS, vol. 3969, pp. 178\u2013188. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11779360_15"},{"key":"7_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/11554868_5","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"R Overbeck","year":"2005","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol. 3715, pp. 50\u201363. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11554868_5"},{"issue":"2","key":"7_CR59","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2008","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptol."},{"key":"7_CR60","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Dwork, C., (ed.), Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 17\u201320 May 2008, pp. 187\u2013196. ACM (2008)","DOI":"10.1145\/1374376.1374406"},{"key":"7_CR61","doi-asserted-by":"crossref","unstructured":"Rashwan, H., Gabidulin, E.M., Honary, B.: A smart approach for GPT cryptosystem based on rank code. In: Proceedings of the IEEE International Symposium on Information Theory - ISIT, pp. 2463\u20132467. IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513549"},{"issue":"8","key":"7_CR62","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1002\/sec.228","volume":"4","author":"H Rashwan","year":"2011","unstructured":"Rashwan, H., Gabidulin, E., Honary, B.: Security of the GPT cryptosystem and its applications to cryptography. Secur. Commun. Netw. 4(8), 937\u2013946 (2011)","journal-title":"Secur. Commun. Netw."},{"issue":"2","key":"7_CR63","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"},{"key":"7_CR64","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814549","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2008","unstructured":"Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge University Press, USA (2008)","edition":"2"},{"key":"7_CR65","doi-asserted-by":"crossref","unstructured":"Wachter-Zeh, A., Puchinger, S., Renner, J. : Repairing the Faure-Loidreau public-key cryptosystem. In: Proceedings of the IEEE International Symposium on Information Theory - ISIT, pp. 2426\u20132430 (2018)","DOI":"10.1109\/ISIT.2018.8437561"},{"key":"7_CR66","doi-asserted-by":"crossref","unstructured":"Wang, L.-P.: Loong: a new IND-CCA-secure code-based KEM. In: 2019 IEEE International Symposium on Information Theory (ISIT), pp. 2584\u20132588 (2019)","DOI":"10.1109\/ISIT.2019.8849302"},{"key":"7_CR67","doi-asserted-by":"publisher","unstructured":"Burle, \u00c9., Otmani, A.: An upper-bound on the decoding failure probability of the LRPC decoder. In: Quaglia, E.A. (eds.) Cryptography and Coding. IMACC 2023. LNCS, vol. 14421, pp. 3\u201316. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-47818-5_1","DOI":"10.1007\/978-3-031-47818-5_1"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-58411-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T19:25:19Z","timestamp":1731957919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-58411-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031584107","9783031584114"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-58411-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"12 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Windsor, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","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":"sacrypt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sac2022.ca\/home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}