On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms

DOI10.1007/11935230_16zbMATH Open1172.94582OpenAlexW1543878229MaRDI QIDQ5459082FDOQ5459082

Authors: Gregor Leander, Andy Rupp 

Publication date: 24 April 2008

Published in: Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11935230_16

Recommendations

• Breaking RSA Generically Is Equivalent to Factoring
• On the analysis of cryptographic assumptions in the generic ring model
• On the analysis of cryptographic assumptions in the generic ring model
• Breaking RSA may not be equivalent to factoring
• Breaking RSA may be as difficult as factoring

zbMATH Keywords

Factorization ProblemComputational EquivalenceGeneric AlgorithmsRSA Problem

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (12)

• Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
• Breaking RSA may be as difficult as factoring
• Generic hardness of inversion on ring and its relation to self-bilinear map
• Bootstrapping for approximate homomorphic encryption
• Breaking RSA Generically Is Equivalent to Factoring
• On the Equivalence of Generic Group Models
• Breaking RSA Generically Is Equivalent to Factoring
• Using LLL-reduction for solving RSA and factorization problems
• Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
• Towards a security model for computational puzzle schemes
• On the analysis of cryptographic assumptions in the generic ring model
• On the analysis of cryptographic assumptions in the generic ring model

This page was built for publication: On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459082)