IEICE TRANSACTIONS on Fundamentals
Linear Complexity of Quaternary Sequences over Z4 Based on Ding-Helleseth Generalized Cyclotomic Classes
Summary :
A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the sequences, which is in fact connected with the discrete Fourier transform of the sequences. The results show that the sequences possess large linear complexity and are “good” sequences from the viewpoint of cryptography.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E101-A No.5 pp.867-871
- Publication Date
- 2018/05/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E101.A.867
- Type of Manuscript
- LETTER
- Category
- Information Theory
Authors
Xina ZHANG
Northwest Normal University
Xiaoni DU
Northwest Normal University
Chenhuang WU
Putian University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Xina ZHANG, Xiaoni DU, Chenhuang WU, "Linear Complexity of Quaternary Sequences over Z4 Based on Ding-Helleseth Generalized Cyclotomic Classes" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 5, pp. 867-871, May 2018, doi: 10.1587/transfun.E101.A.867.
Abstract: A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the sequences, which is in fact connected with the discrete Fourier transform of the sequences. The results show that the sequences possess large linear complexity and are “good” sequences from the viewpoint of cryptography.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.867/_p
Copy
@ARTICLE{e101-a_5_867,
author={Xina ZHANG, Xiaoni DU, Chenhuang WU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Linear Complexity of Quaternary Sequences over Z4 Based on Ding-Helleseth Generalized Cyclotomic Classes},
year={2018},
volume={E101-A},
number={5},
pages={867-871},
abstract={A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the sequences, which is in fact connected with the discrete Fourier transform of the sequences. The results show that the sequences possess large linear complexity and are “good” sequences from the viewpoint of cryptography.},
keywords={},
doi={10.1587/transfun.E101.A.867},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Linear Complexity of Quaternary Sequences over Z4 Based on Ding-Helleseth Generalized Cyclotomic Classes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 867
EP - 871
AU - Xina ZHANG
AU - Xiaoni DU
AU - Chenhuang WU
PY - 2018
DO - 10.1587/transfun.E101.A.867
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2018
AB - A family of quaternary sequences over Z4 is defined based on the Ding-Helleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the sequences, which is in fact connected with the discrete Fourier transform of the sequences. The results show that the sequences possess large linear complexity and are “good” sequences from the viewpoint of cryptography.
ER -
English
