FCSR PERIODIC MULTISEQUENCES WITH MAXIMAL JOINT N-ADIC COMPLEXITY AND LARGE k-ERROR JOINT N-ADIC COM

• 作 者: LI Fulin HU Honggang ZHU Shixin
• 机 构: Department of Applied Mathematics, Hefei University of Technology,School of Information Science and
• 出 处: Journal of Systems Science & Complexity
• 发表日期: 2014年02期
• 关键词: Cryptography N-adic numbers joint N-adic complexity k-error joint N-adic complex

Complexity measures for keystream multisequences over Z/(N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic multisequences over Z/(N), and establishes the existence of periodic N-adic multisequences over Z/(N) which simultaneously possess maximal joint N-adic complexity and large k-error joint N-adic complexity. Under some conditions the overwhelming majority of all T-periodic N-adic multisequences over Z/(N) with maximal joint N-adic complexity logN(NT- 1)have a k-error joint N-adic complexity close to logN(NT- 1).

Complexity measures for keystream multisequences over Z / (N) play a crucial role in designing good stream cipher systems. This correspondence shows a general upper bound on k-error joint N-adic complexity of periodic multisequences over Z / (N) the existence of periodic N-adic multisequences over Z / (N) which simultaneously possess maximal joint N-adic complexity and large k-error joint N-adic complexity. Under some conditions the overwhelming majority of all T-periodic N-adic multisequences over Z / (N) with maximal joint N-adic complexity logN (NT-1) have a k-error joint N-adic complexity close to logN (NT-1).