The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Exibições de texto completo
109
Sequências periódicas, usadas como chaves em criptosistemas, desempenham um papel importante na criptografia. Tais sequências periódicas devem possuir alta complexidade linear para resistir ao algoritmo BM. Sequências construídas por cosets ciclotômicos têm sido amplamente estudadas nos últimos anos. Neste artigo, a complexidade linear de n-sequências ciclotômicas periódicas de ordem 2 e 4 sobre 𝔽p foi calculado, onde n e p são dois primos ímpares distintos. As conclusões revelam que as sequências apresentadas possuem alta complexidade linear em muitos casos, o que indica que as sequências podem resistir ao ataque linear.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -