{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T23:44:08Z","timestamp":1648856648143},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T00:00:00Z","timestamp":1576540800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11786-019-00444-1","type":"journal-article","created":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T15:02:48Z","timestamp":1576594968000},"page":"457-469","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computer Algebra Tales on Goppa Codes and McEliece Cryptography"],"prefix":"10.1007","volume":"14","author":[{"given":"Narc\u00eds","family":"Sayols","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebasti\u00e0","family":"Xamb\u00f3-Descamps","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,17]]},"reference":[{"key":"444_CR1","doi-asserted-by":"crossref","unstructured":"Aragon, N., Gaborit, P., Hauteville, A., Tillich, J.-P.: Improvement of generic attacks on the rank syndrome decoding problem. https:\/\/hal.archives-ouvertes.fr\/hal-01618464 (2017)","DOI":"10.1109\/ISIT.2018.8437464"},{"key":"444_CR2","unstructured":"Augot, D., Batina, L., Bernstein, D.J., Bos, J., Buchmann, J., Castryck, W., Dunkelman, O., G\u00fcneysu, T., Gueron, S., H\u00fclsing, A., Lange, T., Mohamed, M.S.E., Rechberger, C., Schwabe, P., Sendrier, N., Vercauteren, F., Yang, B.Y.: Initial recommendations of long-term secure post-quantum systems. PQCRYPTO \/ ICT-645622 \/ Horizon 2020 (2015). https:\/\/pqcrypto.eu.org\/docs\/initial-recommendations.pdf"},{"key":"444_CR3","unstructured":"Barbier, M., Barreto, P.S.L.M.: Key Reduction of McEliece\u2019s cryptosystem using list decoding. In: Kuleshov, A., Blinovsky, V.M., Ephremides, A., (eds), International Symposium of Information Theory (ISIT), Saint-Peterburg, Russia. IEEE, pp 2657\u20132661 (2011). https:\/\/hal.inria.fr\/inria-00565343\/file\/preprint.pdf"},{"key":"444_CR4","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.: Algebraic Coding Theory. McGraw-Hill, 1968. Revised edition by Aegean Park Press in 1984, revised edition by World Scientific Publishing Co. in 2015, with a new Preface","DOI":"10.1142\/9407"},{"issue":"3","key":"444_CR5","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"444_CR6","unstructured":"Bernstein, D.J.: Index of formal scientific papers (2018). https:\/\/cr.yp.to\/papers.html. Consulted on 1st February"},{"key":"444_CR7","unstructured":"Bernstein, D.J.: Introduction to post-quantum cryptography. In: Post-Quantum Cryptography. Springer, pp. 1\u201314. Introductory chapter of [10] (2009). http:\/\/www.pqcrypto.org\/www.springer.com\/cda\/content\/document\/cda_downloaddocument\/9783540887010-c1.pdf"},{"key":"444_CR8","unstructured":"Bernstein, D.\u00a0J.: Is the security of quantum cryptography guaranteed by the laws of physics? (2017). https:\/\/sidechannels.cr.yp.to\/qkd\/holographic-20160326.pdf"},{"key":"444_CR9","unstructured":"Bernstein, D.J., Biasse, J.F., Mosca, M.: A low-resource quantum factoring algorithm. In: Lange, T., Takagi, T., (eds.) Post-Quantum Cryptography-8th International Workshop, PQCrypto 2017, Lecture Notes in Computer Science 10346. Springer, pp. 330\u2013346 (2017). Proceedings of the PQCrypto 2017 workshop held at Utrecht, the Netherlands, June 26-28. https:\/\/cr.yp.to\/papers\/grovernfs-20170419.pdf"},{"key":"444_CR10","volume-title":"Post-Quantum Cryptography","year":"2009","unstructured":"Bernstein, D.J., Buchmann, J., Dahmen, E. (eds.): Post-Quantum Cryptography. Springer, Berlin (2009)"},{"key":"444_CR11","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1038\/nature23461","volume":"549","author":"DJ Bernstein","year":"2017","unstructured":"Bernstein, D.J., Lange, T.: Post-quantum cryptography -dealing with the fallout of physics success. Nature 549, 188\u2013194 (2017)","journal-title":"Nature"},{"key":"444_CR12","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J., (eds) Post-Quantum Cryptography, Number 5299 in Lecture Notes in Computer Science, Proceedings of the Second international Workshop PQCrypto 2008, October 17\u201319, Cincinnati, OH, USA. Springer pp. 31\u201345 (2008)"},{"key":"444_CR13","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece incognito. In: Yang, B.Y., (eds) Post-quantum Cryptography\u20134th International Workshop, PQCrypto 2011, Lecture Notes in Computer Science 7071, Proceedings of the PQCrypto 2011 Workshop Held at Taipei, Taiwan, November 29\u2013December 2, 2011. Springer, pp 244\u2013254 (2011) . https:\/\/cr.yp.to\/codes\/wild2-20110915.pdf"},{"key":"444_CR14","unstructured":"Bernstein, D.J., Yang, B.Y.: Asymptotically faster quantum algorithms to solve multivariate quadratic equations (2017). https:\/\/cr.yp.to\/papers\/groverxl-20171215.pdf"},{"key":"444_CR15","unstructured":"Biswas, B.: Implementational aspects of code-based cryptography. PhD thesis, L\u2019\u00c9cole Polytechnique \/ INRIA (2010). https:\/\/hal.archives-ouvertes.fr\/pastel-00523007\/"},{"key":"444_CR16","unstructured":"Cameron, P.J.: Notes on Cryptography (2013). http:\/\/www.maths.qmul.ac.uk\/~pjc\/notes\/crypt.pdf"},{"key":"444_CR17","unstructured":"Campbell, E.T., Terhal, B.M., Vuillot, C.: The steep road towards robust and universal quantum computation (2016). https:\/\/arxiv.org\/pdf\/1612.07330.pdf"},{"key":"444_CR18","doi-asserted-by":"crossref","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: International Conference on the Theory and Application of Cryptology and Information Security. Springer, pp. 157\u2013174 (2001)","DOI":"10.1007\/3-540-45682-1_10"},{"key":"444_CR19","unstructured":"Deneuville, J.-C., Gaborit, P., Z\u00e9mor, G.: Ouroboros: A simple, secure and efficient key exchange protocol based on coding theory. In: Lange, T., Takagi, T., (eds), Post-Quantum Cryptography, Number 10346 in Lecture Notes in Computer Science. Proceedings of the International Workshop PQCrypto 2017, pp 18\u201334 (2017). https:\/\/rd.springer.com\/chapter\/10.1007%2F978-3-319-59879-6_2"},{"key":"444_CR20","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellmann, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"444_CR21","unstructured":"Dinh, H., Moore, C., Russell, A.: McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks. In: Rogaway, P. (ed) CRYPTO 2011. Springer, pp. 761\u2013779 (2011). https:\/\/www.iacr.org\/archive\/crypto2011\/68410758\/68410758.pdf"},{"issue":"2","key":"444_CR22","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1515\/JMC.2007.009","volume":"1","author":"D Engelbert","year":"2007","unstructured":"Engelbert, D., Overbeck, R., Schmidt, A.: A summary of McEliece-type cryptosystems and their security. J. Math. Cryptol. 1(2), 151\u2013199 (2007)","journal-title":"J. Math. Cryptol."},{"key":"444_CR23","unstructured":"Farr\u00e9, R., Sayols, N., Xamb\u00f3-Descamps, S.: On the PGZ decoding algorithm for alternant codes. Comput. Appl. Math. (in press) (2018). arXiv:1704.05259"},{"key":"444_CR24","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of Workshop on Codes and Cryptography, pp. 81\u201390 (2005)"},{"key":"444_CR25","unstructured":"Gaborit, P., Ruatta, O., Schrek, J.: On the complexity of the rank syndrome decoding problem. IEEE Trans. Inf. Theory 62(2), 1006\u20131019 (2016). https:\/\/arxiv.org\/pdf\/1301.1026.pdf"},{"issue":"3","key":"444_CR26","first-page":"24","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa, V.D.: A new class of linear correcting codes. Probl. Pederachi Inf. 6(3), 24\u201334 (1970). (in Russian)","journal-title":"Probl. Pederachi Inf."},{"issue":"2","key":"444_CR27","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1137\/0109020","volume":"9","author":"D Gorenstein","year":"1961","unstructured":"Gorenstein, D., Zierler, N.: A class of error-correcting codes in $$p^m$$ symbols. J. Soc. Ind. Appl. Math. 9(2), 2007\u2013214 (1961)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"444_CR28","volume-title":"Modern Cryptography. Cryptography and Network Security","author":"J Katz","year":"2008","unstructured":"Katz, J., Lindell, Y.: Modern Cryptography. Cryptography and Network Security. Chapmann & Hall\/CRC, London (2008)"},{"key":"444_CR29","volume-title":"The Theory of Information and Coding Volume\u00a03 of The Encyclopedia of Mathematics and its Applications","author":"RJ McEliece","year":"1977","unstructured":"McEliece, R.J.: The Theory of Information and Coding Volume\u00a03 of The Encyclopedia of Mathematics and its Applications. Addison-Wesley, Boston (1977)"},{"key":"444_CR30","unstructured":"McEliece, R.\u00a0J.: A public-key cryptosystem based on algebraic coding theory. Jet Propulsion Laboratory, DSN Progress Report 42-44 (1978). http:\/\/ipnpr.jpl.nasa.gov\/progress_report2\/42-44\/44N.pdf"},{"issue":"5","key":"444_CR31","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"RC Merkle","year":"1978","unstructured":"Merkle, R.C., Hellman, M.E.: Hiding information and signatures in trapdoor knapsacks. IEEE Int. Symp. Inf. Theory 24(5), 525\u2013530 (1978)","journal-title":"IEEE Int. Symp. Inf. Theory"},{"key":"444_CR32","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: New McEliece Variants from Moderate Density Parity-Check Codes (2012). https:\/\/eprint.iacr.org\/2012\/409.pdf"},{"key":"444_CR33","unstructured":"Molina, S., Sayols, N., Xamb\u00f3-Descamps, S.: A bootstrap for the number of $${\\mathbb{F}}_{q^m}$$-rational points on a curve over $${\\mathbb{F}}_q$$ (2017)"},{"key":"444_CR34","unstructured":"Niebuhr, R.: Attacking and Defending Code-based Cryptosystems. Ph.D. thesis (2012)"},{"key":"444_CR35","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theory 15, 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theory"},{"key":"444_CR36","unstructured":"NISTIR-2018. Report on post-quantum cryptography (2018). https:\/\/nvlpubs.nist.gov\/nistpubs\/ir\/2016\/NIST.IR.8105.pdf"},{"key":"444_CR37","doi-asserted-by":"crossref","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Post-Quantum Cryptography. Springer. See [10], pp. 95\u2013146 (2009)","DOI":"10.1007\/978-3-540-88702-7_4"},{"issue":"2","key":"444_CR38","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"NJ Patterson","year":"1975","unstructured":"Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Trans. Inf. Theory 21(2), 203\u2013207 (1975)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"444_CR39","unstructured":"Persichetti, E.: Improving the Efficiency of Code-Based Cryptography. Ph.D. thesis, Department of Mathematics, University of Auckland, New Zeeland (2012). https:\/\/www.math.auckland.ac.nz\/~sgal018\/EdoardoPhD.pdf"},{"key":"444_CR40","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TIT.1960.1057586","volume":"6","author":"WW Peterson","year":"1960","unstructured":"Peterson, W.W.: Encoding and error-correction procedures for the Bose\u2013Chaudhuri codes. IRE Trans. Inf. Theory 6, 459\u2013470 (1960)","journal-title":"IRE Trans. Inf. Theory"},{"key":"444_CR41","volume-title":"Error-Correcting Codes (2nd edition)","author":"WW Peterson","year":"1972","unstructured":"Peterson, W.W., Weldon, E.J.: Error-Correcting Codes (2nd edition). MIT Press, Boston (1972)"},{"key":"444_CR42","unstructured":"Post-Quantum Cryptography 2018. https:\/\/csrc.nist.gov\/Projects\/Post-Quantum-Cryptography. First PQC Standardization Conference organized by the NIST Computer Security Resource Center"},{"key":"444_CR43","unstructured":"Post-quantum cryptography (2018). https:\/\/pqcrypto.org\/"},{"key":"444_CR44","unstructured":"Randall, D.: Efficient generation of random nonsingular matrices, 1991. Report No. UCB\/CSD-91-658 (November 1991). https:\/\/www2.eecs.berkeley.edu\/Pubs\/TechRpts\/1991\/CSD-91-658.pdf"},{"key":"444_CR45","first-page":"57","volume":"60","author":"M Repka","year":"2014","unstructured":"Repka, M., Zadaj, P.: Overview of the McEliece cryptosystem and its security. Tatra Mt. Math. Publ. 60, 57\u201383 (2014)","journal-title":"Tatra Mt. Math. Publ."},{"key":"444_CR46","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosistems. Commun. ACM 21, 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"444_CR47","unstructured":"Ru\u00e9, J., Xamb\u00f3-Descamps, S.: Introducci\u00f3 matem\u00e0tica a la computaci\u00f3 qu\u00e0ntica. Butllet\u00ed de la Societat Catalana de Matem\u00e0tiques, 28(2), 183\u2013231 (2013). English version available at https:\/\/mat-web.upc.edu\/people\/sebastia.xambo\/QC\/qc.pdf"},{"key":"444_CR48","unstructured":"Sayols, N., Xamb\u00f3-Descamps, S.: A Python package for the construction, coding and decoding of error-correcting codes (2017). https:\/\/mat-web.upc.edu\/people\/sebastia.xambo\/PyECC.html"},{"key":"444_CR49","unstructured":"Sayols, N., Xamb\u00f3-Descamps, S.: Computer algebra tales on Goppa codes and McEliece cryptography: Python sources and companion materials (2018). https:\/\/mat-web.upc.edu\/people\/sebastia.xambo\/Papers\/PyACA.html"},{"key":"444_CR50","unstructured":"Sendrier, N.: Efficient generation of binary words of given weight. In: Proceedings of the 5th IMA Conference on Cryptography and Coding. Springer, pp. 184\u2013187 (1995). https:\/\/link.springer.com\/chapter\/10.1007\/3-540-60693-9_20"},{"key":"444_CR51","unstructured":"Sendrier, N.: Cryptosystm\u0300es \u00e0 cl\u00e9 publique bas\u00e9s sur les codes correcteurs d\u2019erreurs. Universit\u00e9 Pierre et Marie Curie, Institut National de Recherche en Informatique et Automatique, INRIA Rocquencourt. M\u00e9moire d\u2019habilitation \u00e0 diriger des recherches (2002)"},{"key":"444_CR52","unstructured":"Sendrier, N.: On the use of structured codes in code based cryptography. In: Nikova, S., Prenell, B., Storme, L., (eds), Coding Theory and Cryptography III. Contactforum. Koninklijke Vlaamse Academie van Belgi\u00eb voor Wetenschaeppen en Kunsten. pp. 59\u201368 (2009). https:\/\/www.rocq.inria.fr\/secret\/Nicolas.Sendrier\/PDFs\/Sen10c.pdf"},{"issue":"5","key":"444_CR53","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1109\/TIT.1984.1056964","volume":"30","author":"A Shamir","year":"1984","unstructured":"Shamir, A.: A polynomial-time algorithm for breaking the basic Merkle\u2013Hellman cryptosystem. IEEE Trans. Inf. Theory 30(5), 699\u2013704 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"444_CR54","unstructured":"Shor, P.: Algorithms for quantum computation: Discrete logarithms and factorization. In: Symposium of Foundations on Computer Science (Santa Fe, New Mexico, 1994). For a revised and expanded version of this paper, see [53] (1994)"},{"key":"444_CR55","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P Shor","year":"1997","unstructured":"Shor, P.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"444_CR56","unstructured":"Tillich, J.-P.: The decoding failure probability of MDPC codes (2018). https:\/\/arxiv.org\/pdf\/1801.04668.pdf"},{"key":"444_CR57","unstructured":"Wang, J.: Quantum resistant random linear code based public key encryption scheme RLCE. In: Proceedings IEEE ISIT 2016, pp. 2519\u20132523 (2016). https:\/\/eprint.iacr.org\/2015\/298.pdf"},{"key":"444_CR58","unstructured":"Wang, J.: Decoding generalized Reed-Solomon codes and its application to RLCE encryption schemes (2017). https:\/\/arxiv.org\/pdf\/1702.07737.pdf"},{"key":"444_CR59","unstructured":"Wikipedia. Quantum cryptography (2018). https:\/\/en.wikipedia.org\/wiki\/Quantum_cryptography"},{"key":"444_CR60","volume-title":"Intersection Theory and Enumerative Geometry\u2013A Computational Primer","author":"S Xamb\u00f3-Descamps","year":"2019","unstructured":"Xamb\u00f3-Descamps, S., Miret, J.M., Sayols, N.: Intersection Theory and Enumerative Geometry\u2013A Computational Primer. Springer, Berlin (2019)"},{"key":"444_CR61","unstructured":"Xamb\u00f3-Descamps, S., Sayols, N.: Error-Correcting Codes. A Computational Primer. Universitext. Springer, 2019. 2nd edition of [60], with Three New Chapters, Corrections, and an Extended Introductory Chapter. Companion materials, including source code, available at https:\/\/mat-web.upc.edu\/people\/sebastia.xambo\/PyECC.html"},{"key":"444_CR62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18997-5","volume-title":"Block Error-correcting Codes: A Computational Primer","author":"S Xamb\u00f3-Descamps","year":"2003","unstructured":"Xamb\u00f3-Descamps, S.: Block Error-correcting Codes: A Computational Primer. Universitext, Springer (2003)"}],"container-title":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-019-00444-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-019-00444-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-019-00444-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,16]],"date-time":"2020-12-16T00:39:53Z","timestamp":1608079193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-019-00444-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,17]]},"references-count":62,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["444"],"URL":"https:\/\/doi.org\/10.1007\/s11786-019-00444-1","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,17]]},"assertion":[{"value":"29 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}