REVIEW
Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Computing the 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences of period of twin prime products
classification
math.NT
cs.CR
keywords
adiccomplexitysequencesclassescyclotomicding-hellesethgeneralizedalgorithm
read the original abstract
This paper contributes to compute 2-adic complexity of two classes of Ding-Helleseth generalized cyclotomic sequences. Results show that 2-adic complexity of these sequences is good enough to resist the attack by the rational approximation algorithm.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.