Random subgroups of braid groups: An approach to cryptanalysis of a braid group based cryptographic protocol

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

Volumn 3958 LNCS, Issue , 2006, Pages 302-314

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

^a MCGILL UNIVERSITY   (Canada)

^b CITY COLLEGE OF NEW YORK   (United States)

^c Stevens Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; PARAMETER ESTIMATION; RANDOM PROCESSES; SECURITY OF DATA;

CRYPTANALYSIS; CRYPTOGRAPHIC PROTOCOL; KEY EXCHANGE PROTOCOL; RANDOM ELEMENTS;

NETWORK PROTOCOLS;

EID: 33745819514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745853_20     Document Type: Conference Paper

References (16)

1. I. Anshel, M. Anshel, B. Fisher, D. Goldfeld, New Key Agreement Protocols in Braid Group Cryptography. In: Progress in Cryptology - CT-RSA 2001, 13-27.
2. Lecture Notes Comp. Sc., vol. 2020. Berlin Heidelberg New York Tokyo: Springer 2001.
3. I. Anshel, M. Anshel, D. Goldfeld, An algebraic method for public-key cryptography, Math. Res. Lett. 6 (1999), 287-291.
4. J. S. Birman, Braids, links and mapping class groups, Ann. Math. Studies 82, Princeton Univ. Press, 1974.
5. P. Dehornoy, A fast method for comparing braids, Adv. Math. 125 (1997), 200-235.
6. D. B. A. Epstein, J. W. Cannon, D. F. 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. J. Gonzalez-Meneses, Improving an algorithm to solve Multiple Simultaneous Conjugacy Problems in braid groups, Contemp. Math., Amer. Math. Soc. 372 (2005), 35-42.
9. J. Gonzalez-Meneses and B. Wiest, On the structure of the centraliser of a braid, Ann. Sci. École Norm. Sup. 37 (5) (2004), 729-757.
10. 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 Proceedings, 187-198 (Y. G. Desmedt, ed., Lecture Notes Comp. Sc., vol. 2567) Berlin Heidelberg New York Tokyo: Springer 2002.
11. Hughes, J., Tannenbaum, A., Length-based attacks for certain group based encryption rewriting systems. In: Workshop SECI02 Securitè de la Communication sur Intenet, September 2002, Tunis, Tunisia, http://www.network.com/~hughes/
12. K. H. Ko, S. J. Lee, J. H. Cheon, J. W. Han, J. Kang, C. Park, New public-key cryptosystem using braid groups. In: Advances in cryptology - CRYPTO 2000 (Santa Barbara, CA), 166-183 (Lecture Notes Comp. Sc., vol. 1880) Berlin Heidelberg New York Tokyo: Springer 2000.
13. S. J. Lee, E. Lee, Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups. In: Advances in cryptology - EUROCRYPT 2002, 14-28 (Lecture Notes Comp. Sc., vol. 2332) Berlin Heidelberg New York Tokyo: Springer 2002.
14. A. Myasnikov, V. Shpilrain, A. Ushakov, A practical attack on some braid group based cryptographic protocols. In: Advances in cryptology - CRYPTO 2005 (Santa Barbara, CA). Lecture Notes Comp. Sc. 3621 (2005), 86-96.
15. M. Paterson, A. Razborov, The set of minimal braids is co-NP-complete, J. Algorithms 12 (1991), 393-408.
16. 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/