Recovering decimation-based cryptographic sequences by means of linear CAs
نویسندگان
چکیده
The sequences produced by the cryptographic sequence generator known as the shrinking generator can be modelled as the output sequences of linear elementary cellular automata. These sequences are composed of interleaved m-sequences produced by linear structures based on feedback shifts. This profitable characteristic can be used in the cryptanalysis of this generator. In this work we propose an algorithm that takes advantage of the inherent linearity of these cellular automata and the interleaved m-sequences. Although irregularly decimated generators have been conceived and designed as non-linear sequence generators, in practice they can be easily analysed in terms of simple linear structures. keywords: decimation, shrinking generator, cellular automata, Zech logarithm, cryptanalysis MSC2010: 94A55
منابع مشابه
Generation of Cryptographic Sequences by means of Difference Equations
In the present work, it is shown that the sequences obtained from cryptographic generators based on decimation are just particular solutions of a kind of linear difference equations. Moreover, all these sequences are simple linear combinations of a class of basic sequences (binomial sequences). Cryptographic parameters of decimated sequences, e.g. period, linear complexity or balancedness, can ...
متن کاملSubsequence based recovery of missing samples in oversampled bandlimited signals
A new approach for recovering an arbitrary finite number of missing samples in an oversampled bandlimited signal is presented. This correspondence also proposes an approach for recovering the original signal's spectrum from the spectra of a certain number of subsequences, obtained by downsampling the original sequence. Closed-form expressions for the missing samples in terms of the known sample...
متن کاملSynthesis of cryptographic interleaved sequences by means of linear cellular automata
This work shows that a class of pseudorandom binary sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, these linear automata generate all the solutions of a type of linear difference equations with binary coefficients. Interleaved sequences are just particular solutions of such equations. In this way, popular...
متن کاملLinear Cellular Automata as Discrete Models for Generating Cryptographic Sequences
This work shows that a wide class of cryptographic sequences, the so-called interleaved sequences, can be generated by means of linear multiplicative polynomial cellular automata. In fact, this type of onedimensional linear 90/150 cellular automata can be devised as generators of pseudo-random sequences. Moreover, these linear automata generate all the solutions of a type of difference equation...
متن کاملLightweight 4x4 MDS Matrices for Hardware-Oriented Cryptographic Primitives
Linear diffusion layer is an important part of lightweight block ciphers and hash functions. This paper presents an efficient class of lightweight 4x4 MDS matrices such that the implementation cost of them and their corresponding inverses are equal. The main target of the paper is hardware oriented cryptographic primitives and the implementation cost is measured in terms of the required number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1802.02206 شماره
صفحات -
تاریخ انتشار 2018