The RSA group is pseudo-free

DOI10.1007/s00145-009-9042-5zbMath1182.94044OpenAlexW2156490532MaRDI QIDQ2267366

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

zbMATH Keywords

safe primescryptographic assumptionspseudo-free Abelian groupstrong RSA problem

Mathematics Subject Classification ID

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

Related Items

Pseudo-free families and cryptographic primitives ⋮ Pseudo-free families of finite computational elementary abelian \(p\)-groups ⋮ Pseudo-free families of computational universal algebras ⋮ A certain family of subgroups of \(\mathbb{Z}_{n}^{\star}\) is weakly pseudo-free under the general integer factoring intractability assumption

Cites Work

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