An attack on the Walnut digital signature algorithm
From MaRDI portal
Publication:2324764
DOI10.1007/s10623-019-00615-yzbMath1419.94040OpenAlexW2810628178MaRDI QIDQ2324764
Matvei Kotov, Anton Menshov, Alexander Ushakov
Publication date: 12 September 2019
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00615-y
digital signaturebraid groupconjugacy problemalgebraic erasergroup-based cryptographyWalnutDSAcolored Burau presentation
Related Items (1)
Uses Software
Cites Work
- A fast method for comparing braids
- A new approach to the word and conjugacy problems in the braid groups
- Generic-case complexity, decision problems in group theory, and random walks.
- Practical attacks against the walnut digital signature scheme
- A practical cryptanalysis of \({\mathrm {walnutdsa}^{\mathrm {TM}}}\)
- Attack on Kayawood protocol: uncloaking private keys
- A new approach to the conjugacy problem in Garside groups.
- The set of minimal braids is co-NP-complete
- A Practical Attack on a Braid Group Based Cryptographic Protocol
- Public Key Cryptography - PKC 2006
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An attack on the Walnut digital signature algorithm