Defeating the Kalka--Teicher--Tsaban linear algebra attack on the Algebraic Eraser

2012/02/03 by Dorian Goldfeld, Goldfeld, Dorian, Paul E. Gunnells +1
Computer Science · #20F36 #94A60 #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR #msc:20F36 #msc:94A60

paper · pdf · doi:10.48550/arxiv.1202.0598

arxiv created 2012/02/03 · arxiv updated 2012/02/06

Abstract

The Algebraic Eraser (AE) is a public key protocol for sharing information over an insecure channel using commutative and noncommutative groups; a concrete realization is given by Colored Burau Key Agreement Protocol (CBKAP). In this paper, we describe how to choose data in CBKAP to thwart an attack by Kalka--Teicher--Tsaban.

Related

• On the cryptanalysis of the generalized simultaneous conjugacy search problem and the security of the Algebraic Eraser
• A Practical Cryptanalysis of the Algebraic Eraser
• Defeating the Ben-Zvi, Blackburn, and Tsaban Attack on the Algebraic Eraser
• Cryptanalysis of Anshel-Anshel-Goldfeld-Lemieux key agreement protocol
• Cryptanalysis of two schemes of Baba et al. by linear algebra methods