On the public citation graph
FPGA-based Design of a Large Moduli Multiplier for Public-Key Cryptographic Systems
0 signed · 28 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.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/12.743408openalex-snapshot
Multiplexer-based array multipliers
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/ahs.2006.6openalex-snapshot
A Large Scale Adaptable Multiplier for Cryptographic Applications
inferredcites →https://doi.org/10.1109/asap.2003.1212866openalex-snapshot
Hardware implementation of an elliptic curve processor over GF(p)
inferredcites →https://doi.org/10.1109/asap.2004.1342459openalex-snapshot
Parallel Montgomery multipliers
inferredcites →https://doi.org/10.1109/fpga.2003.1227282openalex-snapshot
RSA encryption using extended modular arithmetic on the Quicksilver COSM adaptive computing machine
inferredcites →https://doi.org/10.1109/iscas.1994.409255openalex-snapshot
General modular multiplication by block multiplication and table lookup
inferredcites →https://doi.org/10.1109/iscas.2004.1328795openalex-snapshot
FPGA Montgomery modular multiplication architectures suitable for ECCs over GF(p)
inferredcites →https://doi.org/10.1109/tvlsi.2003.812308openalex-snapshot
Cellular-array modular multiplier for fast RSA public-key cryptosystem based on modified Booth's algorithm
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.
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.1016/j.procs.2026.05.185openalex-snapshot
A Systematic Review of Montgomery Multiplication Techniques for Cryptographic Hardware Acceleration
inferred← citeshttps://doi.org/10.1109/apcip.2009.107openalex-snapshot
The Researcher and Implement of High-Speed Modular Multiplication Algorithm Basing on Parallel Pipelining
inferred← citeshttps://doi.org/10.1109/csndsp.2014.6923835openalex-snapshot
Efficient montgomery multiplier for pairing and elliptic curve based cryptography
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/fpl.2014.6927452openalex-snapshot
Radix-4 and radix-8 booth encoded interleaved modular multipliers over general Fp
inferred← citeshttps://doi.org/10.1109/icecs.2008.4675098openalex-snapshot
Implementation of large-integer hardware multiplier in Xilinx FPGA
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.12732/ijam.v26i2.10openalex-snapshot
BIT-PARALLEL COPROCESSOR FOR STANDARD ECC-$GF(2^m)$ ON FPGA
inferred← citeshttps://doi.org/10.3897/jucs.86282openalex-snapshot
FPGA Implementation of Fast Binary Multiplication Based on Customized Basic Cells
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.