Open AccessLinear complexity of generalised cyclotomic quaternary sequences of length 2 p m +1 q n +1
Author(s) -
Li Dandan,
Chang Zuling,
Wen Qiaoyan,
Zhang Jie
Publication year - 2016
Publication title -
iet information security
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 34
eISSN - 1751-8717
pISSN - 1751-8709
DOI - 10.1049/iet-ifs.2015.0006
Subject(s) - mathematics , order (exchange) , cryptography , time complexity , construct (python library) , combinatorics , computational complexity theory , discrete mathematics , algorithm , computer science , finance , economics , programming language
Sequences with high linear complexity play a fundamental part in cryptography. In this study, the authors construct general forms of Whiteman's generalised cyclotomic quaternary sequences with period 2 p m +1 q n +1 of order two over 4 and give the linear complexity of the proposed sequences. The conclusions reveal that such sequences have good balance property and high linear complexity.