Pages that link to "Item:Q1402365"
From MaRDI portal
The following pages link to On the security of modular exponentiation with application to the construction of pseudorandom generators (Q1402365):
Displaying 5 items.
- Paillier's trapdoor function hides \(\Theta(n)\) bits (Q350942) (← links)
- Distribution of exponential functions modulo a prime power (Q740381) (← links)
- Short cycles in repeated exponentiation modulo a prime (Q977189) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- Soficity, short cycles, and the Higman group (Q4645101) (← links)
