{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T09:04:44Z","timestamp":1775466284665,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540281146","type":"print"},{"value":"9783540318705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11535218_6","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T18:20:34Z","timestamp":1292869234000},"page":"86-96","source":"Crossref","is-referenced-by-count":20,"title":["A Practical Attack on a Braid Group Based Cryptographic Protocol"],"prefix":"10.1007","author":[{"given":"Alexei","family":"Myasnikov","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Shpilrain","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Ushakov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I. Anshel","year":"1999","unstructured":"Anshel, I., Anshel, M., Goldfeld, D.: An algebraic method for public-key cryptography. Math. Res. Lett.\u00a06, 287\u2013291 (1999)","journal-title":"Math. Res. Lett."},{"key":"6_CR2","volume-title":"Ann. Math. Studies","author":"J.S. Birman","year":"1974","unstructured":"Birman, J.S.: Braids, links and mapping class groups. In: Ann. Math. Studies, vol.\u00a082. Princeton Univ. Press, Princeton (1974)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-45146-4_13","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J.H. Cheon","year":"2003","unstructured":"Cheon, J.H., Jun, B.: A polynomial time algorithm for the braid diffie-hellman conjugacy problem. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 212\u2013225. Springer, Heidelberg (2003)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1006\/aima.1997.1605","volume":"125","author":"P. Dehornoy","year":"1997","unstructured":"Dehornoy, P.: A fast method for comparing braids. Adv. Math.\u00a0125, 200\u2013235 (1997)","journal-title":"Adv. Math."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1090\/conm\/360\/06566","volume":"360","author":"P. Dehornoy","year":"2004","unstructured":"Dehornoy, P.: Braid-based cryptography. Contemp. Math., Amer. Math. Soc.\u00a0360, 5\u201333 (2004)","journal-title":"Contemp. Math., Amer. Math. Soc."},{"key":"6_CR6","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word processing in groups","author":"D.B.A. Epstein","year":"1992","unstructured":"Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word processing in groups. Jones and Bartlett Publishers, Boston (1992)"},{"key":"6_CR7","unstructured":"Garber, D., Kaplan, S., Teicher, M., Tsaban, B., Vishne, U.: Probabilistic solutions of equations in the braid group, preprint, \n                  \n                    http:\/\/arxiv.org\/abs\/math.GR\/0404076"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-36288-6_14","volume-title":"Public Key Cryptography - PKC 2003","author":"D. Hofheinz","year":"2002","unstructured":"Hofheinz, D., Steinwandt, R.: A practical attack on some braid group based cryptographic primitives. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 187\u2013198. Springer, Heidelberg (2002)"},{"key":"6_CR9","unstructured":"Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems. In: Workshop SECI 2002 Securit\u00e8 de la Communication sur Intenet, Tunis, Tunisia (September 2002), \n                  \n                    http:\/\/www.storagetek.com\/hughes\/"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.aim.2003.02.001","volume":"190","author":"I. Kapovich","year":"2005","unstructured":"Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Average-case complexity for the word and membership problems in group theory. Advances in Math.\u00a0190, 343\u2013359 (2005)","journal-title":"Advances in Math."},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/3-540-44598-6_10","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"K.H. Ko","year":"2000","unstructured":"Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J., Park, C.: New public-key cryptosystem using braid groups. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 166\u2013183. Springer, Heidelberg (2000)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0196-6774(91)90011-M","volume":"12","author":"M.S. Paterson","year":"1991","unstructured":"Paterson, M.S., Razborov, A.A.: The set of minimal braids is co-NP-complete. J. Algorithms\u00a012, 393\u2013408 (1991)","journal-title":"J. Algorithms"},{"key":"6_CR13","unstructured":"Shpilrain, V., Ushakov, A.: The conjugacy search problem in public key cryptography: unnecessary and insufficient. Applicable Algebra in Engineering, Communication and Computing, \n                  \n                    http:\/\/eprint.iacr.org\/2004\/321\/\n                  \n                  \n                 (to appear)"},{"key":"6_CR14","unstructured":"Shpilrain, V., Zapata, G.: Combinatorial group theory and public key cryptography. Applicable Algebra in Engineering, Communication and Computing, \n                  \n                    http:\/\/eprint.iacr.org\/2004\/242\n                  \n                  \n                 (to appear)"},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-1-4612-1872-2_12","volume-title":"Complexity Theory Retrospective, II","author":"J. Wang","year":"1997","unstructured":"Wang, J.: Average-case computational complexity theory. In: Complexity Theory Retrospective, II, pp. 295\u2013334. Springer, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11535218_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:54Z","timestamp":1619506314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11535218_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281146","9783540318705"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11535218_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}