The linear complexity of new binary cyclotomic sequences of period $p^n$
Vladimir Edemskiy
TL;DR
This paper calculates the linear complexity of a new class of binary cyclotomic sequences with period p^n, confirming their high complexity and potential cryptographic strength.
Contribution
It determines the linear complexity of newly constructed binary cyclotomic sequences and proves their conjectured high complexity.
Findings
Confirmed high linear complexity of the sequences
Provided explicit calculation method for linear complexity
Validated the sequences' cryptographic suitability
Abstract
In this paper, we determine the linear complexity of a class of new binary cyclotomic sequences of period pn constructed by Z. Xiao et al. (Des. Codes Cryptogr. DOI 10.1007/s10623-017-0408-7) and prove their conjecture about high linear complexity of these sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cryptographic Implementations and Security