A practical attack on a braid group based cryptographic protocol

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

Volumn 3621 LNCS, Issue , 2006, Pages 86-96

  Myasnikov, Alexei ^a   Shpilrain, Vladimir ^b   Ushakov, Alexander ^c  

^a MCGILL UNIVERSITY   (Canada)

^b CITY COLLEGE OF NEW YORK   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRAID GROUP; CRYPTOGRAPHIC PROTOCOL; HEURISTIC ATTACK; KEY EXCHANGE PROTOCOLS;

COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SIMULATION; CRYPTOGRAPHY; DIFFUSION; ELECTRONIC CRIME COUNTERMEASURES; NETWORK PROTOCOLS; PARAMETER ESTIMATION; PROBLEM SOLVING;

HEURISTIC METHODS;

EID: 33745146187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. I. Anshel, M. Anshel, D. Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6 (1999), 287-291.
2. J. S. Birman, Braids, links and mapping class groups, Ann. Math. Studies 82, Princeton Univ. Press, 1974.
3. J. H. Cheon and B. Jun, A polynomial time algorithm for the braid Diffie-Hellman conjugacy problem, Crypto 2003, Lecture Notes in Comput. Sci. 2729 (2003), 212-225.
4. P. Dehornoy, A fast method for comparing braids, Adv. Math. 125 (1997), 200-235.
5. P. Dehornoy, Braid-based cryptography, Contemp. Math., Amer. Math. Soc. 360 (2004), 5-33.
6. D. B. A. Epstein, J. W. Cannon, D. P. Holt, S. V. F. Levy, M. S. Paterson, W. P. Thurston, Word processing in groups. Jones and Bartlett Publishers, Boston, MA, 1992.
7. D. Garber, S. Kaplan, M. Teicher, B. Tsaban, U. Vishne, Probabilistic solutions of equations in the braid group, preprint. http://arxiv.org/abs/math. GR/0404076
8. D. Hofheinz and R. Steinwandt, 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 Proceedings, Y.G. Desmedt, ed., Lecture Notes in Computer Science 2567, pp. 187-198, Springer, 2002.
9. J. Hughes and A. Tannenbaum, Length-based attacks for certain group based encryption rewriting systems, Workshop SECI02 Securitè de la Communication sur Intenet, September 2002, Tunis, Tunisia, http://www. storagetek.com/hughes/
10. I. Kapovich, A. Myasnikov, P. Schupp and V. Shpilrain, Average-case complexity for the word and membership problems in group theory, Advances in Math. 190 (2005), 343-359.
11. K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J. Kang, 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.
12. M. S. Paterson, A. A. Razborov, The set of minimal braids is co-NP-complete, J. Algorithms 12 (1991), 393-408.
13. V. Shpilrain and A. Ushakov, The conjugacy search problem in public key cryptography: unnecessary and insufficient, Applicable Algebra in Engineering, Communication and Computing, to appear. http://eprint.iacr.org/2004/321/
14. V. Shpilrain and G. Zapata, Combinatorial group theory and public key cryptography, Applicable Algebra in Engineering, Communication and Computing, to appear. http://eprint.iacr.org/2004/242
15. J. Wang, Average-case computational complexity theory, Complexity Theory Retrospective, II. Springer-Verlag, New York, 1997, 295-334.