Randomness Analysis for the Generalized Self-Shrinking Sequences

Cardell, Sara D.; Requena, Verónica; Fúster‐Sabater, Amparo; Orue, A. B.

doi:10.3390/sym11121460

Cited by 9 publications

(13 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These generators are fast, easy and with low implementation costs to generate good cryptographic sequences. The authors of [15] presented a statistical and graphical study of the randomness of the sequences generated by the generalized self-shrinking generator that prove their suitability for cryptographic applications.…”

Section: Introductionmentioning

confidence: 99%

Interleaving Shifted Versions of a PN-Sequence

Cardell¹,

Fúster‐Sabater

Requena

2021

Mathematics

Self Cite

View full text Add to dashboard Cite

The output sequence of the shrinking generator can be considered as an interleaving of determined shifted versions of a single PN -sequence. In this paper, we present a study of the interleaving of a PN-sequence and shifted versions of itself. We analyze some important cryptographic properties as the period and the linear complexity in terms of the shifts. Furthermore, we determine the total number of the interleaving sequences that achieve each possible value of the linear complexity.

show abstract

Section: Introductionmentioning

confidence: 99%

Interleaving Shifted Versions of a PN-Sequence

Cardell¹,

Fúster‐Sabater

Requena

2021

Mathematics

Self Cite

View full text Add to dashboard Cite

show abstract

“…In particular, Professor Amalia Beatriz Orue Lopez from Isabel I University in Burgos, Spain [1][2][3], Professor Miguel Angel Murillo-Escoba from the Centre for Research and Higher Education in Ensenada, Baja California, Mexico [4,5] and Rafik Hamza from LAMIE Laboratory, University of Batna, Algeria [6] in their articles research the various methods of constructing pseudorandom sequence generators, in order to determine issues regarding information protection and estimation quality.…”

Section: Introductionmentioning

confidence: 99%

A New Approach to the Development of Additive Fibonacci Generators Based on Prime Numbers

et al. 2021

View full text Add to dashboard Cite

Pseudorandom number and bit sequence generators are widely used in cybersecurity, measurement, and other technology fields. A special place among such generators is occupied by additive Fibonacci generators (AFG). By itself, such a generator is not cryptographically strong. Nevertheless, when used as a primary it can be quite resistant to cryptanalysis generators. This paper proposes a modification to AGF, the essence of which is to use prime numbers as modules of recurrent equations describing the operation of generators. This modification made it possible to ensure the constancy of the repetition period of the output pseudorandom pulse sequence in the entire range of possible values of the initial settings–keys (seed) at specific values of the module. In addition, it has proposed a new generator scheme, which consists of two generators: the first of which is based on a modified AFG and the second is based on a linear feedback shift register (LFSR). The output pulses of both generators are combined through a logic element XOR. The results of the experiment show that the specific values of modules provide a constant repetition period of the output pseudorandom pulse sequence in a whole range of possible values of the initial settings–keys (seed) and provide all the requirements of the NIST test to statistical characteristics of the sequence. Modified AFGs are designed primarily for hardware implementation, which allows them to provide high performance.

show abstract

“…In addition, we present the generalized self-shrinking generator, a family of ciphers suitable for cryptography [11]. This generator remains strong against different algorithms that analyze the cryptographic strength (e.g., linear complexity) of its sequences.…”

Section: Introductionmentioning

confidence: 99%

Folding-BSD Algorithm for Binary Sequence Decomposition

Martín-Navarro

Fúster‐Sabater

2020

Computers

Self Cite

View full text Add to dashboard Cite

The Internet of Things (IoT) revolution leads to a range of critical services which rely on IoT devices. Nevertheless, they often lack proper security, becoming the gateway to attack the whole system. IoT security protocols often rely on stream ciphers, where pseudo-random number generators (PRNGs) are an essential part of them. In this article, a family of ciphers with strong characteristics that make them difficult to be analyzed by standard methods is described. In addition, we will discuss an innovative technique of sequence decomposition and present a novel algorithm to evaluate the strength of binary sequences, a key part of the IoT security stack. The density of the binomial sequences in the decomposition has been studied experimentally to compare the performance of the presented algorithm with previous works.

show abstract

Randomness Analysis for the Generalized Self-Shrinking Sequences

Cited by 9 publications

References 34 publications

Interleaving Shifted Versions of a PN-Sequence

Interleaving Shifted Versions of a PN-Sequence

A New Approach to the Development of Additive Fibonacci Generators Based on Prime Numbers

Folding-BSD Algorithm for Binary Sequence Decomposition

Contact Info

Product

Resources

About