Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Authentication from Matrix Conjugation

Authentication from Matrix Conjugation 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 –1 AX and A . The platform semigroup that we suggest here is the semigroup of n × n matrices over truncated multivariable polynomials over a ring. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups - Complexity - Cryptology de Gruyter

Authentication from Matrix Conjugation

Loading next page...
 
/lp/de-gruyter/authentication-from-matrix-conjugation-Pgl2SFoLh7
Publisher
de Gruyter
Copyright
© Heldermann Verlag
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/GCC.2009.199
Publisher site
See Article on Publisher Site

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 would follow from 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 × n matrices over truncated multivariable polynomials over a ring.

Journal

Groups - Complexity - Cryptologyde Gruyter

Published: Oct 1, 2009

There are no references for this article.