On the public citation graph
A Karatsuba-Based Montgomery Multiplier
0 signed · 58 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/978-3-540-74735-2_19openalex-snapshot
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
inferredcites →https://doi.org/10.1007/978-3-642-12133-3_9openalex-snapshot
Parametric Encryption Hardware Design
inferredcites →https://doi.org/10.1016/j.micpro.2006.12.003openalex-snapshot
An efficient CSA architecture for montgomery modular multiplication
inferredcites →https://doi.org/10.1049/ip-cdt:20040791openalex-snapshot
Modified Montgomery modular multiplication and RSA exponentiation techniques
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/40.502403openalex-snapshot
Analyzing and comparing Montgomery multiplication algorithms
inferredcites →https://doi.org/10.1109/acssc.2006.355045openalex-snapshot
Quotient Pipelined Very High Radix Scalable Montgomery Multipliers
inferredcites →https://doi.org/10.1109/fpl.2005.1515780openalex-snapshot
Efficient hardware architectures for modular multiplication on FPGAs
inferredcites →https://doi.org/10.1109/fpt.2003.1275731openalex-snapshot
Modular exponentiation using parallel multipliers
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/reconfig.2008.13openalex-snapshot
Parametric, Secure and Compact Implementation of RSA on FPGA
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.1145/503053.503055openalex-snapshot
Efficient architectures for implementing montgomery modular multiplication and RSA modular exponentiation on reconfigurable logic
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/eng2.12639openalex-snapshot
Hardware acceleration of number theoretic transform for zk‐SNARK
inferred← citeshttps://doi.org/10.1007/978-3-032-13301-4_2openalex-snapshot
High-Performance FPGA Implementation of a Recursive Modular Karatsuba Multiplier over $$GF(2^m)$$
inferred← citeshttps://doi.org/10.1007/978-3-642-31494-0_12openalex-snapshot
An Efficient High Speed Implementation of Flexible Characteristic-2 Multipliers on FPGAs
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_26openalex-snapshot
Attacking RSA–CRT Signatures with Faults on Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-981-16-7088-6_63openalex-snapshot
Low Complexity and High Speed Montgomery Multiplication Based on FFT
inferred← citeshttps://doi.org/10.1007/s11265-017-1225-yopenalex-snapshot
Using OpenCL to Increase SCA Application Portability
inferred← citeshttps://doi.org/10.1007/s13389-013-0050-xopenalex-snapshot
Attacking RSA–CRT signatures with faults on montgomery multiplication
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.micpro.2018.07.005openalex-snapshot
High-speed FPGA implementation of full-word Montgomery multiplier for ECC applications
inferred← citeshttps://doi.org/10.1016/j.sysarc.2013.10.013openalex-snapshot
Improving the computational efficiency of modular operations for embedded systems
inferred← citeshttps://doi.org/10.1049/iet-cds.2018.5182openalex-snapshot
Efficient implementation of digit‐serial Montgomery modular multiplier architecture
inferred← citeshttps://doi.org/10.1049/iet-cdt.2018.5098openalex-snapshot
Low‐complexity and differential power analysis (DPA)‐resistant two‐folded power‐aware Rivest–Shamir–Adleman (RSA) security schema implementation for IoT‐connected devices
inferred← citeshttps://doi.org/10.1109/conecct65861.2025.11306762openalex-snapshot
Design & Implementation of Karatsuba Multiplier: A complete RTL to GDS II Flow
inferred← citeshttps://doi.org/10.1109/fccm.2012.14openalex-snapshot
Area-Efficient Architectures for Large Integer and Quadruple Precision Floating Point Multipliers
inferred← citeshttps://doi.org/10.1109/fccm53951.2022.9786123openalex-snapshot
IMpress: Large Integer Multiplication Expression Rewriting for FPGA HLS
inferred← citeshttps://doi.org/10.1109/fccm53951.2022.9786219openalex-snapshot
Fast Arbitrary Precision Floating Point on FPGA
inferred← citeshttps://doi.org/10.1109/fpt.2012.6412162openalex-snapshot
Low complexity and hardware-friendly spectral modular multiplication
inferred← citeshttps://doi.org/10.1109/icdccom.2014.7024721openalex-snapshot
FPGA Implementation of 160- Bit Vedic Multiplier
inferred← citeshttps://doi.org/10.1109/indiscon66021.2025.11251969openalex-snapshot
Pipelined Low Power and High Speed Karatsuba Multiplier
inferred← citeshttps://doi.org/10.1109/iraniancee.2014.6999599openalex-snapshot
Radix-4 implementation of redundant interleaved modular multiplication on FPGA
inferred← citeshttps://doi.org/10.1109/iscas.2013.6572409openalex-snapshot
A GPU implementation of the Montgomery multiplication algorithm for elliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/iscas.2018.8351136openalex-snapshot
An Implementation of Karatsuba-based Montgomery Modular Multiplication with Only Half-size Additions
inferred← citeshttps://doi.org/10.1109/iscas.2018.8351190openalex-snapshot
An Efficient Single Core Flexible Processor Architecture for 4096-bit Montgomery Modular Multiplication and Exponentiation
inferred← citeshttps://doi.org/10.1109/iscas.2019.8702684openalex-snapshot
A Design and Implementation of Montgomery Modular Multiplier
inferred← citeshttps://doi.org/10.1109/iscc.2013.19openalex-snapshot
An Implementation of Montgomery Modular Multiplication on FPGAs
inferred← citeshttps://doi.org/10.1109/isqed60706.2024.10528765openalex-snapshot
Design and Evaluation of Parametric NTT Hardware Unit using different Multiplier based Modular Reduction Techniques
inferred← citeshttps://doi.org/10.1109/les.2025.3619075openalex-snapshot
Improved Montgomery Modular Multipliers on FPGAs and ASICs
inferred← citeshttps://doi.org/10.1109/tc.2015.2417553openalex-snapshot
Parameter Space for the Architecture of FFT-Based Montgomery Modular Multiplication
inferred← citeshttps://doi.org/10.1109/tc.2016.2601334openalex-snapshot
Area-Time Efficient Architecture of FFT-Based Montgomery Multiplication
inferred← citeshttps://doi.org/10.1109/tc.2017.2677426openalex-snapshot
Evaluation of Large Integer Multiplication Methods on Hardware
inferred← citeshttps://doi.org/10.1109/tcsi.2018.2878598openalex-snapshot
High-Speed ECC Processor Over NIST Prime Fields Applied With Toom–Cook Multiplication
inferred← citeshttps://doi.org/10.1109/tcsii.2019.2932328openalex-snapshot
A Low-Latency and Low-Cost Montgomery Modular Multiplier Based on NLP Multiplication
inferred← citeshttps://doi.org/10.1109/tr.2016.2606883openalex-snapshot
Secure and Dependable NoC-Connected Systems on an FPGA Chip
inferred← citeshttps://doi.org/10.1109/trustcom.2012.215openalex-snapshot
On Increasing the Computational Efficiency of Long Integer Multiplication on FPGA
inferred← citeshttps://doi.org/10.1109/tvlsi.2023.3299508openalex-snapshot
Novel Formulations of M-Term Overlap-Free Karatsuba Binary Polynomial Multipliers and Their Hardware Implementations
inferred← citeshttps://doi.org/10.1145/3287624.3287699openalex-snapshot
Towards practical homomorphic email filtering
inferred← citeshttps://doi.org/10.11591/ijeecs.v21.i2.pp735-743openalex-snapshot
A compact FPGA-based montgomery modular multiplier
inferred← citeshttps://doi.org/10.14445/22315381/ijett-v9p251openalex-snapshot
Implementation of Proposed Interleaved Karatsuba Montgomery Multiplier- A Review
inferred← citeshttps://doi.org/10.15598/aeee.v19i3.4199openalex-snapshot
Booth-Encoded Karatsuba: A Novel Hardware-Efficient Multiplier
inferred← citeshttps://doi.org/10.1587/transfun.e102.a.430openalex-snapshot
Hardware-Accelerated Secured Naïve Bayesian Filter Based on Partially Homomorphic Encryption
inferred← citeshttps://doi.org/10.23919/date51398.2021.9473908openalex-snapshot
Parametric Throughput Oriented Large Integer Multipliers for High Level Synthesis
inferred← citeshttps://doi.org/10.23919/fpl.2017.8056763openalex-snapshot
Determine the carry bit of carry-sum generated by unsigned MBE multiplier without final addition
inferred← citeshttps://doi.org/10.23919/fpl.2017.8056769openalex-snapshot
Broken-Karatsuba multiplication and its application to Montgomery modular multiplication
inferred← citeshttps://doi.org/10.33317/ssurj.213openalex-snapshot
Low latency Montgomery multiplier for cryptographic applications
inferred← citeshttps://doi.org/10.35940/ijeat.f8273.088619openalex-snapshot
Area and Delay Efficient Compressor Based Montgomery Multiplier
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.