Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Non-associative key establishment for left distributive systems

Non-associative key establishment for left distributive systems 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

Non-associative key establishment for left distributive systems

Loading next page...
 
/lp/de-gruyter/non-associative-key-establishment-for-left-distributive-systems-dB0QYOAoDz
Publisher
de Gruyter
Copyright
Copyright © 2013 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2013-0009
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Groups Complexity Cryptologyde Gruyter

Published: Nov 1, 2013

There are no references for this article.