On the public citation graph

Bit-level systolic array for fast exponentiation in GF(2/sup m/)

0 signed · 41 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/9780470050118.ecse011openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1049/el:19860368openalex-snapshot
Use of unidirectional data flow in bit-level systolic array chips
inferredcites →https://doi.org/10.1049/ip-e.1989.0063openalex-snapshot
Systolic architecture for finite field exponentiation
inferredcites →https://doi.org/10.1109/12.45211openalex-snapshot
A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequences
inferredcites →https://doi.org/10.1109/31.135751openalex-snapshot
Systolic array implementation of multipliers for finite fields GF(2/sup m/)
inferredcites →https://doi.org/10.1109/49.1927openalex-snapshot
Architectures for exponentiation in GF(2/sup m/)
inferredcites →https://doi.org/10.1109/jsac.1986.1146305openalex-snapshot
A Fast VLSI Multiplier for GF(2m)
inferredcites →https://doi.org/10.1109/mc.1982.1653825openalex-snapshot
Why systolic architectures?
inferredcites →https://doi.org/10.1109/t-c.1971.223173openalex-snapshot
A Cellular-Array Multiplier for GF(2m)
inferredcites →https://doi.org/10.1109/tc.1984.1676441openalex-snapshot
Systolic Multipliers for Finite Fields GF(2m)
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1184/r1/6605633openalex-snapshot
Fault-tolerance and two-level pipelining in VLSI systolic arrays
inferredcites →https://doi.org/10.2307/2003832openalex-snapshot
Error-Correcting Codes.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11676935_52openalex-snapshot
Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2 m ) Using LSB First Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_92openalex-snapshot
Time-Space Efficient Exponentiation over GF(2m)
inferred← citeshttps://doi.org/10.1007/3-540-44862-4_91openalex-snapshot
Fast Exponentiaion over GF(2m) Based on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_19openalex-snapshot
Efficient Exponentiation for a Class of Finite Fields GF(2 n ) Determined by Gauss Periods
inferred← citeshttps://doi.org/10.1007/s11390-007-9003-0openalex-snapshot
Unified Parallel Systolic Multiplier Over ${\it GF}(2^{m})$
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2008.09.009openalex-snapshot
More efficient systolic arrays for multiplication in GF() using LSB first algorithm with irreducible polynomials and trinomials
inferred← citeshttps://doi.org/10.1049/ip-cdt:19981906openalex-snapshot
Digit-serial systolic multiplier for finite fields GF(2m)
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1109/92.661252openalex-snapshot
Efficient semisystolic architectures for finite-field arithmetic
inferred← citeshttps://doi.org/10.1109/ainaw.2007.225openalex-snapshot
Low-Complexity Parallel Systolic Architectures for Computing Multiplication and Squaring over FG(2^m)
inferred← citeshttps://doi.org/10.1109/arith.2001.930103openalex-snapshot
Bit-parallel systolic modular multipliers for a class of GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/enc.2003.1232886openalex-snapshot
Hardware implementation of the binary method for exponentiation in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/icassp.1995.480130openalex-snapshot
Low latency standard basis GF(2/sup m/) multiplier and squarer architectures
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/icosp.2000.894561openalex-snapshot
The design of a low-complexity systolic architecture for fast bit-parallel exponentiation in a class of GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/icvd.1994.282705openalex-snapshot
ACE: a VLSI chip for Galois field GF(2/sup m/) based exponentiation
inferred← citeshttps://doi.org/10.1109/icvd.1997.568178openalex-snapshot
Architectures for arithmetic over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.1997.621557openalex-snapshot
A new systolic squarer and its application to compute exponentiations in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.2001.922303openalex-snapshot
New bit-parallel systolic multipliers for a class of GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.2003.1206392openalex-snapshot
A systolic multiplier with LSB first algorithm over GF(2/sup m/) which is as efficient as the one with MSB first algorithm
inferred← citeshttps://doi.org/10.1109/iscas56072.2025.11043771openalex-snapshot
Design of Cascade and One-Shot Mixed-Mode Recursive Multipliers for GF(2N) Polynomials
inferred← citeshttps://doi.org/10.1109/tc.2005.147openalex-snapshot
Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2/sup m/)
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.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/vtsa.2001.934542openalex-snapshot
High-speed bit-parallel systolic multipliers for a class of GF(2/sup m/)
inferred← citeshttps://doi.org/10.21236/ada397589openalex-snapshot
Design Tools and Architectures for Dedicated Digital Signal Processing (DSP) Processors
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.