On the public citation graph
Breaking RSA may not be equivalent to factoring
0 signed · 212 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-48658-5_26openalex-snapshot
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
inferredcites →https://doi.org/10.1007/3-540-68339-9_14openalex-snapshot
Finding a Small Root of a Univariate Modular Equation
inferredcites →https://doi.org/10.1007/3-540-68697-5_22openalex-snapshot
Algorithms for Black-Box Fields and their Application to Cryptography
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50017-5openalex-snapshot
Algorithms in Number Theory
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1137/0217019openalex-snapshot
Solving Simultaneous Modular Equations of Low Degree
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.2307/1971363openalex-snapshot
Factoring Integers with Elliptic Curves
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470099742.app1openalex-snapshot
Appendix A: Cryptography Primer: Introduction to Cryptographic Principles and Algorithms
inferred← citeshttps://doi.org/10.1002/9781394351930.ch8openalex-snapshot
Nonce Generation for Discrete Logarithm‐Based Signatures
inferred← citeshttps://doi.org/10.1002/wcm.602openalex-snapshot
Provably secure RSA‐type signature based on conic curve
inferred← citeshttps://doi.org/10.1007/10722028_4openalex-snapshot
Lattice Reduction in Cryptology: An Update
inferred← citeshttps://doi.org/10.1007/11586821_2openalex-snapshot
Pairing-Based Cryptography at High Security Levels
inferred← citeshttps://doi.org/10.1007/11593447_1openalex-snapshot
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
inferred← citeshttps://doi.org/10.1007/11596981_14openalex-snapshot
Revised Fischlin’s (Blind) Signature Schemes
inferred← citeshttps://doi.org/10.1007/11779360_12openalex-snapshot
Interpolation of Functions Related to the Integer Factoring Problem
inferred← citeshttps://doi.org/10.1007/11935230_16openalex-snapshot
On the Equivalence of RSA and Factoring Regarding Generic Ring Algorithms
inferred← citeshttps://doi.org/10.1007/11935230_17openalex-snapshot
Trading One-Wayness Against Chosen-Ciphertext Security in Factoring-Based Encryption
inferred← citeshttps://doi.org/10.1007/11941378_12openalex-snapshot
Another Look at “Provable Security”. II
inferred← citeshttps://doi.org/10.1007/3-540-39200-9_28openalex-snapshot
Why Provable Security Matters?
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_1openalex-snapshot
On the Security o a Williams Based Public Key Encryption Scheme
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_12openalex-snapshot
The Two Faces of Lattices in Cryptology
inferred← citeshttps://doi.org/10.1007/3-540-45760-7_8openalex-snapshot
The Representation Problem Based on Factoring
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_17openalex-snapshot
Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups
inferred← citeshttps://doi.org/10.1007/3-540-46035-7_18openalex-snapshot
Optimal Security Proofs for PSS and Other Signature Schemes
inferred← citeshttps://doi.org/10.1007/3-540-46088-8_25openalex-snapshot
The Power of RSA Inversion Oracles and the Security of Chaum’s RSA-Based Blind Signature Scheme
inferred← citeshttps://doi.org/10.1007/3-540-48970-3_12openalex-snapshot
On the Security of an RSA Based Encryption Scheme
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_16openalex-snapshot
The Effectiveness of Lattice Attacks Against Low-Exponent RSA
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_3openalex-snapshot
Foundations of Modern Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4615-0895-3_18openalex-snapshot
Lattices and Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4939-1711-2_3openalex-snapshot
Integer Factorization and RSA
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_19openalex-snapshot
On the Security Loss of Unique Signatures
inferred← citeshttps://doi.org/10.1007/978-3-030-12612-4_9openalex-snapshot
Tight Reductions for Diffie-Hellman Variants in the Algebraic Group Model
inferred← citeshttps://doi.org/10.1007/978-3-030-18732-3_11openalex-snapshot
A Secure Hybrid RSA (SHRSA)-based Lightweight and Efficient Personal Messaging Communication Protocol
inferred← citeshttps://doi.org/10.1007/978-3-030-40186-3_25openalex-snapshot
One-More Assumptions Do Not Help Fiat-Shamir-type Signature Schemes in NPROM
inferred← citeshttps://doi.org/10.1007/978-3-030-45374-9_19openalex-snapshot
On Black-Box Extensions of Non-interactive Zero-Knowledge Arguments, and Signatures Directly from Simulation Soundness
inferred← citeshttps://doi.org/10.1007/978-3-030-45724-2_4openalex-snapshot
On Instantiating the Algebraic Group Model from Falsifiable Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_8openalex-snapshot
Signatures from Sequential-OR Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-56877-1_17openalex-snapshot
Generically Speeding-Up Repeated Squaring Is Equivalent to Factoring: Sharp Thresholds for All Generic-Ring Delay Functions
inferred← citeshttps://doi.org/10.1007/978-3-030-56880-1_21openalex-snapshot
Black-Box Use of One-Way Functions is Useless for Optimal Fair Coin-Tossing
inferred← citeshttps://doi.org/10.1007/978-3-030-57990-6_31openalex-snapshot
Unprovability of Leakage-Resilient Cryptography Beyond the Information-Theoretic Limit
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_13openalex-snapshot
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_14openalex-snapshot
On the Security of Time-Lock Puzzles and Timed Commitments
inferred← citeshttps://doi.org/10.1007/978-3-030-64837-4_24openalex-snapshot
On the Adaptive Security of MACs and PRFs
inferred← citeshttps://doi.org/10.1007/978-3-030-75245-3_15openalex-snapshot
Impossibility on Tamper-Resilient Cryptography with Uniqueness Properties
inferred← citeshttps://doi.org/10.1007/978-3-030-90453-1_19openalex-snapshot
The Cost of Adaptivity in Security Games on Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-90456-2_10openalex-snapshot
Towards Tight Adaptive Security of Non-interactive Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_17openalex-snapshot
On the Non-tightness of Measurement-Based Reductions for Key Encapsulation Mechanism in the Quantum Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-030-92075-3_17openalex-snapshot
Key Encapsulation Mechanism with Tight Enhanced Security in the Multi-user Setting: Impossibility Result and Optimal Tightness
inferred← citeshttps://doi.org/10.1007/978-3-030-92075-3_2openalex-snapshot
Fault-Injection Attacks Against NIST’s Post-Quantum Cryptography Round 3 KEM Candidates
inferred← citeshttps://doi.org/10.1007/978-3-030-97131-1_16openalex-snapshot
On Pairing-Free Blind Signature Schemes in the Algebraic Group Model
inferred← citeshttps://doi.org/10.1007/978-3-030-97131-1_5openalex-snapshot
Lifting Standard Model Reductions to Common Setup Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-07085-3_19openalex-snapshot
Optimal Tightness for Chain-Based Unique Signatures
inferred← citeshttps://doi.org/10.1007/978-3-031-22365-5_26openalex-snapshot
The Price of Verifiability: Lower Bounds for Verifiable Random Functions
inferred← citeshttps://doi.org/10.1007/978-3-031-22972-5_11openalex-snapshot
An Analysis of the Algebraic Group Model
inferred← citeshttps://doi.org/10.1007/978-3-031-35486-1_10openalex-snapshot
A Tightly Secure ID-Based Signature Scheme Under DL Assumption in AGM
inferred← citeshttps://doi.org/10.1007/978-3-031-48621-0_11openalex-snapshot
Generic-Group Lower Bounds via Reductions Between Geometric-Search Problems: With and Without Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-031-48621-0_6openalex-snapshot
Immunizing Backdoored PRGs
inferred← citeshttps://doi.org/10.1007/978-3-031-48624-1_13openalex-snapshot
(Verifiable) Delay Functions from Lucas Sequences
inferred← citeshttps://doi.org/10.1007/978-3-031-57718-5_1openalex-snapshot
On Proving Equivalence Class Signatures Secure from Non-interactive Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-57722-2_2openalex-snapshot
Vector Commitments with Proofs of Smallness: Short Range Proofs and More
inferred← citeshttps://doi.org/10.1007/978-3-031-58737-5_10openalex-snapshot
New Limits of Provable Security and Applications to ElGamal Encryption
inferred← citeshttps://doi.org/10.1007/978-3-031-68388-6_3openalex-snapshot
Limits on the Power of Prime-Order Groups: Separating Q-Type from Static Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-031-91098-2_13openalex-snapshot
A New Approach to Generic Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-032-26734-4_3openalex-snapshot
Hashing in Generic Groups: Completing the AGM-to-GGM Transfer
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_6openalex-snapshot
Lower Bounds on Black-Box Constructions of Pseudorandom Functions
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_7openalex-snapshot
Unique SNARGs with Adaptive Security: Constructions and Black-Box Separations
inferred← citeshttps://doi.org/10.1007/978-3-032-35374-0_3openalex-snapshot
On the Adaptive Security of Key-Unique Threshold Signatures
inferred← citeshttps://doi.org/10.1007/978-3-319-08344-5_19openalex-snapshot
On the Impossibility of Proving Security of Strong-RSA Signatures via the RSA Assumption
inferred← citeshttps://doi.org/10.1007/978-3-319-08783-2_45openalex-snapshot
Statistical Properties of Short RSA Distribution and Their Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-23318-5_1openalex-snapshot
Black-Box Separations on Fiat-Shamir-Type Signatures in the Non-Programmable Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-319-23609-4_13openalex-snapshot
A Real Life Project in Cryptography: Assessment of RSA Keys
inferred← citeshttps://doi.org/10.1007/978-3-319-45871-7_23openalex-snapshot
Impossibility on the Provable Security of the Fiat-Shamir-Type Signatures in the Non-programmable Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-319-63697-9_22openalex-snapshot
PRF-ODH: Relations, Instantiations, and Impossibility Results
inferred← citeshttps://doi.org/10.1007/978-3-319-68637-0_12openalex-snapshot
Impossibility of the Provable Security of the Schnorr Signature from the One-More DL Assumption in the Non-programmable Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-319-70500-2_14openalex-snapshot
Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy
inferred← citeshttps://doi.org/10.1007/978-3-319-93563-8_5openalex-snapshot
An Improved Algorithm to Solve the Systems of Univariate Modular Equations
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_2openalex-snapshot
The Algebraic Group Model and its Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-96881-0_3openalex-snapshot
On Tightly Secure Non-Interactive Key Exchange
inferred← citeshttps://doi.org/10.1007/978-3-319-98113-0_1openalex-snapshot
Lower Bounds on Structure-Preserving Signatures for Bilateral Messages
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_11openalex-snapshot
How to Compress Rabin Ciphertexts and Signatures (and More)
inferred← citeshttps://doi.org/10.1007/978-3-540-39927-8_2openalex-snapshot
A Forward-Secure Blind Signature Scheme Based on the Strong RSA Assumption
inferred← citeshttps://doi.org/10.1007/978-3-540-78440-1_2openalex-snapshot
Recovering NTRU Secret Key from Inversion Oracles
inferred← citeshttps://doi.org/10.1007/978-3-540-78440-1_3openalex-snapshot
Solving Systems of Modular Equations in One Variable: How Many RSA-Encrypted Messages Does Eve Need to Know?
inferred← citeshttps://doi.org/10.1007/978-3-540-85174-5_6openalex-snapshot
Improved Bounds on Security Reductions for Discrete Log Based Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-85886-7_32openalex-snapshot
Strong Accumulators from Collision-Resistant Hashing
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_30openalex-snapshot
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-01001-9_2openalex-snapshot
Breaking RSA Generically Is Equivalent to Factoring
inferred← citeshttps://doi.org/10.1007/978-3-642-02295-1_10openalex-snapshot
Using LLL-Reduction for Solving RSA and Factorization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_24openalex-snapshot
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
inferred← citeshttps://doi.org/10.1007/978-3-642-10628-6_23openalex-snapshot
On Generic Constructions of Designated Confirmer Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-11799-2_16openalex-snapshot
On Related-Secret Pseudorandomness
inferred← citeshttps://doi.org/10.1007/978-3-642-13190-5_10openalex-snapshot
On the Impossibility of Three-Move Blind Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_59openalex-snapshot
Concurrent Knowledge Extraction in the Public-Key Model
inferred← citeshttps://doi.org/10.1007/978-3-642-20465-4_28openalex-snapshot
Efficient Circuit-Size Independent Public Key Encryption with KDM Security
inferred← citeshttps://doi.org/10.1007/978-3-642-23235-0_33openalex-snapshot
A Modified Securities Model Based on Public Key Infrastructure
inferred← citeshttps://doi.org/10.1007/978-3-642-25385-0_34openalex-snapshot
Separating Short Structure-Preserving Signatures from Non-interactive Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-642-27937-9_20openalex-snapshot
The PASSERINE Public Key Encryption and Authentication Mechanism
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_19openalex-snapshot
Group to Group Commitments Do Not Shrink
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_2openalex-snapshot
Another Look at Provable Security
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_33openalex-snapshot
On the Exact Security of Schnorr-Type Signatures in the Random Oracle Model
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_26openalex-snapshot
Black-Box Reductions and Separations in Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-32009-5_47openalex-snapshot
On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_11openalex-snapshot
Why “Fiat-Shamir for Proofs” Lacks a Proof
inferred← citeshttps://doi.org/10.1007/978-3-642-36594-2_19openalex-snapshot
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_27openalex-snapshot
Limitations of the Meta-reduction Technique: The Case of Schnorr Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-42033-7_16openalex-snapshot
Notions of Black-Box Reductions, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_5openalex-snapshot
On the Security of One-Witness Blind Signature Schemes
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_13openalex-snapshot
White-Box Security Notions for Symmetric Encryption Schemes
inferred← citeshttps://doi.org/10.1007/978-3-662-45608-8_20openalex-snapshot
Black-Box Separations for One-More (Static) CDH and Its Generalization
inferred← citeshttps://doi.org/10.1007/978-3-662-45608-8_5openalex-snapshot
Adaptive Security of Constrained PRFs
inferred← citeshttps://doi.org/10.1007/978-3-662-49301-4_23openalex-snapshot
Improving the Big Mac Attack on Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-662-49896-5_10openalex-snapshot
On the Impossibility of Tight Cryptographic Reductions
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_11openalex-snapshot
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
inferred← citeshttps://doi.org/10.1007/978-3-662-64322-8_22openalex-snapshot
Another Look at Extraction and Randomization of Groth’s zk-SNARK
inferred← citeshttps://doi.org/10.1007/978-4-431-55060-0_3openalex-snapshot
Introduction to Public-Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-15-8427-5_4openalex-snapshot
Identity-Based Encryption
inferred← citeshttps://doi.org/10.1007/978-981-15-8711-5_4openalex-snapshot
Impact of Computational Power on Cryptography
inferred← citeshttps://doi.org/10.1007/978-981-95-5125-5_15openalex-snapshot
On the Limits of Non-interactive Blind Signatures
inferred← citeshttps://doi.org/10.1007/978-981-95-5125-5_16openalex-snapshot
New Limits for Homomorphic Encryption
inferred← citeshttps://doi.org/10.1007/978-981-96-9095-4_8openalex-snapshot
Indifferentiability Separations in Ideal Public Key Encryption: Explicit vs. Implicit Rejection
inferred← citeshttps://doi.org/10.1007/978-981-97-8546-9_7openalex-snapshot
Public Auditing with Aggregated Tags for Multiple Users
inferred← citeshttps://doi.org/10.1007/bfb0054129openalex-snapshot
Speeding up discrete log and factoring based schemes via precomputations
inferred← citeshttps://doi.org/10.1007/s00037-016-0122-2openalex-snapshot
Unprovable Security of Perfect NIZK and Non-interactive Non-malleable Commitments
inferred← citeshttps://doi.org/10.1007/s00145-002-0120-1openalex-snapshot
The One-More-RSA-Inversion Problems and the Security of Chaum's Blind Signature Scheme
inferred← citeshttps://doi.org/10.1007/s00145-005-0432-zopenalex-snapshot
Another Look at "Provable Security"
inferred← citeshttps://doi.org/10.1007/s00145-012-9120-yopenalex-snapshot
On the Analysis of Cryptographic Assumptions in the Generic Ring Model
inferred← citeshttps://doi.org/10.1007/s00145-014-9191-zopenalex-snapshot
Concurrent Knowledge Extraction in Public-Key Models
inferred← citeshttps://doi.org/10.1007/s00145-014-9192-yopenalex-snapshot
Breaking RSA May Be As Difficult As Factoring
inferred← citeshttps://doi.org/10.1007/s00145-023-09488-wopenalex-snapshot
Lattice-Based Programmable Hash Functions and Applications
inferred← citeshttps://doi.org/10.1007/s00200-012-0181-9openalex-snapshot
RSA, Dickson, LUC and Williams: a study on four polynomial-type public-key cryptosystems
inferred← citeshttps://doi.org/10.1007/s10207-012-0169-2openalex-snapshot
Strong accumulators from collision-resistant hashing
inferred← citeshttps://doi.org/10.1007/s11042-020-09092-1openalex-snapshot
A color image authenticated encryption using conic curve and Mersenne twister
inferred← citeshttps://doi.org/10.1007/s11432-006-2013-7openalex-snapshot
Provably secure robust threshold partial blind signature
inferred← citeshttps://doi.org/10.1016/j.comcom.2020.06.012openalex-snapshot
A secure authentication scheme with forward secrecy for industrial internet of things using Rabin cryptosystem
inferred← citeshttps://doi.org/10.1016/j.csi.2017.12.004openalex-snapshot
Efficient machine learning over encrypted data with non-interactive communication
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.09.039openalex-snapshot
A New Rabin-type Trapdoor Permutation Equivalent to Factoring
inferred← citeshttps://doi.org/10.1016/j.jksuci.2018.02.004openalex-snapshot
A forward secure signcryption scheme with ciphertext authentication for e-payment systems using conic curve cryptography
inferred← citeshttps://doi.org/10.1016/j.procs.2018.10.397openalex-snapshot
A New Security Framework for Cloud Data
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.013openalex-snapshot
Being a permutation is also orthogonal to one-wayness in quantum world: Impossibilities of quantum one-way permutations from one-wayness primitives
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00400-6openalex-snapshot
How to fake an RSA signature by encoding modular root finding as a SAT problem
inferred← citeshttps://doi.org/10.1017/cbo9781139013673openalex-snapshot
Cryptography and Secure Communication
inferred← citeshttps://doi.org/10.1023/a:1008345904539openalex-snapshot
Information Security, Mathematics, and Public-Key Cryptography
inferred← citeshttps://doi.org/10.1049/iet-ifs:20060142openalex-snapshot
Diffie–Hellman technique: extended to multiple two-party keys and one multi-party key
inferred← citeshttps://doi.org/10.1088/1742-6596/943/1/012057openalex-snapshot
On factoring RSA modulus using random-restart hill-climbing algorithm and Pollard’s rho algorithm
inferred← citeshttps://doi.org/10.1090/s1061-0022-09-01079-6openalex-snapshot
Algebraic cryptography: new constructions and their security against provable break
inferred← citeshttps://doi.org/10.1109/access.2019.2900300openalex-snapshot
A Lightweight and Efficient Secure Hybrid RSA (SHRSA) Messaging Scheme With Four-Layered Authentication Stack
inferred← citeshttps://doi.org/10.1109/access.2021.3138497openalex-snapshot
How to Prove Work: With Time or Memory
inferred← citeshttps://doi.org/10.1109/acct.2012.73openalex-snapshot
Notice of Violation of IEEE Publication Principles: Modified Integer Factorization Algorithm Using V-Factor Method
inferred← citeshttps://doi.org/10.1109/candarw57323.2022.00014openalex-snapshot
On Multi-user Security of Schnorr Signature in Algebraic Group Model
inferred← citeshttps://doi.org/10.1109/csnt.2013.101openalex-snapshot
Designing and Performance Analysis of a Proposed Symmetric Cryptography Algorithm
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00100openalex-snapshot
Indistinguishability Obfuscation via Mathematical Proofs of Equivalence
inferred← citeshttps://doi.org/10.1109/i3ceet61722.2024.10993817openalex-snapshot
Innovative Mechanisms for Improving Cloud Data Safety During Cyber Threats
inferred← citeshttps://doi.org/10.1109/icacomit.2017.8253381openalex-snapshot
An implementation of the H-rabin algorithm in the shamir three-pass protocol
inferred← citeshttps://doi.org/10.1109/ieeestd.2000.92292openalex-snapshot
IEEE Standard Specifications for Public-Key Cryptography
inferred← citeshttps://doi.org/10.1109/peeic59336.2023.10450434openalex-snapshot
The Innovative Cloud Security Environment for Data Privacy
inferred← citeshttps://doi.org/10.1109/setit.2012.6481970openalex-snapshot
Decrypting the ciphertexts of RSA cryptosystem with ciphering function
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743502openalex-snapshot
The security of individual RSA bits
inferred← citeshttps://doi.org/10.1109/sp.2019.00050openalex-snapshot
On the Security of Two-Round Multi-Signatures
inferred← citeshttps://doi.org/10.1109/synasc.2007.61openalex-snapshot
An Extension of the RSA Trapdoor in a KEM/DEM Framework
inferred← citeshttps://doi.org/10.1109/tifs.2012.2232653openalex-snapshot
Online/Offline Signatures for Low-Power Devices
inferred← citeshttps://doi.org/10.1109/tit.2016.2594197openalex-snapshot
Breaking RSA Generically Is Equivalent to Factoring
inferred← citeshttps://doi.org/10.1109/tpds.2012.337openalex-snapshot
Enabling Dynamic Data and Indirect Mutual Trust for Cloud Computing Storage Systems
inferred← citeshttps://doi.org/10.1137/s0036144503439190openalex-snapshot
A Survey of Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1142/9789812799890_0007openalex-snapshot
NUMBER THEORY AND PUBLIC-KEY CRYPTOGRAPHY
inferred← citeshttps://doi.org/10.1145/1655048.1655057openalex-snapshot
Obfuscating straight line arithmetic programs
inferred← citeshttps://doi.org/10.1145/1943513.1943516openalex-snapshot
Key dependent message security
inferred← citeshttps://doi.org/10.1145/1993636.1993652openalex-snapshot
Limits of provable security from standard assumptions
inferred← citeshttps://doi.org/10.1145/2422436.2422480openalex-snapshot
On the power of nonuniformity in proofs of security
inferred← citeshttps://doi.org/10.1145/2976749.2978375openalex-snapshot
Efficient Cryptographic Password Hardening Services from Partially Oblivious Commitments
inferred← citeshttps://doi.org/10.1145/319709.319715openalex-snapshot
On the fly signatures based on factoring
inferred← citeshttps://doi.org/10.1145/3779208.3785261openalex-snapshot
Efficiency Improvements for Signal's Handshake Protocol
inferred← citeshttps://doi.org/10.1515/jmc-2016-0046openalex-snapshot
RSA: A number of formulas to improve the search for p+qp+q
inferred← citeshttps://doi.org/10.1515/jmc-2024-0033openalex-snapshot
On integer sequences in cryptography
inferred← citeshttps://doi.org/10.15803/ijnc.13.2_118openalex-snapshot
On Multi-user Security of Schnorr Signature in Algebraic Group Model
inferred← citeshttps://doi.org/10.1587/transfun.2020dmp0008openalex-snapshot
Impossibility on the Schnorr Signature from the One-More DL Assumption in the Non-Programmable Random Oracle Model
inferred← citeshttps://doi.org/10.1587/transfun.e101.a.77openalex-snapshot
Black-Box Separations on Fiat-Shamir-Type Signatures in the Non-Programmable Random Oracle Model
inferred← citeshttps://doi.org/10.18642/jmsaa_7100121630openalex-snapshot
A STUDY OF SOME METHODS FOR FINDING SMALL ZEROS OF POLYNOMIAL CONGRUENCES APPLIED TO RSA
inferred← citeshttps://doi.org/10.20868/upm.thesis.193openalex-snapshot
Números primos especiales y sus aplicaciones criptográficas
inferred← citeshttps://doi.org/10.22364/bjmc.2017.5.3.02openalex-snapshot
Efficiency of RSA Key Factorization by Open-Source Libraries and Distributed System Architecture
inferred← citeshttps://doi.org/10.26083/tuprints-00002376openalex-snapshot
On the Complexity of Blind Signatures
inferred← citeshttps://doi.org/10.26083/tuprints-00003414openalex-snapshot
On the Foundations of Key Exchange
inferred← citeshttps://doi.org/10.26083/tuprints-00004000openalex-snapshot
Cryptographic Reductions: Classification and Applications to Ideal Models
inferred← citeshttps://doi.org/10.32657/10356/173909openalex-snapshot
Improved packing for fully homomorphic encryption with reverse multiplication friendly embeddings
inferred← citeshttps://doi.org/10.3929/ethz-a-007089360openalex-snapshot
Advice and Randomization in Online Computation
inferred← citeshttps://doi.org/10.3929/ethz-a-007242748openalex-snapshot
Security proofs in number theoretic cryptography
inferred← citeshttps://doi.org/10.4169/amer.math.monthly.119.07.584openalex-snapshot
The Extraordinary Power of Division in Straight Line Programs
inferred← citeshttps://doi.org/10.47749/t/unicamp.2002.251302openalex-snapshot
Criptossistemas baseados em curvas elipticas
inferred← citeshttps://doi.org/10.48550/arxiv.1610.09503openalex-snapshot
The Joint Signature and Encryption Revisited
inferred← citeshttps://doi.org/10.48550/arxiv.2011.00985openalex-snapshot
Computing Power, Key Length and Cryptanalysis. An Unending Battle?
inferred← citeshttps://doi.org/10.48550/arxiv.math/0411531openalex-snapshot
Studies in Cryptological Combinatorics
inferred← citeshttps://doi.org/10.5075/epfl-thesis-5291openalex-snapshot
On the Cryptanalysis of Public-Key Cryptography
inferred← citeshttps://doi.org/10.5269/bspm.82329openalex-snapshot
A binary tree interpretation of shared key generation using modular Ananta-graph paths
inferred← citeshttps://doi.org/10.54254/2753-8818/13/20240864openalex-snapshot
Evaluating RSA encryption: Primality testing, pollard’s algorithms, and security challenges
inferred← citeshttps://doi.org/10.56947/gjom.v6i4.246openalex-snapshot
A digitial signature scheme based simultaneously on the DSA and RSA protocols
inferred← citeshttps://doi.org/10.62056/anr-zoja5openalex-snapshot
The Uber-Knowledge Assumption: A Bridge to the AGM
inferred← citeshttps://doi.org/10.62056/ayfhp2w9popenalex-snapshot
Quantum Black-Box Separations: Succinct Non-Interactive Arguments from Falsifiable Assumptions
inferred← citeshttps://doi.org/10.70675/16812547z40d8z411cz8e13z65480ff1cf00openalex-snapshot
Try again. Fail again. Fail better : new notions of security, broken assumptions, and increased efficiency in cryptography
inferred← citeshttps://doi.org/10.70675/856726a5z3d79z450cz8920z5ae6dc87f10eopenalex-snapshot
Pseudo-random generators and pseudo-random functions : cryptanalysis and complexity measures
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/adb74676z6fffz4da4zab28z0435fd4b6827openalex-snapshot
Zero-knowledge proofs for secure computation
showing the first 200 of 202 · page through all 202
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.