Welcome to the resource topic for 2012/694
Title:
Cryptanalysis of matrix conjugation schemes
Authors: A. D. Myasnikov, 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.
ePrint: https://eprint.iacr.org/2012/694
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .