{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T22:33:37Z","timestamp":1775774017284,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319555881","type":"print"},{"value":"9783319555898","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-55589-8_15","type":"book-chapter","created":{"date-parts":[[2017,3,7]],"date-time":"2017-03-07T21:01:24Z","timestamp":1488920484000},"page":"230-237","source":"Crossref","is-referenced-by-count":12,"title":["A NP-Complete Problem in Coding Theory with Application to Code Based Cryptography"],"prefix":"10.1007","author":[{"given":"Thierry P.","family":"Berger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheikh Thi\u00e9coumba","family":"Gueye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean Belo","family":"Klamti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,9]]},"reference":[{"key":"15_CR1","unstructured":"Barg, A.: Some new NP-complete coding problems. Problemy Peredachi Informatsii 30(3), 23\u201328 (1994). English translation in Probl. Inform. Trans. 30, 209\u2013214, July\u2013September 1994"},{"key":"15_CR2","unstructured":"Berger, T.P.: New perspectives for code-based public key cryptography. In: Codes and Lattices in Cryptography, CLC 2006, Darmstadt (2006)"},{"key":"15_CR3","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":"TP 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. 5580, pp. 77\u201397. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02384-2_6"},{"key":"15_CR4","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 Crypt. 35, 63\u201379 (2005)","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"15_CR5","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.J., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theor. 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"15_CR6","unstructured":"Cayrel, P.L., Diagne, M.K., Gueye, C.T.: NP-completeness of the Coset weight problem for Quasi-dyadic codes. In: International Conference on Coding theory and Cryptography ICCC 2015, Alger, Algeria (2015)"},{"key":"15_CR7","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., 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. 6544, pp. 171\u2013186. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-19574-7_12"},{"key":"15_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"E Garey","year":"1979","unstructured":"Garey, E., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York (1979)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0030367","volume-title":"Advances in Cryptology \u2014 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. (eds.) AUSCRYPT 1990. LNCS, vol. 453, pp. 265\u2013272. Springer, Heidelberg (1990). doi: 10.1007\/BFb0030367"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Girault, M.: Lightweight code-based authentication and signature. In: ISIT (2007)","DOI":"10.1109\/ISIT.2007.4557225"},{"key":"15_CR11","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: Cohen, G., Wolfmann, J. (eds.) Coding Theory 1988. LNCS, vol. 388, pp. 91\u2013105. Springer, Heidelberg (1989). doi: 10.1007\/BFb0019849"},{"key":"15_CR12","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. Jet Propulsion Lab. DSN Progress Report, Technical report (1978)"},{"key":"15_CR13","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"},{"issue":"2","key":"15_CR14","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Probl. Control Inf. Theor. 15(2), 159\u2013166 (1986)","journal-title":"Probl. Control Inf. Theor."},{"issue":"5","key":"15_CR15","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank, E., Roth, R.M.: Is code equivalence easy to decide? IEEE Trans. Inf. Theory 43(5), 1602\u20131604 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"15_CR16","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 codes: the support splitting algorithm. IEEE Trans. Inf. Theor. 46(4), 1193\u20131203 (2000)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Sendrier, N., Simos, D.E.: The hardness of code equivalence over $$\\mathbb{F}_q$$ and its application to code-based cryptography. In: Proceeding of Post-Quantum Cryptography, 5th International Workshop PQcrupto 2013, Limoges, France (2013)","DOI":"10.1007\/978-3-642-38616-9_14"},{"issue":"3","key":"15_CR18","first-page":"57","volume":"4","author":"VM Sidel\u2019nikov","year":"1992","unstructured":"Sidel\u2019nikov, V.M., Shestakov, S.O.: On cryptosystems based on generalized Reed-Solomon codes. Discrete Math. 4(3), 57\u201363 (1992)","journal-title":"Discrete Math."},{"key":"15_CR19","unstructured":"Sendrier, N., Simos, D.E.: How easy is code equivalence over $$\\mathbb{F}_q$$ ? In: Proceedings of the 8th International Workshop on Coding and Cryptography, WCC 2013 (2013, to appear). https:\/\/www.rocq.inria.fr\/secret\/PUBLICATIONS\/codeq3.pdf . Preprint (2012)"},{"issue":"6","key":"15_CR20","doi-asserted-by":"crossref","first-page":"1757","DOI":"10.1109\/18.641542","volume":"43","author":"A Vardy","year":"1997","unstructured":"Vardy, A.: The intractability of computing the minimum distance of a code. IEEE Trans. Inf. Theor. 43(6), 1757\u20131766 (1997)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"15_CR21","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 ISIT 2006, Seattle, USA, pp. 1733\u20131737 (2006)","DOI":"10.1109\/ISIT.2006.261651"},{"key":"15_CR22","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":"15_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-46885-4_19","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1989","author":"J Stern","year":"1990","unstructured":"Stern, J.: An alternative to the Fiat-Shamir protocol. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 173\u2013180. Springer, Heidelberg (1990). doi: 10.1007\/3-540-46885-4_19"},{"issue":"1","key":"15_CR24","doi-asserted-by":"crossref","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. 8(1), 57\u201369 (1996)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"15_CR25","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 \u2014 CRYPTO 1993","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. 773, pp. 13\u201321. Springer, Heidelberg (1994). doi: 10.1007\/3-540-48329-2_2"}],"container-title":["Lecture Notes in Computer Science","Codes, Cryptology and Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55589-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T08:26:59Z","timestamp":1568881619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55589-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319555881","9783319555898"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55589-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}