Efficient Pseudorandom Generators Based on the DDH Assumption

DOI10.1007/978-3-540-71677-8_28MaRDI QIDQ5756548zbMATH OpenOpenAlexFDO

Authors Reza Rezaeian Farashahi, Berry Schoenmakers, 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

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

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
• scientific article; zbMATH DE number 1088241
• scientific article; zbMATH DE number 1302855
• Near-optimal pseudorandom generators for constant-depth read-once formulas
• Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
• scientific article; zbMATH DE number 2086718

Cited in

(9)

• The distinction between fixed and random generators in group-based assumptions
• 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
• 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
• More efficient DDH pseudorandom generators
• Privacy-preserving authenticated key exchange in the standard model

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)