Generalized Fourier Transform and the Joint N-Adic Complexity of a Multisequence

Minghui YANG, Dongdai LIN, Xuan GUANG

  • Full Text Views

    0

  • Cite this

Summary :

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.

Publication
IEICE TRANSACTIONS on Fundamentals Vol.E97-A No.9 pp.1982-1986
Publication Date
2014/09/01
Publicized
Online ISSN
1745-1337
DOI
10.1587/transfun.E97.A.1982
Type of Manuscript
LETTER
Category
Cryptography and Information Security

Authors

Minghui YANG
  Chinese Academy of Sciences
Dongdai LIN
  Chinese Academy of Sciences
Xuan GUANG
  Nankai University

Keyword

FlyerIEICE has prepared a flyer regarding multilingual services. Please use the one in your native language.