Representation attacks on the braid Diffie-Hellman public key encryption

Applicable Algebra in Engineering, Communications and Computing

Volumn 17, Issue 3-4, 2006, Pages 257-266

  Kalka, Arkadius G ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Braid Diffie Hellman key agreement protocol; Braid group; Decomposition problem; Generalized conjugacy search problem; Lawrence Krammer representation; Linear algebra attack; Public key cryptography

Indexed keywords

COMPUTER CRIME; DECOMPOSITION; LINEAR ALGEBRA; PROBLEM SOLVING;

BRAID DIFFIE-HELLMAN KEY AGREEMENT PROTOCOL; BRAID GROUP; DECOMPOSITION PROBLEM; GENERALIZED CONJUGACY SEARCH PROBLEM; LAWRENCE-KRAMMER REPRESENTATION; LINEAR ALGEBRA ATTACK;

PUBLIC KEY CRYPTOGRAPHY;

EID: 33746356856     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00200-006-0007-8     Document Type: Article

References (21)

1. Anshel, I., Anshel, M., Goldfeld, D.: An algebraic method for public-key cryptography. Math Res Lett 6, 1-5 (1999)
2. Bigelow, S.: The Burau representation is not faithful for n = 5. Geom Topol 3, 397-404 (1999)
3. Bigelow, S.: Braid groups are linear. J Am Math Soc 14(2), 471-486 (2001)
4. Burau, W.: Über Zopfgruppen und gleichsinnig verdrillte Verkettungen. Abh Math Sem Univ Hamburg 11, 179-186(1936)
5. Cha, J., Ko, K., Lee, S., Han, J., Cheon, J.: An efficient implementation of braid groups. In: Boyd, C. (ed.) Advances in cryptology - ASIACRYPT 2001 (Lect Notes Comp Sci, vol 2248) Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Tokyo: Springer (2001)
6. Cheon, J., Jun, B.: A polynomial time algorithm for the Braid Diffie-Hellman conjugacy problem. In: Boneh, D. (ed.) Advances in cryptology - CRYPTO 2003 (Lect Notes Comp Sci. vol 2729) Berlin Heidelberg New York Hong Kong London Milan Paris Tokyo: Springer (2003)
7. Dehornoy, P.: Braid-based cryptography. Contemp Math 360, 5-33 (2004)
8. Garber, D., Kaplan, S., Teicher, M., Tsaban, B., Vishne, U.: Length based conjugacy search in the braid group. http://arXiv.org/abs/math.GR/0209267 (preprint)
9. von zur Gathen, J., Gerhard, J.: Modern computer algebra. London: Cambridge University Press (1999)
10. Gebhardt, V.: A new approach to the conjugacy problem in garside groups, http://arxiv.org/abs/math.GT/0306199 (preprint)
11. Hofheinz, D., Steinwandt, R.: A practical attack on some braid group based cryptographic primitives. In: Desmedt, Y. (ed.) Public key cryptography - PKC 2003 (Lect Notes Comp Sci, vol 2567) Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Tokyo: Springer (2003)
12. Hughes. J.: The LeftSSS attack on Ko-Lee-Cheon-Han-Kang-Park key agreement protocol in 845. Presentation, rump session CRYPTO 2000, http://www.stortek.com/hughes/Crypt2000.pdf
13. Hughes, J.: A linear algebraic attack on the AAFG1 braid group cryptosystem. In: Batten, L., Seberry. J. (eds.) Information security and privacy (Lect Notes Comp Sci, vol 2384) Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Tokyo: Springer 2002
14. Hughes, J., Tannenbaum, A.: Length-based attacks for certain group based encryption rewriting systems. Workshop SECI02 SEcurité de la Communication sur Internet Tunis (2002)
15. Ko, K.: Conjugacy problem in Braid groups and applications: III. Cryptanalytic approach to conjugacy problem and its variations via representations and linear algebra. Presentation, 10th school of Knots and Links, University of Tokyo 2003, http://kyokan.ms.u-tokyo.ac.jp/~topology/files/ KS03b.pdf
16. Ko, K., Lee, S., Cheon, J., Han, J., Kang, J., Park, C.: New Public-key Cryptosystem Using Braid Groups. In: Bellare, M. (ed.) Advances in cryptology - CRYPTO 2000 (Lect Notes Comp Sci, vol 1880) Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Singapore Tokyo: Springer (2000)
17. 4 is linear. Invent Math 142(3), 451-486 (2000)
18. Krammer, D.: Braid groups are linear. Ann Math (2) 155(1), 131-156 (2002)
19. Lawrence, R.: Homological representations of the Hecke algebra. Comm Math Phys 135(1), 141-191 (1990)
20. Lee, E., Park, J.: Cryptanalysis of the public-key encryption based on Braid groups. In: Biham, E. (ed.) Advances in cryptology - EUROCRYPT 2003 (Lect Notes Comp Sci, vol 2656) Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Tokyo: Springer (2003)
21. Lee, S., Lee, E.: Potential weaknesses in the commutator key agreement protocol based on braid groups. In: Knudsen, L. (ed.) Advances in cryptology - EUROCRYPT 2002 (Lect Notes Comp Sci, vol 2332) Berlin Heidelberg New York Barcelona Hong Kong London Milan Paris Tokyo: Springer (2002)