The generalized self-shrinking generator is a sequence generator that produces binary sequences with good cryptographic properties. On the other hand, the binomial sequences are a well-defined class of sequences that can be obtained considering infinite successions of binomial coefficients modulo 2. In this work, we see that the generalized sequences can be computed as a finite binary sum of binomial sequences. Moreover, the cryptographic parameters of the generalized sequences can be studied in terms of the binomial sequences.1161980381619. International Conference on Computational Science and Its Applications2019-07-01Saint Petersbur
Abstract. Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness...
In the present work, it is shown that the sequences obtained from cryptographic generators based on ...
This book offers a broad survey of all information made public - from 1993 until today - on keystrea...
AbstractThis work shows that the output sequences of a well-known cryptographic generator, the so-ca...
In this paper we show that the output sequences of the generalized self-shrinking generator are part...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
AbstractThis work shows that the output sequences of a well-known cryptographic generator, the so-ca...
Output sequences of the cryptographic pseudo-random number generator, known as the generalized self-...
27 páginas, 8 tablas, 2 figurasOutput sequences of the cryptographic pseudo-random number generator,...
In cryptography, the property of randomness in pseudo-random generators is very important to avoid a...
In cryptography, the property of randomness in pseudo-random generators is very important to avoid a...
Keystream sequences should look as random as possible, i.e. should present no logical pattern to be ...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
In cryptography, the property of randomness in pseudo-random generators is very important to avoid a...
AbstractIn this work, a simple constructive method is developed for enlarging known families of filt...
Abstract. Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness...
In the present work, it is shown that the sequences obtained from cryptographic generators based on ...
This book offers a broad survey of all information made public - from 1993 until today - on keystrea...
AbstractThis work shows that the output sequences of a well-known cryptographic generator, the so-ca...
In this paper we show that the output sequences of the generalized self-shrinking generator are part...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
AbstractThis work shows that the output sequences of a well-known cryptographic generator, the so-ca...
Output sequences of the cryptographic pseudo-random number generator, known as the generalized self-...
27 páginas, 8 tablas, 2 figurasOutput sequences of the cryptographic pseudo-random number generator,...
In cryptography, the property of randomness in pseudo-random generators is very important to avoid a...
In cryptography, the property of randomness in pseudo-random generators is very important to avoid a...
Keystream sequences should look as random as possible, i.e. should present no logical pattern to be ...
The binomial sequences are binary sequences that correspond to the diagonals of the binary Sierpinsk...
In cryptography, the property of randomness in pseudo-random generators is very important to avoid a...
AbstractIn this work, a simple constructive method is developed for enlarging known families of filt...
Abstract. Security of cryptographic symmetric primitives is studied in this thesis. Pseudorandomness...
In the present work, it is shown that the sequences obtained from cryptographic generators based on ...
This book offers a broad survey of all information made public - from 1993 until today - on keystrea...