Computer Science – Cryptography and Security
Scientific paper
2005-07-26
Journal of Cryptology 20 (2007), 389-392
Computer Science
Cryptography and Security
To appear in JoC
Scientific paper
10.1007/s00145-007-0564-4
The internal state of the Klimov-Shamir number generator TF-1 consists of four words of size w bits each, whereas its intended strength is 2^{2w}. We exploit an asymmetry in its output function to show that the internal state can be recovered after having 2^w outputs, using 2^{1.5w} operations. For w=32 the attack is practical, but for their recommended w=64 it is only of theoretical interest.
No associations
LandOfFree
Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1 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 Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Theoretical cryptanalysis of the Klimov-Shamir number generator TF-1 will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-208646