On the public citation graph

A VLSI architecture for fast inversion in GF(2/sup m/)

0 signed · 122 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.1109/jsac.1986.1146305openalex-snapshot
A Fast VLSI Multiplier for GF(2m)
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.1976.5009207openalex-snapshot
Galois Switching Functions and Their Applications
inferredcites →https://doi.org/10.1109/tc.1984.1676441openalex-snapshot
Systolic Multipliers for Finite Fields 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/tcom.1976.1093315openalex-snapshot
Two's Complement Pipeline Multipliers
inferredcites →https://doi.org/10.1109/tit.1975.1055352openalex-snapshot
The use of finite fields to compute convolutions
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
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-36400-5_35openalex-snapshot
Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2n)
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-69053-0_25openalex-snapshot
Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)
inferred← citeshttps://doi.org/10.1007/978-1-4020-8391-4_6openalex-snapshot
Hardware implementation of Galois field operators
inferred← citeshttps://doi.org/10.1007/978-1-4757-2226-0_5openalex-snapshot
Optimal Normal Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-12827-1_8openalex-snapshot
Concurrent Error Detection Architectures for Field Multiplication Using Gaussian Normal Basis
inferred← citeshttps://doi.org/10.1007/978-981-99-1588-0_22openalex-snapshot
Analysis of Serial-In Parallel-Out Finite Field Multiplier Using Various Domino Logic Styles
inferred← citeshttps://doi.org/10.1007/bf02407028openalex-snapshot
Bit-level systolic arrays for finite-field multiplications
inferred← citeshttps://doi.org/10.1007/s10623-007-9073-6openalex-snapshot
Parallel Itoh–Tsujii multiplicative inversion algorithm for a special class of trinomials
inferred← citeshttps://doi.org/10.1016/j.aeue.2020.153383openalex-snapshot
An area-efficient ECC architecture over GF( 2 m ) for resource-constrained applications
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.09.002openalex-snapshot
New stream ciphers based on elliptic curve point multiplication
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2008.06.006openalex-snapshot
Implementation and analysis of stream ciphers based on the elliptic curves
inferred← citeshttps://doi.org/10.1016/j.micpro.2022.104439openalex-snapshot
An area-efficient architecture for finite field inversion over GF(2m) using polynomial basis
inferred← citeshttps://doi.org/10.1016/j.vlsi.2003.12.001openalex-snapshot
Efficient scalable VLSI architecture for Montgomery inversion in (p)
inferred← citeshttps://doi.org/10.1016/s0167-9260(02)00053-6openalex-snapshot
Hardware architectures for public key cryptography
inferred← citeshttps://doi.org/10.1016/s0167-9260(03)00004-xopenalex-snapshot
Systolic architectures for inversion/division using AB2 circuits in GF(2 )
inferred← citeshttps://doi.org/10.1017/cbo9780511800467openalex-snapshot
Algebraic Codes for Data Transmission
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.002openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.003openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.004openalex-snapshot
Introduction to Algebra
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.005openalex-snapshot
Linear Block Codes
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.006openalex-snapshot
The Arithmetic of Galois Fields
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.007openalex-snapshot
Cyclic Codes
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.008openalex-snapshot
Codes Based on the Fourier Transform
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.009openalex-snapshot
Algorithms Based on the Fourier Transform
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.010openalex-snapshot
Implementation
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.011openalex-snapshot
Convolutional Codes
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.012openalex-snapshot
Beyond BCH Codes
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.013openalex-snapshot
Codes and Algorithms Based on Graphs
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.014openalex-snapshot
Performance of Error-Control Codes
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.015openalex-snapshot
Codes and Algorithms for Majority Decoding
inferred← citeshttps://doi.org/10.1017/cbo9780511800467.016openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1049/el:19921453openalex-snapshot
Division over GF (2 m )
inferred← citeshttps://doi.org/10.1049/el:19961036openalex-snapshot
Fast normal basis inversion in 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-cdt:20060183openalex-snapshot
High speed hardware architecture to compute galois fields GF(p) montgomery inversion with scalability features
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.238496openalex-snapshot
On computing multiplicative inverses in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/12.241603openalex-snapshot
A systolic architecture for computing inverses and divisions in finite fields GF(2/sup m/)
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.729800openalex-snapshot
Systolic array implementation of Euclid's algorithm for inversion and division in GF(2/sup m/)
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/12.888047openalex-snapshot
New systolic arrays for C+AB/sup 2/, inversion, and division in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/12.926155openalex-snapshot
A fast algorithm for multiplicative inversion in GF(2/sup m/) using normal basis
inferred← citeshttps://doi.org/10.1109/82.488283openalex-snapshot
ACE: a VLSI chip for Galois field GF(2/sup m/) based exponentiation
inferred← citeshttps://doi.org/10.1109/82.868459openalex-snapshot
High-speed easily testable Galois-field inverter
inferred← citeshttps://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
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.2006.342505openalex-snapshot
Low Complexity Architecture for Multiplicative Inversion in GF(2m)
inferred← citeshttps://doi.org/10.1109/apccas.2006.342506openalex-snapshot
An Area-Efficient Design for Modular Inversion in GF(2m)
inferred← citeshttps://doi.org/10.1109/arith.2003.1207678openalex-snapshot
Low complexity sequential normal basis multipliers over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/arith.2013.25openalex-snapshot
Another Look at Inversions over Binary Fields
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/arith.2017.37openalex-snapshot
A New Multiplicative Inverse Architecture in Normal Basis Using Novel Concurrent Serial Squaring and Multiplication
inferred← citeshttps://doi.org/10.1109/asap.1993.397142openalex-snapshot
Systolic design of a new finite field division/inverse algorithm
inferred← citeshttps://doi.org/10.1109/ats.1998.741629openalex-snapshot
On-line error detection schemes for a systolic finite-field inverter
inferred← citeshttps://doi.org/10.1109/bwcca.2011.51openalex-snapshot
Finite Field Multiplication Using Reordered Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1109/ccst.1991.202202openalex-snapshot
Secure communication networks based on the public-key cryptosystem in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/ccwc51732.2021.9376014openalex-snapshot
Performance Analysis of Gaussian Normal Basis GF ($2^{m}$) Serial Multipliers and Inverters
inferred← citeshttps://doi.org/10.1109/cjece.2016.2638962openalex-snapshot
New Systolic Array Architecture for Finite Field Inversion
inferred← citeshttps://doi.org/10.1109/devic63749.2025.11012382openalex-snapshot
Transmission Gate based Reordered Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1109/edac.1993.386410openalex-snapshot
Systolic VLSI implementations of a Galois field arithmetic algorithms
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/icaect54875.2022.9807862openalex-snapshot
Implementation of Low Complexity Finite Field GF (2m) Multiplier Using Irreducible Primitive Polynomials
inferred← citeshttps://doi.org/10.1109/icassp.1997.599847openalex-snapshot
VLSI architecture for datapath integration of arithmetic over GF(2/sup m/) on digital signal processors
inferred← citeshttps://doi.org/10.1109/icmacc54824.2022.10093545openalex-snapshot
Design and Implementation of RNB multiplier Using NP Domino logic
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.1993.669630openalex-snapshot
SIGMA: A VLSI Chip for Galois Field GF(2m) Based Multiplication and Division
inferred← citeshttps://doi.org/10.1109/icvd.1994.282702openalex-snapshot
Cellular automata based VLSI architecture for computing multiplication and inverses in 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/ipps.1992.223032openalex-snapshot
A systolic algorithm and architecture for Galois field arithmetic
inferred← citeshttps://doi.org/10.1109/iscas.1994.409258openalex-snapshot
A dual basis systolic divider for GF (2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.1996.541751openalex-snapshot
Systolic array implementation of Euclid's algorithm for inversion and division in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.2002.1010808openalex-snapshot
An area-efficient systolic division circuit over GF(2/sup m/) for secure communication
inferred← citeshttps://doi.org/10.1109/iscas.2006.1692881openalex-snapshot
New viewpoint of bit-serial/parallel normal basis multipliers using irreducible all-one polynomial
inferred← citeshttps://doi.org/10.1109/isspa.1999.815768openalex-snapshot
Normal basis inversion in some finite fields
inferred← citeshttps://doi.org/10.1109/isvlsi.2015.32openalex-snapshot
Small FPGA Based Multiplication-Inversion Unit for Normal Basis Representation in GF(2m)
inferred← citeshttps://doi.org/10.1109/itcc.2005.8openalex-snapshot
A fast implementation of multiplicative inversion over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/mwscas.2010.5548774openalex-snapshot
Efficient VLSI implementation of a finite field multiplier using reordered normal basis
inferred← citeshttps://doi.org/10.1109/paccs.2009.150openalex-snapshot
Design of Scalable Hardware Architecture for Dual-field Montgomery Modular Inverse Computation
inferred← citeshttps://doi.org/10.1109/primeasia.2009.5397344openalex-snapshot
A fast hardware implementation of multiplicative inversion in GF(2m)
inferred← citeshttps://doi.org/10.1109/sips.2003.1235650openalex-snapshot
Efficient scalable hardware architecture for Montgomery inverse computation in GF(p)
inferred← citeshttps://doi.org/10.1109/tc.2002.1047755openalex-snapshot
Finite field multiplier using redundant representation
inferred← citeshttps://doi.org/10.1109/tc.2005.29openalex-snapshot
Low complexity word-level sequential normal basis multipliers
inferred← citeshttps://doi.org/10.1109/tc.2006.10openalex-snapshot
Efficient algorithms and architectures for field multiplication using Gaussian normal bases
inferred← citeshttps://doi.org/10.1109/tc.2007.70834openalex-snapshot
A New Finite-Field Multiplier Using Redundant Representation
inferred← citeshttps://doi.org/10.1109/tc.2010.218openalex-snapshot
High-Speed Architectures for Multiplication Using Reordered Normal Basis
inferred← citeshttps://doi.org/10.1109/tc.2010.235openalex-snapshot
A Word-Level Finite Field Multiplier Using Normal Basis
inferred← citeshttps://doi.org/10.1109/tc.2010.272openalex-snapshot
Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2^m)
inferred← citeshttps://doi.org/10.1109/tc.2012.22openalex-snapshot
Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1109/tc.2012.265openalex-snapshot
Fast Inversion in ${\schmi{GF(2^m)}}$ with Normal Basis Using Hybrid-Double Multipliers
inferred← citeshttps://doi.org/10.1109/tc.2015.2481408openalex-snapshot
New Architectures for Digit-Level Single, Hybrid-Double, Hybrid-Triple Field Multiplications and Exponentiation Using Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1109/tc.2018.2859941openalex-snapshot
New Multiplicative Inverse Architectures Using Gaussian Normal Basis
inferred← citeshttps://doi.org/10.1109/tc.2020.3023131openalex-snapshot
Novel GF($2_m$) Digit-Serial PISO Multipliers for the Self-Dual Gaussian Normal Bases
inferred← citeshttps://doi.org/10.1109/tc.2022.3149422openalex-snapshot
Efficient and scalable FPGA design of GF(2m) inversion for post-quantum cryptosystems
inferred← citeshttps://doi.org/10.1109/tcsi.2023.3253797openalex-snapshot
Squeezing Area of the Versatile GF (2 m ) GNB Arithmetic Operators
inferred← citeshttps://doi.org/10.1109/tcsii.2014.2387612openalex-snapshot
Fast and Generic Inversion Architectures Over $\mbox{GF}(2^m)$ Using Modified Itoh–Tsujii Algorithms
inferred← citeshttps://doi.org/10.1109/tvlsi.2014.2358196openalex-snapshot
Systolic Array Architectures for Sunar–Koç Optimal Normal Basis Type II Multiplier
inferred← citeshttps://doi.org/10.1109/tvlsi.2018.2851958openalex-snapshot
Efficient VLSI Implementation of a Sequential Finite Field Multiplier Using Reordered Normal Basis in Domino Logic
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.1994.574755openalex-snapshot
Efficient power based Galois Field Arithmetic architectures
inferred← citeshttps://doi.org/10.1109/vtsa.1991.246741openalex-snapshot
A systolic architecture for computing inverses in finite fields GF (2/sup m/)
inferred← citeshttps://doi.org/10.1155/s111086570220414xopenalex-snapshot
Low-Complexity Versatile Finite Field Multiplier in Normal Basis
inferred← citeshttps://doi.org/10.1201/9781420068405.ch23openalex-snapshot
Finite Field Arithmetic for RFID and Sensor Networks
inferred← citeshttps://doi.org/10.1201/b15006-22openalex-snapshot
Cryptography
inferred← citeshttps://doi.org/10.21236/ada397589openalex-snapshot
Design Tools and Architectures for Dedicated Digital Signal Processing (DSP) Processors
inferred← citeshttps://doi.org/10.3923/jas.2006.1362.1372openalex-snapshot
Hardware Implementations of GF (2m) Arithmetic Using Normal Basis
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.58-60.1007openalex-snapshot
Research and Hardware Design of Scalable Dual-Field Montgomery Modular Inversion Algorithm
inferred← citeshttps://doi.org/10.4218/etrij.03.0303.0014openalex-snapshot
A Scalable Structure for a Multiplier and an Inversion Unit in GF(2m)
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.