Computational extractors and pseudorandomness
From MaRDI portal
Recommendations
- Automata, Languages and Programming
- Simple extractors via constructions of cryptographic pseudo-random generators
- Extractors and pseudorandom generators
- Construction of extractors using pseudo-random generators (extended abstract)
- Simple extractors for all min-entropies and a new pseudorandom generator
Cited in
(18)- Extracting randomness from extractor-dependent sources
- Low error efficient computational extractors in the CRS model
- Revocable hierarchical identity-based authenticated key exchange
- Improved computational extractors and their applications
- Witness authenticating NIZKs and applications
- Computational fuzzy extractors
- Immunization against complete subversion without random oracles
- Simple extractors via constructions of cryptographic pseudo-random generators
- Additive combinatorics: with a view towards computer science and cryptography -- an exposition
- Simple extractors for all min-entropies and a new pseudorandom generator
- Extractors with weak random seeds
- scientific article; zbMATH DE number 6963652 (Why is no real title available?)
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- Toward RSA-OAEP without random oracles
- Dimension, Pseudorandomness and Extraction of Pseudorandomness
- Extracting Computational Entropy and Learning Noisy Linear Functions
- Automata, Languages and Programming
- Computational analogues of entropy
This page was built for publication: Computational extractors and pseudorandomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891496)