Abstract
We demonstrate that recent advances in the theory of braid groups, in particular a new invariant of conjugacy classes of braids, the ultra summit set, make some braid-based cryptographic protocols insecure for almost all randomly chosen keys. As part of this we present an overview of the known algorithms for solving the conjugacy decision and search problems in braid groups and an assessment of their practical performance from the point of view of braid-based cryptography.
| Original language | English |
|---|---|
| Pages (from-to) | 219-238 |
| Number of pages | 20 |
| Journal | Applicable Algebra in Engineering\, Communication and Computing |
| Volume | 17 |
| Issue number | 3-4 |
| Publication status | Published - 2006 |
Keywords
- braid groups
- conjugacy search
- conjugacy problem
- ultra summit set
- cryptography
- key exchange
- Conjugacy search
- Key exchange
- Ultra summit set
- Braid-Diffie-Hellman
- Encryption
- Braid groups
- Cryptanalysis
- Conjugacy problem
- Cryptography