The search functionality is under construction.

The search functionality is under construction.

Binary sequences with high linear complexity and high 2-adic complexity have important applications in communication and cryptography. In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences which have high linear complexity is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, the result shows that the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm (RAA) for feedback with carry shift registers (FCSRs).

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E105-A No.3 pp.603-606

- Publication Date
- 2022/03/01

- Publicized
- 2021/09/21

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.2021EAL2043

- Type of Manuscript
- LETTER

- Category
- Cryptography and Information Security

Chun-e ZHAO

China University of Petroleum

Yuhua SUN

China University of Petroleum

Tongjiang YAN

China University of Petroleum

Xubo ZHAO

China University of Petroleum

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.

Copy

Chun-e ZHAO, Yuhua SUN, Tongjiang YAN, Xubo ZHAO, "Balanced Whiteman Generalized Cyclotomic Sequences with Maximal 2-adic Complexity" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 3, pp. 603-606, March 2022, doi: 10.1587/transfun.2021EAL2043.

Abstract: Binary sequences with high linear complexity and high 2-adic complexity have important applications in communication and cryptography. In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences which have high linear complexity is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, the result shows that the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm (RAA) for feedback with carry shift registers (FCSRs).

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021EAL2043/_p

Copy

@ARTICLE{e105-a_3_603,

author={Chun-e ZHAO, Yuhua SUN, Tongjiang YAN, Xubo ZHAO, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Balanced Whiteman Generalized Cyclotomic Sequences with Maximal 2-adic Complexity},

year={2022},

volume={E105-A},

number={3},

pages={603-606},

abstract={Binary sequences with high linear complexity and high 2-adic complexity have important applications in communication and cryptography. In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences which have high linear complexity is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, the result shows that the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm (RAA) for feedback with carry shift registers (FCSRs).},

keywords={},

doi={10.1587/transfun.2021EAL2043},

ISSN={1745-1337},

month={March},}

Copy

TY - JOUR

TI - Balanced Whiteman Generalized Cyclotomic Sequences with Maximal 2-adic Complexity

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 603

EP - 606

AU - Chun-e ZHAO

AU - Yuhua SUN

AU - Tongjiang YAN

AU - Xubo ZHAO

PY - 2022

DO - 10.1587/transfun.2021EAL2043

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E105-A

IS - 3

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - March 2022

AB - Binary sequences with high linear complexity and high 2-adic complexity have important applications in communication and cryptography. In this paper, the 2-adic complexity of a class of balanced Whiteman generalized cyclotomic sequences which have high linear complexity is considered. Through calculating the determinant of the circulant matrix constructed by one of these sequences, the result shows that the 2-adic complexity of this class of sequences is large enough to resist the attack of the rational approximation algorithm (RAA) for feedback with carry shift registers (FCSRs).

ER -