Attack on Kayawood protocol: uncloaking private keys
From MaRDI portal
Publication:2033519
DOI10.1515/jmc-2019-0015zbMath1466.94032OpenAlexW3111981975MaRDI QIDQ2033519
Anton Menshov, Alexander Ushakov, Matvei Kotov
Publication date: 17 June 2021
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2019-0015
braid groupalgebraic eraserkey agreementgroup-based cryptographycloaking problemcolored Burau presentationE-multiplicationKayawood protocol
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fast method for comparing braids
- A new approach to the word and conjugacy problems in the braid groups
- An algebraic method for public-key cryptography
- Practical attacks against the walnut digital signature scheme
- A practical cryptanalysis of \({\mathrm {walnutdsa}^{\mathrm {TM}}}\)
- Factoring products of braids via garside normal form
- An attack on the Walnut digital signature algorithm
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- The set of minimal braids is co-NP-complete
- Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
- A Practical Attack on Some Braid Group Based Cryptographic Primitives
- Advances in Cryptology - CRYPTO 2003
- A Practical Attack on a Braid Group Based Cryptographic Protocol
- Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
- Public Key Cryptography - PKC 2006
This page was built for publication: Attack on Kayawood protocol: uncloaking private keys