A polynomial algorithm for the braid double shielded public key cryptosystems

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...

Cijeli opis

Bibliografski detalji

Glavni autor:	V.A. Roman’kov
Format:	Artigo
Jezik:	Inglês
Izdano:	Academician Ye.A. Buketov Karaganda University 2016-12-01
Serija:	Қарағанды университетінің хабаршысы. Математика сериясы
Teme:	cryptography protocol braid group cryptanalysis attack linear decomposition
Online pristup:	http://mathematics-vestnik.ksu.kz/index.php/mathematics-vestnik/article/view/133
Oznake:	Dodaj oznaku Bez oznaka, Budi prvi tko označuje ovaj zapis!