On finite pseudorandom binary sequences and their applications in cryptography

zbMATH Open1240.11085MaRDI QIDQ5445484FDOQ5445484

Authors: András Sárközy 

Publication date: 5 March 2008

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

zbMATH Keywords

correlationcomplexitybinary sequencepseudorandom

Mathematics Subject Classification ID

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

Cited In (16)

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

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)