On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
From MaRDI portal
Publication:5459082
DOI10.1007/11935230_16zbMath1172.94582MaRDI QIDQ5459082
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
94A60: Cryptography
Related Items
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?, On the Equivalence of Generic Group Models, Breaking RSA Generically Is Equivalent to Factoring, Breaking RSA may be as difficult as factoring, Bootstrapping for approximate homomorphic encryption, Generic hardness of inversion on ring and its relation to self-bilinear map, Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions, On the analysis of cryptographic assumptions in the generic ring model, Towards a security model for computational puzzle schemes