FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\)
From MaRDI portal
Publication:488927
DOI10.1007/s11424-014-2265-zzbMath1395.94296OpenAlexW2022700917MaRDI QIDQ488927
Shixin Zhu, Fulin Li, 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
cryptographystream cipher\(N\)-adic numbers\(k\)-error joint \(N\)-adic complexityjoint \(N\)-adic complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\)
- Improved results on periodic multisequences with large error linear complexity
- Periodic multisequences with large error linear complexity
- Lower bounds on error complexity measures for periodic LFSR and FCSR sequences
- 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
