Iterated LD-Problem in non-associative key establishment
Cryptography and Security
2013-12-25 v1 Group Theory
Abstract
We construct new non-associative key establishment protocols for all left self-distributive (LD), multi-LD-, and mutual LD-systems. The hardness of these protocols relies on variations of the (simultaneous) iterated LD-problem and its generalizations. We discuss instantiations of these protocols using generalized shifted conjugacy in braid groups and their quotients, LD-conjugacy and -symmetric conjugacy in groups. We suggest parameter choices for instantiations in braid groups, symmetric groups and several matrix groups.
Cite
@article{arxiv.1312.6791,
title = {Iterated LD-Problem in non-associative key establishment},
author = {Arkadius Kalka and Mina Teicher},
journal= {arXiv preprint arXiv:1312.6791},
year = {2013}
}
Comments
30 pages, 5 figures. arXiv admin note: substantial text overlap with arXiv:1305.4401