On the public citation graph

Redundant Integer Representations and Fast Exponentiation

0 signed · 36 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/978-1-4757-0602-4_5openalex-snapshot
A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography
inferredcites →https://doi.org/10.1016/0898-1221(92)90209-zopenalex-snapshot
Adaptive m-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers
inferredcites →https://doi.org/10.1016/0898-1221(93)90295-7openalex-snapshot
An improved binary algorithm for RSA
inferredcites →https://doi.org/10.1049/el:19820617openalex-snapshot
Fast decipherment algorithm for RSA public-key cryptosystem
inferredcites →https://doi.org/10.1049/el:19890785openalex-snapshot
Minimum weight modified signed-digit representations and fast exponentiation
inferredcites →https://doi.org/10.1049/el:19940949openalex-snapshot
Fast square-and-multiply exponentiation for RSA
inferredcites →https://doi.org/10.1049/ip-e.1989.0023openalex-snapshot
Algorithms for software implementations of RSA
inferredcites →https://doi.org/10.1080/00207169108804009openalex-snapshot
High-radix and bit recoding techniques for modular exponentiation
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1093/qjmam/4.2.236openalex-snapshot
A SIGNED BINARY MULTIPLICATION TECHNIQUE
inferredcites →https://doi.org/10.1109/12.238495openalex-snapshot
Signed digit representations of minimal Hamming weight
inferredcites →https://doi.org/10.1109/12.256444openalex-snapshot
Modular multiplication hardware algorithms with a redundant representation and their application to RSA cryptosystem
inferredcites →https://doi.org/10.1109/71.382314openalex-snapshot
Modulo reduction in residue number systems
inferredcites →https://doi.org/10.1109/tc.1985.1676634openalex-snapshot
High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree
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/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-44647-8_11openalex-snapshot
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-45664-3_27openalex-snapshot
New Minimal Modified Radix-r Representation with Applications to Smart Cards
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_25openalex-snapshot
Differential Power Analysis
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_26openalex-snapshot
An Analysis of Exponentiation Based on Formal Languages
inferred← citeshttps://doi.org/10.1007/3-540-60693-9_6openalex-snapshot
Minimal weight k-SR representations
inferred← citeshttps://doi.org/10.1007/978-1-4614-6859-2_7openalex-snapshot
Signal Processing for Cryptography and Security Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_8openalex-snapshot
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
inferred← citeshttps://doi.org/10.1007/bfb0023285openalex-snapshot
Investigation of non-repudiation protocols
inferred← citeshttps://doi.org/10.1007/bfb0054128openalex-snapshot
How to improve an exponentiation black-box
inferred← citeshttps://doi.org/10.1016/s0167-9260(02)00053-6openalex-snapshot
Hardware architectures for public key cryptography
inferred← citeshttps://doi.org/10.1023/a:1011212615791openalex-snapshot
On String Replacement Exponentiation
inferred← citeshttps://doi.org/10.1080/00207169708804562openalex-snapshot
A fast modular exponentiation for rsa on systolic arrays
inferred← citeshttps://doi.org/10.1109/12.795126openalex-snapshot
Closed-form expression for the average weight of signed-digit representations
inferred← citeshttps://doi.org/10.1109/tc.2004.14openalex-snapshot
Minimal weight digit set conversions
inferred← citeshttps://doi.org/10.1109/tcad.2016.2584181openalex-snapshot
Lower Bound Analysis and Perturbation of Critical Path for Area-Time Efficient Multiple Constant Multiplications
inferred← citeshttps://doi.org/10.1145/2835043.2835046openalex-snapshot
Computing Modular Exponentiation for Fixed-Exponent
inferred← citeshttps://doi.org/10.14257/ijsia.2013.7.6.27openalex-snapshot
Some Explicit Formulae of NAF and its Left-to-Right Analogue Based on Booth Encoding
inferred← citeshttps://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
inferred← citeshttps://doi.org/10.6100/ir564670openalex-snapshot
Speeding up subgroup cryptosystems
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.