{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T20:44:45Z","timestamp":1773261885194,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T00:00:00Z","timestamp":1337904000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s10623-012-9694-2","type":"journal-article","created":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T08:59:00Z","timestamp":1337849940000},"page":"317-333","source":"Crossref","is-referenced-by-count":17,"title":["The non-gap sequence of a subcode of a generalized Reed\u2013Solomon code"],"prefix":"10.1007","volume":"66","author":[{"given":"Irene","family":"M\u00e1rquez-Corbella","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Mart\u00ednez-Moro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruud","family":"Pellikaan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,5,25]]},"reference":[{"key":"9694_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10623-003-6151-2","volume":"35","author":"T. Berger","year":"2005","unstructured":"Berger T., Loidreau P.: How to mask the structure of codes for a cryptographic use. Des. Codes Cryptogr. 35, 63\u201379 (2005)","journal-title":"Des. Codes Cryptogr."},{"issue":"36","key":"9694_CR2","first-page":"73","volume":"2010","author":"D.J. Bernstein","year":"2010","unstructured":"Bernstein D.J.: Grover vs. McEliece. PQCrypto 2010(36), 73\u201380 (2010)","journal-title":"McEliece. PQCrypto"},{"key":"9694_CR3","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie W., Hellman M.: New directions in cryptography. IEEE Trans. Inf. Theory. IT-22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory."},{"key":"9694_CR4","doi-asserted-by":"crossref","first-page":"1863","DOI":"10.1016\/j.jpaa.2010.10.018","volume":"215","author":"I. Duursma","year":"2011","unstructured":"Duursma I., Kirov R., Park S.: Distance bounds for algebraic geometric codes. J. Pure Appl. Algebra. 215, 1863\u20131878 (2011)","journal-title":"J. Pure Appl. Algebra."},{"key":"9694_CR5","doi-asserted-by":"crossref","first-page":"489","DOI":"10.3934\/amc.2011.5.489","volume":"5","author":"O. Geil","year":"2011","unstructured":"Geil O., Munuera C., Ruano D., Torres F.: On the order bounds for one-point AG codes. Adv. Math. Commun. 5, 489\u2013504 (2011)","journal-title":"Adv. Math. Commun."},{"key":"9694_CR6","unstructured":"H\u00f8holdt T., van Lint J.H., Pellikaan R.: Algebraic geometry codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory. vol. 1, pp. 871\u2013961. Elsevier, Amsterdam (1998)."},{"key":"9694_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/TIT.1968.1054127","volume":"IT-14","author":"T. Kasami","year":"1968","unstructured":"Kasami T., Lin S., Peterson W.W.: New generalizations of the Reed\u2013Muller codes part I: Primitive codes. IEEE Trans. Inf. Theory IT-14, 189\u2013199 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9694_CR8","first-page":"27","volume":"40","author":"Y.X. Li","year":"1994","unstructured":"Li Y.X., Deng R.H., Wang X.M.: On the equivalence of McEliece\u2019s and Niederreiter\u2019s public-key cryptosystems. IEEE Trans. Inf. Theory IT- 40, 27\u2013273 (1994)","journal-title":"IEEE Trans. Inf. Theory IT-"},{"issue":"-44","key":"9694_CR9","first-page":"114","volume":"42","author":"R.J. McEliece","year":"1978","unstructured":"McEliece R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42(\u221244), 114\u2013116 (1978)","journal-title":"DSN Prog. Rep."},{"issue":"2","key":"9694_CR10","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter H.: Knapsack-type crypto systems and algebraic coding theory. Prob. Control Inf. Theory 15(2), 159\u2013166 (1986)","journal-title":"Prob. Control Inf. Theory"},{"key":"9694_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-3-540-88702-7_4","volume":"6","author":"R. Overbeck","year":"2009","unstructured":"Overbeck R., Sendrier N.: Code-based cryptography. Post Quantum Cryptogr. 6, 95\u2013145 (2009)","journal-title":"Post Quantum Cryptogr."},{"key":"9694_CR12","first-page":"439","volume":"2","author":"V.M. Sidelnikov","year":"1992","unstructured":"Sidelnikov V.M., Shestakov S.O.: On the insecurity of cryptosystems based on generalized Reed\u2013Solomon codes. Discret. Math. Appl. 2, 439\u2013444 (1992)","journal-title":"Discret. Math. Appl."},{"key":"9694_CR13","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/0022-314X(74)90043-2","volume":"6","author":"W.M. Schmidt","year":"1974","unstructured":"Schmidt W.M.: A lower bound for the number of solutions of equations over finite fields. J. Number Theory 6, 448\u2013480 (1974)","journal-title":"J. Number Theory"},{"key":"9694_CR14","volume-title":"Algebraic Function Fields and Codes","author":"H. Stichtenoth","year":"1993","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes. Springer, Universitext (1993)"},{"key":"9694_CR15","unstructured":"Wieschebrink C.: An attack on the modified Niederreiter encryption scheme. In: PKC 2006. Lecture Notes in Computer Science, vol. 3958, pp. 14\u201326, Berlin, Springer (2006)."},{"key":"9694_CR16","unstructured":"Wieschebrink C.: Cryptoanalysis of the Niederreiter public key scheme based on GRS subcodes. In: Post-Quantum Cryptography. Lecture Notes in Computer Science, vol. 6061, pp. 6\u201372. Berlin, Springer (2010)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9694-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9694-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9694-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:33Z","timestamp":1559246313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9694-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,25]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9694"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9694-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,25]]}}}