{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T16:16:46Z","timestamp":1648570606211},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s10623-005-5382-9","type":"journal-article","created":{"date-parts":[[2006,4,17]],"date-time":"2006-04-17T13:52:29Z","timestamp":1145281949000},"page":"347-373","source":"Crossref","is-referenced-by-count":7,"title":["A Weak Key Test for Braid Based Cryptography"],"prefix":"10.1007","volume":"39","author":[{"given":"Samuel","family":"Maffre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5382_CR1","doi-asserted-by":"crossref","first-page":"287","DOI":"10.4310\/MRL.1999.v6.n3.a3","volume":"6","author":"I Anshel","year":"1999","journal-title":"Math Res Lett"},{"key":"5382_CR2","doi-asserted-by":"crossref","unstructured":"Anshel I, Fischer B, Goldfeld D (2001). New key agreement protocols in braid group cryptography , RSA 2001, LNCS 2020, 1\u201315","DOI":"10.1007\/3-540-45353-9_2"},{"key":"5382_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.2307\/1969218","volume":"48","author":"E Artin","year":"1947","journal-title":"Anna Math"},{"key":"5382_CR4","doi-asserted-by":"crossref","unstructured":"Cha JC, Ko KH, Lee SJ, Han JW, Cheon JH (2001). An efficient implementation of braid groups, Asiacrypt 2001, LNCS 2248, pp 144\u2013156","DOI":"10.1007\/3-540-45682-1_9"},{"key":"5382_CR5","unstructured":"Cheon JH, Jun B (2003). A polynomial time algorithm for the braid Diffie\u2013Hellman conjugacy problem. Crypto 2003"},{"issue":"2","key":"5382_CR6","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1006\/aima.1997.1605","volume":"125","author":"P Dehornoy","year":"1997","journal-title":"Adv Math"},{"key":"5382_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1090\/conm\/360\/06566","volume":"360","author":"P Dehornoy","year":"2004","journal-title":"Contemp Math Amer Math Soc"},{"issue":"2","key":"5382_CR8","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1093\/qmath\/45.4.479","volume":"45","author":"EA Elrifai","year":"1994","journal-title":"Quart J Math Oxford"},{"key":"5382_CR9","doi-asserted-by":"crossref","DOI":"10.1201\/9781439865699","volume-title":"Word processing in groups","author":"D Epstein","year":"1992"},{"issue":"1","key":"5382_CR10","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/S0021-8693(03)00292-8","volume":"266","author":"N Franco","year":"2003","journal-title":"J Algebra"},{"key":"5382_CR11","unstructured":"Garber D, Kaplan S, Teicher M, Tsaban B, Vishne U (2002). Length-based conjugacy search in the Braid group. http:\/\/arXiv.org\/abs\/math.GR\/0209267"},{"key":"5382_CR12","doi-asserted-by":"crossref","unstructured":"Garside FA (1969). The braid group and other groups. Quart J Math Oxford. 20\u201378, 235\u2013254","DOI":"10.1093\/qmath\/20.1.235"},{"key":"5382_CR13","unstructured":"Gebhardt V (2003). A new approach to the conjugacy problem in Garside groups to appear in J Algebra: http:\/\/arXiv.org\/abs\/math.GT\/0306199"},{"key":"5382_CR14","doi-asserted-by":"crossref","unstructured":"Hofheinz D, Steinwandt R (2003). A practical attack on some braid group cryptographic primitives, PKC 2003, LNCS 2567, pp 187\u2013198","DOI":"10.1007\/3-540-36288-6_14"},{"key":"5382_CR15","doi-asserted-by":"crossref","unstructured":"Hughes J (2002). A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem, ACISP 2002, LNCS 2384, 02, pp 176\u2013189","DOI":"10.1007\/3-540-45450-0_15"},{"key":"5382_CR16","unstructured":"Hughes J (2000). Allen Tannenbaum, Length-based attacks for certain group based encryption rewriting systems, Inst. for Math. and its Applic. Minneapolis"},{"issue":"2","key":"5382_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0022-4049(90)90023-B","volume":"63","author":"A Jacquemard","year":"1990","journal-title":"J Pure Appl Algebra"},{"key":"5382_CR18","unstructured":"Ko KH, Choi DH, Cho MS, Lee JW (2002). New Signature Scheme Using Conjugacy Problem: http:\/\/eprint.iacr.org\/2002\/168\/"},{"key":"5382_CR19","doi-asserted-by":"crossref","unstructured":"Ko KH, Lee SJ, Cheon JH, Han JW, Kang JS, Park C (2000). New public-key cryptosystem using braid groups, Crypto 2000, LNCS 1880, pp 166\u2013184","DOI":"10.1007\/3-540-44598-6_10"},{"key":"5382_CR20","doi-asserted-by":"crossref","unstructured":"Lee SJ, Lee EK (2002). Potential weakness of the commutator key agreement protocol based on braid groups, Eurocrypt 2002, LNCS 2332, pp 14\u201328","DOI":"10.1007\/3-540-46035-7_2"},{"key":"5382_CR21","doi-asserted-by":"crossref","unstructured":"Lee E, Park JH (2003). Cryptanalysis of the public-key encryption based on braid groups, Eurocrypt 2003, LNCS 2656","DOI":"10.1007\/3-540-39200-9_30"},{"key":"5382_CR22","unstructured":"Maffre S (2005). Reduction of conjugacy problem in braid groups, using two Garside structures, WCC 2005, pp 214\u2013224"},{"key":"5382_CR23","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1006\/jabr.1998.7723","volume":"215","author":"J Michel","year":"1999","journal-title":"J Algebra"},{"key":"5382_CR24","unstructured":"Sibert H (2003). Algorithmique des groupes de tresses, Ph.D. Lab. LMNO"},{"key":"5382_CR25","unstructured":"Sibert H, Dehornoy P, Girault M (2003). Entity authentification schemes using braid word reduction, WCC 2003, pp 153\u2013163"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-005-5382-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-005-5382-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-005-5382-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:05Z","timestamp":1559245805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-005-5382-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["5382"],"URL":"https:\/\/doi.org\/10.1007\/s10623-005-5382-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}