Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
From MaRDI portal
Publication:3604736
Recommendations
- scientific article; zbMATH DE number 3974332
- Cryptanalysis of Pseudo-random Generators Based on Vectorial FCSRs
- scientific article; zbMATH DE number 1555990
- On finite pseudorandom binary sequences and their applications in cryptography
- scientific article; zbMATH DE number 2077097
- An algebraic framework for pseudorandom functions and applications to related-key security
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
- On the semantic security of cellular automata based pseudo-random permutation using results from the Luby-Rackoff construction
- Finite Automata and Application to Cryptography
- On the pseudorandomness of automatic sequences
Cited in
(9)- A matrix approach for FCSR automata
- Breaking the F-FCSR-H Stream Cipher in Real Time
- A lower bound on the linear span of an FCSR
- Breaking the stream ciphers F-FCSR-H and F-FCSR-16 in real time
- Entropy of the Internal State of an FCSR in Galois Representation
- X-FCSR – A New Software Oriented Stream Cipher Based Upon FCSRs
- Fast Software Encryption
- Parallel Generation of ℓ-Sequences
- Some remarks on FCSRs and implications for stream ciphers
This page was built for publication: Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604736)