On finite pseudorandom binary sequences and their applications in cryptography

MaRDI QIDQ5445484zbMATH OpenFDO

Authors András Sárközy

Publication date 5 March 2008

zbMATH Keywords

correlationcomplexitybinary sequencepseudorandom

Mathematics Subject Classification ID

Pseudo-random numbers; Monte Carlo methods (11K45)

Recommendations

• On finite pseudorandom binary lattices
• On pseudorandomness of families of binary sequences
• The study of some pseudorandom sequences used in cryptography
• Binary Pseudo-Random Sequences Theory
• On pseudorandom sequences and their application

Cited in

(16)

• Secure function extensions to additively homomorphic cryptosystems
• scientific article; zbMATH DE number 5901698 (Why is no real title available?)
• On the correlation of families of pseudorandom sequences of \(k\) symbols
• On \(p\)-pseudorandom binary sequences
• More constructions of pseudorandom lattices of \(k\) symbols
• An efficient binary sequence generator with cryptographic applications
• On finite pseudorandom binary sequences IV: The Liouville function, II
• Correlation measure, linear complexity and maximum order complexity for families of binary sequences
• Some Results on FCSR Automata With Applications to the Security of FCSR-Based Pseudorandom Generators
• On the pseudorandomness of automatic sequences
• On finite pseudorandom binary lattices
• More constructions of pseudorandom sequences of \(k\) symbols
• On pseudorandom sequences and their application
• On finite pseudorandom lattices of \(k\) symbols
• Construction of pseudorandom binary lattices using elliptic curves
• Hamming correlation of higher order

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)