Pseudorandom generators and the frequency of simplicity

zbMATH Open0862.94014MaRDI QIDQ2563546FDOQ2563546

Authors: Yenjo Han, Lane A. Hemaspaandra 

Publication date: 26 May 1997

Published in: Journal of Cryptology (Search for Journal in Brave)

Recommendations

• Pseudorandom generators and the frequency of simplicity
• Pseudorandom Generators and Typically-Correct Derandomization
• A primer on pseudorandom generators
• scientific article; zbMATH DE number 4182679
• On the Existence of Pseudorandom Generators
• Characterizing pseudoentropy and simplifying pseudorandom generator constructions
• Stochastic investigations of pseudo-random number generators
• scientific article; zbMATH DE number 4141372
• scientific article; zbMATH DE number 3894341

zbMATH Keywords

computational complexityKolmogorov complexitypseudorandom generators

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (3)

• Title not available (Why is that?)
• Pseudorandom generators against advised context-free languages
• Pseudorandom generators and the frequency of simplicity

This page was built for publication: Pseudorandom generators and the frequency of simplicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2563546)