On the public citation graph
Finite field inversion over the dual basis
0 signed · 25 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.1049/el:19930313openalex-snapshot
Improved algorithm for division over GF (2 m )
inferredcites →https://doi.org/10.1109/12.156540openalex-snapshot
Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)
inferredcites →https://doi.org/10.1109/12.2212openalex-snapshot
A comparison of VLSI architecture of finite field multipliers using dual, normal, or standard bases
inferredcites →https://doi.org/10.1109/18.45274openalex-snapshot
Efficient bit-serial multiplication and the discrete-time Wiener-Hopf equation over finite fields
inferredcites →https://doi.org/10.1109/92.219904openalex-snapshot
SIGMA: a VLSI systolic array implementation of a Galois field GF(2/sup m/) based multiplication and division algorithm
inferredcites →https://doi.org/10.1109/iscas.1994.409232openalex-snapshot
VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/)
inferredcites →https://doi.org/10.1109/iscas.1994.409258openalex-snapshot
A dual basis systolic divider for 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/tc.1985.1676616openalex-snapshot
VLSI Architectures for Computing Multiplications and Inverses in GF(2m)
inferredcites →https://doi.org/10.1109/tit.1982.1056591openalex-snapshot
Bit-serial Reed - Solomon encoders
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_13openalex-snapshot
Efficient Finite Field Basis Conversion Involving dual bases
inferred← citeshttps://doi.org/10.1007/3-540-49162-7_2openalex-snapshot
A New Aspect of Dual Basis for Efficient Field Arithmetic
inferred← citeshttps://doi.org/10.1007/3-540-69053-0_25openalex-snapshot
Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)
inferred← citeshttps://doi.org/10.1049/el:19961036openalex-snapshot
Fast normal basis inversion in GF (2 m )
inferred← citeshttps://doi.org/10.1049/el:19970172openalex-snapshot
Improved normal basis inversion in GF (2 m )
inferred← citeshttps://doi.org/10.1093/comjnl/bxw009openalex-snapshot
Fast Inversions in Small Finite Fields by Using Binary Trees
inferred← citeshttps://doi.org/10.1109/12.805153openalex-snapshot
Fast arithmetic for public-key algorithms in Galois fields with composite exponents
inferred← citeshttps://doi.org/10.1109/fpga.1997.624622openalex-snapshot
Comparison of arithmetic architectures for Reed-Solomon decoders in reconfigurable hardware
inferred← citeshttps://doi.org/10.1109/icassp.1997.599846openalex-snapshot
Low-area dual basis divider over GF(2/sup M/)
inferred← citeshttps://doi.org/10.1109/isspa.1999.815768openalex-snapshot
Normal basis inversion in some finite fields
inferred← citeshttps://doi.org/10.1109/tc.2004.52openalex-snapshot
A generalized method for constructing subquadratic complexity GF(2/sup k/) multipliers
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.14257/astl.2016.134.02openalex-snapshot
Fast FPGA Implementations of Inversions for Special Irreducible Polynomials in Finite Field
inferred← citeshttps://doi.org/10.5573/ieie.2016.53.2.070openalex-snapshot
Design of the Multiplier in case of P=2 over the Finite Fields based on the Polynomial
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.