For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Generalized Fourier Transform and the Joint N-Adic Complexity of a Multisequence
Minghui YANG Dongdai LIN Xuan GUANG
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/09/01
Online ISSN: 1745-1337
Type of Manuscript: LETTER
Category: Cryptography and Information Security
multisequence, joint N-adic complexity, generalized Fourier transform,
Full Text: PDF(100.7KB)>>
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.