Abstract
The Braid Diffie-Hellman public key cryptosystem is based on the Diffie-Hellman version of a decomposition problem (DP) in the braid group B n . We propose a linear algebra attack on DP via the faithful Lawrence-Krammer representation ρ′n. For generic and sufficiently long instance braids we recover the ρ′n-image of the private key using just one matrix inversion.
Original language | English |
---|---|
Pages (from-to) | 257-266 |
Number of pages | 10 |
Journal | Applicable Algebra in Engineering, Communications and Computing |
Volume | 17 |
Issue number | 3-4 |
DOIs | |
State | Published - Aug 2006 |
Externally published | Yes |
Keywords
- Braid Diffie-Hellman key agreement protocol
- Braid group
- Decomposition problem
- Generalized conjugacy search problem
- Lawrence-Krammer representation
- Linear algebra attack
- Public-key cryptography