On the public citation graph

Optimum Digit Serial GF(2^m) Multipliers for Curve-Based Cryptography

0 signed · 108 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/0-387-34799-2_8openalex-snapshot
A Family of Jacobians Suitable for Discrete Log Cryptosystems
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_3openalex-snapshot
A High-Performance Reconfigurable Elliptic Curve Processor for GF(2m)
inferredcites →https://doi.org/10.1007/3-540-44709-1_29openalex-snapshot
A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware
inferredcites →https://doi.org/10.1017/cbo9781107360211openalex-snapshot
Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1023/a:1008013818413openalex-snapshot
Low-Energy Digit-Serial/Parallel Finite Field Multipliers
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
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-319-01796-9_39openalex-snapshot
Hybrid Digit-Serial Multiplier for Shifted Polynomial Basis of GF(2 m )
inferred← citeshttps://doi.org/10.1007/978-3-319-23207-2_22openalex-snapshot
Efficient Digit-Serial Multiplier Employing Karatsuba Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-69499-1_9openalex-snapshot
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-71431-6_20openalex-snapshot
Multiplication over $\mathbb{F}_{{p}^{m}}$ on FPGA: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-642-00641-8_18openalex-snapshot
Optimizing the Control Hierarchy of an ECC Coprocessor Design on an FPGA Based SoC Platform
inferred← citeshttps://doi.org/10.1007/978-3-642-04138-9_21openalex-snapshot
Programmable and Parallel ECC Coprocessor Architecture: Tradeoffs between Area, Speed and Security
inferred← citeshttps://doi.org/10.1007/978-3-642-28365-9_11openalex-snapshot
Complexity Analysis of Finite Field Digit Serial Multipliers on FPGAs
inferred← citeshttps://doi.org/10.1007/978-3-642-32112-2_33openalex-snapshot
Fault Tolerant High Performance Galois Field Arithmetic Processor
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.1007/s41635-019-00087-5openalex-snapshot
Throughput/Area Efficient Implementation of Scalable Polynomial Basis Multiplication
inferred← citeshttps://doi.org/10.1016/j.aej.2020.10.058openalex-snapshot
Word-serial unified and scalable semi-systolic processor for field multiplication and squaring
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2015.07.006openalex-snapshot
Versatile digit serial multipliers for binary extension fields
inferred← citeshttps://doi.org/10.1016/j.eij.2022.01.001openalex-snapshot
Combined two-dimensional word-based serial-in/serial-out systolic processor for multiplication and squaring over GF ( 2 m )
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.10.008openalex-snapshot
A survey of some recent bit-parallel GF(2n) multipliers
inferred← citeshttps://doi.org/10.1016/j.jksuci.2022.06.009openalex-snapshot
Compact modular multiplier design for strong security capabilities in resource-limited Telehealth IoT devices
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.vlsi.2023.102124openalex-snapshot
High-performance unified modular multiplication algorithm and hardware architecture over G(2m)
inferred← citeshttps://doi.org/10.1049/iet-cdt.2010.0021openalex-snapshot
Bit-serial and digit-serial GF(2 m ) Montgomery multipliers using linear feedback shift registers
inferred← citeshttps://doi.org/10.1049/iet-ifs.2012.0227openalex-snapshot
Low space‐complexity digit‐serial dual basis systolic multiplier over Galois field GF(2 m ) using Hankel matrix and Karatsuba algorithm
inferred← citeshttps://doi.org/10.1049/iet-ifs.2015.0336openalex-snapshot
Low‐latency digit‐serial dual basis multiplier for lightweight cryptosystems
inferred← citeshttps://doi.org/10.1049/iet-ifs.2015.0461openalex-snapshot
High‐performance and high‐speed implementation of polynomial basis Itoh–Tsujii inversion algorithm over GF(2 m )
inferred← citeshttps://doi.org/10.1080/00207210801924099openalex-snapshot
Horner's rule-based multiplication over GF(p) and GF(pn): a survey
inferred← citeshttps://doi.org/10.1080/02533839.2019.1644200openalex-snapshot
Design of a digit-serial multiplier over GF(2m) using a karatsuba algorithm
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.7.1763openalex-snapshot
Scalable and Systolic Montgomery Multipliers over GF(2m)
inferred← citeshttps://doi.org/10.1109/access.2018.2851662openalex-snapshot
Efficient Implementation of Karatsuba Algorithm Based Three-Operand Multiplication Over Binary Extension Field
inferred← citeshttps://doi.org/10.1109/access.2019.2903170openalex-snapshot
Speed-Oriented Architecture for Binary Field Point Multiplication on Elliptic Curves
inferred← citeshttps://doi.org/10.1109/access.2021.3051282openalex-snapshot
Innovative Dual-Binary-Field Architecture for Point Multiplication of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1109/access.2022.3141104openalex-snapshot
Efficient Hardware Implementation of Large Field-Size Elliptic Curve Cryptographic Processor
inferred← citeshttps://doi.org/10.1109/apccas.2008.4745989openalex-snapshot
High-speed and low-power serial accumulator for serial/parallel multiplier
inferred← citeshttps://doi.org/10.1109/arith.2007.10openalex-snapshot
An Algorithm for the nt Pairing Calculation in Characteristic Three and its Hardware Implementation
inferred← citeshttps://doi.org/10.1109/austrochip.2014.6946314openalex-snapshot
Evaluation of the back-end design overhead for ASIC implementations of large-operand multipliers targeting resource-constrained environments
inferred← citeshttps://doi.org/10.1109/cas-ictd.2009.4960812openalex-snapshot
Error Detecting Dual Basis Bit Parallel Systolic Multiplication Architecture over GF(2m)
inferred← citeshttps://doi.org/10.1109/ciapp.2017.8167267openalex-snapshot
New digit-serial three-operand multiplier over binary extension fields for high-performance applications
inferred← citeshttps://doi.org/10.1109/cisis.2013.84openalex-snapshot
Low Complexity Digit-Serial Multiplier over GF(2^m) Using Karatsuba Technology
inferred← citeshttps://doi.org/10.1109/date.2009.5090708openalex-snapshot
Optimizing the HW/SW boundary of an ECC SoC design using control hierarchy and distributed storage
inferred← citeshttps://doi.org/10.1109/dsd.2010.59openalex-snapshot
Unified Digit Serial Systolic Montgomery Multiplication Architecture for Special Classes of Polynomials over GF(2m)
inferred← citeshttps://doi.org/10.1109/fpl.2013.6645546openalex-snapshot
Area/performance evaluation of digit-digit GF(2K) multipliers on FPGAS
inferred← citeshttps://doi.org/10.1109/fpl.2015.7293951openalex-snapshot
High speed ECC implementation on FPGA over GF(2m)
inferred← citeshttps://doi.org/10.1109/iccd.2015.7357184openalex-snapshot
Energy-efficient implementations of GF (p) and GF(2m) elliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/icecs.2012.6463517openalex-snapshot
Power efficiency of digit level polynomial basis finite field multipliers in GF(2283)
inferred← citeshttps://doi.org/10.1109/icgec.2012.129openalex-snapshot
Self-Checking Gaussian Normal Basis Multiplier over GF(2m) Using Multiplexer Approach
inferred← citeshttps://doi.org/10.1109/icgec.2012.136openalex-snapshot
Super Digit-Serial Systolic Multiplier over GF(2^m)
inferred← citeshttps://doi.org/10.1109/iconstem.2016.7560950openalex-snapshot
Design and implementation of 16 bit systolic multiplier using modular shifting algorithm
inferred← citeshttps://doi.org/10.1109/iscas.2008.4541455openalex-snapshot
A new look-up table-based multiplier/squarer design for cryptosystems over GF(2m)
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029517openalex-snapshot
Subquadratic space complexity digit-serial multiplier over binary extension fields using Toom-Cook algorithm
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029543openalex-snapshot
Time-efficient computation of digit serial Montgomery multiplication
inferred← citeshttps://doi.org/10.1109/isqed.2012.6187474openalex-snapshot
Low complexity cross parity codes for multiple and random bit error correction
inferred← citeshttps://doi.org/10.1109/norchp.2007.4481033openalex-snapshot
Area efficient pseudo-parallel Galois field multipliers
inferred← citeshttps://doi.org/10.1109/tc.2009.70openalex-snapshot
Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)
inferred← citeshttps://doi.org/10.1109/tc.2015.2401024openalex-snapshot
Comments on “Low-Latency Digit-Serial Systolic Double Basis Multiplier over $GF(2^{m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach”
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2264694openalex-snapshot
Low-Latency Digit-Serial and Digit-Parallel Systolic Multipliers for Large Binary Extension Fields
inferred← citeshttps://doi.org/10.1109/tcsi.2013.2283691openalex-snapshot
Efficient algorithm and architecture for elliptic curve cryptography for extremely constrained secure applications
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2386782openalex-snapshot
Low-Latency High-Throughput Systolic Multipliers Over $GF(2^{m})$ for NIST Recommended Pentanomials
inferred← citeshttps://doi.org/10.1109/tcsi.2015.2388842openalex-snapshot
Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a,b)$ -Way Karatsuba Algorithm
inferred← citeshttps://doi.org/10.1109/tcsi.2015.2437516openalex-snapshot
Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach
inferred← citeshttps://doi.org/10.1109/tcsi.2018.2866248openalex-snapshot
Digit-Serial Versatile Multiplier Based on a Novel Block Recombination of the Modified Overlap-Free Karatsuba Algorithm
inferred← citeshttps://doi.org/10.1109/tcsii.2008.2003347openalex-snapshot
A Combined Circuit for Multiplication and Inversion in ${\rm GF}(2^{m})$
inferred← citeshttps://doi.org/10.1109/tcsii.2015.2455992openalex-snapshot
Throughput/Area-efficient ECC Processor Using Montgomery Point Multiplication on FPGA
inferred← citeshttps://doi.org/10.1109/tencon.2015.7373168openalex-snapshot
A systolic architecture based GF (2m) multiplier using modified LSD first multiplication algorithm
inferred← citeshttps://doi.org/10.1109/tvlsi.2009.2016753openalex-snapshot
Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of ${\rm GF}(2^{m})$
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.2014.2341631openalex-snapshot
A Low-Complexity Multiple Error Correcting Architecture Using Novel Cross Parity Codes Over GF $(2^{m})$
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.1109/tvlsi.2016.2514272openalex-snapshot
Area-Delay Efficient Digit-Serial Multiplier Based on $k$ -Partitioning Scheme Combined With TMVP Block Recombination Approach
inferred← citeshttps://doi.org/10.1109/tvlsi.2016.2574620openalex-snapshot
High-Speed and Low-Latency ECC Processor Implementation Over GF( $2^{m})$ on FPGA
inferred← citeshttps://doi.org/10.1109/tvlsi.2016.2585980openalex-snapshot
Low-Power Design for a Digit-Serial Polynomial Basis Finite Field Multiplier Using Factoring Technique
inferred← citeshttps://doi.org/10.1109/tvlsi.2016.2605183openalex-snapshot
Low-Complexity Digit-Serial Multiplier Over $GF(2^{m})$ Based on Efficient Toeplitz Block Toeplitz Matrix–Vector Product Decomposition
inferred← citeshttps://doi.org/10.1109/tvlsi.2019.2903289openalex-snapshot
Novel Systolization of Subquadratic Space Complexity Multipliers Based on Toeplitz Matrix–Vector Product Approach
inferred← citeshttps://doi.org/10.1109/tvlsi.2022.3155611openalex-snapshot
Input-Latency Free Versatile Bit-Serial GF(2 m ) Polynomial Basis Multiplication
inferred← citeshttps://doi.org/10.1142/s0218126617501146openalex-snapshot
VLSI Implementation of Low Power High Speed ECC Processor Using Versatile Bit Serial Multiplier
inferred← citeshttps://doi.org/10.1145/1502781.1502783openalex-snapshot
Elliptic Curve Cryptography on FPGA for Low-Power Applications
inferred← citeshttps://doi.org/10.1145/1857927.1857933openalex-snapshot
Optimized System-on-Chip Integration of a Programmable ECC Coprocessor
inferred← citeshttps://doi.org/10.1587/elex.16.20190268openalex-snapshot
Efficient parallel semi-systolic array structure for multiplication and squaring in GF(2m)
inferred← citeshttps://doi.org/10.1587/elex.16.20190600openalex-snapshot
Novel bit-serial semi-systolic array structure for simultaneously computing field multiplication and squaring
inferred← citeshttps://doi.org/10.2197/ipsjtsldm.4.47openalex-snapshot
Scan Vulnerability in Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.3109/01480540903311043openalex-snapshot
The potential dermal irritating effect of residual (meth)acrylic monomers in pressure sensitive adhesive tapes
inferred← citeshttps://doi.org/10.3390/app11156938openalex-snapshot
Energy-Efficient Word-Serial Processor for Field Multiplication and Squaring Suitable for Lightweight Authentication Schemes in RFID-Based IoT Applications
inferred← citeshttps://doi.org/10.3390/electronics10151777openalex-snapshot
Word-Based Systolic Processor for Field Multiplication and Squaring Suitable for Cryptographic Processors in Resource-Constrained IoT Systems
inferred← citeshttps://doi.org/10.35940/ijrte.e4866.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e4935.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e4943.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e5091.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e5639.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e5652.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e6107.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e6300.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e6358.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e6493.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e6807.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e6946.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.35940/ijrte.e7032.018520openalex-snapshot
Withdrawn
inferred← citeshttps://doi.org/10.3923/jas.2008.2625.2630openalex-snapshot
A Novel Multiplication Algorithm in Nanotechnology
inferred← citeshttps://doi.org/10.46586/tches.v2024.i2.677-713openalex-snapshot
UpWB: An Uncoupled Architecture Design for White-box Cryptography Using Vectorized Montgomery Multiplication
inferred← citeshttps://doi.org/10.48175/ijarsct-v2-i3-304openalex-snapshot
High Performance and Low Latency ECC Processor for Cryptography
inferred← citeshttps://doi.org/10.5555/1874620.1874733openalex-snapshot
Optimizing the HW/SW boundary of an ECC SoC design using control hierarchy and distributed storage
inferred← citeshttps://doi.org/10.6109/jkiice.2010.14.3.628openalex-snapshot
A Study on Design of High-Speed Parallel Multiplier over GF(2m) using VCG
inferred← citeshttps://doi.org/10.9708/jksci.2013.18.2.009openalex-snapshot
Design of High-Speed Parallel Multiplier with All Coefficients 1's of Primitive Polynomial over Finite Fields GF(2m)
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.