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

DOI10.1007/S00145-004-0215-YMaRDI QIDQ814844zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(13)

• More efficient DDH pseudorandom generators
• Breaking Goppa-based McEliece with hints
• Distribution of exponential functions modulo a prime power
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• Quantum attacks on pseudorandom generators
• Simultaneous Security of Bits in the Discrete Log
• scientific article; zbMATH DE number 7528580 (Why is no real title available?)
• Tightly secure signatures from lossy identification schemes
• Secure PRNGs from Specialized Polynomial Maps over Any $\mathbb{F}_{q}$
• scientific article; zbMATH DE number 4035727 (Why is no real title available?)
• A pseudorandom number generator based on piecewise logistic map
• scientific article; zbMATH DE number 1759796 (Why is no real title available?)
• 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)