Breaking RSA may not be equivalent to factoring
From MaRDI portal
Publication:4249628
Recommendations
Cited in
(49)- On related-secret pseudorandomness
- Revisiting RSA-polynomial problem and semiprime factorization
- Breaking RSA may be as difficult as factoring
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- The price of verifiability: lower bounds for verifiable random functions
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Concurrent knowledge extraction in public-key models
- On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing
- Immunizing backdoored PRGs
- How to fake an RSA signature by encoding modular root finding as a SAT problem
- On the security loss of unique signatures
- Breaking RSA Generically Is Equivalent to Factoring
- (Verifiable) delay functions from Lucas sequences
- Algorithm for factoring some RSA and Rabin moduli
- Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
- Lifting standard model reductions to common setup assumptions
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness
- Another look at extraction and randomization of Groth's zk-SNARK
- Breaking RSA Generically Is Equivalent to Factoring
- Lattice-based programmable hash functions and applications
- When e-th Roots Become Easier Than Factoring
- A new Rabin-type trapdoor permutation equivalent to factoring
- Using LLL-reduction for solving RSA and factorization problems
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments
- Algebraic cryptography: new constructions and their security against provable break
- On proving equivalence class signatures secure from non-interactive assumptions
- Vector commitments with proofs of smallness: short range proofs and more
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- Optimal tightness for chain-based unique signatures
- Signatures from sequential-OR proofs
- New limits of provable security and applications to ElGamal encryption
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
- Impossibility on tamper-resilient cryptography with uniqueness properties
- RSA: a number of formulas to improve the search for p+q
- Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
- Towards tight adaptive security of non-interactive key exchange
- On pairing-free blind signature schemes in the algebraic group model
- An analysis of the algebraic group model
- Limits on the power of prime-order groups: separating Q-type from static assumptions
- On the analysis of cryptographic assumptions in the generic ring model
- On the adaptive security of MACs and PRFs
- The cost of adaptivity in security games on graphs
- A tightly secure ID-based signature scheme under DL assumption in AGM
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- On black-box extensions of non-interactive zero-knowledge arguments, and signatures directly from simulation soundness
- Black-box use of one-way functions is useless for optimal fair coin-tossing
- On instantiating the algebraic group model from falsifiable assumptions
This page was built for publication: Breaking RSA may not be equivalent to factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4249628)
