Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol
From MaRDI portal
Publication:5756527
DOI10.1007/978-3-540-71677-8_6zbMath1127.94017OpenAlexW1585287467MaRDI QIDQ5756527
Alexander Ushakov, Alex D. Myasnikov
Publication date: 4 September 2007
Published in: Public Key Cryptography – PKC 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-71677-8_6
Related Items (16)
A PTIME solution to the restricted conjugacy problem in generalized Heisenberg groups ⋮ 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 ⋮ Algebraic cryptanalysis and new security enhancements ⋮ Affine braid groups: a better platform than braid groups for cryptology? ⋮ Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid Groups ⋮ Mean-set attack: cryptanalysis of Sibert et al. authentication protocol ⋮ Attack on Kayawood protocol: uncloaking private keys ⋮ Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography ⋮ An improved version of the AAG cryptographic protocol ⋮ Evolution of group-theoretic cryptology attacks using hyper-heuristics ⋮ Two general schemes of algebraic cryptography ⋮ Signature scheme using the root extraction problem on quaternions ⋮ The Complexity of Public-Key Cryptography
This page was built for publication: Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol