An improved version of the AAG cryptographic protocol

DOI10.1515/gcc-2019-2003zbMath1452.94082OpenAlexW2937220647MaRDI QIDQ2304870

Vitaliĭ Roman'kov

Publication date: 13 March 2020

Published in: Groups, Complexity, Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/gcc-2019-2003

zbMATH Keywords

key-exchangealgebraic cryptographyconjugacy search problemmembership search problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

On Eulerian semigroups of multivariate transformations and their cryptographic applications ⋮ Algebraic cryptanalysis and new security enhancements ⋮ An improvement of the Diffie-Hellman noncommutative protocol

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A nonlinear decomposition attack
• Group-based cryptography
• An algebraic method for public-key cryptography
• Cryptanalysis via algebraic spans
• Two general schemes of algebraic cryptography
• A linear decomposition attack
• Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
• Random van Kampen diagrams and algorithmic problems in groups
• The discrete logarithm problem in Bergman's non-representable ring
• Advances in Cryptology - CRYPTO 2003
• Length Based Attack and Braid Groups: Cryptanalysis of Anshel-Anshel-Goldfeld Key Exchange Protocol

This page was built for publication: An improved version of the AAG cryptographic protocol