GRMar 18, 2014
Complete simultaneous conjugacy invariants in Artin's braid groupsArkadius Kalka, Boaz Tsaban, Gary Vinokur
We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super summit set to arbitrary dimensions. One key ingredient in our solution is the introduction of a provable high-dimensional version of the Birman--Ko--Lee cycling theorem. The complexity of this solution is a small degree polynomial in the cardinalities of our generalized super summit sets and the input parameters. Computer experiments suggest that the cardinality of this invariant, for a list of order $N$ independent elements of Artin's braid group $B_N$, is generically close to~1.
CRDec 24, 2013
Non-associative key establishment protocols and their implementationArkadius Kalka, Mina Teicher
We provide implementation details for non-associative key establishment protocols. In particular, we describe the implementation of non-associative key establishment protocols for all left self-distributive and all mutually left distributive systems.
CRDec 24, 2013
Iterated LD-Problem in non-associative key establishmentArkadius Kalka, Mina Teicher
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 $f$-symmetric conjugacy in groups. We suggest parameter choices for instantiations in braid groups, symmetric groups and several matrix groups.
CRMay 19, 2013
Non-associative key establishment for left distributive systemsArkadius Kalka, Mina Teicher
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.
CROct 31, 2012
Non-associative public-key cryptographyArkadius Kalka
We introduce a generalized Anshel-Anshel-Goldfeld (AAG) key establishment protocol (KEP) for magmas. This leads to the foundation of non-associative public-key cryptography (PKC), generalizing the concept of non-commutative PKC. We show that left selfdistributive systems appear in a natural special case of a generalized AAG-KEP for magmas, and we propose, among others instances, concrete realizations using $f$-conjugacy in groups and shifted conjugacy in braid groups. We discuss the advantages of our schemes compared with the classical AAG-KEP based on conjugacy in braid groups.