On the public citation graph
Fast Parallel Exponentiation Algorithm for RSA Public-Key Cryptosystem
0 signed · 43 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-44499-8_22openalex-snapshot
A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
inferredcites →https://doi.org/10.1007/978-3-0348-8295-8openalex-snapshot
Cryptography and Computational Number Theory
inferredcites →https://doi.org/10.1016/j.amc.2003.12.018openalex-snapshot
A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
inferredcites →https://doi.org/10.1016/j.amc.2004.01.018openalex-snapshot
A threshold signature scheme based on the elliptic curve cryptosystem
inferredcites →https://doi.org/10.1016/j.neucom.2004.01.011openalex-snapshot
Artificial neural networks on massively parallel computer hardware
inferredcites →https://doi.org/10.1016/j.parco.2004.07.007openalex-snapshot
On performance analysis of heterogeneous parallel algorithms
inferredcites →https://doi.org/10.1049/el:19960662openalex-snapshot
Fast exponentiation methodby folding exponent in half
inferredcites →https://doi.org/10.1049/ip-cdt:20040791openalex-snapshot
Modified Montgomery modular multiplication and RSA exponentiation techniques
inferredcites →https://doi.org/10.1080/00207160310001624223openalex-snapshot
Fast exponentiation by folding the signed-digit exponent in half
inferredcites →https://doi.org/10.1080/00207160412331290676openalex-snapshot
New methods for binary multiplication
inferredcites →https://doi.org/10.1093/ietfec/e89-a.1.231openalex-snapshot
Simple Power Analysis on Fast Modular Reduction with Generalized Mersenne Prime for Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/12.936241openalex-snapshot
High-radix Montgomery modular exponentiation on reconfigurable hardware
inferredcites →https://doi.org/10.1109/aina.2005.97openalex-snapshot
An Efficient Decryption Method for RSA Cryptosystem
inferredcites →https://doi.org/10.1109/arith.1993.378085openalex-snapshot
Fast implementations of RSA cryptography
inferredcites →https://doi.org/10.1109/itcc.2005.241openalex-snapshot
Reconfigurable hardware for addition chains based modular exponentiation
inferredcites →https://doi.org/10.1109/itcc.2005.89openalex-snapshot
Applications of the Montgomery exponent
inferredcites →https://doi.org/10.1109/mdso.2004.12openalex-snapshot
An Excellent Resource for Parallel Computing
inferredcites →https://doi.org/10.1109/tc.2006.3openalex-snapshot
Analysis of fractional window recoding methods and their application to elliptic curve cryptosystems
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
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.1145/370155.370419openalex-snapshot
RSA cryptosystem design based on the Chinese remainder theorem
inferredcites →https://doi.org/10.1201/9780429466335openalex-snapshot
Handbook of Applied Cryptography
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/2007902openalex-snapshot
Elementary Number Theory and Its Applications.
inferredcites →https://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
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-642-13136-3_16openalex-snapshot
A Massively Parallel Hardware for Modular Exponentiations Using the m-ary Method
inferred← citeshttps://doi.org/10.1007/978-81-322-2656-7_33openalex-snapshot
RSA Public Key Acceleration on CUDA GPU
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.2016.07.036openalex-snapshot
Parallel algorithms for modular multi-exponentiation
inferred← citeshttps://doi.org/10.1016/j.engappai.2014.09.003openalex-snapshot
Evolutionary programming for the length minimization of addition chains
inferred← citeshttps://doi.org/10.1049/iet-cdt.2011.0074openalex-snapshot
Massively parallel modular exponentiation method and its implementation in software and hardware for high-performance cryptographic systems
inferred← citeshttps://doi.org/10.1109/cads.2010.5623649openalex-snapshot
M-ary parallel modular exponentiation: Software vs. hardware
inferred← citeshttps://doi.org/10.1109/gcc.2010.42openalex-snapshot
Parallel Algorithms for Cryptosystem on Conic Curves over Finite Field Fp
inferred← citeshttps://doi.org/10.1109/jiot.2020.3029030openalex-snapshot
Efficient Parallel Secure Outsourcing of Modular Exponentiation to Cloud for IoT Applications
inferred← citeshttps://doi.org/10.1109/paap.2010.28openalex-snapshot
Parallel Point-Multiplication for Conic Curves Cryptosystem
inferred← citeshttps://doi.org/10.1109/pdcat.2010.11openalex-snapshot
Parallel Point-Addition and Point-Double for Cryptosystem on Conic Curves over Ring Zn
inferred← citeshttps://doi.org/10.1109/tc.2017.2693185openalex-snapshot
Optimization of Tree Modes for Parallel Hash Functions: A Case Study
inferred← citeshttps://doi.org/10.1145/3136825.3136866openalex-snapshot
An enhanced parallel version of RSA public key crypto based algorithm using openMP
inferred← citeshttps://doi.org/10.48550/arxiv.1604.04206openalex-snapshot
Note on Optimal Trees for Parallel Hash Functions
inferred← citeshttps://doi.org/10.5121/ijcsa.2015.5108openalex-snapshot
State of the Art Parallel Approaches For Rsa Public Key Based Cryptosystem
inferred← citeshttps://doi.org/10.58346/jowua.2023.i2.009openalex-snapshot
The Optimal Equations with Chinese Remainder Theorem for RSA’s Decryption Process
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.