On the public citation graph

Division and bit-serial multiplication over GF(qm)

https://doi.org/10.1049/ip-e.1992.0036

0 signed · 58 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/978-1-4613-1983-2openalex-snapshot

Finite Fields for Computer Scientists and Engineers

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/tit.1982.1056591openalex-snapshot

Bit-serial Reed - Solomon encoders

inferredcites →https://doi.org/10.1137/0112045openalex-snapshot

An Algorithm for the Inversion of Finite Toeplitz Matrices

inferredcites →https://doi.org/10.1137/0403012openalex-snapshot

Bit Serial Multiplication in Finite Fields

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/3-540-45811-5_23openalex-snapshot

Efficient Bit Serial Multiplication Using Optimal Normal Bases of Type II in GF(2m)

inferred← citeshttps://doi.org/10.1007/978-3-540-45235-5_75openalex-snapshot

Efficient Bit Serial Multiplication in GF(2 m ) for a Class of Finite Fields

inferred← citeshttps://doi.org/10.1007/978-3-642-31494-0_30openalex-snapshot

VLSI Architecture for Bit Parallel Systolic Multipliers for Special Class of GF(2 m )Using Dual Bases

inferred← citeshttps://doi.org/10.1007/bfb0052346openalex-snapshot

Fast message authentication using efficient polynomial evaluation

inferred← citeshttps://doi.org/10.1007/s11265-008-0164-zopenalex-snapshot

New Bit-Parallel Systolic Architectures for Computing Multiplication, Multiplicative Inversion and Division in GF(2m) Under Polynomial Basis and Normal Basis Representations

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.vlsi.2008.07.003openalex-snapshot

Improved throughput bit-serial multiplier for GF(2 ) fields

inferred← citeshttps://doi.org/10.1023/a:1007959127141openalex-snapshot

Novel Radix Finite Field Multiplier for GF(2m)

inferred← citeshttps://doi.org/10.1049/el:19921453openalex-snapshot

Division over GF (2 m )

inferred← citeshttps://doi.org/10.1049/iet-cds.2008.0331openalex-snapshot

High-speed hardware implementation of a serial-in parallel-out finite field multiplier using reordered normal basis

inferred← citeshttps://doi.org/10.1049/iet-ifs.2007.0132openalex-snapshot

Alternative to the Karatsuba algorithm for software implementations of GF(2 n ) multiplications

inferred← citeshttps://doi.org/10.1049/ip-cds:19981651openalex-snapshot

New low complexity bidirectional systolic structures for serial multiplication over the finite field GF(qm)

inferred← citeshttps://doi.org/10.1049/ip-cdt:19982349openalex-snapshot

GF(2m) multiplication over triangular basis for design of Reed-Solomon codes

inferred← citeshttps://doi.org/10.1109/12.156539openalex-snapshot

Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/12.156540openalex-snapshot

Bit-serial systolic divider and multiplier for finite fields GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/12.392853openalex-snapshot

Architecture for a low complexity rate-adaptive Reed-Solomon encoder

inferred← citeshttps://doi.org/10.1109/12.485570openalex-snapshot

GF(2/sup m/) multiplication and division over the dual basis

inferred← citeshttps://doi.org/10.1109/12.663762openalex-snapshot

Efficient multiplier architectures for Galois fields GF(2/sup 4n/)

inferred← citeshttps://doi.org/10.1109/12.713313openalex-snapshot

A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits

inferred← citeshttps://doi.org/10.1109/12.713315openalex-snapshot

Double-basis multiplicative inversion over GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/arith.2015.11openalex-snapshot

New Bit-Level Serial GF (2^m) Multiplication Using Polynomial Basis

inferred← citeshttps://doi.org/10.1109/asap.1996.542803openalex-snapshot

Efficient finite field serial/parallel multiplication

inferred← citeshttps://doi.org/10.1109/c-code.2017.7918952openalex-snapshot

Architectural review of polynomial bases finite field multipliers over GF(2m)

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/ccece.1993.332304openalex-snapshot

