On the public citation graph
Systolic array implementation of multipliers for finite fields GF(2/sup m/)
0 signed · 150 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.1016/s0019-9958(63)90129-3openalex-snapshot
Computation with finite fields
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1049/el:19860368openalex-snapshot
Use of unidirectional data flow in bit-level systolic array chips
inferredcites →https://doi.org/10.1049/ip-e.1988.0045openalex-snapshot
Algorithms for multiplication in Galois field for implementation using systolic arrays
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/proc.1984.12944openalex-snapshot
On supercomputing with systolic/wavefront array processors
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.1676351openalex-snapshot
The VLSI Implementation of a Reed—Solomon Encoder Using Berlekamp's Bit-Serial Multiplier Algorithm
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.1184/r1/6605633openalex-snapshot
Fault-tolerance and two-level pipelining in VLSI systolic arrays
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.70074openalex-snapshot
A Comparison of 163‐Bit Hybrid Karatsuba Multiplier and Word‐Serial Multipliers for ECC Processors
inferred← citeshttps://doi.org/10.1007/1-4020-3128-9_19openalex-snapshot
A New Arithmetic Unit in GF(2M) for Reconfigurable Hardware Implementation
inferred← citeshttps://doi.org/10.1007/11424758_53openalex-snapshot
Compact Linear Systolic Arrays for Multiplication Using a Trinomial Basis in GF(2 m ) for High Speed Cryptographic Processors
inferred← citeshttps://doi.org/10.1007/11428862_136openalex-snapshot
Semi-systolic Architecture for Modular Multiplication Over GF(2m)
inferred← citeshttps://doi.org/10.1007/11572961_56openalex-snapshot
VLSI Performance Evaluation and Analysis of Systolic and Semisystolic Finite Field Multipliers
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/11758501_85openalex-snapshot
Low Complexity Systolic Architecture for Modular Multiplication over GF(2 m )
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-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_100openalex-snapshot
Computational Algorithm and Architecture for AB2 Multiplication in Finite Fields
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-44839-x_93openalex-snapshot
Efficient Architecture for Exponentiation and Division in GF(2m) Using Irreducible AOP
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-45831-x_21openalex-snapshot
Bit-Serial AOP Arithmetic Architectures over GF(2m)
inferred← citeshttps://doi.org/10.1007/3-540-48051-x_36openalex-snapshot
New Parallel Architecture for Modular Multiplication and Squaring Based on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-41009-8_29openalex-snapshot
Design of a Low-Latency Multiplication Algorithm for Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-24707-4_55openalex-snapshot
Bit-Serial Multipliers for Exponentiation and Division in GF(2 m ) Using Irreducible AOP
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_67openalex-snapshot
New Digit-Serial Systolic Arrays for Power-Sum and Division Operation in GF(2 m )
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_69openalex-snapshot
A New Systolic Array for Least Significant Digit First Multiplication in GF(2 m )
inferred← citeshttps://doi.org/10.1007/978-3-540-24768-5_12openalex-snapshot
A Linear Systolic Array for Multiplication in GF(2 m ) for High Speed Cryptographic Processors
inferred← citeshttps://doi.org/10.1007/978-3-540-24768-5_21openalex-snapshot
Parallel Montgomery Multiplication and Squaring over GF(2 m ) Based on Cellular Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-45234-8_65openalex-snapshot
A New Arithmetic Unit in GF(2m) for Reconfigurable Hardware Implementation
inferred← citeshttps://doi.org/10.1007/978-3-540-69848-7_66openalex-snapshot
Semi-systolic Modular Multiplier over GF(2m)
inferred← citeshttps://doi.org/10.1007/978-94-007-6516-0_112openalex-snapshot
A Study on the Design of the Efficient Adder and Multiplier Based on Normal Basis over Finite Fields
inferred← citeshttps://doi.org/10.1007/s00034-018-0884-7openalex-snapshot
Analysis of Systolic Penalties and Design of Efficient Digit-Level Systolic-like Multiplier for Binary Extension Fields
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/s11265-008-0164-zopenalex-snapshot
New Bit-Parallel Systolic Architectures for Computing Multiplication, Multiplicative Inversion and Division in GF(2m) Under Polynomial Basis and Normal Basis Representations
inferred← citeshttps://doi.org/10.1007/s11265-012-0702-6openalex-snapshot
Utilization of Pipeline Technique in AOP Based Multipliers with Parallel Inputs
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/s11771-012-1140-0openalex-snapshot
Low latency systolic multipliers for finite field GF (2 m ) based on irreducible polynomials
inferred← citeshttps://doi.org/10.1016/0167-9260(95)00007-3openalex-snapshot
A dual basis bit-serial systolic multiplier for GF(2 )
inferred← citeshttps://doi.org/10.1016/j.amc.2003.09.002openalex-snapshot
AOP arithmetic architectures over GF(2m)
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.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.eij.2021.07.003openalex-snapshot
Low complexity design of bit parallel polynomial basis systolic multiplier using irreducible polynomials
inferred← citeshttps://doi.org/10.1016/j.mejo.2020.104709openalex-snapshot
Area-efficient low-latency polynomial basis finite field GF(2 ) systolic multiplier for a class of trinomials
inferred← citeshttps://doi.org/10.1016/j.mejo.2021.105163openalex-snapshot
A low complexity bit parallel polynomial basis systolic multiplier for general irreducible polynomials and trinomials
inferred← citeshttps://doi.org/10.1016/j.micpro.2015.11.016openalex-snapshot
Low space-complexity and low power semi-systolic multiplier architectures over GF(2m) based on irreducible trinomial
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.2007.05.001openalex-snapshot
Low-complexity bit-parallel systolic multipliers over GF(2 )
inferred← citeshttps://doi.org/10.1016/j.vlsi.2007.07.004openalex-snapshot
Versatile multiplier architectures in GF(2k) fields using the Montgomery multiplication algorithm
inferred← citeshttps://doi.org/10.1016/j.vlsi.2011.12.006openalex-snapshot
Low complexity bit-parallel polynomial basis multipliers over binary fields for special irreducible pentanomials
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/s0020-0190(00)00130-7openalex-snapshot
Partitioned systolic architecture for modular multiplication in
inferred← citeshttps://doi.org/10.1016/s0898-1221(01)00147-xopenalex-snapshot
Design of a linear systolic array for computing modular multiplication and squaring in GF(2m)
inferred← citeshttps://doi.org/10.1023/a:1007959127141openalex-snapshot
Novel Radix Finite Field Multiplier for GF(2m)
inferred← citeshttps://doi.org/10.1023/a:1008013818413openalex-snapshot
Low-Energy Digit-Serial/Parallel Finite Field Multipliers
inferred← citeshttps://doi.org/10.1049/iet-cds:20060314openalex-snapshot
Scalable and systolic Montgomery multiplier over GF(2 m ) generated by trinomials
inferred← citeshttps://doi.org/10.1049/iet-ifs.2009.0160openalex-snapshot
Concurrent error detection and correction in a polynomial basis multiplier over GF (2 m )
inferred← citeshttps://doi.org/10.1049/ip-cds:19981651openalex-snapshot
New low complexity bidirectional systolic structures for serial multiplication over the finite field GF(qm)
inferred← citeshttps://doi.org/10.1049/ip-cds:20030337openalex-snapshot
Computation of AB2 multiplication in GF(2m) using low-complexity systolic architecture
inferred← citeshttps://doi.org/10.1049/ip-cds:20040161openalex-snapshot
Design of new AB2 multiplier over GF(2m) using cellular automata
inferred← citeshttps://doi.org/10.1049/ip-cdt:20000785openalex-snapshot
Two systolic architectures for multiplication in GF (2m)
inferred← citeshttps://doi.org/10.1080/0020721021000044304openalex-snapshot
Dual basis digit serial GF(2m) multiplier
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.262128openalex-snapshot
A systolic power-sum circuit for GF(2/sup m/)
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.888047openalex-snapshot
New systolic arrays for C+AB/sup 2/, inversion, and division in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/30.964166openalex-snapshot
Fast VLSI arithmetic algorithms for high-security elliptic curve cryptographic applications
inferred← citeshttps://doi.org/10.1109/76.644066openalex-snapshot
An area-efficient pipelined VLSI architecture for decoding of Reed-Solomon codes based on a time-domain algorithm
inferred← citeshttps://doi.org/10.1109/81.340851openalex-snapshot
VLSI array synthesis for polynomial GCD computation and application to finite field division
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/82.877151openalex-snapshot
A low-complexity power-sum circuit for GF(2/sup m/) and its applications
inferred← citeshttps://doi.org/10.1109/92.661252openalex-snapshot
Efficient semisystolic architectures for finite-field arithmetic
inferred← citeshttps://doi.org/10.1109/92.831436openalex-snapshot
Hardware/software codesign of finite field datapath for low-energy Reed-Solomon codecs
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/apcc.2003.1274416openalex-snapshot
Design of B(x)/sup -1/mod F(x) for high-speed communications
inferred← citeshttps://doi.org/10.1109/apccas.1994.514551openalex-snapshot
A high speed Reed-Solomon codec chip using lookforward architecture
inferred← citeshttps://doi.org/10.1109/apccas.2006.342062openalex-snapshot
New Bit-Parallel Systolic Multiplier over GF(2m) Using The Modified Booth's Algorithm
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/asap.1993.397171openalex-snapshot
Systolic evaluation of functions: Digit-level algorithm and realization
inferred← citeshttps://doi.org/10.1109/asap.1996.542803openalex-snapshot
Efficient finite field serial/parallel multiplication
inferred← citeshttps://doi.org/10.1109/asic.2001.954728openalex-snapshot
An efficient digit-serial systolic multiplier for finite fields GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466574openalex-snapshot
A fast digit-serial systolic multiplier for finite field GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/ats.1993.398805openalex-snapshot
A C-testable DCVS GF(2/sup m/) multiplier
inferred← citeshttps://doi.org/10.1109/cas-ictd.2009.4960812openalex-snapshot
Error Detecting Dual Basis Bit Parallel Systolic Multiplication Architecture over 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/icassp.1995.480130openalex-snapshot
Low latency standard basis GF(2/sup m/) multiplier and squarer architectures
inferred← citeshttps://doi.org/10.1109/icassp.1996.550580openalex-snapshot
An area-efficient VLSI architecture for decoding of Reed-Solomon codes
inferred← citeshttps://doi.org/10.1109/icce.2001.935281openalex-snapshot
A fast finite field multiplier architecture for high-security cryptographic applications
inferred← citeshttps://doi.org/10.1109/iccsp.2019.8697927openalex-snapshot
Systolic Array Implementation of Mix Column and Inverse Mix Column of AES
inferred← citeshttps://doi.org/10.1109/icecs.2005.4633449openalex-snapshot
A systolic trinomial GF(2k) multiplier based on the Montgomery Multiplication Algorithm
inferred← citeshttps://doi.org/10.1109/iceeot.2016.7755632openalex-snapshot
Efficient bit-parallel systolic multiplier over GF (2m)
inferred← citeshttps://doi.org/10.1109/iceeot.2016.7755652openalex-snapshot
Efficient bit-parallel systolic multiplier over GF (2m)
inferred← citeshttps://doi.org/10.1109/icgccee.2014.6922224openalex-snapshot
Low-complexity systolic design for finite field multiplier
inferred← citeshttps://doi.org/10.1109/icii.2001.983507openalex-snapshot
Digit-serial systolic power-sum array in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/icosp.2000.894560openalex-snapshot
A systolic architecture for elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/icppw.1999.800061openalex-snapshot
Partitioned systolic multiplier for 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/iscas.1992.230101openalex-snapshot
Choosing VLSI algorithms for finite field arithmetic
inferred← citeshttps://doi.org/10.1109/iscas.1995.521618openalex-snapshot
High-level estimation of high-performance architectures for Reed-Solomon decoding
inferred← citeshttps://doi.org/10.1109/iscas.1997.621557openalex-snapshot
A new systolic squarer and its application to compute exponentiations in GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/iscas.1999.777940openalex-snapshot
Low-complexity modified Mastrovito multipliers over finite fields GF(2/sup M/)
inferred← citeshttps://doi.org/10.1109/iscas.1999.777943openalex-snapshot
A low time-complexity, hardware-efficient bit-parallel power-sum circuit for finite fields GF(2/sup M/)
inferred← citeshttps://doi.org/10.1109/iscas.2001.922302openalex-snapshot
Custom VLSI design of efficient low latency and low power finite field multiplier for Reed-Solomon codec
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/iscas.2008.4541541openalex-snapshot
Programmable LSB-first and MSB-first modular multipliers for ECC in GF(2m)
inferred← citeshttps://doi.org/10.1109/itcc.2004.1286717openalex-snapshot
Area efficient high speed elliptic curve cryptoprocessor for random curves
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/tc.2005.147openalex-snapshot
Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2/sup 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.2008.916622openalex-snapshot
Systolic and Super-Systolic Multipliers for Finite Field $GF(2^{m})$ Based on Irreducible Trinomials
inferred← citeshttps://doi.org/10.1109/tcsi.2010.2089553openalex-snapshot
Low Latency $GF(2^{m})$ Polynomial Basis Multiplier
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2334992openalex-snapshot
Efficient $M$ -ary Exponentiation over $GF(2^{m})$ Using Subquadratic KA-Based Three-Operand Montgomery Multiplier
inferred← citeshttps://doi.org/10.1109/tcsi.2015.2500419openalex-snapshot
High-Speed Polynomial Basis Multipliers Over GF(2m) for Special Pentanomials
inferred← citeshttps://doi.org/10.1109/tencon.2001.949623openalex-snapshot
Architecture of the high-speed standard basis multiplier with delay-boxes over GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/tencon.2003.1273423openalex-snapshot
A finite field inversion circuit for high-speed communications
inferred← citeshttps://doi.org/10.1109/tencon.2007.4429017openalex-snapshot
A combined multiplication/division algorithm for efficient design of ECC over GF(2m)
inferred← citeshttps://doi.org/10.1109/tvlsi.2004.842923openalex-snapshot
A digit-serial multiplier for finite field GF(2/sup m/)
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2005288openalex-snapshot
On Efficient Implementation of Accumulation in Finite Field Over $GF(2^{m})$ and its Applications
inferred← citeshttps://doi.org/10.1109/tvlsi.2008.2006080openalex-snapshot
Systolic and Non-Systolic Scalable Modular Designs of Finite Field Multipliers for Reed–Solomon Codec
inferred← citeshttps://doi.org/10.1109/tvlsi.2009.2023381openalex-snapshot
Test Generation in Systolic Architecture for Multiplication Over $GF(2 ^{m})$
inferred← citeshttps://doi.org/10.1109/tvlsi.2010.2066994openalex-snapshot
Digit-Level Semi-Systolic and Systolic Structures for the Shifted Polynomial Basis Multiplication Over Binary Extension Fields
inferred← citeshttps://doi.org/10.1109/tvlsi.2011.2181434openalex-snapshot
Low-Complexity Multiplier for $GF(2^{m})$ Based on All-One Polynomials
inferred← citeshttps://doi.org/10.1109/vlsisp.1996.558302openalex-snapshot
Novel structures for serial multiplication over the finite field GF(2/sup m/)
inferred← citeshttps://doi.org/10.1145/1120725.1121040openalex-snapshot
A fast digit-serial systolic multiplier for finite field GF(2m)
inferred← citeshttps://doi.org/10.1201/9780849387692.ch4openalex-snapshot
Hardware Design Issues in Elliptic Curve Cryptography for Wireless Systems
inferred← citeshttps://doi.org/10.14372/iemek.2016.11.4.227openalex-snapshot
Low Latency Systolic Multiplier over GF(2m) Using Irreducible AOP
inferred← citeshttps://doi.org/10.1587/elex.11.20141051openalex-snapshot
New systolic modular multiplication architecture for efficient Montgomery multiplication
inferred← citeshttps://doi.org/10.1587/elex.12.20150222openalex-snapshot
Efficient systolic modular multiplier/squarer for fast exponentiation over GF(2m)
inferred← citeshttps://doi.org/10.1587/elex.14.20171195openalex-snapshot
Efficient bit-parallel systolic architecture for multiplication and squaring over GF(2m)
inferred← citeshttps://doi.org/10.1587/elex.16.20190080openalex-snapshot
Low-latency semi-systolic architecture for multiplication over finite fields
inferred← citeshttps://doi.org/10.1587/transele.2021ecs6006openalex-snapshot
Bit-Parallel Systolic Architecture for AB and AB2 Multiplications over GF(2m)
inferred← citeshttps://doi.org/10.3745/kipsta.2002.9a.3.281openalex-snapshot
Implementation of a LSB-First Digit-Serial Multiplier for Finite Fields GF(2m)
inferred← citeshttps://doi.org/10.3745/kipsta.2004.11a.1.001openalex-snapshot
A Design of Cellular Array Parallel Multiplier on Finite Fields GF(2m)
inferred← citeshttps://doi.org/10.4028/scientific5/amr.457-458.848openalex-snapshot
A Systolic Bit-Parallel Multiplier with Flexible Latency and Complexity over GF(2m) Using Polynomial Basis
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.6109/jicce.2011.9.4.435openalex-snapshot
An Arithmetic System over Finite Fields
inferred← citeshttps://doi.org/10.7763/ijcte.2009.v1.61openalex-snapshot
A Study of Suitability and Effectiveness of Various Implementation Options Of Finite Field Arithmetic on Elliptic Curve Crypto System
inferred← citeshttps://doi.org/10.9708/jksci.2013.18.2.009openalex-snapshot
Design of High-Speed Parallel Multiplier with All Coefficients 1's of Primitive Polynomial over Finite Fields GF(2m)
inferred← citeshttps://doi.org/10.9723/jksiis.2013.18.2.041openalex-snapshot
Design of Montgomery Algorithm and Hardware Architecture 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.