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

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

2006-07-17

arxiv.org/abs/cs/0607079v4

Journal of Mathematical Cryptology 1 (2007), 359--372

Computer Science

Cryptography and Security

Final version, to appear in JMC

Scientific paper

10.1515/jmc.2007.018

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.

Affiliated with

Also associated with

No associations

Rating

Length-based cryptanalysis: The case of Thompson's Group 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 Length-based cryptanalysis: The case of Thompson's Group, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Length-based cryptanalysis: The case of Thompson's Group will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-506334