Pages that link to "Item:Q5459082"
From MaRDI portal
The following pages link to On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms (Q5459082):
Displayed 10 items.
- Breaking RSA may be as difficult as factoring (Q271594) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- Generic hardness of inversion on ring and its relation to self-bilinear map (Q1989358) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- On the analysis of cryptographic assumptions in the generic ring model (Q2377063) (← links)
- Towards a security model for computational puzzle schemes (Q3101621) (← links)
- Using LLL-Reduction for Solving RSA and Factorization Problems (Q5188546) (← links)
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know? (Q5445445) (← links)
- On the Equivalence of Generic Group Models (Q5505469) (← links)
- Breaking RSA Generically Is Equivalent to Factoring (Q5901923) (← links)