Efficient Pseudorandom Generators Based on the DDH Assumption

DOI10.1007/978-3-540-71677-8_28zbMath1161.65305OpenAlexW2159786810MaRDI QIDQ5756548

Berry Schoenmakers, Reza Rezaeian Farashahi, Andrey Sidorenko

Publication date: 4 September 2007

Published in: Public Key Cryptography – PKC 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-71677-8_28

Mathematics Subject Classification ID

Cryptography (94A60) Random number generation in numerical analysis (65C10)

Related Items (9)

More efficient DDH pseudorandom generators ⋮ Privacy-preserving authenticated key exchange in the standard model ⋮ 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 ⋮ Secure simultaneous bit extraction from Koblitz curves ⋮ Secure pseudorandom bit generators and point sets with low star-discrepancy ⋮ Distribution of exponential functions modulo a prime power ⋮ Extractors for binary elliptic curves ⋮ A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators

This page was built for publication: Efficient Pseudorandom Generators Based on the DDH Assumption