Pages that link to "Item:Q3718620"
From MaRDI portal
The following pages link to Simultaneous Security of Bits in the Discrete Log (Q3718620):
Displaying 8 items.
- Paillier's trapdoor function hides \(\Theta(n)\) bits (Q350942) (← links)
- An improved pseudo-random generator based on the discrete logarithm problem (Q814844) (← links)
- Minimum disclosure proofs of knowledge (Q1110348) (← links)
- The discrete logarithm modulo a composite hides \(O(n)\) bits (Q1317484) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography (Q2470209) (← links)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits (Q3339289) (← links)
- Topics in Cryptology – CT-RSA 2005 (Q5710833) (← links)