Structural properties of cryptographic sequences
A Fúster-Sabater - Computational Intelligence in Security for Information …, 2011 - Springer
Computational Intelligence in Security for Information Systems: 4th …, 2011•Springer
In the present work, it is shown that the binary sequences obtained from a cryptographic
generator, the so-called generalized self-shrinking generator, are just particular solutions of
a type of linear difference equations. Cryptographic parameters eg period, linear complexity
or balancedness of the previous sequences can be analyzed in terms of linear equation
solutions. In brief, computing the solutions of linear difference equations is an easy method
of generating new sequences with guaranteed cryptographic parameters.
generator, the so-called generalized self-shrinking generator, are just particular solutions of
a type of linear difference equations. Cryptographic parameters eg period, linear complexity
or balancedness of the previous sequences can be analyzed in terms of linear equation
solutions. In brief, computing the solutions of linear difference equations is an easy method
of generating new sequences with guaranteed cryptographic parameters.
Abstract
In the present work, it is shown that the binary sequences obtained from a cryptographic generator, the so-called generalized self-shrinking generator, are just particular solutions of a type of linear difference equations. Cryptographic parameters e.g. period, linear complexity or balancedness of the previous sequences can be analyzed in terms of linear equation solutions. In brief, computing the solutions of linear difference equations is an easy method of generating new sequences with guaranteed cryptographic parameters.
Springer
Showing the best result for this search. See all results