Handbook of theoretical computer science (vol. A)
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
Cryptanalysis of Another Knapsack Cryptosystem
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Implementation in ScaLAPACK of Divide-and-Conquer Algorithms forBanded and Tridiagonal Linear Systems
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
One-more matching conjugate problem and security of braid-based signatures
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Towards generating secure keys for braid cryptography
Designs, Codes and Cryptography
A generalisation of the CKLHC cryptosystem
AIC'04 Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications
Length based attack and braid groups: cryptanalysis of Anshel-Anshel-Goldfeld key exchange protocol
PKC'07 Proceedings of the 10th international conference on Practice and theory in 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
Transitive signatures from braid groups
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
CSP-DHIES: a new public-key encryption scheme from matrix conjugation
Security and Communication Networks
Hi-index | 0.00 |
Our purpose is to describe a promising linear algebraic attack on the AAFG1 braid group cryptosystem proposed in [2] employing parameters suggested by the authors. Our method employs the well known Burau matrix representation of the braid group and techniques from computational linear algebra and provide evidence which shows that at least a certain class of keys are weak. We argue that if AAFG1 is to be viable the parameters must be fashioned to defend against this attack.