Authentication from matrix conjugation

Abstract. We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover's long-term private key. The latter is equivalent to solving the conjugacy search problem in the platform (noncommutative) semigroup, i.e., to recovering X from X-1 AX and A. The platform semigroup that we suggest here is the semigroup of n

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Dima Grigoriev, Vladimir Shpilrain
• Keywords: Conjugacy Search Problem, CORR 2010, Education, Long-term Private Key, Semigroup