Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4

Xiaoping LI; Wenping MA; Tongjiang YAN; Xubo ZHAO

doi:10.1587/transfun.E96.A.363

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Regular Section

Linear Complexity of Binary Whiteman Generalized Cyclotomic Sequences of Order 4

Xiaoping LI, Wenping MA, Tongjiang YAN, Xubo ZHAO

Author information

Keywords: generalized cyclotomic sequences, linear complexity, cryptography, minimal polynomial

JOURNAL RESTRICTED ACCESS

2013 Volume E96.A Issue 1 Pages 363-366

DOI https://doi.org/10.1587/transfun.E96.A.363

Details

Abstract

In this letter we propose a new Whiteman generalized cyclotomic sequence of order 4. Meanwhile, we determine its linear complexity and minimal polynomial. The results show that this sequence possesses both high linear complexity and optimal balance on 1s and 0s, which may be attractive for cryptographic applications.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!