On the public citation graph

A VLSI design for computing exponentiations in GF(2/sup m/) and its application to generate pseudorandom number sequences

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.
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.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/mcom.1979.1089968openalex-snapshot
Packets to the editor
inferredcites →https://doi.org/10.1109/proc.1977.10825openalex-snapshot
Spread spectrum systems
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.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-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-4757-2226-0_5openalex-snapshot
Optimal Normal Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-27708-5_25openalex-snapshot
Low Cost Dual-Basis Multiplier over GF(2m) Using Multiplexer Approach
inferred← citeshttps://doi.org/10.1007/s10440-006-9071-0openalex-snapshot
Scalable and Systolic Architecture for Computing Double Exponentiation Over GF(2 m )
inferred← citeshttps://doi.org/10.1007/s10836-005-1053-zopenalex-snapshot
Concurrent Error Detection in a Bit-Parallel Systolic Multiplier for Dual Basis of GF(2m)
inferred← citeshttps://doi.org/10.1007/s10836-006-7446-9openalex-snapshot
Concurrent Error Detection in a Polynomial Basis Multiplier over GF(2m)
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.2007.09.004openalex-snapshot
Multiplexer-based bit-parallel systolic multipliers over GF(2m)
inferred← citeshttps://doi.org/10.1016/j.cose.2004.09.012openalex-snapshot
Multiplexer-based double-exponentiation for normal basis of GF(2m)
inferred← citeshttps://doi.org/10.1016/j.jisa.2023.103430openalex-snapshot
A tradeoff paradigm shift in cryptographically-secure pseudorandom number generation based on discrete logarithm
inferred← citeshttps://doi.org/10.1016/j.nima.2014.04.011openalex-snapshot
Fast decoding algorithms for coded aperture systems
inferred← citeshttps://doi.org/10.1016/j.vlsi.2007.05.001openalex-snapshot
Low-complexity bit-parallel systolic multipliers over GF(2 )
inferred← citeshttps://doi.org/10.1023/a:1019715916749openalex-snapshot
Bit-Parallel Arithmetic Implementations over Finite Fields GF(2 m ) with Reconfigurable Hardware
inferred← citeshttps://doi.org/10.1049/el:20031050openalex-snapshot
Low-complexity finite field multiplier using irreducible trinomials
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.2012.0210openalex-snapshot
Low-complexity design of bit-parallel dual-basis multiplier over GF(2 m )
inferred← citeshttps://doi.org/10.1049/ip-cds:20050188openalex-snapshot
Low-complexity bit-parallel systolic architectures for computing A(x)B2(x) over GF(2m)
inferred← citeshttps://doi.org/10.1080/00207217.2013.780297openalex-snapshot
High-performance computing VLSI system for bit-parallel exponentiation inGF(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.663762openalex-snapshot
Efficient multiplier architectures for Galois fields GF(2/sup 4n/)
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/18.556132openalex-snapshot
Normal basis of the finite field F/sub 2/(p-1)p/sup m/ over F/sub 2/
inferred← citeshttps://doi.org/10.1109/3dpvt.2004.40openalex-snapshot
Construction of animal models and motion synthesis in 3D virtual environments using image sequences
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.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/92.661252openalex-snapshot
Efficient semisystolic architectures for finite-field arithmetic
inferred← citeshttps://doi.org/10.1109/ainaw.2007.225openalex-snapshot
Low-Complexity Parallel Systolic Architectures for Computing Multiplication and Squaring over FG(2^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/asicon.2011.6157318openalex-snapshot
Parallel structure of GF (214) and GF (216) multipliers based on composite finite fields
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/et2ecn.2014.7044939openalex-snapshot
FPGA implementation of multipliers for ECC
inferred← citeshttps://doi.org/10.1109/icics.2007.4449810openalex-snapshot
Design of Multiplexer-Based Multi-Exponentiation on the Normal Bases
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/icsmc.2006.384557openalex-snapshot
Low-Complexity Bit-Parallel Systolic Multipliers over GF(2m)
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.282705openalex-snapshot
ACE: a VLSI chip for Galois field GF(2/sup m/) based exponentiation
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.409232openalex-snapshot
VLSI architectures for computing exponentiations, multiplicative inverses, and divisions in GF(2/sup m/)
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/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.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/tcad.2014.2387866openalex-snapshot
Secure and Efficient Architectures for Single Exponentiations in Finite Fields Suitable for High-Performance Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/tcad.2015.2424928openalex-snapshot
High-Performance Two-Dimensional Finite Field Multiplication and Exponentiation for Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/vlsisp.1994.574755openalex-snapshot
Efficient power based Galois Field Arithmetic architectures
inferred← citeshttps://doi.org/10.1109/vtsa.2001.934544openalex-snapshot
New efficient low-complexity architecture for performing inversion and divisions
inferred← citeshttps://doi.org/10.3109/01480540903311043openalex-snapshot
The potential dermal irritating effect of residual (meth)acrylic monomers in pressure sensitive adhesive tapes
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.