Linear Complexity of Geometric Sequences Defined by Cyclotomic Classes and Balanced Binary Sequences Constructed by the Geometric Sequences

09/12/2018
by   Kazuyoshi Tsuchiya, et al.
0

Pseudorandom number generators are required to generate pseudorandom numbers which have good statistical properties as well as unpredictability in cryptography. An m-sequence is a linear feedback shift register sequence with maximal period over a finite field. M-sequences have good statistical properties, however we must nonlinearize m-sequences for cryptographic purposes. A geometric sequence is a sequence given by applying a nonlinear feedforward function to an m-sequence. Nogami, Tada and Uehara proposed a geometric sequence whose nonlinear feedforward function is given by the Legendre symbol, and showed the period, periodic autocorrelation and linear complexity of the sequence. Furthermore, Nogami et al. proposed a generalization of the sequence, and showed the period and periodic autocorrelation. In this paper, we first investigate linear complexity of the geometric sequences. In the case that the Chan--Games formula which describes linear complexity of geometric sequences does not hold, we show the new formula by considering the sequence of complement numbers, Hasse derivative and cyclotomic classes. Under some conditions, we can ensure that the geometric sequences have a large linear complexity from the results on linear complexity of Sidel'nikov sequences. The geometric sequences have a long period and large linear complexity under some conditions, however they do not have the balance property. In order to construct sequences that have the balance property, we propose interleaved sequences of the geometric sequence and its complement. Furthermore, we show the periodic autocorrelation and linear complexity of the proposed sequences. The proposed sequences have the balance property, and have a large linear complexity if the geometric sequences have a large one.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2018

Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N

The autocorrelation and the linear complexity of a key stream sequence i...
research
12/25/2019

Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences

The linear complexity of a sequence s is one of the measures of its pred...
research
12/22/2021

Comparing balanced ℤ_v-sequences obtained from ElGamal function to random balanced sequences

In this paper, we investigate the randomness properties of sequences in ...
research
07/09/2018

Analysis of Statistical Properties of Nonlinear Feedforward Generators Over Finite Fields

Due to their simple construction, LFSRs are commonly used as building bl...
research
08/24/2021

On the linear complexity of feedforward clock-controlled sequence

As a research field of stream ciphers, the pursuit of a balance of secur...
research
10/27/2020

Deciding ω-Regular Properties on Linear Recurrence Sequences

We consider the problem of deciding ω-regular properties on infinite tra...
research
08/06/2022

Weak Equivalents for Nonlinear Filtering Functions

The application of a nonlinear filtering function to a Linear Feedback S...

Please sign up or login with your details

Forgot password? Click here to reset