On the public citation graph
FPGA implementation of high performance elliptic curve cryptographic processor over
0 signed · 70 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/3-540-36400-5_26openalex-snapshot
An End-to-End Systems Approach to Elliptic Curve Cryptography
inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/3-540-44499-8_1openalex-snapshot
Software Implementation of Elliptic Curve Cryptography over Binary Fields
inferredcites →https://doi.org/10.1007/3-540-44499-8_3openalex-snapshot
A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m)
inferredcites →https://doi.org/10.1007/3-540-48059-5_27openalex-snapshot
Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation
inferredcites →https://doi.org/10.1007/978-1-4757-2226-0openalex-snapshot
Applications of Finite Fields
inferredcites →https://doi.org/10.1007/978-3-540-28632-5_6openalex-snapshot
Efficient Linear Array for Multiplication in GF(2 m ) Using a Normal Basis for Elliptic Curve Cryptography
inferredcites →https://doi.org/10.1016/0890-5401(88)90024-7openalex-snapshot
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866113-7openalex-snapshot
Speeding the Pollard and Elliptic Curve Methods of Factorization
inferredcites →https://doi.org/10.1109/asap.2003.1212867openalex-snapshot
A cryptographic processor for arbitrary elliptic curves over GF(2/sup m/)
inferredcites →https://doi.org/10.1109/fpt.2004.1393285openalex-snapshot
A scalable architecture for elliptic curve point multiplication
inferredcites →https://doi.org/10.1109/fpt.2005.1568575openalex-snapshot
Low latency elliptic curve cryptography accelerators for NISTcurves over binary fields
inferredcites →https://doi.org/10.1109/ieeestd.2000.92292openalex-snapshot
IEEE Standard Specifications for Public-Key Cryptography
inferredcites →https://doi.org/10.1109/ipdps.2003.1213351openalex-snapshot
A high performance VLIW processor for finite field arithmetic
inferredcites →https://doi.org/10.1109/ipdps.2004.1303124openalex-snapshot
A parallel architecture for fast computation of elliptic curve scalar multiplication over GF(2/sup m/)
inferredcites →https://doi.org/10.1109/itcc.2004.1286717openalex-snapshot
Area efficient high speed elliptic curve cryptoprocessor for random curves
inferredcites →https://doi.org/10.1109/tc.2003.1190586openalex-snapshot
A scalable dual-field elliptic curve cryptographic processor
inferredcites →https://doi.org/10.1109/tc.2008.133openalex-snapshot
High-Performance Architecture of Elliptic Curve Scalar Multiplication
inferredcites →https://doi.org/10.1109/tcsi.2006.880184openalex-snapshot
Hardware Elliptic Curve Cryptographic Processor Over $rm GF(p)$
inferredcites →https://doi.org/10.1109/tcsii.2006.889459openalex-snapshot
A High-Performance Elliptic Curve Cryptographic Processor for General Curves Over ${\rm GF}(p)$ Based on a Systolic Arithmetic Unit
inferredcites →https://doi.org/10.1109/tvlsi.2006.878235openalex-snapshot
Design of flexible GF(2/sup m/) elliptic curve cryptography processors
inferredcites →https://doi.org/10.1504/ijes.2008.022395openalex-snapshot
A cryptographic processor for arbitrary elliptic curves over GF(2m)
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-642-13797-6_3openalex-snapshot
A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1007/978-3-642-17697-5_5openalex-snapshot
Hardware Architectures for Elliptic Curve Cryptoprocessors Using Polynomial and Gaussian Normal Basis over GF(2233)
inferred← citeshttps://doi.org/10.1007/978-3-642-33027-8_29openalex-snapshot
Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
inferred← citeshttps://doi.org/10.1007/s00034-012-9457-3openalex-snapshot
VLSI Implementation of Double-Precision Floating-Point Multiplier Using Karatsuba Technique
inferred← citeshttps://doi.org/10.1007/s13389-022-00302-0openalex-snapshot
Low area-time complexity point multiplication architecture for ECC over GF($$2^{\textrm{m}}$$) using polynomial basis
inferred← citeshttps://doi.org/10.1016/j.aeue.2020.153383openalex-snapshot
An area-efficient ECC architecture over GF( 2 m ) for resource-constrained applications
inferred← citeshttps://doi.org/10.1016/j.mejo.2013.02.021openalex-snapshot
Area-efficient architectures for double precision multiplier on FPGA, with run-time-reconfigurable dual single precision support
inferred← citeshttps://doi.org/10.1016/j.mejo.2016.03.006openalex-snapshot
High-speed hardware architecture of scalar multiplication for binary elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1016/j.micpro.2010.04.006openalex-snapshot
A high performance ECC hardware implementation with instruction-level parallelism over GF(2163)
inferred← citeshttps://doi.org/10.1016/j.micpro.2021.104049openalex-snapshot
Novel fault attack resistant architecture for elliptic curve cryptography
inferred← citeshttps://doi.org/10.1016/j.micpro.2022.104525openalex-snapshot
An area-time efficient point-multiplication architecture for ECC over GF(2m) using polynomial basis
inferred← citeshttps://doi.org/10.1049/iet-cds.2017.0110openalex-snapshot
Full‐custom hardware implementation of point multiplication on binary Edwards curves for application‐specific integrated circuit elliptic curve cryptosystem applications
inferred← citeshttps://doi.org/10.1049/iet-cdt.2018.5056openalex-snapshot
Throughput/area optimised pipelined architecture for elliptic curve crypto processor
inferred← citeshttps://doi.org/10.1049/iet-ifs.2011.0190openalex-snapshot
Fault-tolerant Gaussian normal basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.1109/cimsim.2013.58openalex-snapshot
A Unified Architecture for a Dual Field ECC Processor Applicable to AES
inferred← citeshttps://doi.org/10.1109/erect.2015.7499063openalex-snapshot
Efficient implementation of scalar multiplication for ECC in GF (2m) on FPGA
inferred← citeshttps://doi.org/10.1109/icears53579.2022.9752413openalex-snapshot
Rapid, Secure and Vedic Approach to Cryptography
inferred← citeshttps://doi.org/10.1109/iscas.2010.5537486openalex-snapshot
A high performance pseudo-multi-core ECC processor over GF(2163)
inferred← citeshttps://doi.org/10.1109/isicir.2016.7829684openalex-snapshot
Accelerating OpenSSL's ECC with low cost reconfigurable hardware
inferred← citeshttps://doi.org/10.1109/pacrim.2015.7334833openalex-snapshot
Review of Elliptic Curve Processor architectures
inferred← citeshttps://doi.org/10.1109/recosoc.2016.7533901openalex-snapshot
Comparative analysis of flexible cryptographic implementations
inferred← citeshttps://doi.org/10.1109/socc52499.2021.9739611openalex-snapshot
Analog-Inspired Hardware Security: A Low-Energy Solution for IoT Trusted Communications
inferred← citeshttps://doi.org/10.1109/tc.2012.22openalex-snapshot
Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1109/tencon.2015.7372837openalex-snapshot
UE-TCAM: An ultra efficient SRAM-based TCAM
inferred← citeshttps://doi.org/10.1109/tie.2012.2186104openalex-snapshot
Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations
inferred← citeshttps://doi.org/10.1109/tit.2015.2409833openalex-snapshot
Common Subexpression Algorithms for Space-Complexity Reduction of Gaussian Normal Basis Multiplication
inferred← citeshttps://doi.org/10.1109/tpds.2014.2323062openalex-snapshot
Parallel and High-Speed Computations of Elliptic Curve Cryptography Using Hybrid-Double Multipliers
inferred← citeshttps://doi.org/10.1109/trustcom.2014.23openalex-snapshot
High Performance FPGA Implementation of Elliptic Curve Cryptography over Binary Fields
inferred← citeshttps://doi.org/10.1109/tssa.2015.7440446openalex-snapshot
Efficient implementation of EC based key management scheme on FPGA for WSN
inferred← citeshttps://doi.org/10.1109/tvlsi.2011.2158595openalex-snapshot
Efficient FPGA Implementations of Point Multiplication on Binary Edwards and Generalized Hessian Curves Using Gaussian Normal Basis
inferred← citeshttps://doi.org/10.1109/tvlsi.2012.2230410openalex-snapshot
Novel Architecture for Efficient FPGA Implementation of Elliptic Curve Cryptographic Processor Over ${\rm GF}(2^{163})$
inferred← citeshttps://doi.org/10.1109/tvlsi.2015.2453360openalex-snapshot
High-Performance Pipelined Architecture of Elliptic Curve Scalar Multiplication Over GF(2m)
inferred← citeshttps://doi.org/10.1142/s0218126619300034openalex-snapshot
Flexible Architectures for Cryptographic Algorithms — A Systematic Literature Review
inferred← citeshttps://doi.org/10.1145/3231743openalex-snapshot
Reconfigurable Hardware Architecture for Authenticated Key Agreement Protocol Over Binary Edwards Curve
inferred← citeshttps://doi.org/10.11591/ijeei.v6i3.532openalex-snapshot
Resource Efficient Single Precision Floating Point Multiplier Using Karatsuba Algorithm
inferred← citeshttps://doi.org/10.1371/journal.pone.0176214openalex-snapshot
Parallel point-multiplication architecture using combined group operations for high-speed cryptographic applications
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3183097/v1openalex-snapshot
Dual ASIC/FPGA Design of Elliptic Curve Scalar Multiplication for Wireless Networks and Internet of Things
inferred← citeshttps://doi.org/10.2478/jee-2025-0025openalex-snapshot
A low-latency 163-bit ECC processor for IoT applications
inferred← citeshttps://doi.org/10.4018/978-1-5225-0299-9.ch004openalex-snapshot
FPGA Implementations for Chaotic Maps Using Fixed-Point and Floating-Point Representations
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.380-384.3316openalex-snapshot
High Performance FPGA Implementation of Floating Point Addition
inferred← citeshttps://doi.org/10.4218/etrij.12.0112.0596openalex-snapshot
Subquadratic Space Complexity Multiplier for GF(2n) Using Type 4 Gaussian Normal Bases
inferred← citeshttps://doi.org/10.48550/arxiv.1710.08336openalex-snapshot
A Survey on Hardware Implementations of Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.5120/11702-7276openalex-snapshot
Design and Implementation of Secure Stream Cipher based on Elliptic Curves on Time Shared Basis
inferred← citeshttps://doi.org/10.5120/4342-039openalex-snapshot
High Performances ASIC Based Elliptic Curve Cryptographic Processor over GF(2m)
inferred← citeshttps://doi.org/10.52549/ijeei.v6i3.532openalex-snapshot
Resource Efficient Single Precision Floating Point Multiplier Using Karatsuba Algorithm
inferred← citeshttps://doi.org/10.7840/kics.2011.36c.1.14openalex-snapshot
On the Computational Cost of Pairing and ECC Scalar Multiplication
inferred← citeshttps://doi.org/10.9723/jksiis.2013.18.2.001openalex-snapshot
Design of FPGA Hardware Accelerator for Information Security System
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.