Potential weaknesses of the commutator key agreement protocol based on braid groups

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2332, Issue , 2002, Pages 14-28

  Lee, Sang Jin ^a   Lee, Eonkyung ^b  

^a AIX MARSEILLE UNIVERSITY   (France)

^b Korea Internet and Security Agency   (South Korea)

Author keywords

Braid group; Colored burau matrix; Key agreement protocol; Multiple simultaneous conjugacy problem

Indexed keywords

GROUP THEORY;

BRAID GROUPS; CONJUGACY; FINITE FIELDS; KEY AGREEMENT PROTOCOL; MATHEMATICAL ALGORITHMS; MATRIX GROUPS; PERMUTATION GROUP; SECURITY LEVEL;

CRYPTOGRAPHY;

EID: 56749171805     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46035-7_2     Document Type: Conference Paper

References (20)

1. I. Anshel, M. Anshel, B. Fisher, and D. Goldfeld, New Key Agreement Protocols in Braid Group Cryptography, Topics in Cryptology—CT-RSA 2001 (San Francisco, CA), 13–27, Lecture Notes in Comput. Sci., 2020, Springer, Berlin, 2001.
2. I. Anshel, M. Anshel, and D. Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6(1999), no. 3-4, 287–291.
3. J.S. Birman, Braids, links and the mapping class group, Ann. Math. Studies 82, Princeton Univ. Press, 1974.
4. J.S. Birman, K.H. Ko, and S.J. Lee, A new approaches to the world and conjugacy problem in the braid groups, Adv. Math. 139(1998), no. 2, 322–353.
5. J.S. Birman, K.H. Ko, and S.J. Lee, The infimum, supremum and geodesic length of a braid conjugacy class, Adv. Math. 164(2001), no. 1, 41–56.
6. J.C. Cha, K.H. Ko, S.J. Lee, J.W. Han, and J.H. Cheon, An Efficient Implementation of Braid Groups, Advances in Cryptology—ASIACRYPT2001, (Gold Coast, Queensland, Australia), 144–156, Lecture Notes in Comput. Sci., 2248, Springer, Berlin, 2001.
7. A. Chistov, G. Ivanyos, and M. Karpinski, Polynimial time algorithms for modules over finite dimensional algebras, Proc. Int. Symp. on Symbolic and Algebraic Computation (ISSAC) ’97, ACM. 68–74, 1997.
8. C.G. Cullen, Matrices and Linear Transformations, Addison-Wesley, 1972.
9. E.A. Elrifai and H.R. Morton, Algorithms for positive braids, Quart. J. Math. Oxford Ser. (2) 45(1994), no. 180, 479–497.
10. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, and W. Thurston, Word processing in groups, Jones and Bartlett Publishers, Boston, MA, 1992.
11. N. Franco and J. González-Meneses, Conjugacy problem for braid groups and Garside groups, arXiv:math.GT/0112310, preprint 2001.
12. A. Fathi, F. Laudenbach, and V. Poenaru, Travaux de Thurston sur les surfaces, Asterisque, 66–67, 1979.
13. F.A. Garside, The braid group and other groups, Quart. J. Math. Oxford Ser. (2) 20(1969), 235–254.
14. J. Hughes and A. Tannenbaum, Length-based attacks for certain group based encryption rewriting systems, Institute for Mathematics and Its Applications, April, 2000, Minneapolis, MN, Preprint number 1696, URL http://www.ima.umn.edu/preprints/apr2000/1696.pdf.
15. K.H. Ko, S.J. Lee, J.H. Cheon, J.H. Han, J.S. Kang, and C. Park, New public key cryptosystem using braid groups, Advances in cryptology—CRYPTO 2000 (Santa Barbara, CA), 166–183, Lecture Notes in Comput. Sci., 1880, Springer, Berlin, 2000.
16. E. Lee, S.J. Lee, and S.G. Hahn, Pseudorandomness from Braid Groups, Advances in cryptology—CRYPTO 2001 (Santa Barbara, CA), 486–502, Lecture Notes in Comput. Sci., 2139, Springer, Berlin, 2001.
17. J. Los, Pseudo-Anosov maps and invariant train track in the disc: a finite algorithm, Proc. Lond. Math. Soc. 66, 400-430, 1993.
18. J. McCarthy, Normalizers and centralizers of psuedo-Anosov mapping clases, Available at http://www.mth.msu.edu/˜mccarthy/research/.
19. W. Miller, The maximum order of an element of a finite symmetric group, Amer. Math. Monthly 94(1987), no. 6, 497–506.
20. H.R. Morton, The multivariable Alexander polynomial for a closed braid, Lowdimensional topology (Funchal, 1998), 167–172, Contemp. Math., 233, Amer. Math. Soc., Providence, RI, 1999.