Pages that link to "Item:Q3787919"
From MaRDI portal
The following pages link to The Discrete Logarithm Hides $O(\log n)$ Bits (Q3787919):
Displaying 8 items.
- Paillier's trapdoor function hides \(\Theta(n)\) bits (Q350942) (← links)
- Mathematical problems in cryptology (Q1910812) (← links)
- All Bits in ax + b mod p are Hard (Q3452346) (← links)
- Gauss periods: orders and cryptographical applications (Q4372701) (← links)
- Secure and efficient off-line digital money (extended abstract) (Q4630266) (← links)
- Quantum attacks on pseudorandom generators (Q4925033) (← links)
- A Kilobit Hidden SNFS Discrete Logarithm Computation (Q5738878) (← links)
- Robust additive randomized encodings from IO and pseudo-non-linear codes (Q6653025) (← links)