FCSR periodic multisequences with maximal joint N-adic complexity and large k-error joint N-adic complexity over Z/(N)

DOI10.1007/S11424-014-2265-ZMaRDI QIDQ488927zbMATH OpenOpenAlexFDO

Authors Fulin Li, Shixin Zhu, Hong Gang Hu

Publication date 27 January 2015

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-014-2265-z

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)
• A fast algorithm for the 2-adic joint complexity of \(p^n\)-periodic binary multisequence
• On the Expected Value of the Joint 2-Adic Complexity of Periodic Binary Multisequences
• On the $2$-Adic Complexity and the $k$-Error $2$-Adic Complexity of Periodic Binary Sequences
• On the 2-Adic Complexity and the k-Error 2-Adic Complexity of Periodic Binary Sequences
• On the joint 2-adic complexity of binary multisequences
• Computing the k-Error N-Adic Complexity of a Sequence of Period p n
• scientific article; zbMATH DE number 2247712
• Periodic sequences with maximal linear complexity and large \(k\)-error linear complexity
• Periodic multisequences with large error linear complexity

Cites work

• scientific article; zbMATH DE number 1740055 (Why is no real title available?)
• 2-Adic shift registers
• A Survey of Feedback with Carry Shift Registers
• Algebraic Shift Register Sequences
• Algebraic coding theory
• 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
• Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
• New Results on Periodic Sequences With Large $k$-Error Linear Complexity
• Periodic multisequences with large error linear complexity
• Periodic sequences with large k-error linear complexity
• Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)
• 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

(3)

• Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)
• The asymptotic behavior of \(N\)-adic complexity
• Computing the k-Error N-Adic Complexity of a Sequence of Period p n

This page was built for publication: FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)

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