On the public citation graph

SPA resistant Elliptic Curve Cryptosystem using Addition Chains

0 signed · 27 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-36400-5_22openalex-snapshot
The Montgomery Powering Ladder
inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/3-540-44709-1_31openalex-snapshot
Protections against Differential Analysis for Elliptic Curve Cryptography — An Algebraic Approach —
inferredcites →https://doi.org/10.1007/3-540-48059-5_14openalex-snapshot
Power Analysis Attacks of Modular Exponentiation in Smartcards
inferredcites →https://doi.org/10.1007/3-540-48059-5_25openalex-snapshot
Resistance Against Differential Power Analysis For Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1007/3-540-48405-1_25openalex-snapshot
Differential Power Analysis
inferredcites →https://doi.org/10.1007/978-3-540-45238-6_4openalex-snapshot
Power-Analysis Attacks on an FPGA – First Experimental Results
inferredcites →https://doi.org/10.1016/j.micpro.2004.03.006openalex-snapshot
An FPGA implementation of a GF(p) ALU for encryption processors
inferredcites →https://doi.org/10.1023/a:1008354106356openalex-snapshot
The State of Elliptic Curve Cryptography
inferredcites →https://doi.org/10.1073/pnas.72.12.4720openalex-snapshot
Analysis of the subtractive algorithm for greatest common divisors
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/itcc.2005.33openalex-snapshot
A scalable dual mode arithmetic unit for public key cryptosystems
inferredcites →https://doi.org/10.1109/itng.2006.107openalex-snapshot
Parallel Hardware Architectures for the Cryptographic Tate Pairing
inferredcites →https://doi.org/10.1109/norchp.2006.329227openalex-snapshot
Versatile Processor for GF(pm) Arithmetic for use in Cryptographic Applications
inferredcites →https://doi.org/10.1109/tvlsi.2002.801608openalex-snapshot
A microcoded elliptic curve processor using FPGA technology
inferredcites →https://doi.org/10.1145/503048.503055openalex-snapshot
Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s11042-016-3272-yopenalex-snapshot
Faster elliptic curve arithmetic for triple-base chain by reordering sequences of field operations
inferred← citeshttps://doi.org/10.1007/s13389-012-0042-2openalex-snapshot
Co- $$Z$$ ECC scalar multiplications for hardware, software and hardware–software co-design on embedded systems
inferred← citeshttps://doi.org/10.1049/iet-cdt.2016.0033openalex-snapshot
High‐performance elliptic curve cryptography processor over NIST prime fields
inferred← citeshttps://doi.org/10.1109/acssc.2010.5757580openalex-snapshot
Hardware implementation of DBNS recoding for ECC processor
inferred← citeshttps://doi.org/10.1109/dsd.2009.140openalex-snapshot
Low-Power Low-Energy Prime-Field ECC Processor Based on Montgomery Modular Inverse Algorithm
inferred← citeshttps://doi.org/10.1109/idt.2008.4802493openalex-snapshot
Low-power flexible GF(p) elliptic-curve cryptography processor
inferred← citeshttps://doi.org/10.1109/iolts.2009.5196010openalex-snapshot
Error detection in addition chain based ECC Point Multiplication
inferred← citeshttps://doi.org/10.1109/iscas.2009.5117903openalex-snapshot
Very low-power flexible GF(p) elliptic-curve crypto-processor for non-time-critical applications
inferred← citeshttps://doi.org/10.1631/jzus.c0910660openalex-snapshot
A low-power and low-energy flexible GF(p) elliptic-curve cryptography processor
inferred← citeshttps://doi.org/10.20948/mvk-2022-119openalex-snapshot
Bellman's, Knut's, Lupanov's, Pippenger's problems and their variations as generalizations of the addition chain problem
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.