Analysis of a certain polycyclic-group-based cryptosystem
classification
🧮 math.GR
keywords
certainprotocolalgorithmanalysisanshel-anshel-goldfeldattackbrokencommutator
read the original abstract
We investigate security properties of the Anshel-Anshel-Goldfeld commutator key-establishment protocol used with certain polycyclic groups. We show that despite low success of the length based attack the protocol can be broken by a deterministic polynomial-time algorithm.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.