Register synthesis for algebraic feedback shift registers based on non-primes
From MaRDI portal
Publication:1878294
DOI10.1023/B:DESI.0000015886.71135.e1zbMath1064.94012MaRDI QIDQ1878294
Publication date: 19 August 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
cryptographypseudorandom generatorBerlekamp-Massey algorithmstream cipherfeedback shift registerN-adic numbersregister synthesis
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Recurrences (11B37)
Related Items (9)
Estimate of 4-adic complexity of unified quaternary sequences of length \(2p \) ⋮ Periodic sequences with maximal \(N\)-adic complexity and large \(k\)-error \(N\)-adic complexity over \(Z/(N)\) ⋮ On lattice-based algebraic feedback shift registers synthesis for multisequences ⋮ Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time ⋮ FCSR periodic multisequences with maximal joint \(N\)-adic complexity and large \(k\)-error joint \(N\)-adic complexity over \(\mathbb Z/(N)\) ⋮ Solving the FCSR synthesis problem for multi-sequences by lattice basis reduction ⋮ AFSRs synthesis with the extended Euclidean rational approximation algorithm ⋮ Expected π-Adic Security Measures of Sequences ⋮ A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
This page was built for publication: Register synthesis for algebraic feedback shift registers based on non-primes
