Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\)

DOI10.1016/j.jco.2011.10.006zbMath1277.94049OpenAlexW1978253633MaRDI QIDQ413471

Fulin Li, Shixin Zhu

Publication date: 7 May 2012

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2011.10.006

zbMATH Keywords

cryptographystream cipher\(k\)-error \(N\)-adic complexity\(N\)-adic complexity\(N\)-adic numbers

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Arithmetic theory of polynomial rings over finite fields (11T55)

Related Items (2)

FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) ⋮ On the 4-adic complexity of the two-prime quaternary generator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved results on periodic multisequences with large error linear complexity
• The stability theory of stream ciphers
• Feedback shift registers, 2-adic span, and combiners with memory
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Register synthesis for algebraic feedback shift registers based on non-primes
• Algebraic Shift Register Sequences
• Computing the k-Error N-Adic Complexity of a Sequence of Period p n
• Feedback With Carry Shift Registers Synthesis With the Euclidean Algorithm
• 2-Adic shift registers
• Periodic sequences with large k-error linear complexity
• New Results on Periodic Sequences With Large $k$-Error Linear Complexity
• A Survey of Feedback with Carry Shift Registers
• Fast Software Encryption

This page was built for publication: Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\)