On the public citation graph
Architectures for exponentiation in GF(2/sup m/)
0 signed · 54 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/3-540-39757-4_20openalex-snapshot
Discrete logarithms in finite fields and their cryptographic significance
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/s0019-9958(63)90129-3openalex-snapshot
Computation with finite fields
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/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.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/tit.1975.1055352openalex-snapshot
The use of finite fields to compute convolutions
inferredcites →https://doi.org/10.1137/0203016openalex-snapshot
Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
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-44679-6_29openalex-snapshot
Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2m)1
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_92openalex-snapshot
Time-Space Efficient Exponentiation over GF(2m)
inferred← citeshttps://doi.org/10.1007/3-540-44862-4_91openalex-snapshot
Fast Exponentiaion over GF(2m) Based on Cellular Automata
inferred← citeshttps://doi.org/10.1007/3-540-47721-7_36openalex-snapshot
Thomas — A Complete Single Chip RSA Device
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-3-540-45238-6_19openalex-snapshot
Efficient Exponentiation for a Class of Finite Fields GF(2 n ) Determined by Gauss Periods
inferred← citeshttps://doi.org/10.1007/978-981-10-6520-0_6openalex-snapshot
Efficient Combined Algorithm for Multiplication and Squaring for Fast Exponentiation over Finite Fields $$GF(2^{m})$$
inferred← citeshttps://doi.org/10.1007/bf01212964openalex-snapshot
Efficient and optimal exponentiation in finite fields
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90045-xopenalex-snapshot
Structure of parallel multipliers for a class of fields GF(2m)
inferred← citeshttps://doi.org/10.1016/j.amc.2005.09.062openalex-snapshot
How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
inferred← citeshttps://doi.org/10.1016/j.micpro.2018.11.002openalex-snapshot
Asynchronous hardware implementations for crypto primitives
inferred← citeshttps://doi.org/10.1016/j.vlsi.2012.03.001openalex-snapshot
Low-power and high-speed design of a versatile bit-serial multiplier in finite fields GF(2 )
inferred← citeshttps://doi.org/10.1016/s1005-8885(08)60201-0openalex-snapshot
Nonlinear network coding based on multiplication and exponentiation in GF(2m)
inferred← citeshttps://doi.org/10.1049/ip-cdt:19981906openalex-snapshot
Digit-serial systolic multiplier for finite fields GF(2m)
inferred← citeshttps://doi.org/10.1109/12.214694openalex-snapshot
Architectures for exponentiation over GD(2/sup n/) adopted for smartcard application
inferred← citeshttps://doi.org/10.1109/12.293263openalex-snapshot
Bit-level systolic array for fast exponentiation in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/12.565591openalex-snapshot
Efficient exponentiation of a primitive root in GF(2/sup m/)
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/82.488283openalex-snapshot
ACE: a VLSI chip for Galois field GF(2/sup m/) based exponentiation
inferred← citeshttps://doi.org/10.1109/82.633444openalex-snapshot
VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/92.974900openalex-snapshot
Efficient exponentiation using weakly dual basis
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/cjece.2019.2900087openalex-snapshot
Efficient Parallel and Serial Systolic Structures for Multiplication and Squaring Over GF(${2^{m}}$ )
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/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/icc.2011.5963328openalex-snapshot
Secret Sharing in the Encrypted Domain
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.1994.282705openalex-snapshot
ACE: a VLSI chip for Galois field GF(2/sup m/) based exponentiation
inferred← citeshttps://doi.org/10.1109/iscas.1994.409232openalex-snapshot
VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.2001.922244openalex-snapshot
Cellular-array power-sum circuits over programmable finite field GF(2''')
inferred← citeshttps://doi.org/10.1109/mwscas.1991.252045openalex-snapshot
A systolic exponentiator for finite fields GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/norchp.2007.4481033openalex-snapshot
Area efficient pseudo-parallel Galois field multipliers
inferred← citeshttps://doi.org/10.1109/sbcci.2000.876029openalex-snapshot
Prototyping a pager-like device using FPGAs: design of an object finder
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.2008.63openalex-snapshot
Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)
inferred← citeshttps://doi.org/10.1109/tcsi.2008.919757openalex-snapshot
Arithmetic Unit for Finite Field ${\rm GF}(2^{m})$
inferred← citeshttps://doi.org/10.1109/vlsi.2008.96openalex-snapshot
Design of Reversible Finite Field Arithmetic Circuits with Error Detection
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.1145/1297666.1297671openalex-snapshot
C-testable bit parallel multipliers over GF (2 m )
inferred← citeshttps://doi.org/10.1587/elex.14.20170458openalex-snapshot
Efficient unified semi-systolic arrays for multiplication and squaring over GF(2m)
inferred← citeshttps://doi.org/10.1587/elex.16.20190268openalex-snapshot
Efficient parallel semi-systolic array structure for multiplication and squaring in GF(2m)
inferred← citeshttps://doi.org/10.5555/827245.827288openalex-snapshot
Prototyping a Pager-Like Device Using FPGAs: Design of an Object Finder
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.