scientific article; zbMATH DE number 1302855

MaRDI QIDQ4249340zbMATH OpenFDO

Authors Sarvar Patel, Ganapathy S. Sundaram

Publication date 17 June 1999

zbMATH Keywords

finite fieldone-way functionpseudo-random number generatordiscrete logarithm with short exponentsexponentiation function

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1759796
• Simultaneous Security of Bits in the Discrete Log
• An improved pseudo-random generator based on the discrete logarithm problem
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits

Cited in

(25)

• Decoding McEliece with a hint -- secret Goppa key parts reveal everything
• Computing discrete logarithms in an interval
• Targeted Pseudorandom Generators, Simulation Advice Generators, and Derandomizing Logspace
• Computing interval discrete logarithm problem with restricted jump method
• Bootstrapping for approximate homomorphic encryption
• The magic of ELFs
• The discrete logarithm modulo a composite hides \(O(n)\) bits
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Simultaneous Security of Bits in the Discrete Log
• scientific article; zbMATH DE number 1759796 (Why is no real title available?)
• Tightly secure signatures from lossy identification schemes
• An improved pseudo-random generator based on the discrete logarithm problem
• A pseudorandom number generator based on piecewise logistic map
• The Magic of ELFs
• Tighter Reductions for Forward-Secure Signature Schemes
• Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms
• Solving discrete logarithm problem in an interval using periodic iterates
• Soficity, short cycles, and the Higman group
• Efficient Pseudorandom Generators Based on the DDH Assumption
• More efficient DDH pseudorandom generators
• scientific article; zbMATH DE number 1952891 (Why is no real title available?)
• Breaking Goppa-based McEliece with hints
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• Non-malleable functions and their applications
• On the tightness of forward-secure signature reductions

This page was built for publication:

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