activity
19952024
most citedProbabilistic Solutions of Equations in the Braid Group

57 citations · 212 across the 65 of their papers we have counts for

collaborators
Showing 2013Show all

6 papers · 1 filter

cs.CR2013

Non-associative key establishment protocols and their implementation

Arkadius 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…

cs.CR2013★ 3 cited

Iterated LD-Problem in non-associative key establishment

Arkadius 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 variat…

math.AG2013

Combinatorial symmetry of line arrangements and applications

Meirav Amram, Moshe Cohen, Hao Sun +3

We introduce an algorithm that exploits a combinatorial symmetry of an arrangement in order to produce a geometric reflection between two disconnected components of its moduli spac…

math.GR2013★ 1 cited

Double Centralizers of Parabolic Subgroups of Braid Groups

David Garber, Arkadius Kalka, Eran Liberman +1

We characterize the double centralizer of all parabolic subgroups of the braid groups. We apply this result to provide a new and potentially more efficient solution to the subgroup…

math.AG2013★ 6 cited

Moduli spaces of ten-line arrangements with double and triple points

Meirav Amram, Moshe Cohen, Mina Teicher +1

Two arrangements with the same combinatorial intersection lattice but whose complements have different fundamental groups are called a Zariski pair. This work finds that there are…

cs.CR2013

Non-associative key establishment for left distributive systems

Arkadius 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 usin…