A polynomial algorithm for the braid double shielded public key cryptosystems

Show simple item record

dc.contributor.author Roman’kov, V.A.
dc.date.accessioned 2017-04-03T06:12:55Z
dc.date.available 2017-04-03T06:12:55Z
dc.date.issued 2016-12-30
dc.identifier.issn 2518-7201
dc.identifier.uri http://rep.ksu.kz/handle/data/1147
dc.description.abstract We propose new provable practical deterministic polynomial time algorithm of cryptographic analysis for the braid Wang, Xu, Li, Lin and Wang «Double shielded public key cryptosystems», where the authors recommended the Artin braid groups Bn as platforms for proposed protocols. We show that a linear decomposition attack based on the decomposition method introduced by the author works for the image of braids under the Lawrence-Krammer representation by finding the exchanging keys in the both two main protocols by Wang et. al. These keys can be effectively computed in their original form too. Thus the protocols propоsed by Wang et. al. are vulnerable. ru_RU
dc.language.iso en ru_RU
dc.publisher Вестник Карагандинского университета ru_RU
dc.relation.ispartofseries Математика;
dc.subject cryptography ru_RU
dc.subject protocol ru_RU
dc.subject braid group ru_RU
dc.subject cryptanalysis ru_RU
dc.subject attack ru_RU
dc.subject linear decomposition ru_RU
dc.subject representation ru_RU
dc.title A polynomial algorithm for the braid double shielded public key cryptosystems ru_RU
dc.type Article ru_RU

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search DSpace


My Account