Mathematics – Group Theory
Scientific paper
2008-01-30
Mathematics
Group Theory
Scientific paper
The Anshel-Anshel-Goldfeld-Lemieux (abbreviated AAGL) key agreement protocol 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 the 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 TTP algorithm (part of AAGL protocol).
Myasnikov Alex D.
Ushakov Alexander
No associations
LandOfFree
Cryptanalysis of Anshel-Anshel-Goldfeld-Lemieux key agreement protocol does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cryptanalysis of Anshel-Anshel-Goldfeld-Lemieux key agreement protocol, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptanalysis of Anshel-Anshel-Goldfeld-Lemieux key agreement protocol will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-203882