An improved pseudo-random generator based on the discrete logarithm problem

DOI10.1007/S00145-004-0215-YzbMATH Open1084.68046OpenAlexW2052744260MaRDI QIDQ814844FDOQ814844

Authors: Rosario Gennaro 

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

Recommendations

• scientific article; zbMATH DE number 1759796
• scientific article; zbMATH DE number 1952891
• scientific article; zbMATH DE number 1302855
• Simultaneous Security of Bits in the Discrete Log
• scientific article; zbMATH DE number 4035727

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Cited In (13)

• Simultaneous Security of Bits in the Discrete Log
• Title not available (Why is that?)
• Distribution of exponential functions modulo a prime power
• Tightly secure signatures from lossy identification schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• A pseudorandom number generator based on piecewise logistic map
• Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
• More efficient DDH pseudorandom generators
• Quantum attacks on pseudorandom generators
• Breaking Goppa-based McEliece with hints
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• Decoding McEliece with a hint -- secret Goppa key parts reveal everything

This page was built for publication: An improved pseudo-random generator based on the discrete logarithm problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q814844)