On the public citation graph

Modified radix-2 Montgomery modular multiplication to make it faster and simpler

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.
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-36400-5_22openalex-snapshot
The Montgomery Powering Ladder
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-48059-5_10openalex-snapshot
A Scalable Architecture for Montgomery Nultiplication
inferredcites →https://doi.org/10.1007/978-3-540-28632-5_5openalex-snapshot
Leak Resistant Arithmetic
inferredcites →https://doi.org/10.1049/el:19900587openalex-snapshot
Carry-save adders for computing the product AB modulo N
inferredcites →https://doi.org/10.1049/el:19950217openalex-snapshot
Still faster modular multiplication
inferredcites →https://doi.org/10.1049/el:19991230openalex-snapshot
Montgomery exponentiation needs no final subtractions
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/12.936241openalex-snapshot
High-radix Montgomery modular exponentiation on reconfigurable hardware
inferredcites →https://doi.org/10.1109/40.502403openalex-snapshot
Analyzing and comparing Montgomery multiplication algorithms
inferredcites →https://doi.org/10.1109/82.700944openalex-snapshot
A new RSA cryptosystem hardware design based on Montgomery's algorithm
inferredcites →https://doi.org/10.1109/acssc.2003.1291939openalex-snapshot
Fast Montgomery modular multiplication and RSA cryptographic processor architectures
inferredcites →https://doi.org/10.1109/apasic.2002.1031541openalex-snapshot
A staged carry-save-adder array for Montgomery modular multiplication
inferredcites →https://doi.org/10.1109/arith.1995.465359openalex-snapshot
Simplifying quotient determination in high-radix modular multiplication
inferredcites →https://doi.org/10.1109/arith.1999.762831openalex-snapshot
Montgomery modular exponentiation on reconfigurable hardware
inferredcites →https://doi.org/10.1109/iscas.1998.706870openalex-snapshot
A novel digit-serial systolic array for modular multiplication
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/tit.1976.1055638openalex-snapshot
New directions in cryptography
inferredcites →https://doi.org/10.1117/12.359540openalex-snapshot
Toward an FPGA architecture optimized for public-key algorithms
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/978-3-540-74784-0_28openalex-snapshot
Dual-Residue Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-76788-6_22openalex-snapshot
Safe-Error Attack on SPA-FA Resistant Exponentiations Using a HW Modular Multiplier
inferred← citeshttps://doi.org/10.1007/978-3-540-89985-3_138openalex-snapshot
A New Operator for Multi-addition Calculations
inferred← citeshttps://doi.org/10.1007/978-3-642-03095-6_41openalex-snapshot
Fast Parallel Montgomery Binary Exponentiation Algorithm Using Canonical- Signed-Digit Recoding Technique
inferred← citeshttps://doi.org/10.1007/s40031-019-00384-1openalex-snapshot
High-Speed High-Throughput VLSI Architecture for RSA Montgomery Modular Multiplication with Efficient Format Conversion
inferred← citeshttps://doi.org/10.1016/j.jestch.2021.08.002openalex-snapshot
Low latency high throughput Montgomery modular multiplier for RSA cryptosystem
inferred← citeshttps://doi.org/10.1016/j.mejo.2021.105099openalex-snapshot
An efficient signed digit montgomery modular multiplication algorithm
inferred← citeshttps://doi.org/10.1016/j.micpro.2006.12.003openalex-snapshot
An efficient CSA architecture for montgomery modular multiplication
inferred← citeshttps://doi.org/10.1016/j.sysarc.2009.04.001openalex-snapshot
An efficient signed digit montgomery multiplication for RSA
inferred← citeshttps://doi.org/10.1049/iet-ifs.2018.5191openalex-snapshot
Fast Montgomery modular multiplier for Rivest–Shamir–Adleman cryptosystem
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/access.2024.3448313openalex-snapshot
Self-Checking Hardware Design for Montgomery Exponentiation-Based Cryptography
inferred← citeshttps://doi.org/10.1109/asap.2009.22openalex-snapshot
Efficient Implementation of Carry-Save Adders in FPGAs
inferred← citeshttps://doi.org/10.1109/icctict.2016.7514561openalex-snapshot
FPGA implementation of RSA based on carry save Montgomery modular multiplication
inferred← citeshttps://doi.org/10.1109/iscas.2008.4542167openalex-snapshot
Differential Power Analysis resistant hardware implementation of the RSA cryptosystem
inferred← citeshttps://doi.org/10.1109/itng.2008.32openalex-snapshot
Very Fast Multi Operand Addition Method by Bitwise Subtraction
inferred← citeshttps://doi.org/10.1109/tvlsi.2012.2227846openalex-snapshot
Energy-Efficient High-Throughput Montgomery Modular Multipliers for RSA Cryptosystems
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2355854openalex-snapshot
High-Throughput Modular Multiplication and Exponentiation Algorithms Using Multibit-Scan–Multibit-Shift Technique
inferred← citeshttps://doi.org/10.1587/elex.7.513openalex-snapshot
A modified radix-2 Montgomery modular multiplication with new recoding method
inferred← citeshttps://doi.org/10.3906/elk-0904-4openalex-snapshot
Differential power analysis resistant hardware implementation of the RSA cryptosystem
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.