{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:27:35Z","timestamp":1769117255723,"version":"3.49.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,1,5]],"date-time":"2012-01-05T00:00:00Z","timestamp":1325721600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10207-011-0153-2","type":"journal-article","created":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T06:33:03Z","timestamp":1325658783000},"page":"137-147","source":"Crossref","is-referenced-by-count":12,"title":["Selecting parameters for secure McEliece-based cryptosystems"],"prefix":"10.1007","volume":"11","author":[{"given":"Robert","family":"Niebuhr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed","family":"Meziani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanislav","family":"Bulygin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Buchmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,1,5]]},"reference":[{"issue":"4","key":"153_CR1","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00145-001-0009-4","volume":"14","author":"A.K. Lenstra","year":"2001","unstructured":"Lenstra A.K., Verheul E.R.: Selecting cryptographic key sizes. J. Cryptol. 14(4), 255\u2013293 (2001)","journal-title":"J. Cryptol."},{"key":"153_CR2","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In SFCS\u201994: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"153_CR3","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DNS Progress Report, pp. 114\u2013116 (1978)"},{"key":"153_CR4","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. Annual Symposium on Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"10","key":"153_CR5","first-page":"34","volume":"2","author":"G. Szewczyk","year":"2008","unstructured":"Szewczyk G.: The dynamic ciphers: new concept of long-term content protecting. Annales Universitatis Apulensis Series Oeconomica 2(10), 34 (2008)","journal-title":"Annales Universitatis Apulensis Series Oeconomica"},{"key":"153_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Grover vs. McEliece. Proceedings of PQCrypto 2010, LNCS 6061, pp.73\u201380 (2010)","DOI":"10.1007\/978-3-642-12929-2_6"},{"key":"153_CR7","unstructured":"Dinh, H., Moore, C., Russell, A.: The McEliece cryptosystem resists quantum fourier sampling attacks. CoRR, vol. abs\/1008.239. http:\/\/arxiv.org\/abs\/1008.2390 (2010)"},{"key":"153_CR8","unstructured":"Eisenbarth, Th.: Cryptography and cryptanalysis for embedded systems. Dissertation, Ruhr Universitaet, Bochum (2009)"},{"key":"153_CR9","doi-asserted-by":"crossref","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the mceliece cryptosystem. In: Progress in Cryptology\u2013Africacrypt\u2019 2009, LNCS 5580, pp. 77\u201397. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02384-2_6"},{"key":"153_CR10","doi-asserted-by":"crossref","unstructured":"Misoczki, R., Barreto, P.S.L.M.: Compact McEliece keys from Goppa codes. In: Jacobson, M.J. Jr., Rijmen, V., Safavi-Naini, R. Selected Areas in Cryptography, pp. 376\u2013392. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-05445-7_24"},{"key":"153_CR11","doi-asserted-by":"crossref","unstructured":"Monico, C., Rosenthal, J., Shokrollahi, A.: Using low density parity check codes in the McEliece cryptosystem. In: Proceedings of IEEE ISIT 2000, p. 215. Sorrento, Italy (2000)","DOI":"10.1109\/ISIT.2000.866513"},{"key":"153_CR12","unstructured":"Otmani, A., Tillich, J.-P., Dallot, L.: Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes. Preprint http:\/\/arxiv.org\/abs\/0804.0409v2 (2008)"},{"key":"153_CR13","unstructured":"Gauthier, V., Leander, G.: Practical key recovery attacks on two McEliece variants. Cryptology ePrint Archive, Report 2009\/509, http:\/\/eprint.iacr.org\/ (2009)"},{"key":"153_CR14","first-page":"279","volume-title":"EUROCRYPT, LNCS Vol. 6110","author":"J.-C. Faug\u00e8re","year":"2010","unstructured":"Faug\u00e8re J.-C., Otmani A., Perret L., Tillich J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys. In: Gilbert, H. (ed.) EUROCRYPT, LNCS Vol. 6110, pp. 279\u2013298. Springer, Berlin (2010)"},{"key":"153_CR15","unstructured":"Faug\u00e8re, J.-C., Otmani, A., Perret, L., Tillich, J.-P.: Algebraic cryptanalysis of McEliece variants with compact keys\u2013towards a complexity analysis. In SCC\u201910: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pp. 45\u201355 (2010)"},{"key":"153_CR16","doi-asserted-by":"crossref","unstructured":"Wieschebrink, C.: Two NP-complete problems in coding theory with an application in code based cryptography. In: IEEE International Symposium on Information Theory\u2013ISIT\u20192006, pp. 1733\u20131737. Seattle, USA, IEEE (2006)","DOI":"10.1109\/ISIT.2006.261651"},{"issue":"2","key":"153_CR17","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."},{"key":"153_CR18","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error correcting codes. North-Holland Pub. Co., New York (1977)"},{"issue":"3","key":"153_CR19","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":"153_CR20","doi-asserted-by":"crossref","unstructured":"Overbeck, R., Sendrier, N.: Code-based cryptography. In: Post Quantum Cryptography, pp. 95\u2013146. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-88702-7_4"},{"key":"153_CR21","unstructured":"Biswas, B.: Implementational aspects of code-based cryptography. PhD Thesis, INRIA, Paris, France (2010)"},{"key":"153_CR22","doi-asserted-by":"crossref","unstructured":"Overbeck, R., Engelbert, D., Schmidt, A.: A Summary of Mceliece-Type Cryptosystems and their Security. Cryptology ePrint Archive, Report 2006\/162, http:\/\/eprint.iacr.org\/ (2006)","DOI":"10.1515\/JMC.2007.009"},{"issue":"2","key":"153_CR23","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1109\/18.32140","volume":"35","author":"C.M. Adams","year":"1989","unstructured":"Adams C.M., Meijer H.: Security-related comments regarding McEliece public-key cryptosystem. IEEE Trans. Inf. Theory 35(2), 454\u2013455 (1989)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"153_CR24","doi-asserted-by":"crossref","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: EUROCRYPT\u201988, LNCS, pp. 275\u2013280 (1988)","DOI":"10.1007\/3-540-45961-8_25"},{"key":"153_CR25","doi-asserted-by":"crossref","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Proceedings of Coding Theory and Applications, pp. 106\u2013113 (1989)","DOI":"10.1007\/BFb0019850"},{"key":"153_CR26","unstructured":"Canteaut, A., Chabanne, H.: A further improvement of the work factor in an attempt at breaking McEliec\u2019s cryptosystem. Research Report RR-2227, INRIA (1994)"},{"issue":"1","key":"153_CR27","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A. Canteaut","year":"1998","unstructured":"Canteaut A., Chabaud F.: A new algorithm for finding minimum-weight words in a linear code: application to McEliece\u2019s cryptosystem and to narrowsense BCH codes of length 511. IEEE Trans. Inf. Theory 44(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"153_CR28","first-page":"31","volume-title":"PQCrypto, LNCS Vol. 5299","author":"D.J. Bernstein","year":"2008","unstructured":"Bernstein D.J., Lange T., Peters C.: Attacking and defending the McEliece cryptosystem. In: Buchmann, J., Ding, J. (eds) PQCrypto, LNCS Vol. 5299, pp. 31\u201346. Springer, Berlin (2008)"},{"key":"153_CR29","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2009, LNCS Vol. 5912","author":"M. Finiasz","year":"2009","unstructured":"Finiasz M., Sendrier N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) Advances in Cryptology\u2014ASIACRYPT 2009, LNCS Vol. 5912, pp. 88\u2013105. Springer, Berlin (2009)"},{"issue":"1","key":"153_CR30","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1109\/TIT.2006.887515","volume":"53","author":"M.P.C. Fossorier","year":"2007","unstructured":"Fossorier M.P.C., Kobara K., Imai H.: Modeling Bit Flipping Decoding Based on Nonorthogonal Check Sums With Application to Iterative Decoding Attack of McEliece Cryptosystem. IEEE Transactions on Information Theory 53(1), 402\u2013411 (2007)","journal-title":"IEEE Transactions on Information Theory"},{"key":"153_CR31","doi-asserted-by":"crossref","unstructured":"Al Jabri, A.Kh.: A statistical decoding algorithm for general linear block codes. In: Proceedings of the 8th IMA International Conference on Cryptography and Coding, pp. 1\u20138. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45325-3_1"},{"key":"153_CR32","doi-asserted-by":"crossref","unstructured":"Overbeck, R.: Statistical decoding revisited. In: ACISP\u20192006, LNCS, vol. 4058, pp. 283\u2013294. Springer (2006)","DOI":"10.1007\/11780656_24"},{"key":"153_CR33","unstructured":"Peters, C., Bernstein, D.J., Lange, T., van Tilborg, H.: Explicit Bounds for Generic Decoding Algorithms for Code-based Cryptography. In Proc. of the International Workshop on Coding and Cryptography, WCC\u20192009, pp. 68\u2013180 (2009)"},{"key":"153_CR34","unstructured":"Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for information set decoding over $${\\mathbb{F}_q}$$ . In: Cid, C., Faugere, J.-C. (eds.) SSC\u2019 2010. pp. 143\u2013157 (2010)"},{"key":"153_CR35","unstructured":"Niebuhr, R., Cayrel, P.-L., Bulygin, S., Buchmann, J.: On lower bounds for information set decoding over $${\\mathbb{F}_q}$$ and on the effect of partial knowledge. Submitted to Mathematics in Computer Science, Special Issue \u201cSymbolic Computation and Cryptography II\u201d (2011)"},{"key":"153_CR36","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: ball-collision decoding. Cryptology ePrint Archive, Report 2010\/585. http:\/\/eprint.iacr.org\/ (2010) (to appear at CRYPTO 2011)","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"153_CR37","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Gauthier, V., Otmani, A., Perret, L., Tillich, J.-P.: A Distinguisher for High Rate McEliece Cryptosystems. Cryptology ePrint Archive, Report 2010\/331 (2010) http:\/\/eprint.iacr.org","DOI":"10.1109\/ITW.2011.6089437"},{"key":"153_CR38","doi-asserted-by":"crossref","first-page":"2669","DOI":"10.1109\/TIT.2002.802608","volume":"48","author":"T. Johansson","year":"2002","unstructured":"Johansson T., Jonsson F.: On the complexity of some cryptographic problems based on the general decoding problem. IEEE Trans. Inf. Theory 48, 2669\u20132678 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"153_CR39","unstructured":"Menezes, A., Qu, M., Stinson, D., Wang, Y.: Evaluation of security level of cryptography: Esign signature scheme. CRYPTREC Project, Japan (2001)"},{"key":"153_CR40","unstructured":"Colm, O.E., Scott, M.: Pairing calculation on supersingular genus 2 curves. In SAC\u201906: Proceedings of the 13th International Conference on Selected areas in Cryptography, pp. 302\u2013316. Springer, Berlin (2007)"},{"key":"153_CR41","unstructured":"Araujo, R.: The Need for Strong SSL Ciphers. http:\/\/www.mcafee.com\/us\/resources\/white-papers\/foundstone\/wp-need-strong-ssldigger.pdf . (2004)"},{"key":"153_CR42","unstructured":"Au-Ja.de: Intel core 2 Quad Q6600. http:\/\/www.au-ja.de\/review-core2quad6600-5.phtml (2007)"},{"key":"153_CR43","unstructured":"Moore, G.E.: Cramming more components onto integrated circuits. In Electronics, vol. 38, p. 8 (1965)"},{"key":"153_CR44","unstructured":"House, D.: Myths of Moore\u2019s Law. http:\/\/news.cnet.com\/Myths-of-Moores-Law\/2010-1071_3-1014887.html (2003)"},{"key":"153_CR45","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: On the security of the McEliece public-key cryptosystem. In: Blaum, M., Farrell, P.G., van Tilborg, H. (eds.) Information, Coding and Mathematics, Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday, pp. 141\u2013163. Kluwer, Dordrecht (2002)","DOI":"10.1007\/978-1-4757-3585-7_10"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-011-0153-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-011-0153-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-011-0153-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T15:22:49Z","timestamp":1742224969000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-011-0153-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,5]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["153"],"URL":"https:\/\/doi.org\/10.1007\/s10207-011-0153-2","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,5]]}}}