Ore Revisited: an Algorithmic Investigation of the Simple Commutator Promise Problem


Motivated by a desire to test the security of the pubic key exchange protocol of I. 1999), we study algorithmic approaches to the simple commutator decision and promise problems (SCDP/SCPP) for the braid groups B n. We take as our point of departure a seminal paper of O. Alternating Groups " , arXiv:math.GR/0303036). We extract, from their proof that any… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics