The braid Diffie-Hellman public key exchange and the corresponding PKC are based on the 
Diffie-Hellman version of a decomposition problem in the braid groups. We discuss linear 
representation attacks on this cryptosystem using the Burau representation and the faithful
Lawrence-Krammer representation. Finally we give an overview of algorithms, which compute
preimage braids for these representations.