Pseudo-free families of computational universal algebras
From MaRDI portal
Publication:2033515
DOI10.1515/jmc-2020-0014zbMath1466.94019OpenAlexW3112984371MaRDI QIDQ2033515
Publication date: 17 June 2021
Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/jmc-2020-0014
universal algebra\(n\)-ary groupoidcollision-resistant family of hash functionspseudo-free familyweakly pseudo-free family
Cryptography (94A60) Applications of universal algebra in computer science (08A70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Finitary algebras (08A62)
Related Items (1)
Cites Work
- Pseudo-free families of finite computational elementary abelian \(p\)-groups
- The RSA group is pseudo-free
- A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption
- Algebraic generalization of Diffie-Hellman key exchange
- Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
- Adaptive Pseudo-free Groups and Applications
- Algorithms for Black-Box Fields and their Application to Cryptography
- Sampling from Signed Quadratic Residues: RSA Group Is Pseudofree
- Foundations of Cryptography
- Algebraic aspects of key generation systems
- Foundations of Cryptography
- Asymptotic expansions for a model with distinguished “fast” and “slow” variables, described by a system of singularly perturbed stochastic differential equations
- On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption
- Toward Separating the Strong Adaptive Pseudo-freeness from the Strong RSA Assumption
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Pseudo-free families of computational universal algebras
