How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Reconstructing truncated integer variables satisfying linear congruences
SIAM Journal on Computing - Special issue on cryptography
Inferring sequences produced by pseudo-random number generators
Journal of the ACM (JACM)
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Learning decision trees using the Fourier spectrum
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An O(nlog log n) learning algorithm for DNF under the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Shift Register Sequences
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Secret linear congruential generators are not cryptographically secure
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Alternating step generators controlled by De Bruijn sequences
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
On the Fourier spectrum of monotone functions
Journal of the ACM (JACM)
On Some Properties of the Shrinking Generator
Designs, Codes and Cryptography
Correlation Analysis of the Alternating Step Generator
Designs, Codes and Cryptography
Design and Properties of a New Pseudorandom Generator Based on a Filtered FCSR Automaton
IEEE Transactions on Computers
Private stateful circuits secure against probing attacks
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Universally composable and forward-secure RFID authentication and authenticated key exchange
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Guess-and-Determine Algebraic Attack on the Self-Shrinking Generator
Fast Software Encryption
| Hi-index | 0.00 |
We present a new construction of a pseudorandom generator based on a simple combination of two LFSRs. The construction has attractive properties as simplicity (conceptual and implementation-wise), scalability (hardware and security), proven minimal security conditions (exponential period, exponential linear complexity, good statistical properties), and resistance to known attacks. The construction is suitable for practical implementation of efficient stream cipher cryptosystems.