The following pages link to Theory of Cryptography (Q5901789):
Displaying 10 items.
- Pseudo-free families of finite computational elementary abelian \(p\)-groups (Q524639) (← links)
- On the rational subset problem for groups. (Q875109) (← links)
- Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
- Pseudo-free families of computational universal algebras (Q2033515) (← links)
- Pseudo-free families and cryptographic primitives (Q2154466) (← links)
- The RSA group is pseudo-free (Q2267366) (← links)
- A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption (Q2317166) (← links)
- Bayesian Authentication: Quantifying Security of the Hancke-Kuhn Protocol (Q3178248) (← links)
- Statistically Hiding Sets (Q3623038) (← links)
- Breaking RSA Generically Is Equivalent to Factoring (Q5901923) (← links)
