Randomness analysis for gss-sequences concatenated

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Binary sequences produced by a generator should appear as random as possible, that is, have no logical pattern to be used in cryptographic applications. In this paper, we give a detailed analysis of the randomness of a family of binary sequences obtained from generalized self-shrinking generator, an element in the class of decimation-based sequence generators. We have applied the most important batteries of statistical tests to the sequence resulting from the concatenation of the family of generalized sequences obtained from a PN-sequence. This complete study provides good results and allow us to construct a new binary sequence with good cryptographic properties from a family of generalized self-shrunken sequences.

Cite

CITATION STYLE

APA

Cardell, S. D., Fúster-Sabater, A., Orue, A. B., & Requena, V. (2021). Randomness analysis for gss-sequences concatenated. In Advances in Intelligent Systems and Computing (Vol. 1267 AISC, pp. 350–360). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-57805-3_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free