Sciweavers

Share
CORR
2006
Springer

Length-based cryptanalysis: The case of Thompson's Group

10 years 1 months ago
Length-based cryptanalysis: The case of Thompson's Group
The length-based approach is a heuristic for solving randomly generated equations in groups which possess a reasonably behaved length function. We describe several improvements of the previously suggested length-based algorithms, that make them applicable to Thompson's group with significant success rates. In particular, this shows that the Shpilrain-Ushakov public key cryptosystem based on Thompson's group is insecure, and suggests that no practical public key cryptosystem based on this group can be secure. (Preliminary version. Comments are welcome.)
Dima Ruinskiy, Adi Shamir, Boaz Tsaban
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CORR
Authors Dima Ruinskiy, Adi Shamir, Boaz Tsaban
Comments (0)
books