Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol

  • Alex D. Myasnikov
  • Alexander Ushakov
Conference paper

DOI: 10.1007/978-3-540-71677-8_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4450)
Cite this paper as:
Myasnikov A.D., Ushakov A. (2007) Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol. In: Okamoto T., Wang X. (eds) Public Key Cryptography – PKC 2007. PKC 2007. Lecture Notes in Computer Science, vol 4450. Springer, Berlin, Heidelberg

Abstract

The length based attack on Anshel-Anshel-Goldfeld commutator key-exchange protocol [1] was initially proposed by Hughes and Tannenbaum in [9]. Several attempts have been made to implement the attack [6], but none of them had produced results convincing enough to believe that attack works. In this paper we show that accurately designed length based attack can successfully break a random instance of the simultaneous conjugacy search problem for certain parameter values and argue that the public/private information chosen uniformly random leads to weak keys.

Download to read the full conference paper text

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Alex D. Myasnikov
    • 1
  • Alexander Ushakov
    • 1
  1. 1.Department of Mathematical Sciences, Stevens Institute of Technology, Hoboken, New Jersey, 07030USA

Personalised recommendations