Cryptanalysis of a particular case of klimov-shamir pseudo-random generator

Authors:
Vincent Bénony;François Recher;Éric Wegrzynowski;Caroline Fontaine
Affiliations:
USTL-LIFL/IRCICA, Cité Scientifique, Villeneuve d'Ascq cedex, France;USTL-Laboratoire Paul Painlevé, Villeneuve d'Ascq cedex, France;USTL-LIFL/IRCICA, Cité Scientifique, Villeneuve d'Ascq cedex, France;USTL-LIFL/IRCICA, Cité Scientifique, Villeneuve d'Ascq cedex, France
Venue:
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Year:
2004

Citing 1
Cited 1

A New Class of Invertible Mappings

CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems

Distinguishing attacks on t-functions

Mycrypt'05 Proceedings of the 1st international conference on Progress in Cryptology in Malaysia

Quantified Score

Hi-index	0.00

Visualization

Abstract

T-functions have been introduced by Shamir and Klimov in [1]. Those functions can be used in order to design a new class of stream ciphers. We present in this paper an algorithm which can retrieve the internal state of a particular class of pseudo-random generators based on T-functions. This algorithm has time complexity of $O(2^{\frac{n}{4}})$ and has memory complexity of O(n log2n ) for pseudo random generators which put out the n/2 most significants bits of their internal state at each time clock, n being the length of the internal state of the pseudo-random generator.