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

DOI10.1016/J.JCO.2011.10.006MaRDI QIDQ413471zbMATHOpenAlexFDO

Authors Shixin Zhu, Fulin Li

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

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

Recommendations

• FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Thek-error linear complexity and the linear complexity forpq n-periodic binary sequences
• Periodic sequences with large k-error linear complexity
• Computing the k-Error N-Adic Complexity of a Sequence of Period p n

Cites work

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

Cited in

(8)

• Computing the k-Error N-Adic Complexity of a Sequence of Period p n
• The Asymptotic Behavior of π-Adic Complexity with π2 = − 2
• On the 4-adic complexity of the two-prime quaternary generator
• The asymptotic behavior of \(N\)-adic complexity
• Cryptography and Coding
• Expected π-Adic Security Measures of Sequences
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
• FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413471)