Cryptanalysis of matrix conjugation schemes

Autor:	Myasnikov Alex D., Ushakov Alexander
Jazyk:	angličtina
Rok vydání:	2014
Předmět:	group-based cryptography conjugacy search problem matrix monoids truncated polynomials 94a60 68w30 Mathematics QA1-939
Zdroj:	Journal of Mathematical Cryptology, Vol 8, Iss 2, Pp 95-114 (2014)
Druh dokumentu:	article
ISSN:	1862-2976 1862-2984
DOI:	10.1515/jmc-2012-0033
Popis:	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.
Databáze:	Directory of Open Access Journals
Externí odkaz:	https://doaj.org/article/13c6d23ec4ea4d12bd6ca09e8f61a2ab Zobrazit plný text záznamu View record in DOAJ