A lower bound on the 2-adic complexity of the modified Jacobi sequence

From MaRDI portal



Abstract: Let p,q be distinct primes satisfying mathrmgcd(p−1,q−1)=d and let Di, i=0,1,cdots,d−1, be Whiteman's generalized cyclotomic classes with Zpqast=cupi=0d−1Di. In this paper, we give the values of Gauss periods based on the generalized cyclotomic sets D0ast=sumi=0fracd2−1D2i and D1ast=sumi=0fracd2−1D2i+1. 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 pq−p−q−1 with period N=pq. 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).




Cites work









This page was built for publication: A lower bound on the 2-adic complexity of the modified Jacobi sequence

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