On finite pseudorandom binary sequences and their applications in cryptography
From MaRDI portal
(Redirected from Publication:5445484)
Recommendations
Cited in
(19)- The study of some pseudorandom sequences used in cryptography
- On the pseudorandomness of automatic sequences
- Hamming correlation of higher order
- Correlation measure, linear complexity and maximum order complexity for families of binary sequences
- More constructions of pseudorandom lattices of \(k\) symbols
- More constructions of pseudorandom sequences of \(k\) symbols
- An efficient binary sequence generator with cryptographic applications
- scientific article; zbMATH DE number 5901698 (Why is no real title available?)
- Construction of pseudorandom binary lattices using elliptic curves
- On the correlation of families of pseudorandom sequences of \(k\) symbols
- Binary Pseudo-Random Sequences Theory
- On pseudorandom sequences and their application
- Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
- scientific article; zbMATH DE number 1245626 (Why is no real title available?)
- On finite pseudorandom binary sequences IV: The Liouville function, II
- On finite pseudorandom binary lattices
- On p-pseudorandom binary sequences
- On finite pseudorandom lattices of \(k\) symbols
- Secure function extensions to additively homomorphic cryptosystems
This page was built for publication: On finite pseudorandom binary sequences and their applications in cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445484)
