{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:13Z","timestamp":1764996793968},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540338512"},{"type":"electronic","value":"9783540338529"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11745853_20","type":"book-chapter","created":{"date-parts":[[2006,4,13]],"date-time":"2006-04-13T09:18:58Z","timestamp":1144919938000},"page":"302-314","source":"Crossref","is-referenced-by-count":8,"title":["Random Subgroups of Braid Groups: An Approach to Cryptanalysis of 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":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45353-9_2","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"I. Anshel","year":"2001","unstructured":"Anshel, I., Anshel, M., Fisher, B., Goldfeld, D.: New Key Agreement Protocols in Braid Group Cryptography. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 13\u201327. Springer, Heidelberg (2001)"},{"key":"20_CR2","doi-asserted-by":"publisher","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":"20_CR3","doi-asserted-by":"crossref","unstructured":"Birman, J.S.: Braids, links and mapping class groups. Ann. Math. Studies\u00a082 (1974)","DOI":"10.1515\/9781400881420"},{"key":"20_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":"20_CR5","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":"20_CR6","unstructured":"Garber, D., Kaplan, S., Teicher, M., Tsaban, B., Vishne, U.: Probabilistic solutions of equations in the braid group, preprint., http:\/\/arxiv.org\/abs\/math.GR\/0404076"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1090\/conm\/372\/06872","volume":"372","author":"J. Gonzalez-Meneses","year":"2005","unstructured":"Gonzalez-Meneses, J.: Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups. Contemp. Math., Amer. Math. Soc.\u00a0372, 35\u201342 (2005)","journal-title":"Contemp. Math., Amer. Math. Soc."},{"issue":"5","key":"20_CR8","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1016\/j.ansens.2004.04.002","volume":"37","author":"J. Gonzalez-Meneses","year":"2004","unstructured":"Gonzalez-Meneses, J., Wiest, B.: On the structure of the centraliser of a braid. Ann. Sci. \u00c9cole Norm. Sup.\u00a037(5), 729\u2013757 (2004)","journal-title":"Ann. Sci. \u00c9cole Norm. Sup."},{"key":"20_CR9","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":"20_CR10","unstructured":"Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems. In: Workshop SECI 2002 Securit\u00e9 de la Communication sur Intenet, Tunis, Tunisia (September 2002), http:\/\/www.network.com\/~hughes\/"},{"key":"20_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":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-46035-7_2","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"S.J. Lee","year":"2002","unstructured":"Lee, S.J., Lee, E.: Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 14\u201328. Springer, Heidelberg (2002)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/11535218_6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"A. Myasnikov","year":"2005","unstructured":"Myasnikov, A., Shpilrain, V., Ushakov, A.: A practical attack on some braid group based cryptographic protocols. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 86\u201396. Springer, Heidelberg (2005)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/0196-6774(91)90011-M","volume":"12","author":"M. Paterson","year":"1991","unstructured":"Paterson, M., Razborov, A.: The set of minimal braids is co-NP-complete. J. Algorithms\u00a012, 393\u2013408 (1991)","journal-title":"J. Algorithms"},{"key":"20_CR15","unstructured":"Shpilrain, V., Ushakov, A.: The conjugacy search problem in public key cryptography: unnecessary and insufficient. Applicable Algebra in Engineering, Communication and Computing (to appear), http:\/\/eprint.iacr.org\/2004\/321\/"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography - PKC 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11745853_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T01:01:50Z","timestamp":1555549310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11745853_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540338512","9783540338529"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11745853_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}