Cryptanalysis of matrix conjugation schemes

A.  D.  Myasnikov; A.  Ushakov

Paper 2012/694

Cryptanalysis of matrix conjugation schemes

A. D. Myasnikov and A. Ushakov

Abstract

In this paper we cryptanalyze two protocols: Grigoriev-Shpilrain authentication protocol and Wang et al. public key encryption protocols that use computational hardness of some variations of the conjugacy search problem in 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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Not published
Keywords: Group-based cryptography conjugacy search problem matrix monoids truncated polynomials
Contact author(s): amyasnik @ stevens edu
History: 2012-12-14: received
Short URL: https://ia.cr/2012/694
License: CC BY

BibTeX

@misc{cryptoeprint:2012/694,
      author = {A.  D.  Myasnikov and A.  Ushakov},
      title = {Cryptanalysis of matrix conjugation schemes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2012/694},
      year = {2012},
      url = {https://eprint.iacr.org/2012/694}
}