On the public citation graph
Low-Latency Digit-Serial Systolic Double Basis Multiplier over $\mbi GF{(2^m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach
0 signed · 56 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-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/3-540-48892-8_16openalex-snapshot
Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)
inferredcites →https://doi.org/10.1007/978-3-540-69499-1_9openalex-snapshot
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
inferredcites →https://doi.org/10.1007/978-3-642-13797-6_3openalex-snapshot
A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier
inferredcites →https://doi.org/10.1007/s11265-011-0654-2openalex-snapshot
Scalable Gaussian Normal Basis Multipliers over GF(2 m ) Using Hankel Matrix-Vector Representation
inferredcites →https://doi.org/10.1016/0167-9260(95)00007-3openalex-snapshot
A dual basis bit-serial systolic multiplier for GF(2 )
inferredcites →https://doi.org/10.1023/a:1027422805851openalex-snapshot
Primitive Polynomials Over GF(2) of Degree up to 660 with Uniformly Distributed Coefficients
inferredcites →https://doi.org/10.1080/0020721021000044304openalex-snapshot
Dual basis digit serial GF(2m) multiplier
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1093/ietfec/e91-a.6.1470openalex-snapshot
Low-Complexity Parallel Systolic Montgomery Multipliers over GF(2m) Using Toeplitz Matrix-Vector Representation
inferredcites →https://doi.org/10.1109/12.2216openalex-snapshot
A new bit-serial systolic multiplier over GF(2/sup m/)
inferredcites →https://doi.org/10.1109/12.926154openalex-snapshot
Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials
inferredcites →https://doi.org/10.1109/dsd.2010.59openalex-snapshot
Unified Digit Serial Systolic Montgomery Multiplication Architecture for Special Classes of Polynomials over GF(2m)
inferredcites →https://doi.org/10.1109/itcc.2005.236openalex-snapshot
Quadrinomial modular arithmetic using modified polynomial basis
inferredcites →https://doi.org/10.1109/tc.1984.1676441openalex-snapshot
Systolic Multipliers for Finite Fields GF(2m)
inferredcites →https://doi.org/10.1109/tc.2005.147openalex-snapshot
Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2/sup m/)
inferredcites →https://doi.org/10.1109/tc.2007.1076openalex-snapshot
Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
inferredcites →https://doi.org/10.1109/tc.2007.19openalex-snapshot
A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
inferredcites →https://doi.org/10.1109/tvlsi.2004.842923openalex-snapshot
A digit-serial multiplier for finite field GF(2/sup m/)
inferredcites →https://doi.org/10.1109/tvlsi.2007.912228openalex-snapshot
Fast Elliptic Curve Cryptography on FPGA
inferredcites →https://doi.org/10.1109/tvlsi.2008.2005288openalex-snapshot
On Efficient Implementation of Accumulation in Finite Field Over $GF(2^{m})$ and its Applications
inferredcites →https://doi.org/10.1109/tvlsi.2009.2016753openalex-snapshot
Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of ${\rm GF}(2^{m})$
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-23207-2_20openalex-snapshot
Problems on Gaussian Normal Basis Multiplication for Elliptic Curve Cryptosystem
inferred← citeshttps://doi.org/10.1016/j.micpro.2019.01.002openalex-snapshot
Design and performance analysis of reconfigurable modified Vedic multiplier with 3-1-1-2 compressor
inferred← citeshttps://doi.org/10.1016/j.vlsi.2023.102106openalex-snapshot
Modified restoring array-based power efficient approximate square root circuit and its application
inferred← citeshttps://doi.org/10.1049/el.2015.0014openalex-snapshot
Reduction of space complexity based on symmetric TMVP
inferred← citeshttps://doi.org/10.1049/iet-cds.2014.0276openalex-snapshot
Subquadratic space complexity Gaussian normal basis multipliers over GF (2 m ) based on Dickson–Karatsuba decomposition
inferred← citeshttps://doi.org/10.1049/iet-cds.2017.0015openalex-snapshot
Gaussian normal basis multiplier over GF(2 m ) using hybrid subquadratic‐and‐quadratic TMVP approach for elliptic curve cryptography
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.1080/02533839.2019.1644200openalex-snapshot
Design of a digit-serial multiplier over GF(2m) using a karatsuba algorithm
inferred← citeshttps://doi.org/10.1109/ddecs.2013.6549784openalex-snapshot
Area-speed efficient modular architecture for GF(2m) multipliers dedicated for cryptographic applications
inferred← citeshttps://doi.org/10.1109/hst.2019.8741034openalex-snapshot
High Capability and Low-Complexity: Novel Fault Detection Scheme for Finite Field Multipliers over GF(2m) based on MSPB
inferred← citeshttps://doi.org/10.1109/icawst.2017.8256506openalex-snapshot
Hardware implementation of double basis multiplier using TMVP approach over GF (2m)
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323892openalex-snapshot
Invited Paper: A Scalable Hardware/Software Co-Design Approach for Efficient Polynomial Multiplication
inferred← citeshttps://doi.org/10.1109/iceca.2018.8474569openalex-snapshot
Fast, Secure and Efficient Vedic Approach for Cryptographic implementations on FPGA
inferred← citeshttps://doi.org/10.1109/iic.2015.7150899openalex-snapshot
VLSI architecture for an area efficient Elliptic Curve Cryptographic processor for embedded systems
inferred← citeshttps://doi.org/10.1109/iscas.2015.7168912openalex-snapshot
Efficient subquadratic parallel multiplier based on modified SPB of GF(2m)
inferred← citeshttps://doi.org/10.1109/iscas.2019.8702298openalex-snapshot
Low-Complexity Systolic Multiplier for GF(2m) using Toeplitz Matrix-Vector Product Method
inferred← citeshttps://doi.org/10.1109/jsen.2024.3520417openalex-snapshot
SVD Theory for Machine Fault Detection: A Review
inferred← citeshttps://doi.org/10.1109/rvsp.2013.35openalex-snapshot
Digit-Serial GNB Multiplier Based on TMVP Approach over GF(2m)
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.2014.2334992openalex-snapshot
Efficient $M$ -ary Exponentiation over $GF(2^{m})$ Using Subquadratic KA-Based Three-Operand Montgomery Multiplier
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2335031openalex-snapshot
Low-Complexity Digit-Serial and Scalable SPB/GPB Multipliers Over Large Binary Extension Fields Using (b,2)-Way Karatsuba Decomposition
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2376091openalex-snapshot
Efficient Subquadratic Space Complexity Architectures for Parallel MPB Single- and Double-Multiplications for All Trinomials Using Toeplitz Matrix-Vector Product Decomposition
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/tcsii.2013.2291075openalex-snapshot
Dual-Basis Superserial Multipliers for Secure Applications and Lightweight Cryptographic Architectures
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/tnnls.2021.3094799openalex-snapshot
Correlated SVD and Its Application in Bearing Fault Diagnosis
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.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.1145/3055514openalex-snapshot
Lightweight Architectures for Reliable and Fault Detection Simon and Speck Cryptographic Algorithms on FPGA
inferred← citeshttps://doi.org/10.1145/3572774openalex-snapshot
Retracted March 9, 2026: Parallel Finite Field Algorithms for Communications and Sensor Networks
inferred← citeshttps://doi.org/10.18260/p.25761openalex-snapshot
Multidisciplinary Approaches and Challenges in Integrating Emerging Medical Devices Security Research and Education
inferred← citeshttps://doi.org/10.2174/0118722121293262240527102646openalex-snapshot
A Systematic Review on Machine Learning / Deep Learning Model-based Detection of Sleep Apnea Using Bio-Signals
inferred← citeshttps://doi.org/10.5120/19897-1982openalex-snapshot
Space Optimized Multiplier Architecture for Embedded Cryptoprocessor
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.