{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:58:07Z","timestamp":1772283487475,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540003243","type":"print"},{"value":"9783540362883","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36288-6_14","type":"book-chapter","created":{"date-parts":[[2007,6,3]],"date-time":"2007-06-03T20:45:01Z","timestamp":1180903501000},"page":"187-198","source":"Crossref","is-referenced-by-count":32,"title":["A Practical Attack on Some Braid Group Based Cryptographic Primitives"],"prefix":"10.1007","author":[{"given":"Dennis","family":"Hofheinz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Steinwandt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45353-9_2","volume-title":"Topics in Cryptology \u2014 CT-RSA 2001","author":"I. Anshel","year":"2001","unstructured":"Iris Anshel, Michael Anshel, Benji Fisher, and Dorian Goldfeld. New Key Agreement Protocols in Braid Group Cryptography. In David Naccache, editor, \u201cTopics in Cryptology \u2014 CT-RSA 2001\u201d, volume 2020 of Lecture Notes in Computer Science, pages 13\u201327. Springer, 2001. 187, 188, 190, 193, 194, 195, 196"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I. Anshel","year":"1999","unstructured":"Iris Anshel, Michael Anshel, and Dorian Goldfeld. An Algebraic Method for Public-Key Cryptography. Mathematical Research Letters, 6:287\u2013291, 1999. 187, 188, 194","journal-title":"Mathematical Research Letters"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF02950718","volume":"4","author":"E. Artin","year":"1925","unstructured":"Emil Artin. Theorie der Z\u00f6pfe. Hamb. Abh., 4:47\u201372, 1925. 188","journal-title":"Hamb. Abh."},{"key":"14_CR4","volume-title":"Annals of Mathematics Studies","author":"J. S. Birman","year":"1974","unstructured":"Joan S. Birman. Braids, Links, And Mapping Class Groups. Number 82 in Annals of Mathematics Studies. Princeton University Press and University of Tokyo Press, Princeton, New Jersey, 1974. 187"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1006\/aima.1998.1761","volume":"139","author":"J. S. Birman","year":"1998","unstructured":"Joan S. Birman, Ki Hyoung Ko, and Sang Jin Lee. A new approach to the word and conjugacy problems in the braid groups. Advances in Mathematics, 139:322\u2013353, 1998. 190","journal-title":"Advances in Mathematics"},{"key":"14_CR6","unstructured":"Jae Choon Cha. CBraid: a C++ library for computations in braid groups, 2001. At the time of writing available electronically at http:\/\/knot.kaist.ac.kr\/~jccha\/cbraid\/ . 193"},{"key":"14_CR7","series-title":"Lect Notes Comput Sci","first-page":"144","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"J. Choon Cha","year":"2001","unstructured":"Jae Choon Cha, Ki Hyoung Ko, Sang Jin Lee, Jae Woo Han, and Jung Hee Cheon. An Efficient Implementation of Braid Groups. In Colin Boyd, editor, Advances in Cryptology \u2014 ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 144\u2013156. Springer, 2001. 189, 196"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1093\/qmath\/45.4.479","volume":"45","author":"E. A. Elrifai","year":"1994","unstructured":"Elsayed A. Elrifai and H.R. Morton. Algorithms for positive braids. Quarterly Journal of Mathematics Oxford, 45:479\u2013497, 1994. 188, 189","journal-title":"Quarterly Journal of Mathematics Oxford"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1093\/qmath\/20.1.235","volume":"20","author":"F.A. Garside","year":"1969","unstructured":"F.A. Garside. The Braid Group and Other Groups. Quarterly Journal of Mathematics Oxford, 20:235\u2013254, 1969. 187, 188, 189","journal-title":"Quarterly Journal of Mathematics Oxford"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(91)90074-C","volume":"88","author":"M. Garzon","year":"1991","unstructured":"Max Garzon and Yechezkel Zalcstein. The Complexity of Grigorchuk groups with application to cryptography. Theoretical Computer Science, 88:83\u201398, 1991. 187","journal-title":"Theoretical Computer Science"},{"key":"14_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-45450-0_15","volume-title":"A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem","author":"J. Hughes","year":"2002","unstructured":"Jim Hughes. A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem. In Lynn Batten and Jennifer Seberry, editors, Information Security and Privacy. 7th Australasian Conference, ACISP 2002, volume 2384 of Lecture Notes in Computer Science, pages 176\u2013189. Springer, 2002. 187, 195"},{"key":"14_CR12","series-title":"Lect Notes Comput Sci","first-page":"166","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"K. Hyoung Ko","year":"2000","unstructured":"Ki Hyoung Ko, Sang Jin Lee, Jung Hee Cheon, Jae Woo Han, Ju sung Kang, and Choonsik Park. New Public-Key Cryptosystem Using Braid Groups. In Mihir Bellare, editor, Advances in Cryptology \u2014 CRYPTO 2000, volume 1880 of Lecture Notes in Computer Science, pages 166\u2013183. Springer, 2000. 187, 188, 190, 193, 195, 196"},{"key":"14_CR13","series-title":"Lect Notes Comput Sci","first-page":"14","volume-title":"Advances in Cryptology\u2013EUROCRYPT 2002","author":"S. Jin Lee","year":"2002","unstructured":"Sang Jin Lee and Eonkyung Lee. Potential Weaknesses of the Commutator Key Agreement Protocol Based On Braid Groups. In Lars Knudsen, editor, Advances in Cryptology\u2013EUROCRYPT 2002, volume 2332 of Lecture Notes in Computer Science, pages 14\u201328. Springer, 2002. 187, 189, 192, 194"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Neal R. Wagner. Searching for Public-Key Cryptosystems. In Proceedings of the 1984 Symposium on Security and Privacy (SSP\u2019 84), pages 91\u201398, Los Angeles, Ca., USA, 1990. IEEE Computer Society Press. 187","DOI":"10.1109\/SP.1984.10026"},{"key":"14_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-39568-7_3","volume-title":"Advances in Cryptology. Proceedings of CRYPTO 1984","author":"N. R. Wagner","year":"1985","unstructured":"Neal R. Wagner and Marianne R. Magyarik. A Public Key Cryptosystem Based on the Word Problem. In G.R. Blakley and D. Chaum, editor, Advances in Cryptology. Proceedings of CRYPTO 1984, volume 196 of Lecture Notes in Computer Science, pages 19\u201336. Springer, 1985. 187"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2014 PKC 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36288-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T22:03:46Z","timestamp":1737065026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36288-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12,18]]},"ISBN":["9783540003243","9783540362883"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36288-6_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002,12,18]]}}}