Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
From MaRDI portal
Recommendations
Cited in
(22)- Attack on Kayawood protocol: uncloaking private keys
- Evolution of group-theoretic cryptology attacks using hyper-heuristics
- Algebraic cryptanalysis and new security enhancements
- Length-based attacks in polycyclic groups
- An improved version of the AAG cryptographic protocol
- Two general schemes of algebraic cryptography
- Signature scheme using the root extraction problem on quaternions
- Representation attacks on the Braid Diffie-Hellman public key encryption
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups
- Mean-set attack: cryptanalysis of Sibert et al. authentication protocol
- A parallel evolutionary approach to solving systems of equations in polycyclic groups
- Authenticated commutator key agreement protocol
- The status of polycyclic group-based cryptography: a survey and open problems
- A nonlinear decomposition attack
- Random subgroups and analysis of the length-based and quotient attacks
- Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
- Affine braid groups: a better platform than braid groups for cryptology?
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- The Complexity of Public-Key Cryptography
- Groups with two generators having unsolvable word problem and presentations of Mihailova subgroups of braid groups
- Analysis of a certain polycyclic-group-based cryptosystem
This page was built for publication: Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756527)