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...
Main Authors: | Myasnikov Alex D., Ushakov Alexander |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2014-06-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc-2012-0033 |
Similar Items
-
Cryptanalysis of the MORE symmetric key fully homomorphic encryption scheme
by: Tsaban Boaz, et al.
Published: (2015-06-01) -
Analysis of a key exchange protocol based on tropical matrix algebra
by: Kotov Matvei, et al.
Published: (2018-09-01) -
Plactic key agreement (insecure?)
by: Brown Daniel R. L.
Published: (2023-02-01) -
Cryptanalysis of “MAKE”
by: Brown Daniel R. L., et al.
Published: (2022-02-01) -
Cryptanalysis of a privacy-preserving authentication scheme based on private set intersection
by: Eskeland Sigurd
Published: (2024-03-01)