A Linear Time Matrix Key Agreement Protocol Over Small Finite Fields

Abstract

This note introduces Braid–Diffie–Hellman (BDH), a key agreement protocol employing matrices over small finite fields. The method employs colored Burau matrices and a refinement of a Diffie–Hellman type protocol. We discuss the security and examine performance parameters of BDH which permit linear time execution on platforms supporting basic algebraic primitives.