{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T08:51:00Z","timestamp":1724316660076},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,9,8]],"date-time":"2007-09-08T00:00:00Z","timestamp":1189209600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2007,10,17]]},"DOI":"10.1007\/s10623-007-9123-0","type":"journal-article","created":{"date-parts":[[2007,9,7]],"date-time":"2007-09-07T05:51:12Z","timestamp":1189144272000},"page":"317-333","source":"Crossref","is-referenced-by-count":14,"title":["Towards generating secure keys for braid cryptography"],"prefix":"10.1007","volume":"45","author":[{"given":"Ki Hyoung","family":"Ko","sequence":"first","affiliation":[]},{"given":"Jang Won","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Tony","family":"Thomas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,8]]},"reference":[{"key":"9123_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. and Goldfeld D. (1999). An algebraic method for public-key cryptography. Math. Res. Lett. 6: 287\u2013291","journal-title":"Math. Res. Lett."},{"key":"9123_CR2","unstructured":"Birman J.S.: Braids, links and mapping class groups, Annals of Math. Study 82, Princeton University Press (1974)."},{"key":"9123_CR3","unstructured":"Birman J.S., Gebhardt V., Gonz\u00e1lez-Mensese J.: Conjugacy in Garside groups I: Cyclings, Powers, and Rigidity, arXiv:math.GT\/0605230"},{"issue":"1","key":"9123_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1006\/aima.2001.2010","volume":"164","author":"J.S. Birman","year":"2001","unstructured":"Birman J.S., Ko K.H. and Lee S.J. (2001). The infimum, supremum, and geodesic length of a braid conjugcy class. Adv. Math. 164(1): 41\u201356","journal-title":"Adv. Math."},{"key":"9123_CR5","doi-asserted-by":"crossref","unstructured":"Cha J.C., Ko K.H., Lee S.J., Han J.W., Cheon J.H.: An efficient implementation of braid groups. Advances in Cryptology: Proceedings of ASIACRYPT 2001, Lecture Notes in Computer Science, Springer-Verlag, vol 2248\u00a0pp. 144\u2013156 Springer-verlag (2001).","DOI":"10.1007\/3-540-45682-1_9"},{"key":"9123_CR6","doi-asserted-by":"crossref","unstructured":"Cheon J.H., Jun B.: A polynomial time algorithm for the braid Diffie-Hellman conjugacy problem. Advances in Cryptology: Proceedings of CRYPTO 2003, Lecture Notes in Computer Science, vol 2729, pp. 212\u2013225. Springer-Verlag-2003.","DOI":"10.1007\/978-3-540-45146-4_13"},{"key":"9123_CR7","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1090\/conm\/360\/06566","volume":"360","author":"P. Dehornoy","year":"2004","unstructured":"Dehornoy P. (2004). Braid-based cryptography. Contemp. Math. 360: 5\u201333","journal-title":"Contemp. Math."},{"issue":"2","key":"9123_CR8","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1093\/qmath\/45.4.479","volume":"45","author":"E.A El-Rifai","year":"1994","unstructured":"El-Rifai E.A and Morton H.R. (1994). Algorithms for positive braids. Quart. J. Math. Oxford Ser. 45(2): 479\u2013497","journal-title":"Quart. J. Math. Oxford Ser."},{"issue":"1","key":"9123_CR9","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/S0021-8693(03)00292-8","volume":"266","author":"N. Franco","year":"2003","unstructured":"Franco N. and Gonaz\u00e1lez-Meneses J. (2003). Conjugacy problem for braid groups and Garside groups. J. Algebra 266(1): 112\u2013132","journal-title":"J. Algebra"},{"key":"9123_CR10","unstructured":"Garber D., Kaplan S., Teicher M., Tsaban B., Vishne U.: Length-based conjugacy search in the Braid groups. http:\/\/arXiv.org\/abs\/math.GR\/0209267"},{"issue":"2","key":"9123_CR11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/qmath\/20.1.235","volume":"20","author":"F.A. Garside","year":"1969","unstructured":"Garside F.A. (1969). The braid group and other groups. Quart. J. Math. Oxford Ser. 20(2): 235\u2013254","journal-title":"J. Math. Oxford Ser."},{"key":"9123_CR12","unstructured":"Gebhardt V.: A new approach to the conjugacy problem in Garside groups, to appear in J. Algebra, (2005)."},{"issue":"3\u20134","key":"9123_CR13","first-page":"219","volume":"17","author":"V. Gebhardt","year":"2006","unstructured":"Gebhardt V. (2006). Conjugacy search in braid groups, from a braid-based cryptography point of view, applicable algebra in engineering. commun computi. 17(3\u20134): 219\u2013238","journal-title":"commun computi."},{"key":"9123_CR14","unstructured":"Hofheinz D., Steinwandt R.: A practical attack on some braid group based cryptographic primitives, 6th International Workshop on Practice and Theory in Public Key Cryptography: Proceedings of PKC 2003, Lecture Notes in Computer Science, vol 2567, pp. 187\u2013198. Springer Verlag (2002)."},{"key":"9123_CR15","unstructured":"Hughes J.: A linear algebraic attack on the AAFG1 braid group cryptosystem, ACISP 2002, Lecture Notes in Computer Science, vol 2384, pp. 176\u2013189. Springer-Verlag (2002)."},{"key":"9123_CR16","unstructured":"Hughes J., Tannenbaum A.: Length-based attacks for certain group based encryption rewriting systems, Workshop SECI02, S\u00e9curit\u00e9 de la Communication sur Internet, Sept. 2002."},{"key":"9123_CR17","unstructured":"Ko K.H., Choi D.H., Cho M.S., Lee J.W.: New signature scheme using conjugacy problem, Available at: http:\/\/eprint.iacr.org\/2002\/168.pdf"},{"key":"9123_CR18","unstructured":"Ko K.H., Lee J.W.: A fast algorithm to the conjugacy problem on generic braids, to appear in the proceedings of Knot theory for Scientific Objects, March, 2006, Osaka, Japan."},{"key":"9123_CR19","unstructured":"Ko K.H., Lee J.W.: A polynomial-time solution to the reducibility problem, arXiv:math.GT\/0610746."},{"key":"9123_CR20","doi-asserted-by":"crossref","unstructured":"Ko K.H., Lee S.J., Cheon J.H., Han J.W., Kang J.S., Park C.S.: New public-key cryptosystem using braid groups. Advances in Cryptology: Proceedings of CRYPTO 2000. Lecture Notes in Computer Science, vol 1880, pp. 166\u2013183. Springer-Verlag (2000).","DOI":"10.1007\/3-540-44598-6_10"},{"issue":"5","key":"9123_CR21","first-page":"986","volume":"87A","author":"E. Lee","year":"2004","unstructured":"Lee E. (2004). Braid groups in cryptology. IEICE Trans. Fundamentals, E 87A(5): 986\u2013992","journal-title":"Fundamentals, E"},{"key":"9123_CR22","unstructured":"Lee S.J.: Algorithmic solutions to decision problems in the braid groups, PhD Thesis, Korea Advanced Institute of Science and Technology (2000)."},{"key":"9123_CR23","unstructured":"Lee S.J., Lee E.K.: Potential weakness of the commutator key agreement protocol based on braid groups, Proceedings of EUROCRYPT 2002, Lecture Notes in Computer Science, vol 2332, pp. 14\u201328. Springer-Verlag (2002)."},{"key":"9123_CR24","unstructured":"Lee E., Park J.H.: Cryptanalysis of the public-key encryption based on braid groups, Advances in Cryptology: Proceedings of EUROCRYPT 2003, Lecture Notes in Computer Science, vol 2565, pp. 477\u2013490. Springer-Verlag (2003)."},{"issue":"3","key":"9123_CR25","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10623-005-5382-9","volume":"39","author":"S. Maffre","year":"2006","unstructured":"Maffre S. (2006). A weak key test for braid based cryptography. Designs Code. Cryptogr. 39(3): 347\u2013373","journal-title":"Des. Codes. Cryptogr."},{"key":"9123_CR26","unstructured":"Myasnikov A., Shpilrain V., Ushakov A.: A practical heuristic attack on the Ko-Lee key exchange protocol. Advances in Cryptology: Proceedings of CRYPTO 2005, Lecture Notes in Computer Science, vol 3621, pp. 86\u201396. Springer-Verlag (2005)."},{"key":"9123_CR27","unstructured":"Sibert H.: Algorithmique des tresses, PhD Thesis, Universite de Caen (2003)."},{"issue":"2","key":"9123_CR28","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.dam.2005.03.015","volume":"154","author":"H. Sibert","year":"2006","unstructured":"Sibert H., Dehornoy P. and Girault M. (2006). Entity authentication schemes using braid word reduction. Discrete Applied Math. 154(2): 420\u2013436","journal-title":"Discrete Applied Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9123-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9123-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9123-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:50:08Z","timestamp":1559231408000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9123-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,8]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,10,17]]}},"alternative-id":["9123"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9123-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,8]]}}}