IEICE TRANSACTIONS on Fundamentals
2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences with Order 4
Summary :
Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and 2-adic complexity, have been widely applied to designing reliable stream ciphers. In this paper, we explicitly determine the 2-adic complexities of two classes of generalized cyclotomic binary sequences with order 4. Our results show that the 2-adic complexities of both of the sequences attain the maximum. Thus, they are large enough to resist the attack of the rational approximation algorithm for feedback with carry shift registers. We also present some examples to illustrate the validity of the results by Magma programs.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E102-A No.11 pp.1566-1570
- Publication Date
- 2019/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E102.A.1566
- Type of Manuscript
- LETTER
- Category
- Digital Signal Processing
Authors
Xiaoni DU
Northwest Normal University
Liping ZHAO
Northwest Normal University
Zhihua NIU
Shanghai 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
Xiaoni DU, Liping ZHAO, Zhihua NIU, "2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences with Order 4" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 11, pp. 1566-1570, November 2019, doi: 10.1587/transfun.E102.A.1566.
Abstract: Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and 2-adic complexity, have been widely applied to designing reliable stream ciphers. In this paper, we explicitly determine the 2-adic complexities of two classes of generalized cyclotomic binary sequences with order 4. Our results show that the 2-adic complexities of both of the sequences attain the maximum. Thus, they are large enough to resist the attack of the rational approximation algorithm for feedback with carry shift registers. We also present some examples to illustrate the validity of the results by Magma programs.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1566/_p
Copy
@ARTICLE{e102-a_11_1566,
author={Xiaoni DU, Liping ZHAO, Zhihua NIU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences with Order 4},
year={2019},
volume={E102-A},
number={11},
pages={1566-1570},
abstract={Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and 2-adic complexity, have been widely applied to designing reliable stream ciphers. In this paper, we explicitly determine the 2-adic complexities of two classes of generalized cyclotomic binary sequences with order 4. Our results show that the 2-adic complexities of both of the sequences attain the maximum. Thus, they are large enough to resist the attack of the rational approximation algorithm for feedback with carry shift registers. We also present some examples to illustrate the validity of the results by Magma programs.},
keywords={},
doi={10.1587/transfun.E102.A.1566},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - 2-Adic Complexity of Two Classes of Generalized Cyclotomic Binary Sequences with Order 4
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1566
EP - 1570
AU - Xiaoni DU
AU - Liping ZHAO
AU - Zhihua NIU
PY - 2019
DO - 10.1587/transfun.E102.A.1566
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2019
AB - Pseudo-random sequences with good statistical property, such as low autocorrelation, high linear complexity and 2-adic complexity, have been widely applied to designing reliable stream ciphers. In this paper, we explicitly determine the 2-adic complexities of two classes of generalized cyclotomic binary sequences with order 4. Our results show that the 2-adic complexities of both of the sequences attain the maximum. Thus, they are large enough to resist the attack of the rational approximation algorithm for feedback with carry shift registers. We also present some examples to illustrate the validity of the results by Magma programs.
ER -
English
