Efficient Pseudorandom Generators Based on the DDH Assumption
From MaRDI portal
Recommendations
- More efficient DDH pseudorandom generators
- Efficient deterministic and non-deterministic pseudorandom number generation
- Pseudorandom Generators and Typically-Correct Derandomization
- On a Fast Version of a Pseudorandom Generator
- An asymptotically perfect pseudorandom generator
- `Pseudo-random' number generation within cryptographic algorithms: The DDS case
- An efficient discrete log pseudo random generator
- Near-optimal pseudorandom generators for constant-depth read-once formulas
- Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
- A practice-oriented treatment of pseudorandom number generators
Cited in
(11)- Extractors for binary elliptic curves
- Secure simultaneous bit extraction from Koblitz curves
- Secure pseudorandom bit generators and point sets with low star-discrepancy
- The distinction between fixed and random generators in group-based assumptions
- More efficient DDH pseudorandom generators
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
- Public key encryption with keyword search secure against keyword guessing attacks without random oracle
- Privacy-preserving authenticated key exchange in the standard model
- Generation of two ``Independent points on an elliptic curve of \(j\)-invariant \(\neq 0, 1728\)
- Round-optimal authenticated key exchange with full forward privacy
- Distribution of exponential functions modulo a prime power
This page was built for publication: Efficient Pseudorandom Generators Based on the DDH Assumption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756548)
