Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux key agreement protocol

Alex D. Myasnikov, Alexander Ushakov

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

The Anshel-Anshel-Goldfeld-Lemieux (abbreviated AAGL) key agreement protocol [1] is proposed to be used on low-cost platforms which constraint the use of computational resources. The core of the protocol is the concept of an Algebraic Eraser (abbreviated AE) which is claimed to be a suitable primitive for use within lightweight cryptography. The AE primitive is based on a new and ingenious idea of using an action of a semidirect product on a (semi)group to obscure involved algebraic structures. The underlying motivation for AAGL protocol is the need to secure networks which deploy Radio Frequency Identification (RFID) tags used for identification, authentication, tracing and point-of-sale applications. In this paper we revisit the computational problem on which AE relies and heuristically analyze its hardness. We show that for proposed parameter values it is impossible to instantiate a secure protocol. To be more precise, in 100% of randomly generated instances of the protocol we were able to find a secret conjugator z generated by the TTP algorithm (part of AAGL protocol).

Original languageEnglish
Pages (from-to)63-75
Number of pages13
JournalGroups, Complexity, Cryptology
Volume1
Issue number1
DOIs
StatePublished - Apr 2009

Fingerprint

Dive into the research topics of 'Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux key agreement protocol'. Together they form a unique fingerprint.

Cite this