Representation attacks on the braid Diffie-Hellman public key encryption

Arkadius G. Kalka

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


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 languageEnglish
Pages (from-to)257-266
Number of pages10
JournalApplicable Algebra in Engineering, Communications and Computing
Issue number3-4
StatePublished - Aug 2006
Externally publishedYes


  • Braid Diffie-Hellman key agreement protocol
  • Braid group
  • Decomposition problem
  • Generalized conjugacy search problem
  • Lawrence-Krammer representation
  • Linear algebra attack
  • Public-key cryptography


Dive into the research topics of 'Representation attacks on the braid Diffie-Hellman public key encryption'. Together they form a unique fingerprint.

Cite this