Pages that link to "Item:Q3191966"
From MaRDI portal
The following pages link to Pseudo-random functions and factoring (extended abstract) (Q3191966):
Displaying 16 items.
- 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)
- Pseudorandom functions in \(\text{TC}^0\) and cryptographic limitations to proving lower bounds (Q1405738) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Exploring crypto dark matter: new simple PRF candidates and their applications (Q1631360) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- A combinatorial approach to quantum random functions (Q2692397) (← links)
- Towards tight adaptive security of non-interactive key exchange (Q2697896) (← links)
- SPRING: Fast Pseudorandom Functions from Rounded Ring Products (Q2946902) (← links)
- Number-theoretic constructions of efficient pseudo-random functions (Q3168269) (← links)
- Fast Pseudorandom Functions Based on Expander Graphs (Q3179351) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- A direct PRF construction from Kolmogorov complexity (Q6637531) (← links)
- Structural lower bounds on black-box constructions of pseudorandom functions (Q6652977) (← links)
