{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:38:54Z","timestamp":1775054334498,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":109,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642406621","type":"print"},{"value":"9783642406638","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40663-8_5","type":"book-chapter","created":{"date-parts":[[2013,8,19]],"date-time":"2013-08-19T21:03:57Z","timestamp":1376946237000},"page":"9-46","source":"Crossref","is-referenced-by-count":6,"title":["Code Based Cryptography and Steganography"],"prefix":"10.1007","author":[{"given":"Pascal","family":"V\u00e9ron","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1109\/18.32140","volume":"35","author":"C. Adams","year":"1989","unstructured":"Adams, C., Meijer, H.: Security-related comments regarding McEliece\u2019s public-key cryptosystem. IEEE Trans. Inform. Theory\u00a035, 454\u2013455 (1989)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-88403-3_1","volume-title":"Post-Quantum Cryptography","author":"C. Aguilar Melchor","year":"2008","unstructured":"Aguilar Melchor, C., Cayrel, P.-L., Gaborit, P.: A new efficient threshold ring signature scheme based on coding theory. In: Buchmann, J., Ding, J. (eds.) PQCrypto 2008. LNCS, vol.\u00a05299, pp. 1\u201316. Springer, Heidelberg (2008)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ashikmin, A.E., Barg, A.: Minimal vectors in linear codes. IEEE Transaction on Information Theory 44(5) (1998)","DOI":"10.1109\/18.705584"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Augot, D., Barbier, M., Couvreur, A.: List-decoding of binary goppa codes up to the binary johnson bound. In: IEEE, ITW 2011, pp. 229\u2013233 (October 2011)","DOI":"10.1109\/ITW.2011.6089384"},{"key":"5_CR5","unstructured":"Augot, D., Finiasz, M., Gaborit, P., Manuel, S., Sendrier, N.: Sha-3 proposal: Fsb. Submission to NIST (2008)"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/11554868_6","volume-title":"Progress in Cryptology \u2013 Mycrypt 2005","author":"D. Augot","year":"2005","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A family of fast syndrome based cryptographic hash functions. In: Dawson, E., Vaudenay, S. (eds.) Mycrypt 2005. LNCS, vol.\u00a03715, pp. 64\u201383. Springer, Heidelberg (2005)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Baldi, M., Chiaraluce, F.: Cryptanalysis of a new instance of McEliece cryptosystem based on qc-ldpc codes. In: IEEE International Symposium on Information Theory, ISIT 2007, pp. 2591\u20132595 (June 2007)","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"5_CR8","first-page":"23","volume":"30","author":"S. Barg","year":"1994","unstructured":"Barg, S.: Some new NP-complete coding problems. Probl. Peredachi Inf.\u00a030, 23\u201328 (1994)","journal-title":"Probl. Peredachi Inf."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-21518-6_23","volume-title":"Information Security and Cryptology","author":"P.S.L.M. Barreto","year":"2011","unstructured":"Barreto, P.S.L.M., Cayrel, P.-L., Misoczki, R., Niebuhr, R.: Quasi-dyadic CFS signatures. In: Lai, X., Yung, M., Lin, D. (eds.) Inscrypt 2010. LNCS, vol.\u00a06584, pp. 336\u2013349. Springer, Heidelberg (2011)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-642-29011-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Becker","year":"2012","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in 2\n                    n\/20: How 1 + 1 = 0 improves information set decoding. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 520\u2013536. Springer, Heidelberg (2012)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-24676-3_17","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Namprempre, C., Neven, G.: Security proofs for identity-based identification and signature schemes. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 268\u2013286. Springer, Heidelberg (2004)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-02384-2_6","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"T.P. Berger","year":"2009","unstructured":"Berger, T.P., Cayrel, P.-L., Gaborit, P., Otmani, A.: Reducing key length of the McEliece cryptosystem. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol.\u00a05580, pp. 77\u201397. Springer, Heidelberg (2009)"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E.R. Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.A.: On the intractability of certain coding problems. IEEE Transactions on Information Theory\u00a024(3), 384\u2013386 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-21969-6_9","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C., Schwabe, P.: Really fast syndrome-based hashing. In: Nitaj, A., Pointcheval, D. (eds.) AFRICACRYPT 2011. LNCS, vol.\u00a06737, pp. 134\u2013152. Springer, Heidelberg (2011)"},{"key":"5_CR15","unstructured":"Bernstein, D.J.: Grover vs. McEliece (2008), \n                    \n                      http:\/\/cr.yp.to\/papers.html"},{"key":"5_CR16","unstructured":"Bernstein, D.J.: List decoding for binary goppa codes (2008), \n                    \n                      http:\/\/cr.yp.to\/codes\/goppalist-20081107.pdf"},{"key":"5_CR17","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":"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 2008. LNCS, vol.\u00a05299, pp. 31\u201346. Springer, Heidelberg (2008)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: Ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 743\u2013760. Springer, Heidelberg (2011)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1007\/978-3-642-22792-9_42","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Smaller decoding exponents: Ball-collision decoding. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 743\u2013760. Springer, Heidelberg (2011)"},{"key":"5_CR20","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":"D.J. 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.\u00a06544, pp. 143\u2013158. Springer, Heidelberg (2011)"},{"key":"5_CR21","unstructured":"Beuchat, J.L., Sendrier, N., Tisserand, A., Villard, G.: Fpga implementation of a recently published signature scheme. Tech. Rep. 5158, Inria (March 2004)"},{"key":"5_CR22","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.\u00a05299, pp. 47\u201362. Springer, Heidelberg (2008)"},{"key":"5_CR23","unstructured":"Brickell, E., Odlyzko, A.: Cryptanalysis: A survey of recent results. In: Comtemporary Cryptology - the Science of Information Integrity, pp. 501\u2013540 (1992)"},{"key":"5_CR24","unstructured":"Canteaut, A.: Attaques de cryptosyst\u00e8mes \u00e0 mots de poids faible et construction de fonctions t-r\u00e9silientes. PhD thesis, Universit\u00e9 Paris VI (1996)"},{"issue":"1","key":"5_CR25","doi-asserted-by":"publisher","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 narrow-sense bch codes of length 511. IEEE Transactions on Information Theory\u00a044(1), 367\u2013378 (1998)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-49649-1_16","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"A. Canteaut","year":"1998","unstructured":"Canteaut, A., Sendrier, N.: Cryptanalysis of the original McEliece cryptosystem. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 187\u2013199. Springer, Heidelberg (1998)"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Cayrel, P.-L., Dusart, P.: McEliece\/niederreiter pkc: sensitivity to fault injection. In: International Workshop on Future Engineering, Applications and Services, FEAS (2010)","DOI":"10.1109\/FUTURETECH.2010.5482663"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-31662-3_4","volume-title":"Arithmetic of Finite Fields","author":"P.-L. Cayrel","year":"2012","unstructured":"Cayrel, P.-L., El Yousfi Alaoui, S.M., Hoffmann, G., V\u00e9ron, P.: An improved threshold ring signature scheme based on error correcting codes. In: \u00d6zbudak, F., Rodr\u00edguez-Henr\u00edquez, F. (eds.) WAIFI 2012. LNCS, vol.\u00a07369, pp. 45\u201363. Springer, Heidelberg (2012)"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Cayrel, P.-L., Gaborit, P., Girault, M.: Identity-based identification and signature schemes using correcting codes. In: Augot, D., Sendrier, N., Tillich, J.P. (eds.) WCC 2007. INRIA (2007)","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"5_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-19574-7_12","volume-title":"Selected Areas in Cryptography","author":"P.-L. Cayrel","year":"2011","unstructured":"Cayrel, P.-L., V\u00e9ron, P., El Yousfi Alaoui, S.M.: A zero-knowledge identification scheme based on the q-ary syndrome decoding problem. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 171\u2013186. Springer, Heidelberg (2011)"},{"key":"5_CR31","unstructured":"Chabanne, H., Courteau, B.: Application de la m\u00e9thode de d\u00e9codage it\u00e9rative d\u2019omura \u00e0 la cryptanalyse du syst\u00e8me de mc eliece. Rapport de Recherche 122, Universit\u00e9 de Sherbrooke (October 1993)"},{"key":"5_CR32","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 - ASIACRYPT 2001","author":"N.T. 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.\u00a02248, pp. 157\u2013174. Springer, Heidelberg (2001)"},{"key":"5_CR33","unstructured":"Crandall, R.: Some notes on steganography (1998), Posted on the steganography mailing list"},{"key":"5_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-88353-1_6","volume-title":"Research in Cryptology","author":"L. Dallot","year":"2008","unstructured":"Dallot, L.: Towards a concrete security proof of courtois, finiasz and sendrier signature scheme. In: Lucks, S., Sadeghi, A.-R., Wolf, C. (eds.) WEWoRC 2007. LNCS, vol.\u00a04945, pp. 65\u201377. Springer, Heidelberg (2008)"},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-10868-6_13","volume-title":"Cryptography and Coding","author":"L. Dallot","year":"2009","unstructured":"Dallot, L., Vergnaud, D.: Provably secure code-based threshold ring signatures. In: Parker, M.G. (ed.) Cryptography and Coding 2009. LNCS, vol.\u00a05921, pp. 222\u2013235. Springer, Heidelberg (2009)"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/0-387-34805-0_39","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"I.B. Damg\u00e5rd","year":"1990","unstructured":"Damg\u00e5rd, I.B.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 416\u2013427. Springer, Heidelberg (1990)"},{"issue":"6","key":"5_CR37","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-00862-7_16","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"R. Dowsley","year":"2009","unstructured":"Dowsley, R., M\u00fcller-Quade, J., Nascimento, A.C.A.: A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol.\u00a05473, pp. 240\u2013251. Springer, Heidelberg (2009)"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-04138-9_4","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"T. Eisenbarth","year":"2009","unstructured":"Eisenbarth, T., G\u00fcneysu, T., Heyse, S., Paar, C.: Microeliece: Mceliece for embedded devices. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 49\u201364. Springer, Heidelberg (2009)"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-31410-0_2","volume-title":"Progress in Cryptology - AFRICACRYPT 2012","author":"S.M. Yousfi Alaoui El","year":"2012","unstructured":"El Yousfi Alaoui, S.M., Dagdelen, \u00d6., V\u00e9ron, P., Galindo, D., Cayrel, P.-L.: Extended Security Arguments for Signature Schemes. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT 2012. LNCS, vol.\u00a07374, pp. 19\u201334. Springer, Heidelberg (2012)"},{"key":"5_CR41","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.C., Otmani, A., Perret, L., Tillich, J.P.: A distinguisher for high rate McEliece cryptosystems. IACR Eprint archive, 2010\/331 (2010)","DOI":"10.1109\/ITW.2011.6089437"},{"key":"5_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"5_CR43","unstructured":"Finiasz, M.: Nouvelles constructions utilisant des codes correcteurs d\u2019erreurs en cryptographie \u00e0 cl\u00e9 publique. PhD thesis, Ecole Polytechnique (2004)"},{"key":"5_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-19574-7_11","volume-title":"Selected Areas in Cryptography","author":"M. Finiasz","year":"2011","unstructured":"Finiasz, M.: Parallel-CFS: Strengthening the CFS McEliece-based signature scheme. In: Biryukov, A., Gong, G., Stinson, D.R. (eds.) SAC 2010. LNCS, vol.\u00a06544, pp. 159\u2013170. Springer, Heidelberg (2011)"},{"key":"5_CR45","unstructured":"Finiasz, M., Gaborit, P., Sendrier, N.: Improved fast syndrome based cryptographic hash function. In: ECRYPT Hash Workshop 2007 (2007)"},{"key":"5_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-10366-7_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"M. Finiasz","year":"2009","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 88\u2013105. Springer, Heidelberg (2009)"},{"key":"5_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/3-540-68339-9_22","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"J.-B. Fischer","year":"1996","unstructured":"Fischer, J.-B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 245\u2013255. Springer, Heidelberg (1996)"},{"key":"5_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-79263-5_2","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"P.-A. Fouque","year":"2008","unstructured":"Fouque, P.-A., Leurent, G.: Cryptanalysis of a hash function based on quasi-cyclic codes. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 19\u201335. Springer, Heidelberg (2008)"},{"issue":"1","key":"5_CR49","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TIFS.2008.2011082","volume":"4","author":"J. Fridrich","year":"2009","unstructured":"Fridrich, J.: Asymptotic behavior of the ZZW embedding construction. IEEE Transactions on Information Forensics and Security\u00a04(1), 151\u2013153 (2009)","journal-title":"IEEE Transactions on Information Forensics and Security"},{"issue":"10","key":"5_CR50","doi-asserted-by":"publisher","first-page":"3923","DOI":"10.1109\/TSP.2005.855393","volume":"53","author":"J. Fridrich","year":"2005","unstructured":"Fridrich, J., Goljan, M., Lisonek, P., Soukal, D.: Writing on wet paper. IEEE Trans. on Signal Processing\u00a053(10), 3923\u20133935 (2005)","journal-title":"IEEE Trans. on Signal Processing"},{"key":"5_CR51","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139192903","volume-title":"Steganography in Digital Media: Principles, Algorithms, and Applications","author":"J. Fridrich","year":"2009","unstructured":"Fridrich, J.: Steganography in Digital Media: Principles, Algorithms, and Applications, 1st edn. Cambridge University Press, New York (2009)","edition":"1"},{"key":"5_CR52","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: Proceeedings of WCC 2005, pp. 81\u201390 (2005)"},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Girault, M.: Lightweight code-based identification and signature. In: Proceeedings of ISIT 2007 (2007)","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"5_CR54","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Laudauroux, C., Sendrier, N.: Synd: a fast code-based stream cipher with a security reduction. In: Proceeedings of ISIT 2007 (2007)","DOI":"10.1109\/ISIT.2007.4557224"},{"key":"5_CR55","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Z\u00e9mor, G.: Asymptotic improvement of the gilbert-varshamov bound for linear codes. In: Proceeedings of ISIT 2006, pp. 287\u2013291 (2006)","DOI":"10.1109\/ISIT.2006.261851"},{"key":"5_CR56","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"5_CR57","unstructured":"Gauthier Umana, V., Leander, G.: Practical key recovery attacks on two McEliece variants. IACR Eprint archive, 2009\/509 (2009)"},{"key":"5_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/3-540-46416-6_46","volume-title":"Advances in Cryptology - EUROCRYPT \u201991","author":"J.K. Gibson","year":"1991","unstructured":"Gibson, J.K.: Equivalent goppa codes and trapdoors to McEliece\u2019s public key cryptosystem. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol.\u00a0547, pp. 517\u2013521. Springer, Heidelberg (1991)"},{"key":"5_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0030367","volume-title":"Advances in Cryptology - AUSCRYPT \u201990","author":"M. Girault","year":"1990","unstructured":"Girault, M.: A (non-practical) three-pass identification protocol using coding theory. In: Seberry, J., Pieprzyk, J.P. (eds.) AUSCRYPT 1990. LNCS, vol.\u00a0453, pp. 265\u2013272. Springer, Heidelberg (1990)"},{"key":"5_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/3-540-48658-5_21","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"M. Girault","year":"1994","unstructured":"Girault, M., Stern, J.: On the length of cryptographic hash-values used in identification schemes. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 202\u2013215. Springer, Heidelberg (1994)"},{"key":"5_CR61","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM, Journal of Computing\u00a018, 186\u2013208 (1989)","journal-title":"SIAM, Journal of Computing"},{"key":"5_CR62","unstructured":"Goppa, V.D.: A new class of linear error correcting codes. Probl. Pered. Inform., 24\u201330 (1970)"},{"key":"5_CR63","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/237814.237866","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996","author":"L.K. Grover","year":"1996","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 212\u2013219. ACM, New York (1996)"},{"issue":"2","key":"5_CR64","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L.K. Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett.\u00a079(2), 325\u2013328 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"5_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0019849","volume-title":"Coding Theory and Applications","author":"S. Harari","year":"1989","unstructured":"Harari, S.: A new authentication algorithm. In: Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol.\u00a0388, pp. 91\u2013105. Springer, Heidelberg (1989)"},{"key":"5_CR66","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-12929-2_9","volume-title":"Post-Quantum Cryptography","author":"S. Heyse","year":"2010","unstructured":"Heyse, S., Moradi, A., Paar, C.: Practical power analysis attacks on software implementations of McEliece. In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 108\u2013125. Springer, Heidelberg (2010)"},{"key":"5_CR67","doi-asserted-by":"crossref","unstructured":"Housley, R.: Using advanced encryption standard (aes) counter mode with ipsec encapsulating security payload (esp). RFC 3686, Network Working Group (January 2004)","DOI":"10.17487\/rfc3686"},{"key":"5_CR68","unstructured":"Massey, J.L.: Minimal codewords and secret sharing. In: 6th Joint Swedish-Russian Workshop on Information Theory, pp. 276\u2013279 (1993)"},{"issue":"10","key":"5_CR69","doi-asserted-by":"publisher","first-page":"2669","DOI":"10.1109\/TIT.2002.802608","volume":"48","author":"T. Johansson","year":"2002","unstructured":"Johansson, T., J\u00f6nsson, F.: On the complexity of some cryptographic problems based on the general decoding problem. IEEE Transactions on Information Theory\u00a048(10), 2669\u20132678 (2002)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR70","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45961-8_25","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"P.J. Lee","year":"1988","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 275\u2013280. Springer, Heidelberg (1988)"},{"issue":"5","key":"5_CR71","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J.S. Leon","year":"1988","unstructured":"Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Transactions on Information Theory\u00a034(5), 1354\u20131359 (1988)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"5_CR72","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/18.272496","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 Transactions on Information Theory\u00a040(1), 271\u2013273 (1994)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"5_CR73","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a047(3), 1207\u20131211 (2001)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR74","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Code. North-Holland (1977)"},{"key":"5_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-642-25385-0_6","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"A. May","year":"2011","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in \n                    \n                      \n                    \n                    $\\tilde{\\mathcal{O}}(2^{0.054n})$\n                  . In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 107\u2013124. Springer, Heidelberg (2011)"},{"key":"5_CR76","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. JPL DSN Progress Report, pp. 114\u2013116 (1978)"},{"issue":"9","key":"5_CR77","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R.J. McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Communications of the ACM\u00a024(9), 583\u2013584 (1981)","journal-title":"Communications of the ACM"},{"key":"5_CR78","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R. Merkle","year":"1978","unstructured":"Merkle, R., Hellman, M.: Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inform. Theory\u00a024, 525\u2013530 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5_CR79","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 Jr., M.J., Rijmen, V., Safavi-Naini, R. (eds.) SAC 2009. LNCS, vol.\u00a05867, pp. 376\u2013392. Springer, Heidelberg (2009)"},{"key":"5_CR80","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s13389-011-0001-3","volume":"1","author":"H. Molter","year":"2011","unstructured":"Molter, H., St\u00f6ttinger, M., Shoufan, A., Strenzke, F.: A simple power analysis attack on a McEliece cryptoprocessor. Journal of Cryptographic Engineering\u00a01, 29\u201336 (2011)","journal-title":"Journal of Cryptographic Engineering"},{"issue":"3","key":"5_CR81","doi-asserted-by":"publisher","first-page":"237","DOI":"10.3934\/amc.2012.6.273","volume":"6","author":"C. Munuera","year":"2012","unstructured":"Munuera, C., Barbier, M.: Wet paper codes and the dual distance in steganography. Advances in Mathematics of Communications\u00a06(3), 237\u2013285 (2012)","journal-title":"Advances in Mathematics of Communications"},{"key":"5_CR82","doi-asserted-by":"crossref","unstructured":"Munuera, C.: Steganography from a coding theory point of view. Series on Coding Theory and Cryptology, vol.\u00a08. World Scientific Publishing Co. Pte. Ltd. (2013)","DOI":"10.1142\/9789814335768_0003"},{"issue":"2","key":"5_CR83","first-page":"159","volume":"15","author":"H. Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems Control Inform. Theory\u00a015(2), 159\u2013166 (1986)","journal-title":"Problems Control Inform. Theory"},{"key":"5_CR84","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10623-008-9175-9","volume":"49","author":"R. Nojima","year":"2008","unstructured":"Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic security for the McEliece cryptosystem without random oracles. Designs, Codes and Cryptography\u00a049, 289\u2013305 (2008), doi:10.1007\/s10623-008-9175-9","journal-title":"Designs, Codes and Cryptography"},{"key":"5_CR85","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s11786-009-0015-8","volume":"3","author":"A. Otmani","year":"2010","unstructured":"Otmani, A., Tillich, J.P., Dallot, L.: Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. Mathematics in Computer Science\u00a03, 129\u2013140 (2010)","journal-title":"Mathematics in Computer Science"},{"key":"5_CR86","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-12929-2_7","volume-title":"Post-Quantum Cryptography","author":"C. Peters","year":"2010","unstructured":"Peters, C.: Information-set decoding for linear codes over F\n                  \n                    q\n                  . In: Sendrier, N. (ed.) PQCrypto 2010. LNCS, vol.\u00a06061, pp. 81\u201394. Springer, Heidelberg (2010)"},{"key":"5_CR87","first-page":"85","volume":"IT-8","author":"E. Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Trans.\u00a0IT-8, 85\u201389 (1962)","journal-title":"IRE Trans."},{"key":"5_CR88","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1007\/0-387-34805-0_60","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"J.-J. Quisquater","year":"1990","unstructured":"Quisquater, J.-J., Guillou, L.C., Berson, T.: How to explain zero-knowledge protocols to your children. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 628\u2013631. Springer, Heidelberg (1990)"},{"issue":"1","key":"5_CR89","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/357980.358017","volume":"26","author":"R.L. Rivest","year":"1983","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM\u00a026(1), 96\u201399 (1983)","journal-title":"Commun. ACM"},{"key":"5_CR90","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-77026-8_1","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"M.-J.O. Saarinen","year":"2007","unstructured":"Saarinen, M.-J.O.: Linearization attacks against syndrome based hashes. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 1\u20139. Springer, Heidelberg (2007)"},{"key":"5_CR91","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-60693-9_20","volume-title":"Cryptography and Coding","author":"N. Sendrier","year":"1995","unstructured":"Sendrier, N.: Efficient generation of binary words of given weight. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol.\u00a01025, pp. 184\u2013187. Springer, Heidelberg (1995)"},{"key":"5_CR92","unstructured":"Sendrier, N.: On the structure of a randomly permuted concateneted code. In: EUROCODE 1994, 169\u2013173. Inria (1994)"},{"issue":"4","key":"5_CR93","doi-asserted-by":"publisher","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 Transactions on Information Theory\u00a046(4), 1193\u20131203 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"5_CR94","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"5_CR95","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A. Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 47\u201353. Springer, Heidelberg (1985)"},{"key":"5_CR96","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp. 20\u201322 (1994)"},{"key":"5_CR97","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.\u00a05984, pp. 161\u2013175. Springer, Heidelberg (2010)"},{"key":"5_CR98","first-page":"57","volume":"4","author":"V. Sidelnikov","year":"1992","unstructured":"Sidelnikov, V., Shestakov, S.: On cryptosystems based on generalized reed-solomon codes. Diskretnaya Math.\u00a04, 57\u201363 (1992)","journal-title":"Diskretnaya Math."},{"key":"5_CR99","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/BFb0019850","volume-title":"Coding Theory and Applications","author":"J. Stern","year":"1989","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1989)"},{"key":"5_CR100","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-48329-2_2","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"J. Stern","year":"1994","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 13\u201321. Springer, Heidelberg (1994)"},{"key":"5_CR101","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.\u00a06033, pp. 47\u201359. Springer, Heidelberg (2010)"},{"key":"5_CR102","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.\u00a05299, pp. 216\u2013229. Springer, Heidelberg (2008)"},{"key":"5_CR103","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1109\/TIT.1976.1055610","volume":"22","author":"Y. Sugiyama","year":"1976","unstructured":"Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T.: Further results on goppa codes and their applications to constructing efficient binary codes. IEEE Transactions on Information Theory\u00a022, 518\u2013526 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"5_CR104","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/0-387-34799-2_10","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J. Tilburg van","year":"1990","unstructured":"van Tilburg, J.: On the McEliece public-key cryptosystem. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 119\u2013131. Springer, Heidelberg (1990)"},{"key":"5_CR105","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/3-540-60693-9_28","volume-title":"Cryptography and Coding","author":"P. V\u00e9ron","year":"1995","unstructured":"V\u00e9ron, P.: Cryptanalysis of harari\u2019s identification scheme. In: Boyd, C. (ed.) Cryptography and Coding 1995. LNCS, vol.\u00a01025, pp. 264\u2013269. Springer, Heidelberg (1995)"},{"issue":"1","key":"5_CR106","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s002000050053","volume":"8","author":"P. V\u00e9ron","year":"1996","unstructured":"V\u00e9ron, P.: Improved identification schemes based on error-correcting codes. Appl. Algebra Eng. Commun. Comput.\u00a08(1), 57\u201369 (1996)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"5_CR107","doi-asserted-by":"crossref","unstructured":"V\u00e9ron, P.: Public key cryptography and coding theory. In: Woungang, I., Misra, S., Misra, S. (eds.) Selected Topics in Information and Coding Theory, vol.\u00a07. World Scientific Publications (March 2010)","DOI":"10.1142\/9789812837172_0015"},{"key":"5_CR108","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-45708-9_19","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"D. Wagner","year":"2002","unstructured":"Wagner, D.: A generalized birthday problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 288\u2013304. Springer, Heidelberg (2002)"},{"key":"5_CR109","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-45496-9_21","volume-title":"Information Hiding","author":"A. Westfeld","year":"2001","unstructured":"Westfeld, A.: F5-A steganographic algorithm. In: Moskowitz, I.S. (ed.) IH 2001. LNCS, vol.\u00a02137, pp. 289\u2013302. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40663-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:54:54Z","timestamp":1558302894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40663-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642406621","9783642406638"],"references-count":109,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40663-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}