A linear complexity analysis of quadratic residues and primitive roots spacings

From MaRDI portal
Publication:5114772

DOI10.17654/ME019010027zbMATH Open1435.11008arXiv1902.07314WikidataQ127936892 ScholiaQ127936892MaRDI QIDQ5114772FDOQ5114772


Authors: Mihai Caragiu, Shannon Tefft, Aaron Kemats, Travis Maenle Edit this on Wikidata


Publication date: 26 June 2020

Published in: Far East Journal of Mathematical Education (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1902.07314




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: A linear complexity analysis of quadratic residues and primitive roots spacings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114772)