Recently the word-based stream ciphers have been the subject of a considerable amount of research. The theory of such stream ciphers requires the study of the complexity of a multisequence. Let S1, S2, . . . , Sm be m N-ary sequences of period T, i.e., a multisequence. The relationship between the joint N-adic complexity and the number of the nonzero columns of the generalized Fourier transform for the N-ary multisequence is determined which generalizes the well-known result about the joint linear complexity and the generalized Fourier transform for a multisequence to the case of the joint N-adic complexity.
Minghui YANG
Chinese Academy of Sciences
Dongdai LIN
Chinese Academy of Sciences
Xuan GUANG
Nankai University
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
Minghui YANG, Dongdai LIN, Xuan GUANG, "Generalized Fourier Transform and the Joint N-Adic Complexity of a Multisequence" in IEICE TRANSACTIONS on Fundamentals,
vol. E97-A, no. 9, pp. 1982-1986, September 2014, doi: 10.1587/transfun.E97.A.1982.
Abstract: Recently the word-based stream ciphers have been the subject of a considerable amount of research. The theory of such stream ciphers requires the study of the complexity of a multisequence. Let S1, S2, . . . , Sm be m N-ary sequences of period T, i.e., a multisequence. The relationship between the joint N-adic complexity and the number of the nonzero columns of the generalized Fourier transform for the N-ary multisequence is determined which generalizes the well-known result about the joint linear complexity and the generalized Fourier transform for a multisequence to the case of the joint N-adic complexity.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1587/transfun.E97.A.1982/_p
Copy
@ARTICLE{e97-a_9_1982,
author={Minghui YANG, Dongdai LIN, Xuan GUANG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Generalized Fourier Transform and the Joint N-Adic Complexity of a Multisequence},
year={2014},
volume={E97-A},
number={9},
pages={1982-1986},
abstract={Recently the word-based stream ciphers have been the subject of a considerable amount of research. The theory of such stream ciphers requires the study of the complexity of a multisequence. Let S1, S2, . . . , Sm be m N-ary sequences of period T, i.e., a multisequence. The relationship between the joint N-adic complexity and the number of the nonzero columns of the generalized Fourier transform for the N-ary multisequence is determined which generalizes the well-known result about the joint linear complexity and the generalized Fourier transform for a multisequence to the case of the joint N-adic complexity.},
keywords={},
doi={10.1587/transfun.E97.A.1982},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Generalized Fourier Transform and the Joint N-Adic Complexity of a Multisequence
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1982
EP - 1986
AU - Minghui YANG
AU - Dongdai LIN
AU - Xuan GUANG
PY - 2014
DO - 10.1587/transfun.E97.A.1982
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E97-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2014
AB - Recently the word-based stream ciphers have been the subject of a considerable amount of research. The theory of such stream ciphers requires the study of the complexity of a multisequence. Let S1, S2, . . . , Sm be m N-ary sequences of period T, i.e., a multisequence. The relationship between the joint N-adic complexity and the number of the nonzero columns of the generalized Fourier transform for the N-ary multisequence is determined which generalizes the well-known result about the joint linear complexity and the generalized Fourier transform for a multisequence to the case of the joint N-adic complexity.
ER -