On the public citation graph

Toward an FPGA architecture optimized for public-key algorithms

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.1002/ecjc.4430770304openalex-snapshot
Montgomery modular‐multiplication method and systolic arrays suitable for modular exponentiation
inferredcites →https://doi.org/10.1007/978-1-4757-0602-4_5openalex-snapshot
A Fast Modular Multiplication Algorithm with Application to Two Key Cryptography
inferredcites →https://doi.org/10.1049/el:19980286openalex-snapshot
Optimised bit serial modular multiplier for implementationon field programmable gate arrays
inferredcites →https://doi.org/10.1049/el:19980624openalex-snapshot
Systolic modular exponentiationvia Montgomery algorithm
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1109/12.210181openalex-snapshot
Systolic modular multiplication
inferredcites →https://doi.org/10.1109/12.277287openalex-snapshot
Hardware implementation of Montgomery's modular multiplication algorithm
inferredcites →https://doi.org/10.1109/12.53588openalex-snapshot
An approach to implementing multiplication with small tables
inferredcites →https://doi.org/10.1109/40.502403openalex-snapshot
Analyzing and comparing Montgomery multiplication algorithms
inferredcites →https://doi.org/10.1109/49.17708openalex-snapshot
Algorithm engineering for public key algorithms
inferredcites →https://doi.org/10.1109/5.663540openalex-snapshot
The roles of FPGAs in reprogrammable systems
inferredcites →https://doi.org/10.1109/54.500200openalex-snapshot
FPGA and CPLD architectures: a tutorial
inferredcites →https://doi.org/10.1109/92.486081openalex-snapshot
Programmable active memories: reconfigurable systems come of age
inferredcites →https://doi.org/10.1109/92.585224openalex-snapshot
VLSI array algorithms and architectures for RSA modular multiplication
inferredcites →https://doi.org/10.1109/92.831434openalex-snapshot
High-performance carry chains for FPGA's
inferredcites →https://doi.org/10.1109/arith.1991.145531openalex-snapshot
A radix-4 modular multiplication hardware algorithm efficient for iterative modular multiplications
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/icasic.1996.562779openalex-snapshot
A systolic linear array for modular multiplication
inferredcites →https://doi.org/10.1109/iscas.1997.621556openalex-snapshot
New VLSI architectures of RSA public-key cryptosystem
inferredcites →https://doi.org/10.1117/12.255826openalex-snapshot
Performance evaluation of FPGA implementations of high-speed addition algorithms
inferredcites →https://doi.org/10.1145/275107.275142openalex-snapshot
High-performance carry chains for FPGAs
inferredcites →https://doi.org/10.1145/357980.358017openalex-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-74524-0_4openalex-snapshot
Review of Algorithmic Techniques for Improving the Performance of Modular Exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_27openalex-snapshot
Reduce-by-Feedback: Timing Resistant and DPA-Aware Modular Multiplication Plus: How to Break RSA by DPA
inferred← citeshttps://doi.org/10.1016/s0167-9260(02)00053-6openalex-snapshot
Hardware architectures for public key cryptography
inferred← citeshttps://doi.org/10.1109/acssc.2003.1291939openalex-snapshot
Fast Montgomery modular multiplication and RSA cryptographic processor architectures
inferred← citeshttps://doi.org/10.1109/dsd.2006.23openalex-snapshot
An Efficient Reconfigurable Montgomery Multiplier Architecture for GF(n)
inferred← citeshttps://doi.org/10.1109/et2ecn.2014.7044987openalex-snapshot
Fast modular multiplication using parallel prefix adder
inferred← citeshttps://doi.org/10.1109/glocom.2006.284openalex-snapshot
NIS04-6: A Time- and Memory- Efficient String Matching Algorithm for Intrusion Detection Systems
inferred← citeshttps://doi.org/10.1109/iccima.2007.70openalex-snapshot
An Image Compression Scheme Using AC Predictions
inferred← citeshttps://doi.org/10.1109/iccima.2007.73openalex-snapshot
An Efficient Gateway Discovery in Ad Hoc Networks for Internet Connectivity
inferred← citeshttps://doi.org/10.1109/icdcsyst.2014.6926198openalex-snapshot
Data security using serial commutative RSA CORE for multiple FPGA system
inferred← citeshttps://doi.org/10.1109/icm.2004.1434229openalex-snapshot
Fast montgomery modular multiplication by pipelined CSA architecture
inferred← citeshttps://doi.org/10.1109/iscas.2003.1205791openalex-snapshot
A high-speed, low latency RSA decryption silicon core
inferred← citeshttps://doi.org/10.1109/iscas.2005.1464674openalex-snapshot
Non-Interleaving Architecture for Hardware Implementation of Modular Multiplication
inferred← citeshttps://doi.org/10.1109/itcc.2005.204openalex-snapshot
Modified radix-2 Montgomery modular multiplication to make it faster and simpler
inferred← citeshttps://doi.org/10.1109/sips.2005.1579848openalex-snapshot
Reconfigurable processor for public-key cryptography
inferred← citeshttps://doi.org/10.1109/tcad.2024.3518412openalex-snapshot
Optimized Modular Adder Architecture for Cryptographic Applications on FPGAs
inferred← citeshttps://doi.org/10.1109/tcad.2025.3610064openalex-snapshot
Efficient Modular Addition for FPGA-Based Cryptographic Operations
inferred← citeshttps://doi.org/10.1109/vetecf.2000.886870openalex-snapshot
Flexible security systems and a new structure for electronic commerce on software radio
inferred← citeshttps://doi.org/10.1109/vlsisoc.2006.313204openalex-snapshot
High-Throughput Montgomery Modular Multiplication
inferred← citeshttps://doi.org/10.1145/329166.329176openalex-snapshot
An FPGA implementation and performance evaluation of the Serpent block cipher
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.