Pages that link to "Item:Q3168269"
From MaRDI portal
The following pages link to Number-theoretic constructions of efficient pseudo-random functions (Q3168269):
Displayed 13 items.
- The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) (← links)
- On the linear complexity of the Naor-Reingold sequence with elliptic curves (Q708437) (← links)
- Performance improvement for the GGM-construction of pseudorandom functions (Q864800) (← links)
- A convertible multi-authenticated encryption scheme for group communications (Q942321) (← links)
- On the period of the Naor-Reingold sequence (Q975477) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- On the distribution of the Diffie-Hellman pairs (Q1609391) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- Public-Key Encryption Schemes with Auxiliary Inputs (Q3408205) (← links)
- On the Hardness of Determining Small NFA’s and of Proving Lower Bounds on Their Sizes (Q3532998) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- On the uniformity of distribution of the Naor-Reingold pseudo-random function (Q5941622) (← links)
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)