Mean-set attack: cryptanalysis of Sibert et al. authentication protocol
We analyze the Sibert et al. group-based (Feige–Fiat–Shamir type) authentication protocol and show that the protocol is not computationally zero-knowledge. In addition, we provide experimental evidence that our approach is practical and can succeed even for groups with no efficiently computable leng...
Main Authors: | Mosina Natalia, Ushakov Alexander |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2010-10-01
|
Series: | Journal of Mathematical Cryptology |
Subjects: | |
Online Access: | https://doi.org/10.1515/jmc.2010.006 |
Similar Items
-
Random subgroups and analysis of the length-based and quotient attacks
by: Myasnikov Alexei G., et al.
Published: (2008-04-01) -
A polynomial algorithm for the braid double shielded public key cryptosystems
by: V.A. Roman’kov
Published: (2016-12-01) -
The Root Extraction Problem for Generic Braids
by: María Cumplido, et al.
Published: (2019-10-01) -
Key agreement protocol in Braid group representation level
by: Povilas Tvarijonas, et al.
Published: (2021-06-01) -
MDS Code Based Ultralightweight Authentication Protocol for RFID System
by: Pramod Kumar Maurya, et al.
Published: (2023-01-01)