Abstract
Abstract. In this paper, we study the symmetric 2-adic complexity of generalized cyclotomic sequences with period 2𝑝 𝑛. These sequences are based on generalized binary cyclotomic classes of order two and have high linear complexity. The 2-adic complexity is another measure of the predictability of a sequence and thus its unsuitability for cryptography. We prove that the symmetric 2-adic complexity of considered sequences attains the maximal value. The generalized “Gauss periods” are used to derive 2-adic complexity of these sequences
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 callMore From: International Conference on Modern Problems of Mathematics, Mechanics and their Applications
Disclaimer: 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.
