On the public citation graph

An Efficient Montgomery Exponentiation Algorithm for Cryptographic Applications

0 signed · 37 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.1006/jagm.1997.0913openalex-snapshot
A Survey of Fast Exponentiation Methods
inferredcites →https://doi.org/10.1007/3-540-36077-8_43openalex-snapshot
Efficient Parallel Modular Exponentiation Algorithm
inferredcites →https://doi.org/10.1007/3-540-39568-7_2openalex-snapshot
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
inferredcites →https://doi.org/10.1007/3-540-46877-3_21openalex-snapshot
A Cryptographic Library for the Motorola DSP56000
inferredcites →https://doi.org/10.1016/s0020-0190(98)00031-3openalex-snapshot
A common-multiplicand method to the montgomery algorithm for speeding up exponentiation
inferredcites →https://doi.org/10.1049/el:19931055openalex-snapshot
Common-multiplicand multiplication and its applications to public key cryptography
inferredcites →https://doi.org/10.1049/el:19951189openalex-snapshot
Improved generalisation common-multiplicandmultiplications algorithm of Yen and Laih
inferredcites →https://doi.org/10.1049/el:19960662openalex-snapshot
Fast exponentiation methodby folding exponent in half
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/12.238495openalex-snapshot
Signed digit representations of minimal Hamming weight
inferredcites →https://doi.org/10.1109/12.863044openalex-snapshot
Optimal left-to-right binary signed-digit recoding
inferredcites →https://doi.org/10.1109/12.926155openalex-snapshot
A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
inferredcites →https://doi.org/10.1109/92.766756openalex-snapshot
An improved Montgomery's algorithm for high-speed RSA public-key cryptosystem
inferredcites →https://doi.org/10.1109/acssc.2002.1197046openalex-snapshot
Defining canonical-signed-digit number systems as arithmetic codes
inferredcites →https://doi.org/10.1109/aina.2003.1193005openalex-snapshot
Fast algorithms for common-multiplicand multiplication and exponentiation by performing complements
inferredcites →https://doi.org/10.1109/apccas.2002.1115104openalex-snapshot
Fast modular multiplication using Booth recoding based on signed-digit number arithmetic
inferredcites →https://doi.org/10.1109/tc.2003.1228516openalex-snapshot
A scalable architecture for modular multiplication based on montgomery's algorithm
inferredcites →https://doi.org/10.1109/tcsii.2002.1002515openalex-snapshot
A formal framework for conversion from binary to residue numbers
inferredcites →https://doi.org/10.1109/tec.1961.5219227openalex-snapshot
Signed-Digit Numbe Representations for Fast Parallel Arithmetic
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
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/3549993.3550007openalex-snapshot
New Directions in Cryptography
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.1201/9781315275567openalex-snapshot
Computer Arithmetic Algorithms
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
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.1002/sec.1511openalex-snapshot
Efficient modular exponential algorithms compatible with hardware implementation of public-key cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-72584-8_28openalex-snapshot
GPU-Accelerated Montgomery Exponentiation
inferred← citeshttps://doi.org/10.1007/s13369-017-2797-3openalex-snapshot
A Fast Parallel Modular Exponentiation Algorithm
inferred← citeshttps://doi.org/10.1016/j.amc.2006.06.089openalex-snapshot
An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
inferred← citeshttps://doi.org/10.1016/j.amc.2006.08.051openalex-snapshot
Fast modular multi-exponentiation using modified complex arithmetic
inferred← citeshttps://doi.org/10.1080/00207160701303136openalex-snapshot
Fast exponentiation based on common-multiplicand-multiplication and minimal-signed-digit techniques
inferred← citeshttps://doi.org/10.1109/commnet56067.2022.9993851openalex-snapshot
Fast Modular Exponentiation Methods for Public-Key Cryptography
inferred← citeshttps://doi.org/10.33317/ssurj.68openalex-snapshot
Introducing Primality Testing Algorithm with an Implementation on 64 bits RSA Encryption Using Verilog
inferred← citeshttps://doi.org/10.4018/ijisp.2017040102openalex-snapshot
Bit Forwarding 3-Bits Technique for Efficient Modular Exponentiation
inferred← citeshttps://doi.org/10.47277/ijcncs/1(3)5openalex-snapshot
Cryptosystem An Implementation of RSA Using Verilog
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.