Breaking RSA generically is equivalent to factoring, with preprocessing
From MaRDI portal
Cites work
- A cryptanalytic time-memory trade-off
- A method for obtaining digital signatures and public-key cryptosystems
- Breaking RSA Generically Is Equivalent to Factoring
- Breaking RSA may not be equivalent to factoring
- Complexity of a determinate algorithm for the discrete logarithm
- Cryptography and Coding
- Fixing cracks in the concrete: random oracles with auxiliary input, revisited
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- scientific article; zbMATH DE number 1258344 (Why is no real title available?)
- scientific article; zbMATH DE number 2086711 (Why is no real title available?)
- Modifications to the number field sieve
- New limits to classical and quantum instance compression
- Non-uniform bounds in the random-permutation, ideal-cipher, and generic-group models
- Non-uniform cracks in the concrete: the power of free precomputation
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- On the instantiability of hash-and-sign RSA signatures
- On the security of time-lock puzzles and timed commitments
- On time-lock cryptographic assumptions in abelian hidden-order groups
- Random oracles and non-uniformity
- Revisiting the Uber assumption in the algebraic group model: fine-grained bounds in hidden-order groups and improved reductions in bilinear groups
- The algebraic group model and its applications
- The Discrete Logarithm problem with preprocessing
- Time space tradeoffs for attacks against one-way functions and PRGs
- To label, or not to label (in generic groups)
- When e-th Roots Become Easier Than Factoring
This page was built for publication: Breaking RSA generically is equivalent to factoring, with preprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864449)
