On the public citation graph
Low-complexity bit-parallel systolic Montgomery multipliers for special classes of GF(2/sup m/)
0 signed · 108 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/978-1-4757-2226-0openalex-snapshot
Applications of Finite Fields
inferredcites →https://doi.org/10.1023/a:1008208521515openalex-snapshot
Montgomery Multiplication in GF(2k)
inferredcites →https://doi.org/10.1049/el:19910738openalex-snapshot
New bit-serial systolic multiplier for GF (2 m ) using irreducible trinomials
inferredcites →https://doi.org/10.1049/ip-cdt:20030061openalex-snapshot
Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials
inferredcites →https://doi.org/10.1090/fic/041/08openalex-snapshot
Algorithms for finding almost irreducible and almost primitive trinomials
inferredcites →https://doi.org/10.1090/s0025-5718-1973-0327722-7openalex-snapshot
Primitive Binary Polynomials
inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777282-xopenalex-snapshot
Modular Multiplication Without Trial Division
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/12.293263openalex-snapshot
Bit-level systolic array for fast exponentiation in GF(2/sup m/)
inferredcites →https://doi.org/10.1109/12.508323openalex-snapshot
A new architecture for a parallel finite field multiplier with low complexity based on composite fields
inferredcites →https://doi.org/10.1109/12.660172openalex-snapshot
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
inferredcites →https://doi.org/10.1109/12.769434openalex-snapshot
Mastrovito multiplier for all trinomials
inferredcites →https://doi.org/10.1109/12.926154openalex-snapshot
Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials
inferredcites →https://doi.org/10.1109/31.135751openalex-snapshot
Systolic array implementation of multipliers for finite fields GF(2/sup m/)
inferredcites →https://doi.org/10.1109/82.877151openalex-snapshot
A low-complexity power-sum circuit for GF(2/sup m/) and its applications
inferredcites →https://doi.org/10.1109/82.938363openalex-snapshot
Low-complexity bit-parallel systolic architecture for computing AB/sup 2/+C in a class of finite field GF(2/sup m/)
inferredcites →https://doi.org/10.1109/arith.2003.1207677openalex-snapshot
Efficient multiplication in GF(p/sup k/) for elliptic curve cryptography
inferredcites →https://doi.org/10.1109/tc.1984.1676441openalex-snapshot
Systolic Multipliers for Finite Fields GF(2m)
inferredcites →https://doi.org/10.1109/tc.2002.1004591openalex-snapshot
Montgomery multiplier and squarer for a class of finite fields
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/978-3-319-23207-2_19openalex-snapshot
Subquadratic Space-Complexity Parallel Systolic Multiplier Based on Karatsuba Algorithm and Block Recombination
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-69499-1_9openalex-snapshot
Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-74784-0_28openalex-snapshot
Dual-Residue Montgomery Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-642-38027-3_107openalex-snapshot
Design of Parallel Pipelined Algorithm for Field Arithmetic Architecture Based on Cellular Array
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/s11265-011-0654-2openalex-snapshot
Scalable Gaussian Normal Basis Multipliers over GF(2 m ) Using Hankel Matrix-Vector Representation
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/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/j.amc.2006.08.018openalex-snapshot
Programmable cellular automata based Montgomery hardware architecture
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.compeleceng.2010.01.001openalex-snapshot
Efficient bit-parallel multipliers over finite fields GF(2m)
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.10.008openalex-snapshot
A survey of some recent bit-parallel GF(2n) multipliers
inferred← citeshttps://doi.org/10.1016/j.matcom.2007.09.005openalex-snapshot
Montgomery exponent architecture based on programmable cellular automata
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.105275openalex-snapshot
Low-latency area-efficient systolic bit-parallel GF(2 m ) multiplier for a narrow class of trinomials
inferred← citeshttps://doi.org/10.1016/j.micpro.2020.103173openalex-snapshot
High-throughput area-delay-efficient systolic multiplier over GF(2 ) for a class of trinomials
inferred← citeshttps://doi.org/10.1016/j.micpro.2021.104053openalex-snapshot
Low-complexity bit-serial sequential polynomial basis finite field GF(2 m ) Montgomery multipliers
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.2009.07.002openalex-snapshot
Concurrent error detection architectures for Gaussian normal basis multiplication over GF(2 )
inferred← citeshttps://doi.org/10.1049/iet-cds.2017.0426openalex-snapshot
Bit‐parallel systolic multiplier over for irreducible trinomials with ASIC and FPGA implementations
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-cdt.2010.0021openalex-snapshot
Bit-serial and digit-serial GF(2 m ) Montgomery multipliers using linear feedback shift registers
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/02564602.2014.891383openalex-snapshot
Efficient Cellular Automata Based MontgomeryAB2Multipliers overGF(2m)
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.6.1470openalex-snapshot
Low-Complexity Parallel Systolic Montgomery Multipliers over GF(2m) Using Toeplitz Matrix-Vector Representation
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.7.1763openalex-snapshot
Scalable and Systolic Montgomery Multipliers over GF(2m)
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/acsat.2012.44openalex-snapshot
Hybrid Crypto Hardware Utilizing Symmetric-Key and Public-Key Cryptosystems
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/apccas.2006.342062openalex-snapshot
New Bit-Parallel Systolic Multiplier over GF(2m) Using The Modified Booth's Algorithm
inferred← citeshttps://doi.org/10.1109/apscc.2008.103openalex-snapshot
Efficient Bit-Parallel Multipliers in Composite Fields
inferred← citeshttps://doi.org/10.1109/aspdac.2009.4796482openalex-snapshot
An optimized design for serial-parallel finite field multiplication over GF(2m) based on all-one polynomials
inferred← citeshttps://doi.org/10.1109/cas-ictd.2009.4960823openalex-snapshot
Fault Tolerant Dual Basis Multiplier Over GF (2m)
inferred← citeshttps://doi.org/10.1109/cise.2009.5366111openalex-snapshot
Digit-Serial Gaussian Normal Basis Multiplier over GF(2m) Using Toeplitz Matrix-Approach
inferred← citeshttps://doi.org/10.1109/ddecs.2013.6549784openalex-snapshot
Area-speed efficient modular architecture for GF(2m) multipliers dedicated for cryptographic applications
inferred← citeshttps://doi.org/10.1109/dsd.2010.59openalex-snapshot
Unified Digit Serial Systolic Montgomery Multiplication Architecture for Special Classes of Polynomials over GF(2m)
inferred← citeshttps://doi.org/10.1109/icawst.2017.8256506openalex-snapshot
Hardware implementation of double basis multiplier using TMVP approach over GF (2m)
inferred← citeshttps://doi.org/10.1109/iccci.2016.7480005openalex-snapshot
Polynomial based Mastrovito multipliers for FFT applications for secure data encryption and decryption
inferred← citeshttps://doi.org/10.1109/icct56141.2022.10072558openalex-snapshot
Efficient Configurable Digit-Serial Multiplier Based on Improved Karatsuba Algorithm over GF(2m)
inferred← citeshttps://doi.org/10.1109/icgec.2012.129openalex-snapshot
Self-Checking Gaussian Normal Basis Multiplier over GF(2m) Using Multiplexer Approach
inferred← citeshttps://doi.org/10.1109/icgec.2012.136openalex-snapshot
Super Digit-Serial Systolic Multiplier over GF(2^m)
inferred← citeshttps://doi.org/10.1109/iciea.2010.5515057openalex-snapshot
Efficient digit serial dual basis GF(2m) multiplier
inferred← citeshttps://doi.org/10.1109/iconstem.2016.7560950openalex-snapshot
Design and implementation of 16 bit systolic multiplier using modular shifting algorithm
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/ieem.2010.5674308openalex-snapshot
A novel digit serial dual basis GF(2m) multiplier
inferred← citeshttps://doi.org/10.1109/iscas.2012.6272184openalex-snapshot
Low-latency area-delay-efficient systolic multiplier over GF(2m) for a wider class of trinomials using parallel register sharing
inferred← citeshttps://doi.org/10.1109/iscas.2019.8702298openalex-snapshot
Low-Complexity Systolic Multiplier for GF(2m) using Toeplitz Matrix-Vector Product Method
inferred← citeshttps://doi.org/10.1109/iscisc.2015.7387892openalex-snapshot
Fast and pipelined bit-parallel montgomery multiplication and squaring over GF(2m)
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029517openalex-snapshot
Subquadratic space complexity digit-serial multiplier over binary extension fields using Toom-Cook algorithm
inferred← citeshttps://doi.org/10.1109/isicir.2014.7029543openalex-snapshot
Time-efficient computation of digit serial Montgomery multiplication
inferred← citeshttps://doi.org/10.1109/tc.2009.70openalex-snapshot
Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m)
inferred← citeshttps://doi.org/10.1109/tc.2012.239openalex-snapshot
Low-Latency Digit-Serial Systolic Double Basis Multiplier over $\mbi GF{(2^m})$ Using Subquadratic Toeplitz Matrix-Vector Product Approach
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.2013.2264694openalex-snapshot
Low-Latency Digit-Serial and Digit-Parallel Systolic Multipliers for Large Binary Extension Fields
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.2014.2349577openalex-snapshot
High-Throughput Finite Field Multipliers Using Redundant Basis for FPGA and ASIC Implementations
inferred← citeshttps://doi.org/10.1109/tcsi.2014.2386782openalex-snapshot
Low-Latency High-Throughput Systolic Multipliers Over $GF(2^{m})$ for NIST Recommended Pentanomials
inferred← citeshttps://doi.org/10.1109/tcsi.2015.2388842openalex-snapshot
Subquadratic Space-Complexity Digit-Serial Multipliers Over $GF(2^{m})$ Using Generalized $(a,b)$ -Way Karatsuba Algorithm
inferred← citeshttps://doi.org/10.1109/tcsi.2015.2437516openalex-snapshot
Efficient Digit-Serial KA-Based Multiplier Over Binary Extension Fields Using Block Recombination Approach
inferred← citeshttps://doi.org/10.1109/tcsi.2016.2614309openalex-snapshot
Low-Latency, Low-Area, and Scalable Systolic-Like Modular Multipliers for $GF(2^{m})$ Based on Irreducible All-One Polynomials
inferred← citeshttps://doi.org/10.1109/tcsi.2017.2677962openalex-snapshot
Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials
inferred← citeshttps://doi.org/10.1109/tcsi.2018.2795380openalex-snapshot
Low Complexity Implementation of Unified Systolic Multipliers for NIST Pentanomials and Trinomials Over $\textit{GF}(2^{m})$
inferred← citeshttps://doi.org/10.1109/tcsi.2020.3048395openalex-snapshot
LWRpro: An Energy-Efficient Configurable Crypto-Processor for Module-LWR
inferred← citeshttps://doi.org/10.1109/tcsii.2014.2386260openalex-snapshot
High-Throughput Digit-Level Systolic Multiplier Over $\mbox{GF}(2^{m})$ Based on Irreducible Trinomials
inferred← citeshttps://doi.org/10.1109/tcsii.2014.2387681openalex-snapshot
High-Throughput Low-Complexity Systolic Montgomery Multiplication Over $GF(2^{m})$ Based on Trinomials
inferred← citeshttps://doi.org/10.1109/tencon.2006.343995openalex-snapshot
Compact Bit-Parallel Systolic Montgomery Multiplication Over GF(2m) Generated by Trinomials
inferred← citeshttps://doi.org/10.1109/tmscs.2018.2878437openalex-snapshot
Low Register-Complexity Systolic Digit-Serial Multiplier Over Based on Trinomials
inferred← citeshttps://doi.org/10.1109/tvlsi.2009.2016753openalex-snapshot
Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of ${\rm 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/tvlsi.2012.2185257openalex-snapshot
Low Latency Systolic Montgomery Multiplier for Finite Field $GF(2^{m})$ Based on Pentanomials
inferred← citeshttps://doi.org/10.1109/tvlsi.2016.2600568openalex-snapshot
FPGA Realization of Low Register Systolic All-One-Polynomial Multipliers Over $GF(2^{m})$ and Their Applications in Trinomial Multipliers
inferred← citeshttps://doi.org/10.1109/tvlsi.2017.2720190openalex-snapshot
Low-Complexity Digit-Level Systolic Gaussian Normal Basis Multiplier
inferred← citeshttps://doi.org/10.1109/tvlsi.2019.2918836openalex-snapshot
Novel Bit-Parallel and Digit-Serial Systolic Finite Field Multipliers Over $GF(2^m)$ Based on Reordered Normal Basis
inferred← citeshttps://doi.org/10.1109/waina.2008.40openalex-snapshot
Concurrent Error Detection in Digit-Serial Normal Basis Multiplication over GF(2m)
inferred← citeshttps://doi.org/10.1142/s0218126610007134openalex-snapshot
GENERALIZED ALGORITHMS FOR BINARY MODULO MULTIPLICATION AND MULTIPLICATION-DIVISION
inferred← citeshttps://doi.org/10.1145/1506270.1506329openalex-snapshot
Combined circuit architecture for computing normal basis and montgomery multiplications over GF(2m)
inferred← citeshttps://doi.org/10.1145/3056662.3056676openalex-snapshot
Efficient montgomery AB 2 multiplier for finite fields defined by irreducible all-one polynomials
inferred← citeshttps://doi.org/10.1504/ijaacs.2011.040988openalex-snapshot
Combined circuit architecture for computing normal basis and Montgomery multiplications over GF(2m)
inferred← citeshttps://doi.org/10.3109/01480540903311043openalex-snapshot
The potential dermal irritating effect of residual (meth)acrylic monomers in pressure sensitive adhesive tapes
inferred← citeshttps://doi.org/10.3390/electronics11172685openalex-snapshot
A Low-Power Area-Efficient Precision Scalable Multiplier with an Input Vector Systolic Structure
inferred← citeshttps://doi.org/10.5120/ijca2016908878openalex-snapshot
18 Years of Redundant Basis Multipliers over Galois Field
inferred← citeshttps://doi.org/10.5555/1509633.1509694openalex-snapshot
An optimized design for serial-parallel finite field multiplication over GF(2 m ) based on all-one polynomials
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
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.