An architecture for a universal Reed-Solomon encoder using a triangular basis multiplication algorithm

inferred← citeshttps://doi.org/10.1109/ccece.1995.528116openalex-snapshot

Double-basis inversion in GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/ccece.1995.528117openalex-snapshot

Division-and-accumulation in GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/glocom.1996.585975openalex-snapshot

Multiplication using the triangular basis representation over GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/glsv.1996.497598openalex-snapshot

A parametrical architecture for Reed-Solomon decoders

inferred← citeshttps://doi.org/10.1109/icasic.2001.982594openalex-snapshot

A VLSI implementation of a low complexity Reed-Solomon encoder and decoder for CDPD

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/icecs.1998.814020openalex-snapshot

Circuit architectures for semi-bit-serial and programmable arithmetic in finite fields

inferred← citeshttps://doi.org/10.1109/icosp.2000.894560openalex-snapshot

A systolic architecture for elliptic curve cryptosystems

inferred← citeshttps://doi.org/10.1109/iscas.1998.706981openalex-snapshot

VLSI architectures of divider for finite field GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/iscas.2001.922162openalex-snapshot

Systolic VLSI realization of a novel iterative division algorithm over GF(2/sup m/): a high-speed, low-complexity design

inferred← citeshttps://doi.org/10.1109/iwbis.2017.8275113openalex-snapshot

Rijndael cipher optimization using low complexity serial multiplier based on Karatsuba technology

inferred← citeshttps://doi.org/10.1109/mwscas.2000.951643openalex-snapshot

Novel iterative division algorithm over GF(2/sup m/) and its semi-systolic VLSI realization

inferred← citeshttps://doi.org/10.1109/norchp.2007.4481033openalex-snapshot

Area efficient pseudo-parallel Galois field multipliers

inferred← citeshttps://doi.org/10.1109/pacrim.1991.160717openalex-snapshot

Multiplication and inversion over a class of GF(2/sup m/)

inferred← citeshttps://doi.org/10.1109/sips.1997.626118openalex-snapshot

Generalised triangular basis multipliers for the design of Reed-Solomon codecs

inferred← citeshttps://doi.org/10.1109/tc.2002.1004597openalex-snapshot

Equally spaced polynomials, dual bases, and multiplication in F(2/sup n/)

inferred← citeshttps://doi.org/10.1109/tc.2007.19openalex-snapshot

A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields

inferred← citeshttps://doi.org/10.1109/tc.2008.67openalex-snapshot

Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields

inferred← citeshttps://doi.org/10.1109/tc.2010.276openalex-snapshot

Block Recombination Approach for Subquadratic Space Complexity Binary Field Multiplication Based on Toeplitz Matrix-Vector Product

inferred← citeshttps://doi.org/10.1109/tc.2012.95openalex-snapshot

Multiway Splitting Method for Toeplitz Matrix Vector Product

inferred← citeshttps://doi.org/10.1109/tc.2013.2297106openalex-snapshot

$\schmi{GF(2^n)}$ Shifted Polynomial Basis Multipliers Based on Subquadratic Toeplitz Matrix-Vector Product Approach for All Irreducible Pentanomials

inferred← citeshttps://doi.org/10.1109/tc.2015.2456023openalex-snapshot

High-Speed Hybrid-Double Multiplication Architectures Using New Serial-Out Bit-Level Mastrovito Multipliers

inferred← citeshttps://doi.org/10.1109/tencon.1999.818431openalex-snapshot

Efficient multiplier architecture using optimized irreducible polynomial over GF((3/sup n/)/sup 3/)

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.1109/vlsisp.1996.558302openalex-snapshot

Novel structures for serial multiplication over the finite field GF(2/sup m/)

inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot

Cryptography

inferred← citeshttps://doi.org/10.5614/itbj.ict.2011.5.2.2openalex-snapshot

Synthesis Optimization on Galois-Field Based Arithmetic Operators for Rijndael Cipher

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.