A linear complexity analysis of quadratic residues and primitive roots spacings
Information Theory
2019-05-07 v1 math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.1902.07314,
title = {A linear complexity analysis of quadratic residues and primitive roots spacings},
author = {Mihai Caragiu and Shannon Tefft and Aaron Kemats and Travis Maenle},
journal= {arXiv preprint arXiv:1902.07314},
year = {2019}
}
Comments
12 pages