{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:36:13Z","timestamp":1780090573926,"version":"3.54.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T00:00:00Z","timestamp":1704585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T00:00:00Z","timestamp":1704585600000},"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":[[2025,9]]},"DOI":"10.1007\/s00200-023-00641-3","type":"journal-article","created":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T09:02:04Z","timestamp":1704618124000},"page":"819-845","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Low-rank parity-check codes over finite commutative rings"],"prefix":"10.1007","volume":"36","author":[{"given":"Hermann Tchatchiem","family":"Kamche","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Herv\u00e9 Tal\u00e9","family":"Kalachi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franck Rivel Kamwa","family":"Djomou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanuel","family":"Fouotsa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,7]]},"reference":[{"issue":"12","key":"641_CR1","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. Inf. Theory 65(12), 7697\u20137717 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"641_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02556-8","volume-title":"QC-LDPC code-based cryptography","author":"M Baldi","year":"2014","unstructured":"Baldi, M.: QC-LDPC code-based cryptography. Springer, Berlin (2014)"},{"key":"641_CR3","first-page":"64","volume-title":"Advances in cryptology - EUROCRYPT. Lecture notes in computer science","author":"M Bardet","year":"2020","unstructured":"Bardet, M., Briaud, P., Bros, M., Gaborit, P., Neiger, V., Ruatta, O., Tillich, J.: An algebraic attack on rank metric code-based cryptosystems. In: Canteaut, A., Ishai, Y. (eds.) Advances in cryptology - EUROCRYPT. Lecture notes in computer science, vol. 12107, pp. 64\u201393. Springer, Berlin (2020)"},{"key":"641_CR4","doi-asserted-by":"crossref","unstructured":"Bardet, M., Bros, M., Cabarcas, D., Gaborit, P., Perlner, R.A., Smith-Tone, D., Tillich, J., Verbel, J.A.: Improvements of algebraic attacks for solving the rank decoding and minrank problems. In: Advances in Cryptology - ASIACRYPT, Lecture Notes in Computer Science, vol. 12491, pp. 507\u2013536. Springer (2020)","DOI":"10.1007\/978-3-030-64837-4_17"},{"key":"641_CR5","doi-asserted-by":"crossref","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: Advances in cryptology - EUROCRYPT\u00a02012, Lecture Notes in Computer Science. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_31"},{"key":"641_CR6","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2017.09.002","volume":"703","author":"B Bulyovszky","year":"2017","unstructured":"Bulyovszky, B., Horv\u00e1th, G.: Polynomial functions over finite commutative rings. Theoret. Comput. Sci. 703, 76\u201386 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"641_CR7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174384","author":"FRK Djomou","year":"2021","unstructured":"Djomou, F.R.K., Kalachi, H.T., Fouotsa, E.: Generalization of low rank parity-check (lrpc) codes over the ring of integers modulo a positive integer. Arab. J. Math. (2021). https:\/\/doi.org\/10.1109\/ISIT44484.2020.9174384","journal-title":"Arab. J. Math."},{"issue":"1","key":"641_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10623-008-9215-5","volume":"50","author":"ST Dougherty","year":"2009","unstructured":"Dougherty, S.T., Kim, J.L., Kulosman, H.: MDS codes over finite principal ideal rings. Des. Codes Crypt. 50(1), 77 (2009)","journal-title":"Des. Codes Crypt."},{"issue":"1","key":"641_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10623-013-9815-6","volume":"73","author":"ST Dougherty","year":"2014","unstructured":"Dougherty, S.T., Salt\u00fcrk, E.: Counting codes over rings. Des. Codes Crypt. 73(1), 151\u2013165 (2014)","journal-title":"Des. Codes Crypt."},{"key":"641_CR10","doi-asserted-by":"crossref","unstructured":"El\u00a0Qachchach, I., Habachi, O., Cances, J.P., Meghdadi, V.: Efficient multi-source network coding using low rank parity check code. In: 2018 IEEE Wireless communications and networking conference (WCNC), pp. 1\u20136. IEEE (2018)","DOI":"10.1109\/WCNC.2018.8377229"},{"issue":"2","key":"641_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10623-012-9726-y","volume":"71","author":"Y Fan","year":"2014","unstructured":"Fan, Y., Ling, S., Liu, H.: Matrix product codes over finite commutative Frobenius rings. Des. Codes Crypt. 71(2), 201\u2013227 (2014)","journal-title":"Des. Codes Crypt."},{"issue":"11","key":"641_CR12","doi-asserted-by":"publisher","first-page":"7576","DOI":"10.1109\/TIT.2013.2274264","volume":"59","author":"C Feng","year":"2013","unstructured":"Feng, C., Silva, D., Kschischang, F.R.: An algebraic approach to physical-layer network coding. IEEE Trans. Inf. Theory 59(11), 7576\u20137596 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"641_CR13","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 Lecture Notes in Computer Science, pp. 482\u2013489. Brighton (1991)","DOI":"10.1007\/3-540-46416-6_41"},{"key":"641_CR14","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). Available on www.selmer.uib.no\/WCC2013\/pdfs\/Gaborit.pdf"},{"issue":"1","key":"641_CR15","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 Crypt. 6(1), 37\u201345 (1995)","journal-title":"Des. Codes Crypt."},{"key":"641_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-017-0343-7","author":"A Horlemann-Trautmann","year":"2017","unstructured":"Horlemann-Trautmann, A., Marshall, K., Rosenthal, J.: Extension of overbeck\u2019s attack for Gabidulin based cryptosystems. Designs, Codes Cryptogr. (2017). https:\/\/doi.org\/10.1007\/s10623-017-0343-7","journal-title":"Designs, Codes Cryptogr."},{"issue":"2","key":"641_CR17","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1080\/01611194.2020.1829181","volume":"46","author":"HT Kalachi","year":"2020","unstructured":"Kalachi, H.T.: On the failure of the smart approach of the GPT cryptosystem. Cryptologia 46(2), 167\u2013182 (2020)","journal-title":"Cryptologia"},{"issue":"12","key":"641_CR18","doi-asserted-by":"publisher","first-page":"7718","DOI":"10.1109\/TIT.2019.2933520","volume":"65","author":"HT Kamche","year":"2019","unstructured":"Kamche, H.T., Mouaha, C.: Rank-metric codes over finite principal ideal rings and applications. IEEE Trans. Inf. Theory 65(12), 7718\u20137735 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"641_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0525-8","volume-title":"Lectures on modules and rings. Graduate texts in mathematics","author":"TY Lam","year":"1999","unstructured":"Lam, T.Y.: Lectures on modules and rings. Graduate texts in mathematics, vol. 189, 1st edn. Springer, New York (1999)","edition":"1"},{"issue":"11","key":"641_CR20","doi-asserted-by":"publisher","first-page":"2160","DOI":"10.1016\/j.scico.2012.07.012","volume":"78","author":"HD Macedo","year":"2013","unstructured":"Macedo, H.D., Oliveira, J.N.: Typing linear algebra: a biproduct-oriented approach. Sci. Comput. Program. 78(11), 2160\u20132191 (2013)","journal-title":"Sci. Comput. Program."},{"key":"641_CR21","volume-title":"Finite rings with identity","author":"BR McDonald","year":"1974","unstructured":"McDonald, B.R.: Finite rings with identity, vol. 28. Marcel Dekker Incorporated (1974)"},{"issue":"10","key":"641_CR22","doi-asserted-by":"publisher","first-page":"6463","DOI":"10.1109\/TIT.2011.2165816","volume":"57","author":"B Nazer","year":"2011","unstructured":"Nazer, B., Gastpar, M.: Compute-and-forward: harnessing interference through structured codes. IEEE Trans. Inf. Theory 57(10), 6463\u20136486 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"641_CR23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546525","volume-title":"Quasi-Frobenius Rings","author":"WK Nicholson","year":"2003","unstructured":"Nicholson, W.K., Yousif, M.F.: Quasi-Frobenius Rings, vol. 158. Cambridge University Press, Cambridge (2003)"},{"issue":"9","key":"641_CR24","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 Crypt. 86(9), 1983\u20131996 (2018). https:\/\/doi.org\/10.1007\/s10623-017-0434-5","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"641_CR25","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. Cryptology 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptology"},{"issue":"5","key":"641_CR26","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. Inform. Theory 8(5), 5\u20139 (1962). https:\/\/doi.org\/10.1109\/TIT.1962.1057777","journal-title":"IRE Trans. Inform. Theory"},{"key":"641_CR27","doi-asserted-by":"crossref","unstructured":"Renner, J., Jerkovits, T., Bartz, H.: Efficient decoding of interleaved low-rank parity-check codes. In: 2019 XVI International Symposium \u201cProblems of redundancy in information and control systems\u201d (REDUNDANCY). IEEE, pp. 121\u2013126 (2019)","DOI":"10.1109\/REDUNDANCY48165.2019.9003356"},{"key":"641_CR28","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10623-020-00825-9","volume":"89","author":"J Renner","year":"2020","unstructured":"Renner, J., Neri, A., Puchinger, S.: Low-rank parity-check codes over Galois rings. Designs, Codes Cryptogr. 89, 351\u2013386 (2020)","journal-title":"Designs, Codes Cryptogr."},{"key":"641_CR29","doi-asserted-by":"crossref","unstructured":"Renner, J., Puchinger, S., Wachter-Zeh, A., Hollanti, C., Freij-Hollanti, R.: Low-rank parity-check codes over the ring of integers modulo a prime power. In: IEEE International symposium on information theory, ISIT 2020, Los Angeles, CA, USA, June 21-26. IEEE, 2020, pp. 19\u201324 (2020)","DOI":"10.1109\/ISIT44484.2020.9174384"},{"key":"641_CR30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern computer algebra","author":"J Von Zur Gathen","year":"2013","unstructured":"Von Zur Gathen, J., Gerhard, J.: Modern computer algebra. Cambridge University Press, Cambridge (2013)"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-023-00641-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00200-023-00641-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-023-00641-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:30:29Z","timestamp":1757097029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00200-023-00641-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,7]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s00200-023-00641-3","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,7]]},"assertion":[{"value":"24 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}