{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T16:56:26Z","timestamp":1774976186300,"version":"3.50.1"},"publisher-location":"Cham","reference-count":102,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319692838","type":"print"},{"value":"9783319692845","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69284-5_10","type":"book-chapter","created":{"date-parts":[[2017,10,28]],"date-time":"2017-10-28T04:03:59Z","timestamp":1509163439000},"page":"129-149","source":"Crossref","is-referenced-by-count":12,"title":["Evolution of the McEliece Public Key Encryption Scheme"],"prefix":"10.1007","author":[{"given":"Dominic","family":"Bucerzan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vlad","family":"Dragoi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herv\u00e9 Tal\u00e9","family":"Kalachi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,29]]},"reference":[{"key":"10_CR1","unstructured":"Aguilar, C., Blazy, O., Deneuville, J.-C., Gaborit, P., Z\u00e9mor, G.: Efficient encryption from random quasi-cyclic codes. arXiv preprint (2016). arXiv:1612.05572"},{"issue":"4","key":"10_CR2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s13389-011-0024-9","volume":"1","author":"R Avanzi","year":"2011","unstructured":"Avanzi, R., Hoerder, S., Page, D., Tunstall, M.: Side-channel attacks on the McEliece and Niederreiter public-key cryptosystems. J. Cryptogr. Eng. 1(4), 271\u2013281 (2011)","journal-title":"J. Cryptogr. Eng."},{"issue":"4","key":"10_CR3","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00037-011-0029-x","volume":"20","author":"M Alekhnovich","year":"2011","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. Comput. Complex. 20(4), 755\u2013786 (2011)","journal-title":"Comput. Complex."},{"key":"10_CR4","series-title":"SpringerBriefs in Electrical and Computer Engineering","doi-asserted-by":"publisher","first-page":"120","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. SpringerBriefs in Electrical and Computer Engineering, p. 120. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-02556-8"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","volume-title":"Security and Cryptography for Networks","author":"M Baldi","year":"2008","unstructured":"Baldi, M., Bodrato, M., Chiaraluce, F.: A new analysis of the mceliece cryptosystem based on QC-LDPC codes. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol. 5229, pp. 246\u2013262. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-85855-3_17"},{"issue":"1","key":"10_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00145-014-9187-8","volume":"29","author":"M Baldi","year":"2016","unstructured":"Baldi, M., Bianchi, M., Chiaraluce, F., Rosenthal, J., Schipani, D.: Enhanced public key security for the mceliece cryptosystem. J. Cryptol. 29(1), 1\u201327 (2016)","journal-title":"J. Cryptol."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes. In: Proceedings of IEEE International Symposium on Information Theory - ISIT, pp. 2591\u20132595, Nice, France, June 2007","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-319-29360-8_9","volume-title":"Post-Quantum Cryptography","author":"M Bardet","year":"2016","unstructured":"Bardet, M., Chaulet, J., Dragoi, V., Otmani, A., Tillich, J.-P.: Cryptanalysis of the McEliece public key cryptosystem based on polar codes. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 118\u2013143. Springer, Cham (2016). doi: 10.1007\/978-3-319-29360-8_9"},{"issue":"1","key":"10_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.15837\/ijccc.2017.1.2780","volume":"12","author":"D Bucerzan","year":"2016","unstructured":"Bucerzan, D., Cayrel, P.-L., Dragoi, V., Richmond, T.: Improved timing attacks against the secret permutation in the mceliece PKC. Int. J. Comput. Commun. Control 12(1), 7\u201325 (2016)","journal-title":"Int. J. Comput. Commun. Control"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-40349-1_15","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"DJ Bernstein","year":"2013","unstructured":"Bernstein, D.J., Chou, T., Schwabe, P.: McBits: fast constant-time code-based cryptography. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 250\u2013272. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40349-1_15"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-319-31517-1_18","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2016","author":"M Bardet","year":"2016","unstructured":"Bardet, M., Dragoi, V., Luque, J.-G., Otmani, A.: Weak keys for the quasi-cyclic MDPC public key encryption scheme. In: Pointcheval, D., Nitaj, A., Rachidi, T. (eds.) AFRICACRYPT 2016. LNCS, vol. 9646, pp. 346\u2013367. Springer, Cham (2016). doi: 10.1007\/978-3-319-31517-1_18"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Bardet, M., Dragoi, V., Otmani, A., Tillich, J.-P.: Algebraic properties of polar codes from a new polynomial formalism. In: IEEE International Symposium on Information Theory (ISIT 2016), Barcelona, Spain, 10\u201315 July 2016, pp. 230\u2013234 (2016)","DOI":"10.1109\/ISIT.2016.7541295"},{"issue":"1","key":"10_CR13","doi-asserted-by":"crossref","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 Cryptogr. 35(1), 63\u201379 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-88403-3_3","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2008","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 31\u201346. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-88403-3_3"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-19574-7_10","volume-title":"Selected Areas in Cryptography","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol. 6544, pp. 143\u2013158. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19574-7_10"},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-25405-5_16","volume-title":"Post-Quantum Cryptography","author":"DJ Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Wild McEliece incognito. In: Yang, B.-Y. (ed.) PQCrypto 2011. LNCS, vol. 7071, pp. 244\u2013254. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25405-5_16"},{"issue":"3","key":"10_CR17","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-88403-3_4","volume-title":"Post-Quantum Cryptography","author":"B Biswas","year":"2008","unstructured":"Biswas, B., Sendrier, N.: McEliece cryptosystem implementation: theory and practice. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 47\u201362. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-88403-3_4"},{"key":"10_CR19","unstructured":"Chizhov, I.V., Borodin, M.A.: The failure of McEliece PKC based on Reed-Muller codes. IACR Cryptology ePrint Archive, Report 2013\/287 (2013). http:\/\/eprint.iacr.org\/"},{"issue":"5","key":"10_CR20","first-page":"273","volume":"24","author":"IV Chizhov","year":"2014","unstructured":"Chizhov, I.V., Borodin, M.A.: Effective attack on the McEliece cryptosystem based on Reed-Muller codes. Discr. Math. Appl. 24(5), 273\u2013280 (2014)","journal-title":"Discr. Math. Appl."},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/3-540-45682-1_10","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NT Courtois","year":"2001","unstructured":"Courtois, N.T., Finiasz, M., Sendrier, N.: How to achieve a McEliece-based digital signature scheme. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 157\u2013174. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45682-1_10"},{"issue":"2","key":"10_CR22","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s10623-014-9967-z","volume":"73","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Gaborit, P., Gauthier-Uma\u00f1a, V., Otmani, A., Tillich, J.-P.: Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes. Des. Codes Cryptogr. 73(2), 641\u2013666 (2014)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-30057-8_9","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"P-L Cayrel","year":"2012","unstructured":"Cayrel, P.-L., Hoffmann, G., Persichetti, E.: Efficient implementation of a CCA2-secure variant of mceliece using generalized srivastava codes. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 138\u2013155. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-30057-8_9"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Couvreur, A., M\u00e1rquez-Corbella, I., Pellikaan, R.: A polynomial time attack against algebraic geometry code based public key cryptosystems. In: Proceedings of IEEE International Symposium on Information Theory (ISIT 2014), pp. 1446\u20131450, June 2014","DOI":"10.1109\/ISIT.2014.6875072"},{"key":"10_CR25","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.ffa.2014.04.007","volume":"29","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Otmani, A., Tillich, J.-P.: New identities relating wild Goppa codes. Finite Fields Appl. 29, 178\u2013197 (2014)","journal-title":"Finite Fields Appl."},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-55220-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"A Couvreur","year":"2014","unstructured":"Couvreur, A., Otmani, A., Tillich, J.-P.: Polynomial time attack on wild McEliece over quadratic extensions. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 17\u201339. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-55220-5_2"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-29360-8_10","volume-title":"Post-Quantum Cryptography","author":"R Canto Torres","year":"2016","unstructured":"Canto Torres, R., Sendrier, N.: Analysis of information set decoding for a sub-linear error weight. In: Takagi, T. (ed.) PQCrypto 2016. LNCS, vol. 9606, pp. 144\u2013161. Springer, Cham (2016). doi: 10.1007\/978-3-319-29360-8_10"},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/978-3-319-03515-4_19","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2013","author":"V Dragoi","year":"2013","unstructured":"Dragoi, V., Cayrel, P.-L., Colombier, B., Richmond, T.: Polynomial structures in code-based cryptography. In: Paul, G., Vaudenay, S. (eds.) INDOCRYPT 2013. LNCS, vol. 8250, pp. 286\u2013296. Springer, Cham (2013). doi: 10.1007\/978-3-319-03515-4_19"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-642-34961-4_30","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"N D\u00f6ttling","year":"2012","unstructured":"D\u00f6ttling, N., M\u00fcller-Quade, J., Nascimento, A.C.A.: IND-CCA secure cryptography based on a variant of the LPN problem. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 485\u2013503. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34961-4_30"},{"key":"10_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-38553-7_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2013","author":"A Duc","year":"2013","unstructured":"Duc, A., Vaudenay, S.: HELEN: a public-key cryptosystem based on the LPN and the decisional minimal distance problems. In: Youssef, A., Nitaj, A., Hassanien, A.E. (eds.) AFRICACRYPT 2013. LNCS, vol. 7918, pp. 107\u2013126. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38553-7_6"},{"issue":"10","key":"10_CR31","doi-asserted-by":"crossref","first-page":"6830","DOI":"10.1109\/TIT.2013.2272036","volume":"59","author":"J-C Faug\u00e8re","year":"2013","unstructured":"Faug\u00e8re, J.-C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.-P.: A distinguisher for high rate McEliece cryptosystems. IEEE Trans. Inform. Theory 59(10), 6830\u20136844 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR32","unstructured":"Faure, C., Minder, L.: Cryptanalysis of the McEliece cryptosystem over hyperelliptic curves. In: Proceedings of the Eleventh International Workshop on Algebraic and Combinatorial Coding Theory, Pamporovo, Bulgaria, pp. 99\u2013107, June 2008"},{"issue":"1","key":"10_CR33","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/TIT.2015.2493539","volume":"62","author":"J-C Faug\u00e8re","year":"2016","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., de Portzamparc, F., Tillich, J.-P.: Folding alternant and Goppa Codes with non-trivial automorphism groups. IEEE Trans. Inform. Theory 62(1), 184\u2013198 (2016)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR34","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), Bergen, Norway, pp. 81\u201391, March 2005"},{"issue":"2","key":"10_CR35","doi-asserted-by":"crossref","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 Cryptogr. 48(2), 171\u2013177 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR36","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low Density Parity Check Codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R.G.: Low Density Parity Check Codes. M.I.T. Press, Cambridge (1963)"},{"issue":"3","key":"10_CR37","first-page":"55","volume":"7","author":"CT Gueye","year":"2013","unstructured":"Gueye, C.T., Mboup, E.H.M.: Secure cryptographic scheme based on modified Reed Muller codes. Int. J. Secur. Appl. 7(3), 55\u201364 (2013)","journal-title":"Int. J. Secur. Appl."},{"key":"10_CR38","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 2013), Bergen, Norway (2013). www.selmer.uib.no\/WCC2013\/pdfs\/Gaborit.pdf"},{"key":"10_CR39","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/S1571-0653(04)00168-4","volume":"6","author":"EM Gabidulin","year":"2001","unstructured":"Gabidulin, E.M., Ourivski, A.V.: Modified GPT PKC with right scrambler. Electron. Notes Discrete Math. 6, 168\u2013177 (2001)","journal-title":"Electron. Notes Discrete Math."},{"issue":"3","key":"10_CR40","first-page":"24","volume":"6","author":"VD Goppa","year":"1970","unstructured":"Goppa, V.D.: A new class of linear correcting codes. Problemy Peredachi Informatsii 6(3), 24\u201330 (1970)","journal-title":"Problemy Peredachi Informatsii"},{"key":"10_CR41","unstructured":"Gabidulin, E., Pilipchuk, N.: GPT cryptosystem for information network security. In: International Conference on Information Society (i-Society 2013), no. 8, pp. 21\u201325 (2013)"},{"issue":"8","key":"10_CR42","first-page":"937","volume":"4","author":"E Gabidulin","year":"2014","unstructured":"Gabidulin, E., Pilipchuk, N.: Modified GPT cryptosystem for information network security. Int. J. Inf. Secur. Res. 4(8), 937\u2013946 (2014)","journal-title":"Int. J. Inf. Secur. Res."},{"key":"10_CR43","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). doi: 10.1007\/3-540-46416-6_41"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Gabidulin, E., Rashwan, H., Honary, B.: On improving security of GPT cryptosystems. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 1110\u20131114. IEEE (2009)","DOI":"10.1109\/ISIT.2009.5206029"},{"issue":"2","key":"10_CR45","doi-asserted-by":"crossref","first-page":"1006","DOI":"10.1109\/TIT.2015.2511786","volume":"62","author":"P Gaborit","year":"2016","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)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"12","key":"10_CR46","doi-asserted-by":"crossref","first-page":"7245","DOI":"10.1109\/TIT.2016.2616127","volume":"62","author":"P Gaborit","year":"2016","unstructured":"Gaborit, P., Z\u00e9mor, G.: On the hardness of the decoding and the minimum distance problems for rank codes. IEEE Trans. Inf. Theory 62(12), 7245\u20137252 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR47","unstructured":"Horlemann-Trautmann, A.-L., Marshall, K., Rosenthal, J.: Extension of overbeck\u2019s attack for gabidulin based cryptosystems. CoRR, abs\/1511.01549 (2015)"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"Algorithmic Number Theory","author":"J Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.H.: NTRU: a ring-based public key cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 267\u2013288. Springer, Heidelberg (1998). doi: 10.1007\/BFb0054868"},{"key":"10_CR49","doi-asserted-by":"crossref","unstructured":"Hooshmand, R., Koochak Shooshtari, M., Eghlidos, T., Aref, M.R.: Reducing the key length of McEliece cryptosystem using polar codes. In: 2014 11th International ISC Conference on Information Security and Cryptology (ISCISC), pp. 104\u2013108. IEEE (2014)","DOI":"10.1109\/ISCISC.2014.6994031"},{"key":"10_CR50","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 (ISIT), pp. 2544\u20132548. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541758"},{"key":"10_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-642-40349-1_16","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2013","author":"S Heyse","year":"2013","unstructured":"Heyse, S., von Maurich, I., G\u00fcneysu, T.: Smaller keys for code-based cryptography: QC-MDPC McEliece implementations on embedded devices. In: Bertoni, G., Coron, J.-S. (eds.) CHES 2013. LNCS, vol. 8086, pp. 273\u2013292. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40349-1_16"},{"issue":"2","key":"10_CR52","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"G Solomon","year":"1960","unstructured":"Solomon, G., Reed, I.S.: Polynomial codes over certain finite fields. J. Soc. Industr. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Industr. Appl. Math."},{"issue":"3","key":"10_CR53","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1027351723034","volume":"8","author":"H Janwa","year":"1996","unstructured":"Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Des. Codes Cryptogr. 8(3), 293\u2013307 (1996)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR54","doi-asserted-by":"crossref","unstructured":"Kudekar, S., Kumar, S., Mondelli, M., Pfister, H.D., Sasoglu, E., Urbanke, R.: Reed-muller codes achieve capacity on erasure channels. IEEE Trans. Inf. Theory PP(99), 1 (2017)","DOI":"10.1145\/2897518.2897584"},{"key":"10_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-54631-0_1","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Kiltz","year":"2014","unstructured":"Kiltz, E., Masny, D., Pietrzak, K.: Simple chosen-ciphertext security from low-noise LPN. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 1\u201318. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54631-0_1"},{"issue":"1","key":"10_CR56","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1109\/18.272496","volume":"40","author":"YX 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. Inform. Theory 40(1), 271\u2013273 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-34129-8_45","volume-title":"Information and Communications Security","author":"C L\u00f6ndahl","year":"2012","unstructured":"L\u00f6ndahl, C., Johansson, T.: A new version of McEliece PKC based on convolutional codes. In: Chim, T.W., Yuen, T.H. (eds.) ICICS 2012. LNCS, vol. 7618, pp. 461\u2013470. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-34129-8_45"},{"key":"10_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-12929-2_11","volume-title":"Post-Quantum Cryptography","author":"P Loidreau","year":"2010","unstructured":"Loidreau, P.: Designing a rank metric based McEliece cryptosystem. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 142\u2013152. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-12929-2_11"},{"issue":"3","key":"10_CR59","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1109\/18.915687","volume":"47","author":"P Loidreau","year":"2001","unstructured":"Loidreau, P., Sendrier, N.: Weak keys in the McEliece public-key cryptosystem. IEEE Trans. Inform. Theory 47(3), 1207\u20131211 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-38616-9_7","volume-title":"Post-Quantum Cryptography","author":"G Landais","year":"2013","unstructured":"Landais, G., Tillich, J.-P.: An efficient attack of a McEliece cryptosystem variant based on convolutional codes. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 102\u2013117. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38616-9_7"},{"issue":"2","key":"10_CR61","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","volume":"45","author":"DJC MacKay","year":"1999","unstructured":"MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45(2), 399\u2013431 (1999)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-05445-7_24","volume-title":"Selected Areas in Cryptography","author":"R Misoczki","year":"2009","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from goppa codes. In: Jacobson, M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol. 5867, pp. 376\u2013392. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-05445-7_24"},{"key":"10_CR63","unstructured":"McEliece, R.J.: A public-key system based on algebraic coding theory, pp. 114\u2013116. Jet Propulsion Lab, DSN Progress Report 44 (1978)"},{"key":"10_CR64","doi-asserted-by":"crossref","unstructured":"M\u00e1rquez-Corbella, I., Tillich, J.-P.: Using Reed-Solomon codes in the $$(u|u+v)$$ construction and an application to cryptography. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 930\u2013934 (2016). arXiv:1601:08227","DOI":"10.1109\/ISIT.2016.7541435"},{"key":"10_CR65","unstructured":"Mitani, N.: On the transmission of numbers in a sequential computer. National Convention of the Institute of Electrical Communication Engineers of Japan, November 1951"},{"issue":"3","key":"10_CR66","doi-asserted-by":"crossref","first-page":"44:1","DOI":"10.1145\/2700102","volume":"14","author":"IV Maurich","year":"2015","unstructured":"Maurich, I.V., Oder, T., G\u00fcneysu, T.: Implementing QC-MDPC McEliece encryption. ACM Trans. Embed. Comput. Syst. 14(3), 44:1\u201344:27 (2015)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"10_CR67","doi-asserted-by":"crossref","unstructured":"Monico, C., Rosenthal, J., Shokrollahi, A.A.: Using low density parity check codes in the McEliece cryptosystem. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), Sorrento, Italy, p. 215 (2000)","DOI":"10.1109\/ISIT.2000.866513"},{"key":"10_CR68","volume-title":"The Theory of Error-Correcting Codes","author":"FJ MacWilliams","year":"1986","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, 5th edn. North-Holland, Amsterdam (1986)","edition":"5"},{"key":"10_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-72540-4_20","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"L Minder","year":"2007","unstructured":"Minder, L., Shokrollahi, A.: Cryptanalysis of the sidelnikov cryptosystem. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 347\u2013360. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72540-4_20"},{"key":"10_CR70","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Tillich, J.-P., Sendrier, N., Barreto, P.S.L.M.: MDPC-McEliece: new McEliece variants from moderate density parity-check codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2069\u20132073 (2013)","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"10_CR71","doi-asserted-by":"crossref","unstructured":"Muller, D.E.: Application of boolean algebra to switching circuit design, to error detection. Trans. I.R.E. Prof. Group Electron. Comput. EC-3(3), 6\u201312 (1954)","DOI":"10.1109\/IREPGELC.1954.6499441"},{"issue":"2","key":"10_CR72","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(2), 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theory"},{"key":"10_CR73","unstructured":"Ouzan, S., Be\u2019ery, Y.: Moderate-density parity-check codes. arXiv preprint (2009). arXiv:0911.3262"},{"key":"10_CR74","unstructured":"Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of McEliece cryptosystem based on quasi-cyclic LDPC codes. In: Proceedings of First International Conference on Symbolic Computation and Cryptography, Beijing, China, 28\u201330 April 2008, pp. 69\u201381. LMIB Beihang University (2008)"},{"key":"10_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-18681-8_14","volume-title":"Codes, Cryptology, and Information Security","author":"A Otmani","year":"2015","unstructured":"Otmani, A., Kalachi, H.T.: Square code attack on a modified sidelnikov cryptosystem. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E.M. (eds.) C2SI 2015. LNCS, vol. 9084, pp. 173\u2013183. Springer, Cham (2015). doi: 10.1007\/978-3-319-18681-8_14"},{"key":"10_CR76","unstructured":"Otmani, A., Tal\u00e9-Kalachi, H., Ndjeya, S.: Improved cryptanalysis of rank metric schemes based on Gabidulin codes. CoRR, abs\/1602.08549 (2016)"},{"issue":"2","key":"10_CR77","doi-asserted-by":"crossref","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. Cryptol. 21(2), 280\u2013301 (2008)","journal-title":"J. Cryptol."},{"issue":"2","key":"10_CR78","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1515\/jmc-2011-0099","volume":"6","author":"E Persichetti","year":"2012","unstructured":"Persichetti, E.: Compact McEliece keys based on quasi-dyadic Srivastava codes. J. Math. Cryptol. 6(2), 149\u2013169 (2012)","journal-title":"J. Math. Cryptol."},{"issue":"5","key":"10_CR79","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.: Is code equivalence easy to decide? IEEE Trans. Inform. Theory 43(5), 1602\u20131604 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR80","first-page":"38","volume":"4","author":"IS Reed","year":"1954","unstructured":"Reed, I.S.: A class of multiple-error-correcting codes and the decoding scheme. IRE Trans. IT 4, 38\u201349 (1954)","journal-title":"IRE Trans. IT"},{"key":"10_CR81","doi-asserted-by":"crossref","unstructured":"Rashwan, H., Gabidulin, E., Honary, B.: A smart approach for GPT cryptosystem based on rank codes. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 2463\u20132467. IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513549"},{"issue":"8","key":"10_CR82","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1002\/sec.228","volume":"4","author":"H Rashwan","year":"2011","unstructured":"Rashwan, H., Gabidulin, E., Honary, B.: Security of the GPT cryptosystem and its applications to cryptography. Secur. Commun. Netw. 4(8), 937\u2013946 (2011)","journal-title":"Secur. Commun. Netw."},{"issue":"2","key":"10_CR83","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"10_CR84","unstructured":"Sendrier, N.: On the structure of a randomly permuted concatenated code. In: EUROCODE 1994, pp. 169\u2013173 (1994)"},{"issue":"3","key":"10_CR85","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s002000050104","volume":"9","author":"N Sendrier","year":"1998","unstructured":"Sendrier, N.: On the concatenated structure of a linear code. Appl. Algebra Eng. Commun. Comput. (AAECC) 9(3), 221\u2013242 (1998)","journal-title":"Appl. Algebra Eng. Commun. Comput. (AAECC)"},{"issue":"4","key":"10_CR86","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent linear codes: the support splitting algorithm. IEEE Trans. Inf. Theory 46(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10_CR87","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)","journal-title":"Bell Syst. Tech. J."},{"key":"10_CR88","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Goldwasser, S. (ed.) FOCS, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"3","key":"10_CR89","first-page":"191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"Sidelnikov, V.M.: A public-key cryptosytem based on Reed-Muller codes. Discr. Math. Appl. 4(3), 191\u2013207 (1994)","journal-title":"Discr. Math. Appl."},{"key":"10_CR90","doi-asserted-by":"crossref","unstructured":"Shrestha, S.R., Kim, Y.-S.: New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography. In: 2014 14th International Symposium on Communications and Information Technologies (ISCIT), pp. 368\u2013372. IEEE (2014)","DOI":"10.1109\/ISCIT.2014.7011934"},{"issue":"4","key":"10_CR91","first-page":"439","volume":"1","author":"VM Sidelnikov","year":"1992","unstructured":"Sidelnikov, V.M., Shestakov, S.O.: On the insecurity of cryptosystems based on generalized Reed-Solomon codes. Discr. Math. Appl. 1(4), 439\u2013444 (1992)","journal-title":"Discr. Math. Appl."},{"key":"10_CR92","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1109\/18.556667","volume":"42","author":"M Sipser","year":"1996","unstructured":"Sipser, M., Spielman, D.A.: Expander codes. IEEE Trans. Inf. Theory 42, 1710\u20131722 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR93","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-14423-3_12","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"A Shoufan","year":"2010","unstructured":"Shoufan, A., Strenzke, F., Molter, H.G., St\u00f6ttinger, M.: A timing attack against patterson algorithm in the McEliece PKC. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 161\u2013175. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14423-3_12"},{"key":"10_CR94","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-88403-3_15","volume-title":"Post-Quantum Cryptography","author":"F Strenzke","year":"2008","unstructured":"Strenzke, F., Tews, E., Molter, H.G., Overbeck, R., Shoufan, A.: Side channels in the McEliece PKC. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol. 5299, pp. 216\u2013229. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-88403-3_15"},{"key":"10_CR95","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-12929-2_8","volume-title":"Post-Quantum Cryptography","author":"F Strenzke","year":"2010","unstructured":"Strenzke, F.: A timing attack against the secret permutation in the McEliece PKC. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol. 6061, pp. 95\u2013107. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-12929-2_8"},{"key":"10_CR96","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-642-12368-9_4","volume-title":"Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Smart Devices","author":"F Strenzke","year":"2010","unstructured":"Strenzke, F.: A smart card implementation of the McEliece PKC. In: Samarati, P., Tunstall, M., Posegga, J., Markantonakis, K., Sauveron, D. (eds.) WISTP 2010. LNCS, vol. 6033, pp. 47\u201359. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-12368-9_4"},{"key":"10_CR97","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-642-38616-9_15","volume-title":"Post-Quantum Cryptography","author":"F Strenzke","year":"2013","unstructured":"Strenzke, F.: Timing attacks against the syndrome inversion in code-based cryptosystems. In: Gaborit, P. (ed.) PQCrypto 2013. LNCS, vol. 7932, pp. 217\u2013230. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38616-9_15"},{"key":"10_CR98","doi-asserted-by":"crossref","unstructured":"Urivskiy, A., Gabidulin, E.: On the equivalence of different variants of the GPT cryptosystem, no. 3, pp. 95\u201397. IEEE (2014)","DOI":"10.1109\/RED.2014.7016713"},{"key":"10_CR99","doi-asserted-by":"crossref","unstructured":"Wang, Y.: Quantum resistant random linear code based public key encryption scheme rlce. In: 2016 IEEE International Symposium on Information Theory (ISIT), pp. 2519\u20132523. IEEE (2016)","DOI":"10.1109\/ISIT.2016.7541753"},{"key":"10_CR100","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). doi: 10.1007\/11745853_2"},{"key":"10_CR101","doi-asserted-by":"crossref","unstructured":"Wieschebrink, C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 1733\u20131737 (2006)","DOI":"10.1109\/ISIT.2006.261651"},{"key":"10_CR102","doi-asserted-by":"crossref","unstructured":"Wieschebrink, C.: Cryptanalysis of the Niederreiter public key scheme based on GRS subcodes. IACR Cryptology ePrint Archive, Report 2009\/452 (2009)","DOI":"10.1007\/978-3-642-12929-2_5"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69284-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T18:02:38Z","timestamp":1603216958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69284-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319692838","9783319692845"],"references-count":102,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69284-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}