International Association for Cryptologic Research (IACR)
Abstract
We propose a new digital signature scheme based on a
non-commutative group where the conjugacy search problem is hard
and the conjugacy decision problem is feasible. We implement our
signature scheme in the braid groups and prove that an existential
forgery of the implementation under no message attack
gives a solution to a variation of conjugacy search problem. Then
we discuss performance of our scheme under suggested parameters
