Using shifted conjugacy in braid-based cryptography
Cryptography and Security
2007-05-23 v1
Abstract
Conjugacy is not the only possible primitive for designing braid-based protocols. To illustrate this principle, we describe a Fiat--Shamir-style authentication protocol that be can be implemented using any binary operation that satisfies the left self-distributive law. Conjugation is an example of such an operation, but there are other examples, in particular the shifted conjugation on Artin's braid group B\_oo, and the finite Laver tables. In both cases, the underlying structures have a high combinatorial complexity, and they lead to difficult problems.
Keywords
Cite
@article{arxiv.cs/0609091,
title = {Using shifted conjugacy in braid-based cryptography},
author = {Patrick Dehornoy},
journal= {arXiv preprint arXiv:cs/0609091},
year = {2007}
}