{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T15:22:03Z","timestamp":1761578523865},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730736"},{"type":"electronic","value":"9783540730743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73074-3_18","type":"book-chapter","created":{"date-parts":[[2007,9,20]],"date-time":"2007-09-20T07:26:47Z","timestamp":1190273207000},"page":"237-251","source":"Crossref","is-referenced-by-count":19,"title":["On Kabatianskii-Krouk-Smeets Signatures"],"prefix":"10.1007","author":[{"given":"Pierre-Louis","family":"Cayrel","sequence":"first","affiliation":[]},{"given":"Ayoub","family":"Otmani","sequence":"additional","affiliation":[]},{"given":"Damien","family":"Vergnaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"18_CR1","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"},{"issue":"1","key":"18_CR2","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":"18_CR3","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":"18_CR4","doi-asserted-by":"crossref","unstructured":"Engelbert, D., Overbeck, R., Schmidt, A.: A summary of McEliece-type cryptosystems and their security, Cryptology ePrint Archive, Report 2006\/162 (2006), http:\/\/eprint.iacr.org\/","DOI":"10.1515\/JMC.2007.009"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","first-page":"81","volume-title":"Coding and Cryptography","author":"P. Gaborit","year":"2006","unstructured":"Gaborit, P.: Shorter keys for code based cryptography. In: WCC 2005. LNCS, vol.\u00a03969, pp. 81\u201391. Springer, Heidelberg (2006)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BFb0024461","volume-title":"Cryptography and Coding","author":"G. Kabatianskii","year":"1997","unstructured":"Kabatianskii, G., Krouk, E., Smeets, B.J.M.: A digital signature scheme based on random error-correcting codes. In: Darnell, M. (ed.) Cryptography and Coding. LNCS, vol.\u00a01355, pp. 161\u2013167. Springer, Heidelberg (1997)"},{"key":"18_CR7","unstructured":"Lamport, L.: Constructing digital signatures from a one way function, Tech. Report CSL-98, SRI International (October 1979)"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR9","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":"18_CR10","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"},{"key":"18_CR11","volume-title":"The theory of error-correcting codes","author":"F.J. MacWilliams","year":"1986","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes, 5th edn. North\u2013Holland, Amsterdam (1986)","edition":"5"},{"key":"18_CR12","unstructured":"McEliece, R.J.: A public-key system based on algebraic coding theory, pp.\u00a0114\u2013116, Jet Propulsion Lab, DSN Progress Report 44 (1978)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/BFb0011626","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1989","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 218\u2013238. Springer, Heidelberg (1989)"},{"issue":"2","key":"18_CR14","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":"18_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1145\/501983.501988","volume-title":"Proceedings of the 8th ACM Conference on Computer and Communications Security","author":"A. Perrig","year":"2001","unstructured":"Perrig, A.: The BiBa one-time signature and broadcast authentication protocol. In: Proceedings of the 8th ACM Conference on Computer and Communications Security, pp. 28\u201337. ACM Press, New York (2001)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-45450-0_11","volume-title":"Information Security and Privacy","author":"L. Reyzin","year":"2002","unstructured":"Reyzin, L., Reyzin, N.: Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol.\u00a02384, pp. 144\u2013153. Springer, Heidelberg (2002)"},{"key":"18_CR17","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 and Applications. LNCS, vol.\u00a0388, pp. 106\u2013113. Springer, Heidelberg (1989)"},{"key":"18_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"18_CR19","unstructured":"V\u00e9ron, P.: Probl\u00e8me SD, op\u00e9rateur trace, sch\u00e9mas d\u2019identification et codes de goppa, Ph.D. thesis, Universit\u00e9 Toulon et du Var, Toulon, France (1995)"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73074-3_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:58:53Z","timestamp":1619503133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73074-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730736","9783540730743"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73074-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}