A Linear Algebraic Attack on the AAFG1 Braid Group Cryptosystem
ACISP '02 Proceedings of the 7th Australian Conference on Information Security and Privacy
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
A Weak Key Test for Braid Based Cryptography
Designs, Codes and Cryptography
Entity authentication schemes using braid word reduction
Discrete Applied Mathematics - Special issue: Coding and 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
A practical attack on a braid group based cryptographic protocol
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Transitive signatures from braid groups
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
New constructions of public-key encryption schemes from conjugacy search problems
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
| Hi-index | 0.00 |
Braid cryptosystem was proposed in CRYPTO 2000 as an alternate public-key cryptosystem. The security of this system is based upon the conjugacy problem in braid groups. Since then, there have been several attempts to break the braid cryptosystem by solving the conjugacy problem in braid groups. In this article, we first survey all the major attacks on the braid cryptosystem and conclude that the attacks were successful because the current ways of random key generation almost always result in weaker instances of the conjugacy problem. We then propose several alternate ways of generating hard instances of the conjugacy problem for use braid cryptography.