Non-associative key establishment for left distributive systems
classification
💻 cs.CR
math.GR
keywords
leftconjugacydistributiveestablishmentnon-associativeproblemprotocolssystems
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.