An improved pseudo-random generator based on the discrete logarithm problem
From MaRDI portal
Publication:814844
DOI10.1007/s00145-004-0215-yzbMath1084.68046OpenAlexW2052744260MaRDI QIDQ814844
Publication date: 8 February 2006
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-004-0215-y
Related Items (7)
Tightly secure signatures from lossy identification schemes ⋮ More efficient DDH pseudorandom generators ⋮ Breaking Goppa-based McEliece with hints ⋮ Decoding McEliece with a hint -- secret Goppa key parts reveal everything ⋮ Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$ ⋮ Quantum attacks on pseudorandom generators ⋮ Distribution of exponential functions modulo a prime power
This page was built for publication: An improved pseudo-random generator based on the discrete logarithm problem
