TY - GEN
T1 - Length based attack and braid groups
T2 - 10th International Conference on Theory and Practice in Public-Key Cryptography, PKC 2007
AU - Myasnikov, Alex D.
AU - Ushakov, Alexander
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=38049061060&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38049061060&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-71677-8_6
DO - 10.1007/978-3-540-71677-8_6
M3 - Conference contribution
AN - SCOPUS:38049061060
SN - 9783540716761
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 76
EP - 88
BT - Public Key Cryptography - PKC 2007 - 10th International Conference on Practice and Theory in Public-Key Cryptography, Proceedings
Y2 - 16 April 2007 through 20 April 2007
ER -