Treffer: Cryptanalysis of a particular case of Klimov-Shamir pseudo-random generator
Title:
Cryptanalysis of a particular case of Klimov-Shamir pseudo-random generator
Source:
SETA 2004 : sequences and their applications (Seoul, 24-28 October 2004, revised selected papers)Lecture notes in computer science. :313-322
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 2 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Analyse séquence, Sequence analysis, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité temps, Time complexity, Complejidad tiempo, Cryptage continu, Stream ciphering, Cifrado continuo, Cryptanalyse, Cryptanalysis, Criptoanálisis, Générateur nombre aléatoire, Random number generators, Horloge, Clock, Reloj, Nombre pseudoaléatoire, Pseudorandom number, Número seudo aleatorio, Classe état, State class, Clase estado
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
USTL-LIFL/IRCICA, Cité Scientifique, Bâtiment M3, 59655 Villeneuve d'Ascq, France
USTL-Laboratoire Paul Painlevé, Bâtiment M2, 59655 Villeneuve d'Ascq, France
USTL-Laboratoire Paul Painlevé, Bâtiment M2, 59655 Villeneuve d'Ascq, France
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16923363
Database:
PASCAL Archive
Weitere Informationen
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(2n 4) and has memory complexity of O(n log2 n) 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.