On the public citation graph

FPGA Montgomery Multiplier Architectures - A Comparison

0 signed · 38 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-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/40.502403openalex-snapshot
Analyzing and comparing Montgomery multiplication 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

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-31578-8_5openalex-snapshot
Optimized Algorithms and Architectures for Montgomery Multiplication for Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_6openalex-snapshot
Introduction to Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-030-74524-0_8openalex-snapshot
High Radix Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-74735-2_19openalex-snapshot
How to Maximize the Potential of FPGA Resources for Modular Exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-642-34704-7_19openalex-snapshot
An Efficient RSA Implementation without Precomputation
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2012.08.010openalex-snapshot
Area/performance trade-off analysis of an FPGA digit-serial Montgomery multiplier based on LFSR
inferred← citeshttps://doi.org/10.1109/async.2015.26openalex-snapshot
Asynchronous Charge Sharing Power Consistent Montgomery Multiplier
inferred← citeshttps://doi.org/10.1109/dasip.2010.5706241openalex-snapshot
High speed Fp multipliers and adders on FPGA platform
inferred← citeshttps://doi.org/10.1109/euc.2008.30openalex-snapshot
Accelerating Montgomery Modulo Multiplication for Redundant Radix-64k Number System on the FPGA Using Dual-Port Block RAMs
inferred← citeshttps://doi.org/10.1109/fpt.2004.1393267openalex-snapshot
Coarsely integrated operand scanning (CIOS) architecture for high-speed Montgomery modular multiplication
inferred← citeshttps://doi.org/10.1109/ic-nc.2010.56openalex-snapshot
An RSA Encryption Hardware Algorithm Using a Single DSP Block and a Single Block RAM on the FPGA
inferred← citeshttps://doi.org/10.1109/icitst.2015.7412140openalex-snapshot
An extension of RSA_512 to RSA_1024 core under hardware platform based on montgomery powering
inferred← citeshttps://doi.org/10.1109/icmira.2013.14openalex-snapshot
Power Analysis of a Montgomery Modular Multiplier for Cryptosystems
inferred← citeshttps://doi.org/10.1109/ipdps.2011.208openalex-snapshot
CRT-Based DSP Decryption Using Montgomery Modular Multiplication on the FPGA
inferred← citeshttps://doi.org/10.1109/isie.2007.4374882openalex-snapshot
Embedded Public-key Cryptosystems Via Enhanced Montgomery Multiplication
inferred← citeshttps://doi.org/10.1109/isvlsi.2011.39openalex-snapshot
Design and Analysis of Pairing Based Cryptographic Hardware for Prime Fields
inferred← citeshttps://doi.org/10.1109/pdcat.2008.13openalex-snapshot
Redundant Radix-2r Number System for Accelerating Arithmetic Operations on the FPGAs
inferred← citeshttps://doi.org/10.1109/reconfig.2008.13openalex-snapshot
Parametric, Secure and Compact Implementation of RSA on FPGA
inferred← citeshttps://doi.org/10.1109/reconfig.2009.83openalex-snapshot
Realizing Arbitrary-Precision Modular Multiplication with a Fixed-Precision Multiplier Datapath
inferred← citeshttps://doi.org/10.1109/sips.2004.1363075openalex-snapshot
Montgomery modular multiplication architecture for public key cryptosystems
inferred← citeshttps://doi.org/10.1109/tc.2019.2920352openalex-snapshot
Generation of Finely-Pipelined GF(P) Multipliers for Flexible Curve Based Cryptography on FPGAs
inferred← citeshttps://doi.org/10.1145/1854153.1854184openalex-snapshot
An efficient implementation of montgomery powering ladder in reconfigurable hardware
inferred← citeshttps://doi.org/10.1145/3624571openalex-snapshot
Montgomery Multiplication Scalable Systolic Designs Optimized for DSP48E2
inferred← citeshttps://doi.org/10.1155/2008/583926openalex-snapshot
Enhanced Montgomery Multiplication on DSP Architectures for Embedded Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1186/s42269-024-01285-0openalex-snapshot
FPGA design and implementation for montgomery multiplication algorithm using MATLAB HDL coder
inferred← citeshttps://doi.org/10.15803/ijnc.1.2_277openalex-snapshot
An RSA Encryption Hardware Algorithm using a Single DSP Block and a Single Block RAM on the FPGA
inferred← citeshttps://doi.org/10.15803/ijnc.2.1_79openalex-snapshot
The Parallel FDFM Processor Core Approach for CRT-based RSA Decryption
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.211openalex-snapshot
How to Maximize the Potential of FPGA-Based DSPs for Modular Exponentiation
inferred← citeshttps://doi.org/10.20381/ruor-4486openalex-snapshot
Implementation of RSA Cryptosystem for Next Generation RFID Tags
inferred← citeshttps://doi.org/10.23919/fpl.2017.8056762openalex-snapshot
Area-optimized montgomery multiplication on IGLOO 2 FPGAs
inferred← citeshttps://doi.org/10.46569/20.500.12680/xd07h099zopenalex-snapshot
Implementation and categorization of RSA decryption block on FPGA
inferred← citeshttps://doi.org/10.70675/213abca0ze883z48f6z97a2z0e84d266952copenalex-snapshot
Unités arithmétiques et cryptoprocesseurs matériels pour la cryptographie sur courbe hyperelliptique
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.