CRGRMay 19, 2013

Non-associative key establishment for left distributive systems

arXiv:1305.4401v32 citations
Originality Incremental advance
AI Analysis

This work addresses cryptographic key establishment for specialized algebraic structures, presenting a novel approach but likely incremental in the broader field of cryptography.

The paper tackled the problem of constructing non-associative key establishment protocols for left distributive systems, resulting in new protocols for all left self-distributive, multi-LD-, and other left distributive systems, with instantiations using generalized shifted conjugacy in braid groups leading to a new group-theoretic problem called the (subgroup) conjugacy coset problem.

We construct non-associative key establishment protocols for all left self-distributive (LD), multi-LD-, and other left distributive systems. Instantiations of these protocols using generalized shifted conjugacy in braid groups lead to instances of a natural and apparently new group-theoretic problem, which we call the (subgroup) conjugacy coset problem.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes