Abstract
Cyclotomic sequences have good cryptographic properties and are closely related to difference sets. This paper proposes a new class of binary generalized cyclotomic sequences of order two and length pqr. Its linear complexity, minimal polynomial, and autocorrelation are investigated. The results show that these sequences have a large linear complexity when 2 e D 1 , which means they can resist the Berlekamp-Massey attack. Furthermore, the autocorrelation values are close to 0 with a probability of approximately 1 — 1/r. Therefore, when r is a big prime, the new sequence has a good autocorrelation.
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.
