Analysis of a certain polycyclic-group-based cryptosystem

Matvei Kotov, Alexander Ushakov

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

Abstract

We investigate security properties of the Anshel-Anshel-Goldfeld commutator key-establishment protocol [Math. Res. Lett. 6 (1999), 287-291] used with certain polycyclic groups described by Eick and Kahrobaei [http://arxiv.org/abs/math.GR/0411077]. We show that despite low success of the length based attack shown by Garber, Kahrobaei and Lam [J. Math. Crypt. 9 (2015), 33-43] the protocol can be broken by a deterministic polynomial-time algorithm.

Original languageEnglish
Pages (from-to)161-167
Number of pages7
JournalJournal of Mathematical Cryptology
Volume9
Issue number3
DOIs
StatePublished - 1 Oct 2015

Keywords

  • Cryptography
  • commutator-key establishment
  • conjugacy problem
  • metabelian groups
  • polycyclic groups

Fingerprint

Dive into the research topics of 'Analysis of a certain polycyclic-group-based cryptosystem'. Together they form a unique fingerprint.

Cite this