The RSA group is pseudo-free

DOI10.1007/S00145-009-9042-5zbMATH Open1182.94044OpenAlexW2156490532MaRDI QIDQ2267366FDOQ2267366

Authors: Daniele Micciancio 

Publication date: 1 March 2010

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-009-9042-5

Recommendations

• The RSA Group is Pseudo-Free
• Theory of Cryptography
• Sampling from signed quadratic residues: RSA group is pseudofree
• Toward separating the strong adaptive pseudo-freeness from the strong RSA assumption
• On the impossibility of proving security of strong-RSA signatures via the RSA assumption

zbMATH Keywords

safe primescryptographic assumptionspseudo-free Abelian groupstrong RSA problem

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• A key distribution system equivalent to factoring
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
• Title not available (Why is that?)
• A simple transitive signature scheme for directed trees
• On the security of public key protocols
• Implicit function theorem over free groups.
• Title not available (Why is that?)
• RSA-based undeniable signatures
• Reconciling two views of cryptography (The computational soundness of formal encryption)
• Theory of Cryptography
• Theory of Cryptography
• Theory of Cryptography
• Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
• Logics for reasoning about cryptographic constructions

Cited In (9)

• 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
• 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
• 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)