Recommendations
Cites work
- scientific article; zbMATH DE number 1088224 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- A key distribution system equivalent to factoring
- A method for obtaining digital signatures and public-key cryptosystems
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- A simple transitive signature scheme for directed trees
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
- Implicit function theorem over free groups.
- Logics for reasoning about cryptographic constructions
- On the security of public key protocols
- RSA-based undeniable signatures
- Reconciling two views of cryptography (The computational soundness of formal encryption)
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
Cited in
(12)- There are no post-quantum weakly pseudo-free families in any nontrivial variety of expanded groups
- Pseudo-free families and cryptographic primitives
- The RSA Group is Pseudo-Free
- Sampling from signed quadratic residues: RSA group is pseudofree
- Toward separating the strong adaptive pseudo-freeness from the strong RSA assumption
- Pseudo-free families of computational universal algebras
- Adaptive pseudo-free groups and applications
- A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption
- A note on low order assumptions in RSA groups
- Hard isogeny problems over RSA moduli and groups with infeasible inversion
- Theory of Cryptography
- Pseudo-free families of finite computational elementary abelian \(p\)-groups
This page was built for publication: The RSA group is pseudo-free
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267366)
