On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms

DOI10.1007/11935230_16zbMath1172.94582OpenAlexW1543878229MaRDI QIDQ5459082

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

zbMATH Keywords

Factorization ProblemComputational EquivalenceGeneric AlgorithmsRSA Problem

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Breaking RSA may be as difficult as factoring ⋮ On the analysis of cryptographic assumptions in the generic ring model ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Generic hardness of inversion on ring and its relation to self-bilinear map ⋮ 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? ⋮ Breaking RSA Generically Is Equivalent to Factoring ⋮ Towards a security model for computational puzzle schemes ⋮ On the Equivalence of Generic Group Models ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions

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