1 research outputs found
A lower bound on the 2-adic complexity of modified Jacobi sequence
Let be distinct primes satisfying and let
, , be Whiteman's generalized cyclotomic classes with
. In this paper, we give the values of Gauss
periods based on the generalized cyclotomic sets
and
. As an application, we
determine a lower bound on the 2-adic complexity of modified Jacobi sequence.
Our result shows that the 2-adic complexity of modified Jacobi sequence is at
least with period . This indicates that the 2-adic complexity
of modified Jacobi sequence is large enough to resist the attack of the
rational approximation algorithm (RAA) for feedback with carry shift registers
(FCSRs).Comment: 13 pages. arXiv admin note: text overlap with arXiv:1702.00822,
arXiv:1701.0376