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 12 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)
- Efficient amplification of the security of weak pseudo-random function generators (Q1402360) (← links)
- On the concrete security of Goldreich's pseudorandom generator (Q1710593) (← links)
- More efficient DDH pseudorandom generators (Q2380399) (← links)
- (Q2739437) (← links)
- The bit security of modular squaring given partial factorization of the modulos (Q3724235) (← links)
- Soficity, short cycles, and the Higman group (Q4645101) (← links)
- On the Provable Security of an Efficient RSA-Based Pseudorandom Generator (Q5459079) (← links)
- Topics in Cryptology – CT-RSA 2004 (Q5901696) (← links)
- \textsf{TOPAS} 2-pass key exchange with full perfect forward secrecy and optimal communication complexity (Q6618628) (← links)
