On the public citation graph
New Attacks on RSA with Small Secret CRT-Exponents
0 signed · 73 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-44448-3_2openalex-snapshot
Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt ’99
inferredcites →https://doi.org/10.1007/3-540-45708-9_16openalex-snapshot
Cryptanalysis of Unbalanced RSA with Small CRT-Exponent
inferredcites →https://doi.org/10.1007/978-3-030-26951-7openalex-snapshot
Advances in Cryptology – CRYPTO 2019
inferredcites →https://doi.org/10.1007/978-3-642-02620-1openalex-snapshot
Information Security and Privacy
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bfb0024458openalex-snapshot
Finding small roots of univariate modular equations revisited
inferredcites →https://doi.org/10.1007/s001459900029openalex-snapshot
The Size of a Share Must Be Large
inferredcites →https://doi.org/10.1007/s001459900030openalex-snapshot
Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities
inferredcites →https://doi.org/10.1109/18.54902openalex-snapshot
Cryptanalysis of short RSA secret exponents
inferredcites →https://doi.org/10.1109/18.850673openalex-snapshot
Cryptanalysis of RSA with private key d less than N/sup 0.292/
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-21548-4_21openalex-snapshot
The Wiener Attack on RSA Revisited: A Quest for the Exact Bound
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_4openalex-snapshot
Partial Key Exposure Attack on Short Secret Exponent CRT-RSA
inferred← citeshttps://doi.org/10.1007/978-3-031-15911-4_1openalex-snapshot
An Analysis of the Security and Privacy Issues of the Neovote Online Voting System
inferred← citeshttps://doi.org/10.1007/978-3-031-89518-0_10openalex-snapshot
Efficient Management Models for SGX Enclaves
inferred← citeshttps://doi.org/10.1007/978-3-031-91095-1_13openalex-snapshot
Solving Multivariate Coppersmith Problems with Known Moduli
inferred← citeshttps://doi.org/10.1007/978-3-032-10794-7_17openalex-snapshot
Formal Verification of PKCS#1 Signature Parser Using Frama-C
inferred← citeshttps://doi.org/10.1007/978-3-319-07536-5_10openalex-snapshot
New Partial Key Exposure Attacks on CRT-RSA with Large Public Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-13039-2_15openalex-snapshot
Partial Key Exposure Attack on CRT-RSA
inferred← citeshttps://doi.org/10.1007/978-3-319-28166-7_25openalex-snapshot
Partial Key Exposure Attacks on CRT-RSA: Better Cryptanalysis to Full Size Encryption Exponents
inferred← citeshttps://doi.org/10.1007/978-3-319-45871-7_3openalex-snapshot
Partial Key Exposure Attacks on CRT-RSA: General Improvement for the Exposed Least Significant Bits
inferred← citeshttps://doi.org/10.1007/978-3-319-56614-6_5openalex-snapshot
Small CRT-Exponent RSA Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_21openalex-snapshot
Finding Small Roots of Bivariate Integer Polynomial Equations: A Direct Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-74143-5_22openalex-snapshot
A Polynomial Time Attack on RSA with Private CRT-Exponents Smaller Than N 0.073
inferred← citeshttps://doi.org/10.1007/978-3-540-75187-8_4openalex-snapshot
An Efficient LLL Gram Using Buffered Transformations
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_25openalex-snapshot
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
inferred← citeshttps://doi.org/10.1007/978-3-642-01957-9_29openalex-snapshot
Partial Key Exposure Attack on CRT-RSA
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-02295-1_4openalex-snapshot
Progress on LLL and Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-03869-3_88openalex-snapshot
Parallel Lattice Basis Reduction Using a Multi-threaded Schnorr-Euchner LLL Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-11925-5_3openalex-snapshot
Efficient CRT-RSA Decryption for Small Encryption Exponents
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_4openalex-snapshot
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-24861-0_7openalex-snapshot
Security Analysis of an RSA Key Generation Algorithm with a Large Private Key
inferred← citeshttps://doi.org/10.1007/978-3-642-29101-2_25openalex-snapshot
Partial Key Exposure on RSA with Private Exponents Larger Than N
inferred← citeshttps://doi.org/10.1007/978-3-642-31410-0_14openalex-snapshot
A New Attack on RSA and CRT-RSA
inferred← citeshttps://doi.org/10.1007/978-3-642-34601-9_29openalex-snapshot
On the Improvement of Fermat Factorization
inferred← citeshttps://doi.org/10.1007/978-81-322-0970-6_26openalex-snapshot
A Performance-Centric Comparative Study of Hybrid Security Protocol Architectures
inferred← citeshttps://doi.org/10.1007/978-81-322-1771-8_70openalex-snapshot
Cryptanalytic Attacks and Countermeasures on RSA
inferred← citeshttps://doi.org/10.1007/s00145-018-9282-3openalex-snapshot
Small CRT-Exponent RSA Revisited
inferred← citeshttps://doi.org/10.1007/s10623-012-9675-5openalex-snapshot
Cryptanalytic results on ‘Dual CRT’ and ‘Common Prime’ RSA
inferred← citeshttps://doi.org/10.1007/s11276-010-0318-3openalex-snapshot
Towards providing a new lightweight authentication and encryption scheme for MANET
inferred← citeshttps://doi.org/10.1007/s11432-010-4029-2openalex-snapshot
On an attack on RSA with small CRT-exponents
inferred← citeshttps://doi.org/10.1007/s11432-015-5325-7openalex-snapshot
Generalized cryptanalysis of RSA with small public exponent
inferred← citeshttps://doi.org/10.1007/s11432-017-9176-5openalex-snapshot
A better bound for implicit factorization problem with shared middle bits
inferred← citeshttps://doi.org/10.1007/s12652-018-0844-xopenalex-snapshot
Speedy Cloud-RSA homomorphic scheme for preserving data confidentiality in cloud computing
inferred← citeshttps://doi.org/10.1016/j.future.2013.06.008openalex-snapshot
On the improvement of Fermat factorization using a continued fraction technique
inferred← citeshttps://doi.org/10.1016/j.jisa.2020.102531openalex-snapshot
A generalised bound for the Wiener attack on RSA
inferred← citeshttps://doi.org/10.1016/j.jss.2009.04.001openalex-snapshot
Trading decryption for speeding encryption in Rebalanced-RSA
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.031openalex-snapshot
Generalized cryptanalysis of small CRT-exponent RSA
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.04.024openalex-snapshot
Fast rebalanced RSA signature scheme with typical prime generation
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.07.004openalex-snapshot
Extended partial key exposure attacks on RSA: Improvement up to full size decryption exponents
inferred← citeshttps://doi.org/10.1109/access.2020.3031276openalex-snapshot
A Review of Sieve Algorithms in Solving the Shortest Lattice Vector Problem
inferred← citeshttps://doi.org/10.1109/bmei.2009.5305866openalex-snapshot
Multi-Factor Rebalanced RSA-CRT Encryption Schemes
inferred← citeshttps://doi.org/10.1109/icaccct.2012.6320816openalex-snapshot
A novel approach to the design of a new hybrid security protocol architecture
inferred← citeshttps://doi.org/10.1109/icectech.2011.5941965openalex-snapshot
Design of new security algorithm: Using hybrid Cryptography architecture
inferred← citeshttps://doi.org/10.1109/icfn.2009.12openalex-snapshot
Enhancing MANET Security Using Secret Public Keys
inferred← citeshttps://doi.org/10.1109/icsccc51823.2021.9478088openalex-snapshot
Hybrid Cryptography Approach to Secure The Data in Computing Environment
inferred← citeshttps://doi.org/10.1109/iscas66217.2026.11562127openalex-snapshot
Deep Learning-based Public Template Attack against ML-DSA on ARM Microcontrollers
inferred← citeshttps://doi.org/10.1109/itime.2009.5236369openalex-snapshot
Factoring RSA modulo N with high bits of p known revisited
inferred← citeshttps://doi.org/10.1109/tit.2007.901248openalex-snapshot
Dual RSA and Its Security Analysis
inferred← citeshttps://doi.org/10.1109/trustcom.2014.19openalex-snapshot
Secure and Privacy-Friendly Public Key Generation and Certification
inferred← citeshttps://doi.org/10.1155/2014/650537openalex-snapshot
On the Improvement of Wiener Attack on RSA with Small Private Exponent
inferred← citeshttps://doi.org/10.1155/2017/6562953openalex-snapshot
Authentication Protocols for Internet of Things: A Comprehensive Survey
inferred← citeshttps://doi.org/10.1371/journal.pone.0240248openalex-snapshot
Decryption speed up of ElGamal with composite modulus
inferred← citeshttps://doi.org/10.14495/jsiaml.4.37openalex-snapshot
An exhaustive search method to find all small solutions of a multivariate modular linear equation
inferred← citeshttps://doi.org/10.1515/jmc.2008.006openalex-snapshot
On the security of multi-prime RSA
inferred← citeshttps://doi.org/10.1587/transfun.e93.a.1111openalex-snapshot
Key Generation for Fast Inversion of the Paillier Encryption Function
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.19openalex-snapshot
Small Secret CRT-Exponent Attacks on Takagi's RSA
inferred← citeshttps://doi.org/10.3390/s22239444openalex-snapshot
AES Based White Box Cryptography in Digital Signature Verification
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.