The search functionality is under construction.
The search functionality is under construction.

Open Access
Linear Complexity of n-Periodic Cyclotomic Sequences over 𝔽p

Qiuyan WANG, Yang YAN

  • Full Text Views

    108

  • Cite this
  • Free PDF (158.2KB)

Summary :

Periodic sequences, used as keys in cryptosystems, plays an important role in cryptography. Such periodic sequences should possess high linear complexity to resist B-M algorithm. Sequences constructed by cyclotomic cosets have been widely studied in the past few years. In this paper, the linear complexity of n-periodic cyclotomic sequences of order 2 and 4 over 𝔽p has been calculated, where n and p are two distinct odd primes. The conclusions reveal that the presented sequences have high linear complexity in many cases, which indicates that the sequences can resist the linear attack.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E103-A No.5 pp.785-791
Publication Date
2020/05/01
Publicized
Online ISSN
1745-1337
DOI
10.1587/transfun.2019EAL2137
Type of Manuscript
LETTER
Category
Information Theory

Authors

Qiuyan WANG
  Tiangong University
Yang YAN
  Tianjin University of Technology and Education

Keyword