Pages that link to "Item:Q4249628"
From MaRDI portal
The following pages link to Breaking RSA may not be equivalent to factoring (Q4249628):
Displaying 46 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- Breaking RSA may be as difficult as factoring (Q271594) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- RSA: a number of formulas to improve the search for \(p+q\) (Q1684046) (← links)
- RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems (Q1938506) (← links)
- Signatures from sequential-OR proofs (Q2055653) (← links)
- Impossibility on tamper-resilient cryptography with uniqueness properties (Q2061927) (← links)
- Black-box use of one-way functions is useless for optimal fair coin-tossing (Q2096541) (← links)
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions (Q2102077) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
- Optimal tightness for chain-based unique signatures (Q2170062) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- On the analysis of cryptographic assumptions in the generic ring model (Q2377063) (← links)
- On the adaptive security of MACs and PRFs (Q2692364) (← links)
- The cost of adaptivity in security games on graphs (Q2697875) (← links)
- Towards tight adaptive security of non-interactive key exchange (Q2697896) (← links)
- A new Rabin-type trapdoor permutation equivalent to factoring (Q2804935) (← links)
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes (Q2829951) (← links)
- Algebraic cryptography: new constructions and their security against provable break (Q3079281) (← links)
- On Related-Secret Pseudorandomness (Q3408199) (← links)
- Improved Bounds on Security Reductions for Discrete Log Based Signatures (Q3600215) (← links)
- On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness (Q5041170) (← 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)
- Breaking RSA Generically Is Equivalent to Factoring (Q5892390) (← links)
- Breaking RSA Generically Is Equivalent to Factoring (Q5901923) (← links)
- On pairing-free blind signature schemes in the algebraic group model (Q6113966) (← links)
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model (Q6157502) (← links)
- Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates (Q6157511) (← links)
- Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness (Q6157528) (← links)
- Lifting standard model reductions to common setup assumptions (Q6169031) (← links)
- The price of verifiability: lower bounds for verifiable random functions (Q6169431) (← links)
- An analysis of the algebraic group model (Q6175979) (← links)
- Lattice-based programmable hash functions and applications (Q6182001) (← links)
- A tightly secure ID-based signature scheme under DL assumption in AGM (Q6535485) (← links)
- Revisiting RSA-polynomial problem and semiprime factorization (Q6558638) (← links)
- Immunizing backdoored PRGs (Q6582215) (← links)
- Generic-group lower bounds via reductions between geometric-search problems: with and without preprocessing (Q6582221) (← links)
- (Verifiable) delay functions from Lucas sequences (Q6587959) (← links)
- On proving equivalence class signatures secure from non-interactive assumptions (Q6635743) (← links)
- Vector commitments with proofs of smallness: short range proofs and more (Q6635763) (← links)
- New limits of provable security and applications to ElGamal encryption (Q6637527) (← links)
- Limits on the power of prime-order groups: separating Q-type from static assumptions (Q6652960) (← links)
