On the public citation graph
Bit Serial Multiplication in Finite Fields
0 signed · 76 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/978-1-4613-1983-2openalex-snapshot
Finite Fields for Computer Scientists and Engineers
inferredcites →https://doi.org/10.1016/0166-218x(88)90090-xopenalex-snapshot
Optimal normal bases in GF(pn)
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
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/11676935_52openalex-snapshot
Unidirectional Two Dimensional Systolic Array for Multiplication in GF(2 m ) Using LSB First Algorithm
inferred← citeshttps://doi.org/10.1007/11676935_53openalex-snapshot
Efficient Linear Array for Multiplication over NIST Recommended Binary Fields
inferred← citeshttps://doi.org/10.1007/11734727_27openalex-snapshot
New Architecture for Multiplication in GF(2 m ) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-36159-6_18openalex-snapshot
Low Complexity Bit Serial Systolic Multipliers over GF(2m) for Three Classes of Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-44499-8_21openalex-snapshot
Montgomery Multiplier and Squarer in GF(2m)
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/3-540-48059-5_13openalex-snapshot
Efficient Finite Field Basis Conversion Involving dual bases
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_1openalex-snapshot
Introduction to Finite Fields and Bases
inferred← citeshttps://doi.org/10.1007/978-3-319-01796-9_40openalex-snapshot
Pipeline Design of Bit-Parallel Gaussian Normal Basis Multiplier over GF(2m)
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.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/bf01418530openalex-snapshot
Self-dual bases in $$\mathbb{F}_{q^n } $$
inferred← citeshttps://doi.org/10.1007/s10440-006-9046-1openalex-snapshot
Efficient Software-Implementation of Finite Fields with Applications to Cryptography
inferred← citeshttps://doi.org/10.1007/s10440-006-9072-zopenalex-snapshot
Efficient Hardware Implementation of Finite Fields with Applications to Cryptography
inferred← citeshttps://doi.org/10.1007/s10623-011-9537-6openalex-snapshot
On explicit factors of cyclotomic polynomials over finite fields
inferred← citeshttps://doi.org/10.1007/s10623-012-9647-9openalex-snapshot
Composed products and factors of cyclotomic polynomials over finite fields
inferred← citeshttps://doi.org/10.1007/s11390-006-0887-xopenalex-snapshot
Low-Complexity Bit-Parallel Multiplier over GF(2m) Using Dual Basis Representation
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.1007/s13389-012-0035-1openalex-snapshot
Sequential multiplier with sub-linear gate complexity
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2005.09.002openalex-snapshot
Low-complexity bit-parallel dual basis multipliers using the modified Booth’s algorithm
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.1016/j.dam.2007.05.031openalex-snapshot
A new characterization of dual bases in finite fields and its applications
inferred← citeshttps://doi.org/10.1016/j.disc.2022.112890openalex-snapshot
Linear sets on the projective line with complementary weights
inferred← citeshttps://doi.org/10.1016/j.ffa.2011.04.002openalex-snapshot
On coefficients of polynomials over finite fields
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.1023/a:1008333132366openalex-snapshot
On-Line Error Detection for Bit-Serial Multipliers in GF(2m)
inferred← citeshttps://doi.org/10.1049/iet-cds.2009.0243openalex-snapshot
Concurrent error detection in semi-systolic dual basis multiplier over GF(2 m ) using self-checking alternating logic
inferred← citeshttps://doi.org/10.1049/iet-cds:20080122openalex-snapshot
Concurrent error detection and correction in dual basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.1049/iet-ifs.2010.0139openalex-snapshot
Non-XOR approach for low-cost bit-parallel polynomial basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.1049/iet-ifs.2010.0254openalex-snapshot
Self-checking alternating logic bit-parallel Gaussian normal basis multiplier with type- t
inferred← citeshttps://doi.org/10.1049/iet-ifs.2011.0190openalex-snapshot
Fault-tolerant Gaussian normal basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.1049/iet-ifs.2012.0110openalex-snapshot
Low-complexity Gaussian normal basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.1049/iet-ifs.2012.0200openalex-snapshot
Palindromic-like representation for Gaussian normal basis multiplier over GF(2 m ) with odd type t
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/ip-cdt:19982349openalex-snapshot
GF(2m) multiplication over triangular basis for design of Reed-Solomon codes
inferred← citeshttps://doi.org/10.1049/ip-e.1992.0036openalex-snapshot
Division and bit-serial multiplication over GF(qm)
inferred← citeshttps://doi.org/10.1080/02533839.2014.955977openalex-snapshot
Low-complexity digit-serial systolic Gaussian normal basis multiplier for curve-based cryptosystems
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.1.236openalex-snapshot
New Hardware Architecture for Multiplication over GF(2m) and Comparisons with Normal and Polynomial Basis Multipliers for Elliptic Curve Cryptography
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.713315openalex-snapshot
Double-basis multiplicative inversion over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/12.736433openalex-snapshot
New low-complexity bit-parallel finite field multipliers using weakly dual bases
inferred← citeshttps://doi.org/10.1109/18.104343openalex-snapshot
On bit-serial multiplication and dual bases in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/18.104351openalex-snapshot
A note on repeated-root cyclic codes
inferred← citeshttps://doi.org/10.1109/81.735445openalex-snapshot
Efficient architectures for computations over variable dimensional Galois fields
inferred← citeshttps://doi.org/10.1109/82.475249openalex-snapshot
GF(p/sup m/) multiplication using polynomial residue number systems
inferred← citeshttps://doi.org/10.1109/92.974900openalex-snapshot
Efficient exponentiation using weakly dual basis
inferred← citeshttps://doi.org/10.1109/apccas.2002.1114972openalex-snapshot
Low-complexity systolic multiplier over GF(2/sup m/) using weakly dual basis
inferred← citeshttps://doi.org/10.1109/arith.2003.1207679openalex-snapshot
A low complexity and a low latency bit parallel systolic multiplier over GF(2/sup m/) using an optimal normal basis of type II
inferred← citeshttps://doi.org/10.1109/cason.2010.33openalex-snapshot
Fast Optimal Normal Basis Multiplier with Type-2kw Over GF (2m)
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/ccece53047.2021.9569160openalex-snapshot
Efficient Multiplier and FPGA Implementation for NTRU Prime
inferred← citeshttps://doi.org/10.1109/dftvs.1997.628338openalex-snapshot
On-line error detection for finite field multipliers
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/icgec.2011.63openalex-snapshot
Novel Mastrovito Multiplier over GF(2m) Using Trinomial
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/icist.2014.6920532openalex-snapshot
Efficient bit-serial finite field montgomery multiplier in GF(2m)
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/isit.1991.695401openalex-snapshot
Division And Bit-serial Multiplication Over GF(q/sup m/)
inferred← citeshttps://doi.org/10.1109/tc.2002.1004591openalex-snapshot
Montgomery multiplier and squarer for a class of finite fields
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.2002.1017695openalex-snapshot
Bit-parallel finite field multiplier and squarer using polynomial basis
inferred← citeshttps://doi.org/10.1109/tc.2008.226openalex-snapshot
Concurrent Error Detection and Correction in Gaussian Normal Basis Multiplier over GF(2^m)
inferred← citeshttps://doi.org/10.1109/tc.2009.62openalex-snapshot
Concurrent Error Detection in Finite-Field Arithmetic Operations Using Pipelined and Systolic Architectures
inferred← citeshttps://doi.org/10.1109/tcsi.2002.800836openalex-snapshot
Low complexity parallel multiplier in F(q/sup n/) over F/sub q/
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/tvlsi.2014.2359113openalex-snapshot
Efficient Scalable Serial Multiplier Over GF( $\textbf {2}^{\boldsymbol {m}}$ ) Based on Trinomial
inferred← citeshttps://doi.org/10.4218/etrij.17.0116.0770openalex-snapshot
Low-Power and Low-Hardware Bit-Parallel Polynomial Basis Systolic Multiplier over GF(2 m ) for Irreducible Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1109.4693openalex-snapshot
Composed Products and Explicit Factors of Cyclotomic Polynomials over Finite Fields
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.