Pages that link to "Item:Q5756548"
From MaRDI portal
The following pages link to Efficient Pseudorandom Generators Based on the DDH Assumption (Q5756548):
Displayed 9 items.
- Public key encryption with keyword search secure against keyword guessing attacks without random oracle (Q497143) (← links)
- Distribution of exponential functions modulo a prime power (Q740381) (← links)
- Extractors for binary elliptic curves (Q1009079) (← links)
- Secure simultaneous bit extraction from Koblitz curves (Q1755988) (← links)
- Secure pseudorandom bit generators and point sets with low star-discrepancy (Q2029676) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators (Q3098001) (← links)
- Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ (Q3535361) (← links)
- Privacy-preserving authenticated key exchange in the standard model (Q6135434) (← links)