{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T13:50:04Z","timestamp":1766065804978},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540884026"},{"type":"electronic","value":"9783540884033"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88403-3_4","type":"book-chapter","created":{"date-parts":[[2008,10,7]],"date-time":"2008-10-07T04:26:31Z","timestamp":1223353591000},"page":"47-62","source":"Crossref","is-referenced-by-count":62,"title":["McEliece Cryptosystem Implementation: Theory and Practice"],"prefix":"10.1007","author":[{"given":"Bhaskar","family":"Biswas","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Sendrier","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","first-page":"649","volume-title":"Handbook of Coding theory, ch. 7","author":"A. Barg","year":"1998","unstructured":"Barg, A.: Complexity issues in coding theory. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding theory, ch. 7, vol.\u00a0I, pp. 649\u2013754. North-Holland, Amsterdam (1998)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"issue":"111","key":"4_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E.R. Berlekamp","year":"1970","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields. Mathematics of Computation\u00a024(111), 713\u2013715 (1970)","journal-title":"Mathematics of Computation"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Transactions on Information Theory\u00a024(3) (May 1978)","DOI":"10.1109\/TIT.1978.1055873"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/BFb0052237","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"T. Berson","year":"1997","unstructured":"Berson, T.: Failure of the McEliece public-key cryptosystem under message-resend and related-message attack. In: Kalisky, B. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 213\u2013220. Springer, Heidelberg (1997)"},{"issue":"1","key":"4_CR6","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":"4_CR7","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)"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TIT.1973.1054929","volume":"19","author":"T. Cover","year":"1973","unstructured":"Cover, T.: Enumerative source encoding. IEEE Transactions on Information Theory\u00a019(1), 73\u201377 (1973)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR9","unstructured":"Finiasz, M.: Nouvelles constructions utilisant des codes correcteurs d\u2019erreurs en cryptographie \u00e0 clef publique. Th\u00e8se de doctorat, \u00c9cole Polytechnique (October 2004)"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/18.567667","volume":"43","author":"J. Ganz","year":"1997","unstructured":"Ganz, J.: Factoring polynomials using binary representations of finite fields. IEEE Transactions on Information Theory\u00a043(1), 147\u2013153 (1997)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-47942-0_2","volume-title":"Information and Communication Security","author":"C. Hall","year":"1999","unstructured":"Hall, C., Goldberg, I., Schneier, B.: Reaction attacks against several public-key cryptosystems. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol.\u00a01726, pp. 2\u201312. Springer, Heidelberg (1999)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-44586-2_2","volume-title":"Public Key Cryptography","author":"K. Kobara","year":"2001","unstructured":"Kobara, K., Imai, H.: Semantically secure McEliece public-key cryptosystems -Conversions for McEliece PKC. In: Kim, K. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 19\u201335. Springer, Heidelberg (2001)"},{"key":"4_CR13","unstructured":"McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. In: DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA, pp. 114\u2013116 (January 1978)"},{"issue":"2","key":"4_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N.J. Patterson","year":"1975","unstructured":"Patterson, N.J.: The algebraic decoding of Goppa codes. IEEE Transactions on Information Theory\u00a021(2), 203\u2013207 (1975)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-46588-1_10","volume-title":"Public Key Cryptography","author":"D. Pointcheval","year":"2000","unstructured":"Pointcheval, D.: Chosen-ciphertext security for any one-way cryptosystem. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 129\u2013146. Springer, Heidelberg (2000)"},{"issue":"4","key":"4_CR16","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 codes: the support splitting algorithm. IEEE Transactions on Information Theory\u00a046(4), 1193\u20131203 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"4_CR17","unstructured":"Sendrier, N.: Cryptosyst\u00e8mes \u00e0 cl\u00e9 publique bas\u00e9s sur les codes correcteurs d\u2019erreurs. M\u00e9moire d\u2019habilitation \u00e0 diriger des recherches, Universit\u00e9 Paris 6 (March 2002)"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Sendrier, N.: Encoding information into constant weight words. In: IEEE Conference, ISIT 2005, pp. 435\u2013438, Adelaide, Australia (September 2005)","DOI":"10.1109\/ISIT.2005.1523371"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/4234.823536","volume":"4","author":"H.M. Sun","year":"2000","unstructured":"Sun, H.M.: Further cryptanalysis of the McEliece public-key cryptosystem. IEEE Trans. on communication letters\u00a04(1), 18\u201319 (2000)","journal-title":"IEEE Trans. on communication letters"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88403-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T17:06:35Z","timestamp":1551632795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88403-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540884026","9783540884033"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88403-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}