On the public citation graph

Seifert’s RSA Fault Attack: Simplified Analysis and Generalizations

0 signed · 25 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-68339-9_34openalex-snapshot
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
inferredcites →https://doi.org/10.1007/3-540-69053-0_4openalex-snapshot
On the Importance of Checking Cryptographic Protocols for Faults
inferredcites →https://doi.org/10.1007/978-3-540-30580-4_3openalex-snapshot
Experimenting with Faults, Lattices and the DSA
inferredcites →https://doi.org/10.1007/s001450010016openalex-snapshot
On the Importance of Eliminating Errors in Cryptographic Computations
inferredcites →https://doi.org/10.1016/0304-3975(76)90050-5openalex-snapshot
Analysis of a simple factorization algorithm
inferredcites →https://doi.org/10.1109/jproc.2005.862424openalex-snapshot
The Sorcerer's Apprentice Guide to Fault Attacks
inferredcites →https://doi.org/10.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1145/1102120.1102138openalex-snapshot
On authenticated computing and RSA-based authentication

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11889700_1openalex-snapshot
Is It Wise to Publish Your Public RSA Keys?
inferred← citeshttps://doi.org/10.1007/11894063_26openalex-snapshot
Why One Should Also Secure RSA Public Key Elements
inferred← citeshttps://doi.org/10.1007/978-3-031-54409-5_4openalex-snapshot
Fault Attacks Sensitivity of Public Parameters in the Dilithium Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-69485-4openalex-snapshot
Public Key Infrastructure
inferred← citeshttps://doi.org/10.1007/978-3-540-69485-4_13openalex-snapshot
Fault Attacks on Public Key Elements: Application to DLP-Based Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-85053-3_24openalex-snapshot
Perturbating RSA Public Keys: An Improved Attack
inferred← citeshttps://doi.org/10.1007/978-3-642-00862-7_28openalex-snapshot
Fault Attacks on RSA Public Keys: Left-To-Right Implementations Are Also Vulnerable
inferred← citeshttps://doi.org/10.1007/978-3-642-23951-9_13openalex-snapshot
Modulus Fault Attacks against RSA-CRT Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-29101-2_21openalex-snapshot
Structure-Based RSA Fault Attacks
inferred← citeshttps://doi.org/10.1007/978-3-642-29656-7_7openalex-snapshot
A Survey of Differential Fault Analysis Against Classical RSA Implementations
inferred← citeshttps://doi.org/10.1007/s12095-011-0061-3openalex-snapshot
Fault analysis of the NTRUSign digital signature scheme
inferred← citeshttps://doi.org/10.1007/s13389-011-0015-xopenalex-snapshot
Modulus fault attacks against RSA–CRT signatures
inferred← citeshttps://doi.org/10.1109/eurospw51379.2020.00102openalex-snapshot
Nethammer: Inducing Rowhammer Faults through Network Requests
inferred← citeshttps://doi.org/10.1109/fdtc60478.2023.00017openalex-snapshot
Forging Dilithium and Falcon Signatures by Single Fault Injection
inferred← citeshttps://doi.org/10.1109/tdsc.2016.2602352openalex-snapshot
Crashing Modulus Attack on Modular Squaring for Rabin Cryptosystem
inferred← citeshttps://doi.org/10.1109/tifs.2015.2411213openalex-snapshot
Double Counting in $2^{t}$ -ary RSA Precomputation Reveals the Secret Exponent
inferred← citeshttps://doi.org/10.3390/jlpea5030183openalex-snapshot
Delay Insensitive Ternary CMOS Logic for Secure Hardware
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.