An improved pseudo-random generator based on discrete log

DOI10.1007/3-540-44598-6_29MaRDI QIDQ4536819zbMATH OpenFDO

Authors Rosario Gennaro

Publication date 6 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44598-6_29

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• An improved pseudo-random generator based on the discrete logarithm problem
• An efficient discrete log pseudo random generator
• A pseudorandom number generator based on piecewise logistic map
• scientific article; zbMATH DE number 4035727
• scientific article; zbMATH DE number 7561734
• An improved pseudorandom generator based on hardness of factoring
• New pseudo-random number generator based on improved discrete-space chaotic map
• Improvement of probabilistic public key cryptosystems using discrete logarithm

Cited in

(25)

• The discrete logarithm modulo a composite hides \(O(n)\) bits
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• Bootstrapping for approximate homomorphic encryption
• Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• More efficient DDH pseudorandom generators
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Indistinguishable proofs of work or knowledge
• Tightly secure signatures from lossy identification schemes
• Solving discrete logarithm problem in an interval using periodic iterates
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• A pseudorandom number generator based on piecewise logistic map
• QUAD: A Practical Stream Cipher with Provable Security
• scientific article; zbMATH DE number 3928174 (Why is no real title available?)
• Simultaneous Security of Bits in the Discrete Log
• scientific article; zbMATH DE number 4035727 (Why is no real title available?)
• An efficient discrete log pseudo random generator
• An improved pseudorandom generator based on hardness of factoring
• Computing discrete logarithms in an interval
• A probabilistic polynomial-time calculus for analysis of cryptographic protocols (preliminary report)
• Computing interval discrete logarithm problem with restricted jump method
• On a Fast Version of a Pseudorandom Generator
• Two-round 2PC ECDSA at the cost of 1 OLE: applications to embedded cryptocurrency wallets
• An asymmetric Diffie-Hellman protocol with enhanced efficiency through parallelization
• An improved pseudo-random generator based on the discrete logarithm problem

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

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