Abstract

Abstract Keystream sequences should look as random as possible, i.e. should present no logical pattern to be exploited in cryptographic attacks. The generalized self-shrinking generator, a sequence generator based on irregular decimation, produces a family of sequences with good cryptographic properties. In this work, we display a detailed analysis on the randomness of the sequences resulting from the concatenation of elements of this family. We apply the most important batteries of statistical and graphical tests providing powerful results and a new method to construct sequences with good cryptographic properties.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.