Iris Anshel

New Key Agreement Protocols in Braid Group Cryptography

Key agreement protocols are presented whose security is based on the difficulty of inverting one-way functions derived from hard problems for braid groups. Efficient/low cost algorithms for key transfer/ extraction are presented. Attacks/security parameters are discussed.

A Linear Time Matrix Key Agreement Protocol Over Small Finite Fields

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.

A class of hash functions based on the algebraic eraser

Abstract This paper introduces a novel braid based cryptographic hash function candidate which is suitable for use in low resource environments. It is shown that the new hash function performed extremely well on a range of cryptographic test suites.

A freiheitssatz for a class of two-relator groups

The Bass-Serre theory of graphs of groups is applied to obtain a Freiheitssatz for groups with two defining relators generalizing the classical theorem of W. Magnus. Applications of the main theorem to questions of torsion, the word problem, center, and cohomological dimension are obtained. Examples of various two-relator groups are given in order to demonstrate the nature of their behavior.