{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:28:13Z","timestamp":1725514093297},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540716761"},{"type":"electronic","value":"9783540716778"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71677-8_5","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T18:05:58Z","timestamp":1182362758000},"page":"61-75","source":"Crossref","is-referenced-by-count":8,"title":["Cryptanalysis of Group-Based Key Agreement Protocols Using Subgroup Distance Functions"],"prefix":"10.1007","author":[{"given":"Dima","family":"Ruinskiy","sequence":"first","affiliation":[]},{"given":"Adi","family":"Shamir","sequence":"additional","affiliation":[]},{"given":"Boaz","family":"Tsaban","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_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. Mathematical Research Letters\u00a06, 287\u2013291 (1999)","journal-title":"Mathematical Research Letters"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.2307\/1969219","volume":"48","author":"E. Artin","year":"1947","unstructured":"Artin, E.: Theory of Braids. Annals of Mathematics\u00a048, 127\u2013136 (1947)","journal-title":"Annals of Mathematics"},{"issue":"2","key":"5_CR3","first-page":"215","volume":"42","author":"J.W. Cannon","year":"1996","unstructured":"Cannon, J.W., Floyd, W.J., Parry, W.R.: Introductory notes on Richard Thompson\u2019s groups. L\u2019Enseignement Mathematique\u00a042(2), 215\u2013256 (1996)","journal-title":"L\u2019Enseignement Mathematique"},{"key":"5_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/conm\/418\/07947","volume":"418","author":"D. Garber","year":"2006","unstructured":"Garber, D., Kaplan, S., Teicher, M., Tsaban, B., Vishne, U.: Length-based conjugacy search in the Braid group. Contemporary Mathematics\u00a0418, 75\u201387 (2006)","journal-title":"Contemporary Mathematics"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.aam.2005.03.002","volume":"35","author":"D. Garber","year":"2005","unstructured":"Garber, D., Kaplan, S., Teicher, M., Tsaban, B., Vishne, U.: Probabilistic solutions of equations in the braid group. Advances in Applied Mathematics\u00a035, 323\u2013334 (2005)","journal-title":"Advances in Applied Mathematics"},{"key":"5_CR6","unstructured":"Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems. In: Workshop SECI02 S\u00e9curit\u00e9 de la Communication sur Internet (2002)"},{"key":"5_CR7","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":"5_CR8","unstructured":"Matucci, F.: The Shpilrain-Ushakov Protocol for Thompson\u2019s Group F is always breakable (2006), \n                    \n                      arxiv.org\/math\/0607184"},{"key":"5_CR9","unstructured":"Ruinskiy, D., Shamir, A., Tsaban, B.: Length-based cryptanalysis: The case of Thompson\u2019s group. \n                    \n                      arxiv.org\/cs\/0607079"},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1090\/conm\/360\/06577","volume":"360","author":"V. Shpilrain","year":"2004","unstructured":"Shpilrain, V.: Assessing security of some group based cryptosystems. Contemporary Mathematics\u00a0360, 167\u2013177 (2004)","journal-title":"Contemporary Mathematics"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00200-006-0006-9","volume":"17","author":"V. Shpilrain","year":"2006","unstructured":"Shpilrain, V., Ushakov, A.: The conjugacy search problem in public key cryptography: unnecessary and insufficient. Applicable Algebra in Engineering, Communication and Computing\u00a017, 291\u2013302 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/11496137_11","volume-title":"Applied Cryptography and Network Security","author":"V. Shpilrain","year":"2005","unstructured":"Shpilrain, V., Ushakov, A.: Thompson\u2019s group and public key cryptography. In: Ioannidis, J., Keromytis, A.D., Yung, M. (eds.) ACNS 2005. LNCS, vol.\u00a03531, pp. 151\u2013164. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71677-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:24:43Z","timestamp":1605763483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71677-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540716761","9783540716778"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71677-8_5","relation":{},"subject":[]}}