A linear complexity analysis of quadratic residues and primitive roots spacings

02/16/2019
by   Mihai Caragiu, et al.
0

We investigate the linear complexities of the periodic 0-1 infinite sequences in which the periods are the sequence of the parities of the spacings between quadratic residues modulo a prime p, and the sequence of the parities of the spacings between primitive roots modulo p, respectively. In either case, the Berlekamp-Massey algorithm running on MAPLE computer algebra software shows very good to perfect linear complexities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2019

On the stability of periodic binary sequences with zone restriction

Traditional global stability measure for sequences is hard to determine ...
research
06/19/2019

Linear Complexity of A Family of Binary pq^2-periodic Sequences From Euler Quotients

We first introduce a family of binary pq^2-periodic sequences based on t...
research
04/10/2019

On the k-error linear complexity of subsequences of d-ary Sidel'nikov sequences over prime field F_d

We study the k-error linear complexity of subsequences of the d-ary Side...
research
05/07/2020

Binary sequences derived from differences of consecutive quadratic residues

For a prime p> 5 let q_0,q_1,...,q_(p-3)/2 be the quadratic residues mod...
research
01/29/2019

On the k-error linear complexity of binary sequences derived from the discrete logarithm in finite fields

Let q=p^r be a power of an odd prime p. We study binary sequences σ=(σ_0...
research
12/24/2017

A note on a conjecture of new binary cyclotomic sequences of length p^n

Recently, a conjecture on the linear complexity of a new class of genera...
research
11/12/2022

Distributed and secure linear algebra – Master Thesis

Cryptography is the discipline that allows securing of the exchange of i...

Please sign up or login with your details

Forgot password? Click here to reset