Full Text Views
108
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.
Qiuyan WANG
Tiangong University
Yang YAN
Tianjin University of Technology and Education
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
Qiuyan WANG, Yang YAN, "Linear Complexity of n-Periodic Cyclotomic Sequences over 𝔽p" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 5, pp. 785-791, May 2020, doi: 10.1587/transfun.2019EAL2137.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2019EAL2137/_p
Copy
@ARTICLE{e103-a_5_785,
author={Qiuyan WANG, Yang YAN, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Linear Complexity of n-Periodic Cyclotomic Sequences over 𝔽p},
year={2020},
volume={E103-A},
number={5},
pages={785-791},
abstract={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.},
keywords={},
doi={10.1587/transfun.2019EAL2137},
ISSN={1745-1337},
month={May},}
Copy
TY - JOUR
TI - Linear Complexity of n-Periodic Cyclotomic Sequences over 𝔽p
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 785
EP - 791
AU - Qiuyan WANG
AU - Yang YAN
PY - 2020
DO - 10.1587/transfun.2019EAL2137
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2020
AB - 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.
ER -