Home Mathematics Authentication from Matrix Conjugation
Article
Licensed
Unlicensed Requires Authentication

Authentication from Matrix Conjugation

  • Dima Grigoriev and Vladimir Shpilrain
Published/Copyright: March 10, 2010
Become an author with De Gruyter Brill
Groups Complexity Cryptology
From the journal Volume 1 Issue 2

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

Received: 2009-08-27
Published Online: 2010-03-10
Published in Print: 2009-October

© Heldermann Verlag

Downloaded on 22.12.2025 from https://www.degruyterbrill.com/document/doi/10.1515/GCC.2009.199/pdf
Scroll to top button