On the public citation graph
Arithmetic operations in GF(2m)
0 signed · 63 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/bf00196789openalex-snapshot
An implementation for a fast public-key cryptosystem
inferredcites →https://doi.org/10.1016/0890-5401(88)90024-7openalex-snapshot
A fast algorithm for computing multiplicative inverses in GF(2m) using normal bases
inferredcites →https://doi.org/10.1090/s0002-9947-1933-1501703-0openalex-snapshot
On a Special Class of Polynomials
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866111-3openalex-snapshot
Primitive Normal Bases for Finite Fields
inferredcites →https://doi.org/10.1109/cicc.1989.56740openalex-snapshot
A high speed data encryption processor for public key cryptography
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11693383_11openalex-snapshot
On the (Im)Possibility of Practical and Secure Nonlinear Filters and Combiners
inferred← citeshttps://doi.org/10.1007/3-540-36400-5_37openalex-snapshot
Error Detection in Polynomial Basis Multipliers over Binary Extension Fields
inferred← citeshttps://doi.org/10.1007/3-540-44750-4_4openalex-snapshot
Fast Key Exchange with Elliptic Curve Systems
inferred← citeshttps://doi.org/10.1007/3-540-47555-9_44openalex-snapshot
On the Development of a Fast Elliptic Curve Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_22openalex-snapshot
Elliptic Curve Scalar Multiplier Design Using FPGAs
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_23openalex-snapshot
Highly Regular Architectures for Finite Field Computation Using Redundant Basis
inferred← citeshttps://doi.org/10.1007/3-540-48059-5_24openalex-snapshot
Low Complexity Bit-Parallel Finite Field Arithmetic Using Polynomial Basis
inferred← citeshttps://doi.org/10.1007/978-1-4615-2694-0_1openalex-snapshot
Development of Fast Multiplier Structures with Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_8openalex-snapshot
Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-319-16277-5_4openalex-snapshot
Reducing the Complexity of Normal Basis Multiplication
inferred← citeshttps://doi.org/10.1007/bf00203817openalex-snapshot
Elliptic curve cryptosystems and their implementation
inferred← citeshttps://doi.org/10.1007/bf01387196openalex-snapshot
On primitive and free roots in a finite field
inferred← citeshttps://doi.org/10.1007/bfb0052247openalex-snapshot
Efficient algorithms for elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1007/s10623-015-0106-2openalex-snapshot
Guest Editorial: Special Issue in Honor of Scott A. Vanstone
inferred← citeshttps://doi.org/10.1007/s10958-013-1350-5openalex-snapshot
Complexity of computation in finite fields
inferred← citeshttps://doi.org/10.1007/s13389-019-00210-wopenalex-snapshot
Polynomial multiplication over binary finite fields: new upper bounds
inferred← citeshttps://doi.org/10.1016/j.sysarc.2006.09.002openalex-snapshot
High-speed hardware implementations of Elliptic Curve Cryptography: A survey
inferred← citeshttps://doi.org/10.1016/s0167-9260(02)00053-6openalex-snapshot
Hardware architectures for public key cryptography
inferred← citeshttps://doi.org/10.1049/el:19990302openalex-snapshot
Massey-Omura type adder for elements of finitefields GF (2 m ) in logarithmic representation
inferred← citeshttps://doi.org/10.1090/s0025-5718-1994-1257578-3openalex-snapshot
Primitive Normal Polynomials Over Finite Fields
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/acssc.2015.7421165openalex-snapshot
Low power design of a word-level finite field multiplier using Reordered Normal Basis
inferred← citeshttps://doi.org/10.1109/andescon.2010.5633137openalex-snapshot
Hardware architectures for inversion in GF(2m) using polynomial and gaussian normal basis
inferred← citeshttps://doi.org/10.1109/apccas.1998.743829openalex-snapshot
An implementation of ElGamal elliptic curves cryptosystems
inferred← citeshttps://doi.org/10.1109/apccas.1998.743903openalex-snapshot
Design and implementation of arithmetic processor F/sub 2//sup 155/ for elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/arith.1997.614899openalex-snapshot
Fast software exponentiation in GF(2/sup k/)
inferred← citeshttps://doi.org/10.1109/asic.2000.880683openalex-snapshot
Improved VLSI designs for multiplication and inversion in GF(2/sup M/) over normal bases
inferred← citeshttps://doi.org/10.1109/cicc.1989.56740openalex-snapshot
A high speed data encryption processor for public key cryptography
inferred← citeshttps://doi.org/10.1109/dftvs.2005.24openalex-snapshot
Concurrent error detection of polynomial basis multiplication over extension fields using a multiple-bit parity scheme
inferred← citeshttps://doi.org/10.1109/hldvt.2006.320004openalex-snapshot
Easily Testable Implementation for Bit Parallel Multipliers in GF (2m)
inferred← citeshttps://doi.org/10.1109/icaccct.2012.6320779openalex-snapshot
High speed bit-parallel systolic multiplier over GF (2m) for cryptographic application
inferred← citeshttps://doi.org/10.1109/iceeot.2016.7755652openalex-snapshot
Efficient bit-parallel systolic multiplier over GF (2m)
inferred← citeshttps://doi.org/10.1109/iscas.2000.857084openalex-snapshot
An architecture of F(2/sup 2N/) multiplier for elliptic curves cryptosystem
inferred← citeshttps://doi.org/10.1109/iscas.2011.5937664openalex-snapshot
A new algorithm for double scalar multiplication over Koblitz curves
inferred← citeshttps://doi.org/10.1109/tc.2002.1004590openalex-snapshot
A new construction of Massey-Omura parallel multiplier over GF(2/sup m/)
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.2002.1047755openalex-snapshot
Finite field multiplier using redundant representation
inferred← citeshttps://doi.org/10.1109/tc.2004.47openalex-snapshot
Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)
inferred← citeshttps://doi.org/10.1109/tc.2006.147openalex-snapshot
Fault Detection Architectures for Field Multiplication Using Polynomial Bases
inferred← citeshttps://doi.org/10.1109/tc.2007.70741openalex-snapshot
A Novel Architecture for Galois Fields GF(2^m) Multipliers Based on Mastrovito Scheme
inferred← citeshttps://doi.org/10.1109/tc.2007.70832openalex-snapshot
Effects of Instruction-Set Extensions on an Embedded Processor: A Case Study on Elliptic Curve Cryptography over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/tc.2008.63openalex-snapshot
Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)
inferred← citeshttps://doi.org/10.1109/tc.2018.2859941openalex-snapshot
New Multiplicative Inverse Architectures Using Gaussian Normal Basis
inferred← citeshttps://doi.org/10.1109/tvlsi.2007.893659openalex-snapshot
On Concurrent Detection of Errors in Polynomial Basis Multiplication
inferred← citeshttps://doi.org/10.1109/tvlsi.2024.3393860openalex-snapshot
HRM: M-Term Heterogeneous Hybrid Blend Recursive Multiplier for GF(2 n ) Polynomial
inferred← citeshttps://doi.org/10.1109/vlsid.2007.53openalex-snapshot
Constant Function Independent Test Set for Fault Detection in Bit Parallel Multipliers in GF(2^m)
inferred← citeshttps://doi.org/10.1109/vts.2007.83openalex-snapshot
Transition Fault Testability in Bit Parallel Multipliers over GF(2^{m})
inferred← citeshttps://doi.org/10.1109/wispnet.2017.8300158openalex-snapshot
Hardware implementation and performance comparison of normal basis multiplication methods over GF (2m)
inferred← citeshttps://doi.org/10.1137/0219049openalex-snapshot
Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$
inferred← citeshttps://doi.org/10.1145/1297666.1297671openalex-snapshot
C-testable bit parallel multipliers over GF (2 m )
inferred← citeshttps://doi.org/10.13067/jkiecs.2014.9.8.867openalex-snapshot
Algorithms for Computing Inverses in Finite Fields using Special ONBs
inferred← citeshttps://doi.org/10.1515/156939206779217952openalex-snapshot
An application of the method of additive chains to inversion in finite fields
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3183097/v1openalex-snapshot
Dual ASIC/FPGA Design of Elliptic Curve Scalar Multiplication for Wireless Networks and Internet of Things
inferred← citeshttps://doi.org/10.3923/itj.2006.204.229openalex-snapshot
Elliptic Curve Cryptography over Binary Finite Field GF(2m)
inferred← citeshttps://doi.org/10.3929/ethz-a-004704198openalex-snapshot
Application exploration regarding a DPC like architecture
inferred← citeshttps://doi.org/10.4213/dm80openalex-snapshot
О применении метода аддитивных цепочек к инвертированию в конечных полях
inferred← citeshttps://doi.org/10.47893/ijcns.2011.1015openalex-snapshot
Performance Analysis Of Secured Synchronous Stream Ciphers
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.