Word Processing in Groups
A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
New Key Agreement Protocols in Braid Group Cryptography
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Potential Weaknesses of the Commutator Key Agreement Protocol Based on Braid Groups
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
A Practical Attack on Some Braid Group Based Cryptographic Primitives
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Cryptanalysis of the public-key encryption based on braid groups
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Towards generating secure keys for braid cryptography
Designs, Codes and Cryptography
Reduction of conjugacy problem in braid groups, using two garside structures
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
| Hi-index | 0.00 |
This work emphasizes an important problem of braid based cryptography: the random generation of good keys. We present a deterministic, polynomial algorithm that reduces the conjugacy search problem in braid group. The algorithm is based on the decomposition of braids into products of canonical factors and gives a partial factorization of the secret: a divisor and a multiple. The tests we performed on different keys of existing protocols showed that many protocols in their current form are broken and that the efficiency of our attack depends on the random generator used to create the key. Therefore, this method gives new critera for testing weak keys. We also propose a new random generator of key which is secure against our attack and the one of Hofheinz and Steinwandt.