Breaking RSA may not be equivalent to factoring
From MaRDI portal
Publication:4249628
DOI10.1007/BFb0054117zbMath0922.94008WikidataQ56029172 ScholiaQ56029172MaRDI QIDQ4249628
Dan Boneh, Ramarathnam Venkatesan
Publication date: 10 October 1999
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Related Items
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness, 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?, Breaking RSA Generically Is Equivalent to Factoring, On pairing-free blind signature schemes in the algebraic group model, On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model, Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates, Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness, Lifting standard model reductions to common setup assumptions, The price of verifiability: lower bounds for verifiable random functions, An analysis of the algebraic group model, Lattice-based programmable hash functions and applications, Concurrent knowledge extraction in public-key models, Breaking RSA may be as difficult as factoring, Unprovable security of perfect NIZK and non-interactive non-malleable commitments, How to fake an RSA signature by encoding modular root finding as a SAT problem, On the security loss of unique signatures, RSA: a number of formulas to improve the search for \(p+q\), RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems, Signatures from sequential-OR proofs, Impossibility on tamper-resilient cryptography with uniqueness properties, Black-box use of one-way functions is useless for optimal fair coin-tossing, Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions, On instantiating the algebraic group model from falsifiable assumptions, Another look at extraction and randomization of Groth's zk-SNARK, Optimal tightness for chain-based unique signatures, Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives, 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, Towards tight adaptive security of non-interactive key exchange, A New Rabin-type Trapdoor Permutation Equivalent to Factoring, Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes, Algebraic cryptography: new constructions and their security against provable break, On Related-Secret Pseudorandomness, Improved Bounds on Security Reductions for Discrete Log Based Signatures
