Abstract
R. Hofer and A. Winterhof proved that the 2-adic complexity of the two-prime (binary) generator of period pq with two odd primes \(p\ne q\) is close to its period and it can attain the maximum in many cases. When the two-prime generator is applied to producing quaternary sequences, we need to determine the 4-adic complexity. It is proved that there are only two possible values of the 4-adic complexity for the two-prime quaternary generator, which are at least \(pq-1-\max \{\log _4(pq^2),\log _4(p^2q)\}\). Examples for primes p and q with \(5\le p, q <10000\) illustrate that the 4-adic complexity only takes one value larger than \(pq-\max \{\log _4(p),\log _4(q)\}\), which is close to its period. So it is good enough to resist the attack of the rational approximation algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
