{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T10:35:26Z","timestamp":1760524526534,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T00:00:00Z","timestamp":1692403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T00:00:00Z","timestamp":1692403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011033","name":"Agencia Estatal de Investigaci\u00f3n","doi-asserted-by":"publisher","award":["PID2019-110525GB-I00","CEX2020-001105-M"],"award-info":[{"award-number":["PID2019-110525GB-I00","CEX2020-001105-M"]}],"id":[{"id":"10.13039\/501100011033","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A class of linear codes that extends classical Goppa codes to a non-commutative context is defined. An efficient decoding algorithm, based on the solution of a non-commutative key equation, is designed. We show how the parameters of these codes, when the alphabet is a finite field, may be adjusted to propose a McEliece-type cryptosystem.<\/jats:p>","DOI":"10.1007\/s10623-023-01286-6","type":"journal-article","created":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T12:01:25Z","timestamp":1692446485000},"page":"3995-4017","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Skew differential Goppa codes and their application to Mceliece cryptosystem"],"prefix":"10.1007","volume":"91","author":[{"given":"Jos\u00e9","family":"G\u00f3mez-Torrecillas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7372-0442","authenticated-orcid":false,"given":"F. J.","family":"Lobillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriel","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,19]]},"reference":[{"key":"1286_CR1","unstructured":"Albrecht M.R., Bernstein D.J., Chou T., Cid C., Gilcher J., Lange T., Maram V., von Maurich I., Misoczki R., Niederhagen R., Paterson K.G., Persichetti E., Peters C., Schwabe P., Sendrier N., Szefer J., Tjhai C.J., Tomlison M., Wang W.: Classic McEliece: conservative code-based cryptography. Tech. Report. NIST\u2019s Post-Quantum Cryptography Standardization Project 10 (2020). https:\/\/classic.mceliece.org\/."},{"key":"1286_CR2","doi-asserted-by":"publisher","first-page":"5026","DOI":"10.1109\/TIT.2021.3067318","volume":"67","author":"H Bartz","year":"2021","unstructured":"Bartz H., Jerkovitz T., Puchinger S., Rosenkilde J.: Fast decoding of codes in the rank, subspace, and sum-rank metric. IEEE Trans. Inform. Theory 67, 5026\u20135050 (2021). https:\/\/doi.org\/10.1109\/TIT.2021.3067318.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1286_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-0285-0","volume-title":"Algorithmic Methods in Non-commutative Algebra. Applications to Quantum groups","author":"JL Bueso","year":"2003","unstructured":"Bueso J.L., G\u00f3mez-Torrecillas J., Verschoren A.: Algorithmic Methods in Non-commutative Algebra. Applications to Quantum groups. Springer, Dordrecht (2003) https:\/\/doi.org\/10.1007\/978-94-017-0285-0."},{"key":"1286_CR4","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1142\/S021949880700251X","volume":"06","author":"J Delenclos","year":"2007","unstructured":"Delenclos J., Leroy A.: Noncommutative symmetric functions and w-polynomials. J. Algebra Appl. 06, 815\u2013837 (2007). https:\/\/doi.org\/10.1142\/S021949880700251X.","journal-title":"J. Algebra Appl."},{"key":"1286_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1006\/ffta.1999.0263","volume":"6","author":"GS Frandsen","year":"2000","unstructured":"Frandsen G.S.: On the density of normal bases in finite fields. Finite Fields Appl. 6, 23\u201338 (2000). https:\/\/doi.org\/10.1006\/ffta.1999.0263.","journal-title":"Finite Fields Appl."},{"key":"1286_CR6","doi-asserted-by":"publisher","first-page":"6216","DOI":"10.1109\/TIT.2017.2731774","volume":"63","author":"J G\u00f3mez-Torrecillas","year":"2017","unstructured":"G\u00f3mez-Torrecillas J., Lobillo F.J., Navarro G.: A Sugiyama-like decoding algorithm for convolutional codes. IEEE Trans. Inform. Theory 63, 6216\u20136226 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2731774. arXiv:1607.07187.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1286_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.jsc.2018.04.018","volume":"92","author":"J G\u00f3mez-Torrecillas","year":"2019","unstructured":"G\u00f3mez-Torrecillas J., Lobillo F.J., Navarro G.: Computing the bound of an Ore polynomial. Applications to factorization. J. Symb. Comput. 92, 269\u2013297 (2019).","journal-title":"J. Symb. Comput."},{"key":"1286_CR8","unstructured":"G\u00f3mez-Torrecillas J., Lobillo F.J., Navarro G.: Procedimiento y dispositivo de cifrado\/descifrado post-cu\u00e1ntico usando c\u00f3digos lineales (February 2022). OEPM, patente solicitud n\u00famero P202230118."},{"key":"1286_CR9","volume-title":"An Introduction to the Theory of Numbers","author":"GH Hardy","year":"1960","unstructured":"Hardy G.H., Wright E.M.: An Introduction to the Theory of Numbers, 4th edn Oxford University Press, Oxford (1960).","edition":"4"},{"key":"1286_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1515\/crll.1888.103.230","volume":"103","author":"K Hensel","year":"1888","unstructured":"Hensel K.: Ueber die darstellung der zahlen eines gattungsbereiches f\u00fcr einen beliebigen primdivisor. J. Reine Angew. Math. 103, 230\u2013237 (1888). https:\/\/doi.org\/10.1515\/crll.1888.103.230.","journal-title":"J. Reine Angew. Math."},{"key":"1286_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02429-0","volume-title":"Finite-Dimensional Division Algebras over Fields","author":"N Jacobson","year":"1996","unstructured":"Jacobson N.: Finite-Dimensional Division Algebras over Fields. Springer, Berlin (1996) https:\/\/doi.org\/10.1007\/978-3-642-02429-0."},{"key":"1286_CR12","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1090\/S0025-5718-98-00944-2","volume":"67","author":"E Kaltofen","year":"1998","unstructured":"Kaltofen E., Shoup V.: Subquadratic-time factoring of polynomials over finite fields. Math. Comput. 67, 1179\u20131197 (1998). https:\/\/doi.org\/10.1090\/S0025-5718-98-00944-2.","journal-title":"Math. Comput."},{"key":"1286_CR13","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0021-8693(88)90063-4","volume":"119","author":"T Lam","year":"1988","unstructured":"Lam T., Leroy A.: Vandermonde and Wronskian matrices over division rings. J. Algebra 119, 308\u2013336 (1988). https:\/\/doi.org\/10.1016\/0021-8693(88)90063-4.","journal-title":"J. Algebra"},{"key":"1286_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0022-4049(03)00125-7","volume":"186","author":"T Lam","year":"2004","unstructured":"Lam T., Leroy A.: Wedderburn polynomials over division rings, I. J. Pure Appl. Algebra 186, 43\u201376 (2004). https:\/\/doi.org\/10.1016\/S0022-4049(03)00125-7.","journal-title":"J. Pure Appl. Algebra"},{"key":"1286_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-94-009-2985-2_15","volume-title":"Perspectives in Ring Theory","author":"TY Lam","year":"1988","unstructured":"Lam T.Y., Leroy A.: Algebraic conjugacy classes and skew polynomial rings. In: van Oystaeyen F., Le Bruyn L. (eds.) Perspectives in Ring Theory, pp. 153\u2013203. Springer, Dordrecht (1988). https:\/\/doi.org\/10.1007\/978-94-009-2985-2_15."},{"key":"1286_CR16","doi-asserted-by":"crossref","unstructured":"Lang S.: Algebra. Graduate Texts in Mathematics, vol.\u00a0211, revised 3rd edn. Springer, New York (2002).","DOI":"10.1007\/978-1-4613-0041-0_1"},{"key":"1286_CR17","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Encyclopedia of Mathematics and Its Applications, vol.\u00a020. Cambridge University Press, Cambridge (1997)."},{"key":"1286_CR18","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. Tech. Report 42-44. National Aeronautics and Space Administration, January and February (1978)."},{"issue":"2","key":"1286_CR19","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inform. Theory 15(2), 159\u2013166 (1986).","journal-title":"Probl. Control Inform. Theory"},{"key":"1286_CR20","doi-asserted-by":"publisher","first-page":"480","DOI":"10.2307\/1968173","volume":"34","author":"O Ore","year":"1933","unstructured":"Ore O.: Theory of non-commutative polynomials. Ann. Math. (2) 34, 480\u2013508 (1933). https:\/\/doi.org\/10.2307\/1968173.","journal-title":"Ann. Math. (2)"},{"key":"1286_CR21","doi-asserted-by":"publisher","first-page":"7132","DOI":"10.1109\/TIT.2018.2810938","volume":"64","author":"IE Shparlinski","year":"2018","unstructured":"Shparlinski I.E.: On constructing primitive roots in finite fields with advice. IEEE Trans. Inform. Theory 64, 7132\u20137136 (2018). https:\/\/doi.org\/10.1109\/TIT.2018.2810938.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1286_CR22","unstructured":"Stein W.A. et al.: Sage Mathematics Software (Version 9.6). The Sage Development Team (2021). www.sagemath.org."},{"key":"1286_CR23","volume-title":"Modern Computer Algebra","author":"J von zur Gathen","year":"2003","unstructured":"von zur Gathen J., Gerhard J.: Modern Computer Algebra. Cambridge University Press, Cambridge (2003)."},{"key":"1286_CR24","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/S0747-7171(08)80158-7","volume":"10","author":"J von zur Gathen","year":"1990","unstructured":"von zur Gathen J., Giesbrecht M.: Constructing normal bases in finite fields. J. Symbol. Comput. 10, 547\u2013570 (1990). https:\/\/doi.org\/10.1016\/S0747-7171(08)80158-7.","journal-title":"J. Symbol. Comput."},{"key":"1286_CR25","doi-asserted-by":"publisher","unstructured":"Wang, L.-P.: Linearized Goppa codes. In: 2018 IEEE International Symposium on Information Theory (ISIT), pp. 2496\u20132500 (2018). https:\/\/doi.org\/10.1109\/ISIT.2018.8437579","DOI":"10.1109\/ISIT.2018.8437579"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01286-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01286-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01286-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T12:05:26Z","timestamp":1699099526000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01286-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,19]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["1286"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01286-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,8,19]]},"assertion":[{"value":"26 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}