{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T08:51:01Z","timestamp":1767948661116,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T00:00:00Z","timestamp":1734134400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T00:00:00Z","timestamp":1734134400000},"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":["AAECC"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00200-024-00671-5","type":"journal-article","created":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T11:35:42Z","timestamp":1734176142000},"page":"187-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Security assessment of the LG cryptosystem"],"prefix":"10.1007","volume":"37","author":[{"given":"\u00c9tienne","family":"Burle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9 Tal\u00e9","family":"Kalachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Freddy Lende","family":"Metouke","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,12,14]]},"reference":[{"key":"671_CR1","doi-asserted-by":"publisher","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, June 17-22, 2018, 2421\u20132425. IEEE (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437464","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"671_CR2","doi-asserted-by":"crossref","unstructured":"Briaud, P., Loidreau, P.: Cryptanalysis of rank-metric schemes based on distorted gabidulin codes. In: International Conference on Post-Quantum Cryptography, pp. 38\u201356. Springer (2023)","DOI":"10.1007\/978-3-031-40003-2_2"},{"issue":"3","key":"671_CR3","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/0097-3165(78)90015-8","volume":"25","author":"P Delsarte","year":"1978","unstructured":"Delsarte, P.: Bilinear forms over a finite field, with applications to coding theory. J. Comb. Theory Ser. A 25(3), 226\u2013241 (1978)","journal-title":"J. Comb. Theory Ser. A"},{"key":"671_CR4","doi-asserted-by":"crossref","unstructured":"Gabidulin, E., Rashwan, H., Honary, B.: On improving security of GPT cryptosystems. In: Proc. IEEE Int. Symposium Inf. Theory - ISIT, pp. 1110\u20131114. IEEE (2009)","DOI":"10.1109\/ISIT.2009.5206029"},{"issue":"1","key":"671_CR5","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":"671_CR6","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":"671_CR7","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, no. 547 in LNCS, pp. 482\u2013489. Brighton (1991)","DOI":"10.1007\/3-540-46416-6_41"},{"key":"671_CR8","unstructured":"Gaborit, P., Murat, G., Ruatta, O., Z\u00e9mor, G.: Low rank parity check codes and their application to cryptography. In: Proceedings of the Workshop on Coding and Cryptography WCC\u20192013. Bergen, Norway (2013). www.selmer.uib.no\/WCC2013\/pdfs\/Gaborit.pdf"},{"key":"671_CR9","first-page":"517","volume-title":"Advances in Cryptology - EUROCRYPT 1991, LNCS","author":"JK Gibson","year":"1991","unstructured":"Gibson, J.K.: Equivalent Goppa codes and trapdoors to McEliece\u2019s public key cryptosystem. In: Davies, D. (ed.) Advances in Cryptology - EUROCRYPT 1991, LNCS, vol. 547, pp. 517\u2013521. Springer, Berlin \/ Heidelberg (1991)"},{"issue":"1","key":"671_CR10","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":"671_CR11","doi-asserted-by":"crossref","unstructured":"Gibson, K.: The security of the Gabidulin public key cryptosystem. In: U.\u00a0Maurer (ed.) Advances in Cryptology - EUROCRYPT \u201996, LNCS, 1070, 212\u2013223. Springer (1996)","DOI":"10.1007\/3-540-68339-9_19"},{"key":"671_CR12","doi-asserted-by":"crossref","unstructured":"Horlemann-Trautmann, A.L., Marshall, K., Rosenthal, J.: Considerations for rank-based cryptosystems. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 2544\u20132548. Ieee (2016)","DOI":"10.1109\/ISIT.2016.7541758"},{"key":"671_CR13","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10623-017-0343-7","volume":"86","author":"AL Horlemann-Trautmann","year":"2018","unstructured":"Horlemann-Trautmann, A.L., Marshall, K., Rosenthal, J.: Extension of overbeck\u2019s attack for gabidulin-based cryptosystems. Designs Codes Cryptogr. 86, 319\u2013340 (2018)","journal-title":"Designs Codes Cryptogr."},{"issue":"2","key":"671_CR14","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/01611194.2020.1829181","volume":"46","author":"HT Kalachi","year":"2022","unstructured":"Kalachi, H.T.: On the failure of the smart approach of the GPT cryptosystem. Cryptologia 46(2), 167\u2013182 (2022)","journal-title":"Cryptologia"},{"key":"671_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-030-16458-4_16","volume-title":"Codes, Cryptology and Information Security","author":"TSC Lau","year":"2019","unstructured":"Lau, T.S.C., Tan, C.H.: A new gabidulin-like code and its application in cryptography. In: Carlet, C., Guilley, S., Nitaj, A., Souidi, E.M. (eds.) Codes, Cryptology and Information Security, pp. 269\u2013287. Springer International Publishing, Cham (2019)"},{"key":"671_CR16","doi-asserted-by":"crossref","unstructured":"Loidreau, P.: A new rank metric codes based encryption scheme. In: Post-Quantum Cryptography\u00a02017, LNCS, 10346, 3\u201317. Springer (2017)","DOI":"10.1007\/978-3-319-59879-6_1"},{"key":"671_CR17","unstructured":"McEliece, R.J.: A Public-Key System Based on Algebraic Coding Theory, pp. 114\u2013116. Jet Propulsion Lab (1978). DSN Progress Report 44"},{"issue":"9","key":"671_CR18","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1007\/s10623-017-0434-5","volume":"86","author":"A Otmani","year":"2018","unstructured":"Otmani, A., Kalachi, H.T., Ndjeya, S.: Improved cryptanalysis of rank metric schemes based on Gabidulin codes. Des. Codes Cryptogr. 86(9), 1983\u20131996 (2018). https:\/\/doi.org\/10.1007\/s10623-017-0434-5","journal-title":"Des. Codes Cryptogr."},{"key":"671_CR19","doi-asserted-by":"crossref","unstructured":"Overbeck, R.: Extending Gibson\u2019s attacks on the GPT cryptosystem. In: \u00d8.\u00a0Ytrehus (ed.) WCC 2005, LNCS, 3969, 178\u2013188. Springer (2005)","DOI":"10.1007\/11779360_15"},{"key":"671_CR20","doi-asserted-by":"crossref","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: Mycrypt, LNCS, 3715, 50\u201363 (2005)","DOI":"10.1007\/11554868_5"},{"key":"671_CR21","unstructured":"Overbeck, R.: Recognizing the structure of permuted reducible codes. In: J.T. D.\u00a0Augot N.\u00a0Sendrier (ed.) proceedings of WCC\u20192007, 269\u2013276 (2007)"},{"issue":"2","key":"671_CR22","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":"671_CR23","doi-asserted-by":"crossref","unstructured":"Rashwan, H., Gabidulin, E., Honary, B.: A smart approach for GPT cryptosystem based on rank codes. In: Proc. IEEE Int. Symposium Inf. Theory - ISIT, pp. 2463\u20132467. IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513549"},{"issue":"8","key":"671_CR24","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."},{"key":"671_CR25","doi-asserted-by":"crossref","unstructured":"Shrestha, M., Xu, L.: Efficient encoding for generalized reed solomon codes. In: 2011 IEEE 10th International Symposium on Network Computing and Applications, pp. 302\u2013305. IEEE (2011)","DOI":"10.1109\/NCA.2011.52"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00671-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-024-00671-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-024-00671-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T07:14:39Z","timestamp":1767942879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-024-00671-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,14]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["671"],"URL":"https:\/\/doi.org\/10.1007\/s00200-024-00671-5","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,14]]},"assertion":[{"value":"10 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 December 2024","order":3,"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"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}