IEICE TRANSACTIONS on Fundamentals
On the Linear Complexity of Legendre Sequences Over Fq
Summary :
In this paper, the linear complexity and minimal polynomials of Legendre sequences over Fq have been calculated, where q = pm and p is a prime number. Our results show that Legendre sequences have high linear complexity over Fq for a large part of prime power number q so that they can resist the linear attack method.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.7 pp.1627-1630
- Publication Date
- 2014/07/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E97.A.1627
- Type of Manuscript
- LETTER
- Category
- Cryptography and Information Security
Authors
Qiuyan WANG
Chinese Academy of Sciences
Dongdai LIN
Chinese Academy of Sciences
Xuan GUANG
Nankai 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
Qiuyan WANG, Dongdai LIN, Xuan GUANG, "On the Linear Complexity of Legendre Sequences Over Fq" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 7, pp. 1627-1630, July 2014, doi: 10.1587/transfun.E97.A.1627.
Abstract: In this paper, the linear complexity and minimal polynomials of Legendre sequences over Fq have been calculated, where q = pm and p is a prime number. Our results show that Legendre sequences have high linear complexity over Fq for a large part of prime power number q so that they can resist the linear attack method.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.1627/_p
Copy
@ARTICLE{e97-a_7_1627,
author={Qiuyan WANG, Dongdai LIN, Xuan GUANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Linear Complexity of Legendre Sequences Over Fq},
year={2014},
volume={E97-A},
number={7},
pages={1627-1630},
abstract={In this paper, the linear complexity and minimal polynomials of Legendre sequences over Fq have been calculated, where q = pm and p is a prime number. Our results show that Legendre sequences have high linear complexity over Fq for a large part of prime power number q so that they can resist the linear attack method.},
keywords={},
doi={10.1587/transfun.E97.A.1627},
ISSN={1745-1337},
month={July},}
Copy
TY - JOUR
TI - On the Linear Complexity of Legendre Sequences Over Fq
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1627
EP - 1630
AU - Qiuyan WANG
AU - Dongdai LIN
AU - Xuan GUANG
PY - 2014
DO - 10.1587/transfun.E97.A.1627
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 7
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - July 2014
AB - In this paper, the linear complexity and minimal polynomials of Legendre sequences over Fq have been calculated, where q = pm and p is a prime number. Our results show that Legendre sequences have high linear complexity over Fq for a large part of prime power number q so that they can resist the linear attack method.
ER -
English
