On the public citation graph
Scalable hardware implementing high-radix Montgomery multiplication algorithm
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.
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-36563-xopenalex-snapshot
Topics in Cryptology — CT-RSA 2003
inferredcites →https://doi.org/10.1007/3-540-44499-8_14openalex-snapshot
High-Speed RSA Hardware Based on Barret’s Modular Reduction Method
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/3-540-44499-8_23openalex-snapshot
Montgomery Exponentiation with no Final Subtractions: Improved Results
inferredcites →https://doi.org/10.1007/3-540-44709-1_17openalex-snapshot
High-Radix Design of a Scalable Modular Multiplier
inferredcites →https://doi.org/10.1007/3-540-44709-1_18openalex-snapshot
A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
inferredcites →https://doi.org/10.1007/3-540-45760-7_3openalex-snapshot
Precise Bounds for Montgomery Modular Multiplication and Some Potentially Insecure RSA Moduli
inferredcites →https://doi.org/10.1007/3-540-48059-5_10openalex-snapshot
A Scalable Architecture for Montgomery Nultiplication
inferredcites →https://doi.org/10.1049/el:19991230openalex-snapshot
Montgomery exponentiation needs no final subtractions
inferredcites →https://doi.org/10.1049/ip-cdt:20000638openalex-snapshot
Improved linear systolic array for fast modular exponentiation
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/12.277287openalex-snapshot
Hardware implementation of Montgomery's modular multiplication algorithm
inferredcites →https://doi.org/10.1109/12.295851openalex-snapshot
A systolic, linear-array multiplier for a class of right-shift algorithms
inferredcites →https://doi.org/10.1109/arith.1993.378085openalex-snapshot
Fast implementations of RSA cryptography
inferredcites →https://doi.org/10.1109/arith.1999.762831openalex-snapshot
Montgomery modular exponentiation on reconfigurable hardware
inferredcites →https://doi.org/10.1109/ipdps.2003.1213341openalex-snapshot
Hardware implementation of a Montgomery modular multiplier in a systolic array
inferredcites →https://doi.org/10.1109/tc.1983.1676262openalex-snapshot
A Computer Algorithm for Calculating the Product AB Modulo M
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.1145/503048.503055openalex-snapshot
Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic
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.1002/sec.1511openalex-snapshot
Efficient modular exponential algorithms compatible with hardware implementation of public-key cryptography
inferred← citeshttps://doi.org/10.1016/j.conengprac.2020.104350openalex-snapshot
Implementing homomorphic encryption based secure feedback control
inferred← citeshttps://doi.org/10.1016/j.ijleo.2009.02.029openalex-snapshot
Circuit designs of ultra-fast all-optical modified signed-digit adders using semiconductor optical amplifier and Mach–Zehnder interferometer
inferred← citeshttps://doi.org/10.1016/j.micpro.2019.102866openalex-snapshot
Balancing elliptic curve coprocessors from bottom to top
inferred← citeshttps://doi.org/10.1109/access.2024.3448313openalex-snapshot
Self-Checking Hardware Design for Montgomery Exponentiation-Based Cryptography
inferred← citeshttps://doi.org/10.1109/dsd.2018.00095openalex-snapshot
Design of a Fully Balanced ASIC Coprocessor Implementing Complete Addition Formulas on Weierstrass Elliptic Curves
inferred← citeshttps://doi.org/10.1109/dsd51259.2020.00051openalex-snapshot
Breaking a fully Balanced ASIC Coprocessor Implementing Complete Addition Formulas on Weierstrass Elliptic Curves
inferred← citeshttps://doi.org/10.1109/lascas.2013.6519072openalex-snapshot
8912-bit Montgomery multipliers using radix-8 booth encoding and coded-digit
inferred← citeshttps://doi.org/10.1109/spl.2010.5483003openalex-snapshot
Montgomery modular multiplication on reconfigurable hardware: Fully systolic array vs parallel implementation
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2356015openalex-snapshot
Secure Systolic Montgomery Modular Multiplier Over Prime Fields Resilient to Fault-Injection Attacks
inferred← citeshttps://doi.org/10.1145/1854153.1854184openalex-snapshot
An efficient implementation of montgomery powering ladder in reconfigurable hardware
inferred← citeshttps://doi.org/10.1155/2011/127147openalex-snapshot
Montgomery Modular Multiplication on Reconfigurable Hardware: Systolic versus Multiplexed Implementation
inferred← citeshttps://doi.org/10.1587/transinf.e92.d.545openalex-snapshot
Privacy-Preserving RFID Authentication Using Public Exponent Three RSA Algorithm
inferred← citeshttps://doi.org/10.4018/ijisp.2017040102openalex-snapshot
Bit Forwarding 3-Bits Technique for Efficient Modular Exponentiation
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.