The following pages link to (Q4536819):
Displaying 18 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- A pseudorandom number generator based on piecewise logistic map (Q335763) (← links)
- An improved pseudo-random generator based on the discrete logarithm problem (Q814844) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- On the security of modular exponentiation with application to the construction of pseudorandom generators (Q1402365) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms (Q2059908) (← links)
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity (Q2414928) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates (Q3297479) (← links)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits (Q3339289) (← links)
- QUAD: A Practical Stream Cipher with Provable Security (Q3593092) (← links)
- Simultaneous Security of Bits in the Discrete Log (Q3718620) (← links)
- Computing discrete logarithms in an interval (Q4912022) (← links)
- A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols (Q4917062) (← links)
- Computing Interval Discrete Logarithm Problem with Restricted Jump Method (Q4988923) (← links)
