{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T18:10:38Z","timestamp":1771611038731,"version":"3.50.1"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031296888","type":"print"},{"value":"9783031296895","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-3-031-29689-5_1","type":"book-chapter","created":{"date-parts":[[2023,3,28]],"date-time":"2023-03-28T16:04:08Z","timestamp":1680019448000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Distinguishing and\u00a0Recovering Generalized Linearized Reed\u2013Solomon Codes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2217-9753","authenticated-orcid":false,"given":"Felicitas","family":"H\u00f6rmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7767-1513","authenticated-orcid":false,"given":"Hannes","family":"Bartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2685-2343","authenticated-orcid":false,"given":"Anna-Lena","family":"Horlemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alagic, G., et al.: Status report on the third round of the NIST post-quantum cryptography standardization process (2022)","DOI":"10.6028\/NIST.IR.8413"},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.102013","volume":"80","author":"GN Alfarano","year":"2022","unstructured":"Alfarano, G.N., Lobillo, F.J., Neri, A., Wachter-Zeh, A.: Sum-rank product codes and bounds on the minimum distance. Finite Fields Appl. 80, 102013 (2022)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1016\/j.jpaa.2014.04.026","volume":"219","author":"A Barra","year":"2015","unstructured":"Barra, A., Gluesing-Luerssen, H.: MacWilliams extension theorems and the local-global property for codes over Frobenius rings. J. Pure Appl. Algebra 219(4), 703\u2013728 (2015)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"TP Berger","year":"2005","unstructured":"Berger, T.P., Loidreau, P.: How to mask the structure of codes for a cryptographic use. Des. Codes Crypt. 35(1), 63\u201379 (2005). https:\/\/doi.org\/10.1007\/s10623-003-6151-2","journal-title":"Des. Codes Crypt."},{"key":"1_CR5","unstructured":"Caruso, X.: Residues of skew rational functions and linearized Goppa codes. arXiv preprint arXiv:1908.08430v1 (2019)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10623-022-01102-7","volume":"91","author":"X Caruso","year":"2022","unstructured":"Caruso, X., Durand, A.: Duals of linearized Reed-Solomon codes. Des. Codes Crypt. 91, 241\u2013271 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01102-7","journal-title":"Des. Codes Crypt."},{"key":"1_CR7","unstructured":"Castryck, W., Decru, T.: An efficient key recovery attack on SIDH (preliminary version). Cryptology ePrint Archive ia.cr\/2022\/975 (2022)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46416-6_41","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"EM Gabidulin","year":"1991","unstructured":"Gabidulin, E.M., Paramonov, A.V., Tretjakov, O.V.: Ideals over a non-commutative ring and their application in cryptology. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 482\u2013489. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_41"},{"issue":"2","key":"1_CR9","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 Crypt. 48(2), 171\u2013177 (2008). https:\/\/doi.org\/10.1007\/s10623-007-9160-8","journal-title":"Des. Codes Crypt."},{"key":"1_CR10","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, pp. 2544\u20132548 (2016)","DOI":"10.1109\/ISIT.2016.7541758"},{"issue":"2","key":"1_CR11","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. Des. Codes Crypt. 86(2), 319\u2013340 (2018). https:\/\/doi.org\/10.1007\/s10623-017-0343-7","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0021-8693(88)90063-4","volume":"119","author":"TY Lam","year":"1988","unstructured":"Lam, T.Y., Leroy, A.: Vandermonde and Wronskian matrices over division rings. J. Algebra 119(2), 308\u2013336 (1988)","journal-title":"J. Algebra"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Lu, H.f., Kumar, P.V.: A unified construction of space-time codes with optimal rate-diversity tradeoff. IEEE Trans. Inf. Theor. 51(5), 1709\u20131730 (2005)","DOI":"10.1109\/TIT.2005.846403"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.jalgebra.2018.02.005","volume":"504","author":"U Mart\u00ednez-Pe\u00f1as","year":"2018","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring. J. Algebra 504, 587\u2013612 (2018)","journal-title":"J. Algebra"},{"issue":"8","key":"1_CR15","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1007\/s10623-020-00772-5","volume":"88","author":"U Mart\u00ednez-Pe\u00f1as","year":"2020","unstructured":"Mart\u00ednez-Pe\u00f1as, U.: Hamming and simplex codes for the sum-rank metric. Des. Codes Crypt. 88(8), 1521\u20131539 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00772-5","journal-title":"Des. Codes Crypt."},{"issue":"8","key":"1_CR16","doi-asserted-by":"publisher","first-page":"4785","DOI":"10.1109\/TIT.2019.2912165","volume":"65","author":"U Mart\u00ednez-Pe\u00f1as","year":"2019","unstructured":"Mart\u00ednez-Pe\u00f1as, U., Kschischang, F.R.: Reliable and secure multishot network coding using linearized Reed-Solomon codes. IEEE Trans. Inf. Theor. 65(8), 4785\u20134803 (2019)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"1_CR17","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. The Deep Space Network Progress Report, vol. 42\u201344, pp. 114\u2013116 (1978)"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1016\/j.jalgebra.2022.06.027","volume":"609","author":"A Neri","year":"2022","unstructured":"Neri, A.: Twisted linearized Reed-Solomon codes: a skew polynomial framework. J. Algebra 609, 792\u2013839 (2022)","journal-title":"J. Algebra"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/s00145-007-9003-9","volume":"21","author":"R Overbeck","year":"2007","unstructured":"Overbeck, R.: Structural attacks for public key cryptosystems based on Gabidulin codes. J. Cryptol. 21(2), 280\u2013301 (2007). https:\/\/doi.org\/10.1007\/s00145-007-9003-9","journal-title":"J. Cryptol."},{"key":"1_CR20","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"},{"key":"1_CR21","unstructured":"Overbeck, R.: Public key cryptography based on coding theory. Ph.D. thesis, Technical University of Darmstadt (2007)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Puchinger, S., Renner, J., Rosenkilde, J.: Generic decoding in the sum-rank metric. In: 2020 IEEE International Symposium on Information Theory, pp. 54\u201359 (2020)","DOI":"10.1109\/ISIT44484.2020.9174497"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Rashwan, H., Gabidulin, E.M., Honary, B.: A smart approach for GPT cryptosystem based on rank codes. In: 2010 IEEE International Symposium on Information Theory, pp. 2463\u20132467 (2010)","DOI":"10.1109\/ISIT.2010.5513549"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Schmidt, G., Sidorenko, V., Bossert, M.: Decoding Reed-Solomon codes beyond half the minimum distance using shift-register synthesis. In: 2006 IEEE International Symposium on Information Theory, pp. 459\u2013463 (2006)","DOI":"10.1109\/ISIT.2006.261711"},{"issue":"4","key":"1_CR25","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1515\/dma.1992.2.4.439","volume":"2","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On insecurity of cryptosystems based on generalized Reed-Solomon codes. Discrete Math. Appl. 2(4), 439\u2013444 (1992)","journal-title":"Discrete Math. Appl."},{"key":"1_CR26","unstructured":"Stein, W.A., et al.: Sage mathematics software (version 9.7). The Sage Development Team (2022). http:\/\/www.sagemath.org"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/11745853_2","volume-title":"Public Key Cryptography - PKC 2006","author":"C Wieschebrink","year":"2006","unstructured":"Wieschebrink, C.: An attack on a modified Niederreiter encryption scheme. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol. 3958, pp. 14\u201326. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11745853_2"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public-key scheme based on GRS subcodes. In: International Workshop on Post-quantum Cryptography, pp. 61\u201372 (2010)","DOI":"10.1007\/978-3-642-12929-2_5"}],"container-title":["Lecture Notes in Computer Science","Code-Based Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-29689-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T20:26:22Z","timestamp":1702153582000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-29689-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031296888","9783031296895"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-29689-5_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":"29 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CBCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Code-Based Cryptography Workshop","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trondheim","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","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":"29 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cbc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cb-crypto.org\/","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","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":"8","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":"35% - 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":"3","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)"}}]}}