Pages that link to "Item:Q3149873"
From MaRDI portal
The following pages link to Pseudorandom Functions and Factoring (Q3149873):
Displaying 12 items.
- On optimal cryptographic key derivation (Q388109) (← links)
- The communication complexity of addition (Q519955) (← links)
- Pseudorandom properties of prime factors (Q558325) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- On the security of modular exponentiation with application to the construction of pseudorandom generators (Q1402365) (← links)
- Practical chosen ciphertext secure encryption from factoring (Q1946594) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- Number-theoretic constructions of efficient pseudo-random functions (Q3168269) (← links)
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems (Q3408192) (← links)
- Practical Chosen Ciphertext Secure Encryption from Factoring (Q3627442) (← links)
- (Q4828961) (← links)
- Small bias requires large formulas (Q5002692) (← links)