On the public citation graph

Efficient modular exponential algorithms compatible with hardware implementation of public-key cryptography

0 signed · 35 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-39568-7_2openalex-snapshot
A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
inferredcites →https://doi.org/10.1007/978-3-319-06734-6_14openalex-snapshot
New Speed Records for Montgomery Modular Multiplication on 8-Bit AVR Microcontrollers
inferredcites →https://doi.org/10.1007/978-3-540-28632-5_9openalex-snapshot
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
inferredcites →https://doi.org/10.1007/bf00124891openalex-snapshot
Authentication and authenticated key exchanges
inferredcites →https://doi.org/10.1016/j.amc.2006.06.089openalex-snapshot
An efficient Montgomery exponentiation algorithm by using signed-digit-recoding and folding techniques
inferredcites →https://doi.org/10.1016/j.ins.2012.09.052openalex-snapshot
A comment on “An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation”
inferredcites →https://doi.org/10.1016/j.jcss.2011.07.002openalex-snapshot
Parallel modular exponentiation using load balancing without precomputation
inferredcites →https://doi.org/10.1016/j.sysarc.2006.09.005openalex-snapshot
Scalable hardware implementing high-radix Montgomery multiplication algorithm
inferredcites →https://doi.org/10.1016/j.sysarc.2009.04.001openalex-snapshot
An efficient signed digit montgomery multiplication for RSA
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.1016/s0167-9260(02)00053-6openalex-snapshot
Hardware architectures for public key cryptography
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/iadcc.2014.6779297openalex-snapshot
Efficient modular multiplication algorithms for public key cryptography
inferredcites →https://doi.org/10.1109/tc.2012.218openalex-snapshot
Scalable Montgomery Modular Multiplication Architecture with Low-Latency and Low-Memory Bandwidth Requirement
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/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.1145/503048.503055openalex-snapshot
Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic
inferredcites →https://doi.org/10.15388/informatica.2005.110openalex-snapshot
An Efficient Montgomery Exponentiation Algorithm for Cryptographic Applications

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-74524-0_10openalex-snapshot
Hardware Implementation of Bit Forwarding Techniques
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_11openalex-snapshot
RSA Processor for Concurrent Cryptographic Transformations
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_12openalex-snapshot
Implementation of Modular Exponentiation in Dual-Core
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_3openalex-snapshot
Modular Exponential Techniques
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_4openalex-snapshot
Review of Algorithmic Techniques for Improving the Performance of Modular Exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_9openalex-snapshot
Bit Forwarding Techniques for Efficient Modular Exponentiation
inferred← citeshttps://doi.org/10.1007/s13389-025-00380-wopenalex-snapshot
Fast polynomial inversion algorithms for the post-quantum cryptography
inferred← citeshttps://doi.org/10.1007/s44444-025-00031-9openalex-snapshot
An area-efficient DSP-free modular exponentiation architecture for resource-constrained FPGAs
inferred← citeshttps://doi.org/10.1080/23742917.2025.2565854openalex-snapshot
Classification of cache side-channel attacks using ensemble learning techniques
inferred← citeshttps://doi.org/10.1109/access.2018.2885989openalex-snapshot
Efficient Algorithm for Multi-Bit Montgomery Inverse Using Refined Multiplicative Inverse Modular $2^K$
inferred← citeshttps://doi.org/10.1109/aiact.2017.8020062openalex-snapshot
A novel approach for improving the modular exponentiation performance
inferred← citeshttps://doi.org/10.23939/ujit2022.01.063openalex-snapshot
COMPARISON ANALYSIS OF THE FUNCTIONS A COMPUTATION OF MODULAR EXPONENTIATION
inferred← citeshttps://doi.org/10.32782/cmis/3392-19openalex-snapshot
Efficient Multithreading Computation of Modular Exponentiation with Pre-computation of Residues for Fixed-base
inferred← citeshttps://doi.org/10.47839/ijc.24.1.3879openalex-snapshot
Fast Exponentiation in Galois Fields GF(2n)
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.