A practical cryptanalysis of the Algebraic Eraser
From MaRDI portal
Publication:2835587
Abstract: Anshel, Anshel, Goldfeld and Lemieaux introduced the Colored Burau Key Agreement Protocol (CBKAP) as the concrete instantiation of their Algebraic Eraser scheme. This scheme, based on techniques from permutation groups, matrix groups and braid groups, is designed for lightweight environments such as RFID tags and other IoT applications. It is proposed as an underlying technology for ISO/IEC 29167-20. SecureRF, the company owning the trademark Algebraic Eraser, has presented the scheme to the IRTF with a view towards standardisation. We present a novel cryptanalysis of this scheme. For parameter sizes corresponding to claimed 128-bit security, our implementation recovers the shared key using less than 8 CPU hours, and less than 64MB of memory.
Recommendations
- Key agreement, the Algebraic Eraser\(^{\text{TM}}\) and lightweight cryptography
- Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- A class of hash functions based on the Algebraic Eraser\(^{\text{TM}}\)
- A practical cryptanalysis of \({\mathrm {walnutdsa}^{\mathrm {TM}}}\)
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Braid Groups
- Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
- Cryptanalysis via algebraic spans
- Key agreement, the Algebraic Eraser\(^{\text{TM}}\) and lightweight cryptography
- Polynomial-time solutions of computational problems in noncommutative-algebraic cryptography
- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- The Magma algebra system. I: The user language
Cited in
(7)- Short expressions of permutations as products and cryptanalysis of the algebraic eraser
- A practical cryptanalysis of \({\mathrm {walnutdsa}^{\mathrm {TM}}}\)
- Cryptanalysis of the Anshel-Anshel-Goldfeld-Lemieux Key Agreement Protocol
- Optimizing Guessing Strategies for Algebraic Cryptanalysis with Applications to EPCBC
- Practical Algebraic Cryptanalysis for Dragon-Based Cryptosystems
- Ironwood meta key agreement and authentication protocol
- Key agreement, the Algebraic Eraser\(^{\text{TM}}\) and lightweight cryptography
This page was built for publication: A practical cryptanalysis of the Algebraic Eraser
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835587)