Conjugacy search in braid groups: From a braid-based cryptography point of view

Applicable Algebra in Engineering, Communications and Computing

Volumn 17, Issue 3-4, 2006, Pages 219-238

  Gebhardt, Volker ^a  

^a UNIVERSITY OF WESTERN SYDNEY   (Australia)

Author keywords

Braid groups; Braid Diffie Hellman; Conjugacy problem; Conjugacy search; Cryptanalysis; Cryptography; Encryption; Key exchange; Ultra summit set

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DECISION THEORY; NETWORK PROTOCOLS; THEOREM PROVING;

BRAID GROUPS; BRAID-DIFFIE-HELLMAN; CONJUGACY PROBLEM; CONJUGACY SEARCH; CRYPTANALYSIS; KEY EXCHANGE; ULTRA SUMMIT SET;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33746365125     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-006-0008-7     Document Type: Review

References (24)

1. Anshel, I., Anshel. M., Fisher, B., Goldfeld, D.: New key agreement protocols in braid group cryptography. In: Topics in cryptology - CT-RSA 2001 (San Francisco, CA). Lecture notes in computer science, vol 2020, pp 13-27. Berlin Heidelberg New York: Springer (2001)
2. Anshel, I., Anshel, M., Goldfeld, D.: An algebraic method for public-key cryptography. Math Res Lett 6(3-4), 287-291 (1999)
3. Artin, E.: Theory of braids. Ann Math 48(2). 101-126 (1947)
4. Birman, J.S., Ko, K.H., Lee, S.J.: The infimum, supremum, and geodesic length of a braid conjugacy class. Adv Math 164(1), 41-56 (2001)
5. Bosma, W., Cannon, J., Playoust, C.: The MAGMA algebra system T: the user language. J Symbolic Comput 24, 235-265 (1997). http://www.magma.maths.usyd. edu.au/magma/
6. Cha, J.C., Ko, K.H., Lee, S.J., Han, J.W., Cheon, J.H.: An efficient implementation of braid groups. In: Advances in cryptology - ASIACRYPT 2001 (Gold Coast). Lecture notes in computer science, vol 2248, pp 144-156. Berlin Heidelberg New York: Springer (2001)
7. Cheon, J.H., Jun, B.: A polynomial time algorithm for the Braid Diffie-Hellman conjugacy problem. In: CRYPTO: Proceedings of Crypto (2003) (in press)
8. Dehornoy, P.: Braid-based cryptography. In: Myasnikov, A., Shpilrain, V., (eds.) Group theory, statistics and cryptography. Contemporary mathematics, vol 360, pp 5-33. American Mathematical Society (2004)
9. El-Rifai, E.A., Morton, H.R.: Algorithms for positive braids. Q J Math Oxford Ser. (2) 45(180), 479-497 (1994)
10. Epstein, D.B.A., Cannon, J.W., Holt, D.F., Levy, S.V.F., Paterson, M.S., Thurston, W.P.: Word processing in groups, chap. 9. Boston, MA: Jones and Bartlett Publishers (1992)
11. Franco, N., González-Meneses, J.: Computation of centralizers in braid groups and Garside groups. Rev Mat Iberoamericana 19(2). 367-384 (2003)
12. Franco, N., González-Meneses, J.: Conjugacy problem for braid groups and Garside groups. J Algebra 266(1), 112-132 (2003)
13. Garber, D., Kaplan, S., Teicher, M., Tsaban, B., Vishne, U.: Length-based conjugacy search in the braid group. Preprint. Available at http://www.arxiv.org/math.GR/0209267 (2002)
14. Garside, F.A.: The braid group and other groups. Q J Math Oxford Ser (2)20, 235-254 (1969)
15. Gebhardt, V.: A new approach to the conjugacy problem in Garside groups. J Algebra 292 (1), 282-302 (2005)
16. González-Meneses, J., Wiest, B.: On the structure of the centralizeer of a braid. Ann Sci EC Norm Super, IV. Ser 37, No 5, 729-757 (2004)
17. Hofheinz, D., Steinwandt, R.: A practical attack on some braid group based cryptographic primitives. In: Public key cryptography, 6th international workshop on practice and theory in public key cryptography, PKC 2003. Lecture notes in computer science, vol 2567, pp 187-198. Berlin Heidelberg New York: Springer (2003)
18. Hughes, J.: A linear algebraic attack on the AAFG1 braid group cryptosystem. In: The 7th Australasian conference on information security and privacy, ACISP 2002. Lecture notes in computer science, vol 2384, pp 176-189. Berlin Heidelberg New York: Springer (2002)
19. Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems (2002)
20. Ko, K.H., Lee, S.J., Cheon, J.H., Han, J.W., Kang, J.-S., Park, C.: New public-key cryptosystem using braid groups. In: Advances in cryptology - CRYPTO 2000 (Santa Barbara, CA). Lecture notes in computer science, vol 1880, pp 166-183. Berlin Heidelberg New York: Springer (2000)
21. Lee, S.J., Lee, E.: Potential weakness of the commutator key agreement protocol based on braid groups. In: EuroCrypt 2002. Lecture notes in computer science, vol 2332, pp 14-28. Berlin Heidelberg New York: Springer (2002)
22. Lee. E., Lee. S.J., Hahn, S.G.: Pseudorandomness from braid groups. In: Advances in cryptology - CRYPTO 2001 (Santa Barbara, CA). Lecture notes in computer science, vol 2139, pp 486-502. Berlin Heidelberg New York: Springer (2001)
23. Sidel'nikov, V.M., Cherepnev, M.A., Yashchenko, V.V.: Public key distribution systems based on noncommutative semigroups. Dokl Akad Nauk 332(5), 566-567 (1993)
24. Thurston. W.P.: On the geometry and dynamics of diffeomorphisms of surfaces. Bull Am Math Soc (NS) 19(2), 417-431 (1988)