Cryptanalysis of matrix conjugation schemes

Cryptanalysis of matrix conjugation schemes

In this paper we cryptanalyze two protocols: the Grigoriev–Shpilrain authentication protocol and a public key cryptosystem due to Wang, Wang, Cao, Okamoto and Shao. Both of these protocols use the computational hardness of some variations of the conjugacy search problem in a class of noncommutative...

Full description

Bibliographic Details
Main Authors: Myasnikov Alex D., Ushakov Alexander
Format: Article
Language:English
Published: De Gruyter 2014-06-01
Series:Journal of Mathematical Cryptology
Subjects:
group-based cryptography
conjugacy search problem
matrix monoids
truncated polynomials
94a60
68w30
Online Access:https://doi.org/10.1515/jmc-2012-0033
Description
Summary:In this paper we cryptanalyze two protocols: the Grigoriev–Shpilrain authentication protocol and a public key cryptosystem due to Wang, Wang, Cao, Okamoto and Shao. Both of these protocols use the computational hardness of some variations of the conjugacy search problem in a class of noncommutative monoids. We devise a practical heuristic algorithm solving those problems. As a conclusion we claim that these protocols are insecure for the proposed parameter values.
ISSN:1862-2976
1862-2984

Similar Items