On the public citation graph
Architectural review of polynomial bases finite field multipliers over GF(2m)
0 signed · 69 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/11424826_68openalex-snapshot
Modified Sequential Normal Basis Multipliers for Type II Optimal Normal Bases
inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot
Use of Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1007/978-3-540-70550-5_20openalex-snapshot
Evaluation of ASIPs Design with LISATek
inferredcites →https://doi.org/10.1007/978-3-540-85053-3_19openalex-snapshot
A New Bit-Serial Architecture for Field Multiplication Using Polynomial Bases
inferredcites →https://doi.org/10.1007/978-3-642-14518-6_20openalex-snapshot
Huff’s Model for Elliptic Curves
inferredcites →https://doi.org/10.1007/978-3-642-31494-0_28openalex-snapshot
High-Speed Unified Elliptic Curve Cryptosystem on FPGAs Using Binary Huff Curves
inferredcites →https://doi.org/10.1007/978-3-642-33027-8_29openalex-snapshot
Pushing the Limits of High-Speed GF(2 m ) Elliptic Curve Scalar Multiplication on FPGAs
inferredcites →https://doi.org/10.1007/978-3-642-40349-1_20openalex-snapshot
On the Implementation of Unified Arithmetic on Binary Huff Curves
inferredcites →https://doi.org/10.1007/s11265-011-0654-2openalex-snapshot
Scalable Gaussian Normal Basis Multipliers over GF(2 m ) Using Hankel Matrix-Vector Representation
inferredcites →https://doi.org/10.1016/j.micpro.2010.04.006openalex-snapshot
A high performance ECC hardware implementation with instruction-level parallelism over GF(2163)
inferredcites →https://doi.org/10.1016/j.micpro.2016.02.013openalex-snapshot
Parallelization of scalable elliptic curve cryptosystem processors in GF (2 m )
inferredcites →https://doi.org/10.1016/j.vlsi.2010.08.001openalex-snapshot
Optimized FPGA-based elliptic curve cryptography processor for high-speed applications
inferredcites →https://doi.org/10.1016/s1005-8885(08)60206-xopenalex-snapshot
Design of highly efficient elliptic curve crypto-processor with two multiplications over GF(2163)
inferredcites →https://doi.org/10.1016/s1005-8885(08)60291-5openalex-snapshot
Load balance in hierarchical routing network
inferredcites →https://doi.org/10.1049/el.2012.1427openalex-snapshot
Minimum-clock-cycle Itoh-Tsujii algorithm hardware implementation for cryptography applications over GF (2 m ) fields
inferredcites →https://doi.org/10.1049/ip-e.1992.0036openalex-snapshot
Division and bit-serial multiplication over GF(qm)
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1109/12.902754openalex-snapshot
An efficient optimal normal basis type II multiplier
inferredcites →https://doi.org/10.1109/49.17708openalex-snapshot
Algorithm engineering for public key algorithms
inferredcites →https://doi.org/10.1109/cse.2008.26openalex-snapshot
Application Specific Processors for Multimedia Applications
inferredcites →https://doi.org/10.1109/icecs.2010.5724745openalex-snapshot
Side-channel evaluation of FPGA implementations of binary Edwards curves
inferredcites →https://doi.org/10.1109/icict.2015.7469484openalex-snapshot
Hardware design and implementation of scalar multiplication in elliptic curve cryptography (ECC) over GF(2163) on FPGA
inferredcites →https://doi.org/10.1109/iscas.2001.922163openalex-snapshot
A low-power bit-serial multiplier for finite fields GF(2/sup m/)
inferredcites →https://doi.org/10.1109/melcon.2004.1347047openalex-snapshot
Serial multiplier architectures over GF(2/sup n/) for elliptic curve cryptosystems
inferredcites →https://doi.org/10.1109/recosoc.2016.7533901openalex-snapshot
Comparative analysis of flexible cryptographic implementations
inferredcites →https://doi.org/10.1109/tc.2005.29openalex-snapshot
Low complexity word-level sequential normal basis multipliers
inferredcites →https://doi.org/10.1109/tcsi.2010.2089553openalex-snapshot
Low Latency $GF(2^{m})$ Polynomial Basis Multiplier
inferredcites →https://doi.org/10.1109/tcsii.2012.2234916openalex-snapshot
High-Performance Implementation of Point Multiplication on Koblitz Curves
inferredcites →https://doi.org/10.1109/tcsii.2015.2455992openalex-snapshot
Throughput/Area-efficient ECC Processor Using Montgomery Point Multiplication on FPGA
inferredcites →https://doi.org/10.1109/tie.2012.2186104openalex-snapshot
Efficient Elliptic Curve Point Multiplication Using Digit-Serial Binary Field Operations
inferredcites →https://doi.org/10.1109/tvlsi.2008.2000728openalex-snapshot
On Parallelization of High-Speed Processors for Elliptic Curve Cryptography
inferredcites →https://doi.org/10.1109/tvlsi.2009.2020088openalex-snapshot
Complexity Analysis and Efficient Implementations of Bit Parallel Finite Field Multipliers Based on Karatsuba-Ofman Algorithm on FPGAs
inferredcites →https://doi.org/10.1109/tvlsi.2011.2158595openalex-snapshot
Efficient FPGA Implementations of Point Multiplication on Binary Edwards and Generalized Hessian Curves Using Gaussian Normal Basis
inferredcites →https://doi.org/10.1109/tvlsi.2012.2230410openalex-snapshot
Novel Architecture for Efficient FPGA Implementation of Elliptic Curve Cryptographic Processor Over ${\rm GF}(2^{163})$
inferredcites →https://doi.org/10.1109/tvlsi.2015.2453360openalex-snapshot
High-Performance Pipelined Architecture of Elliptic Curve Scalar Multiplication Over GF(2m)
inferredcites →https://doi.org/10.5281/zenodo.1329670openalex-snapshot
Efficient Hardware Implementation Of An Elliptic Curve Cryptographic Processor Over Gf (2 163)
inferredcites →https://doi.org/10.6636/ijeie.201506.2(2).03openalex-snapshot
Performance Modelling and Acceleration of Binary Edwards Curve Processor on FPGAs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.1049/iet-cdt.2018.5056openalex-snapshot
Throughput/area optimised pipelined architecture for elliptic curve crypto processor
inferred← citeshttps://doi.org/10.1109/access.2018.2828319openalex-snapshot
ACryp-Proc: Flexible Asymmetric Crypto Processor for Point Multiplication
inferred← citeshttps://doi.org/10.1109/access.2019.2903170openalex-snapshot
Speed-Oriented Architecture for Binary Field Point Multiplication on Elliptic Curves
inferred← citeshttps://doi.org/10.1109/access.2021.3051282openalex-snapshot
Innovative Dual-Binary-Field Architecture for Point Multiplication of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1109/access.2024.3358213openalex-snapshot
DCryp-Unit: Crypto Hardware Accelerator Unit Design for Elliptic Curve Point Multiplication
inferred← citeshttps://doi.org/10.1109/access.2024.3390244openalex-snapshot
A Universal Single and Double Point Multiplications Architecture for ECDSA Based on Differential Addition Chains
inferred← citeshttps://doi.org/10.1109/access.2024.3403771openalex-snapshot
FPGA Implementation of Elliptic-Curve Point Multiplication Over GF(2233) Using Booth Polynomial Multiplier for Area-Sensitive Applications
inferred← citeshttps://doi.org/10.1109/access.2024.3425813openalex-snapshot
Unif-NTT: A Unified Hardware Design of Forward and Inverse NTT for PQC Algorithms
inferred← citeshttps://doi.org/10.1109/access.2024.3487074openalex-snapshot
A Compact 3-Stage Pipelined Hardware Accelerator for Point Multiplication of Binary Elliptic Curves Over GF(2233)
inferred← citeshttps://doi.org/10.1109/i2ct45611.2019.9033682openalex-snapshot
Design of Power Efficient Bit Serial Finite Field GF(2m) Multiplier
inferred← citeshttps://doi.org/10.1109/iceet1.2018.8338645openalex-snapshot
Lopez Dahab based elliptic crypto processor (ECP) over GF(2163) for low-area applications on FPGA
inferred← citeshttps://doi.org/10.1109/icosst.2017.8279005openalex-snapshot
Hardware design and implementation of ECC based crypto processor for low-area-applications on FPGA
inferred← citeshttps://doi.org/10.1109/tii.2025.3613305openalex-snapshot
RIGHT: GPU-Optimized Parallel PQC HAETAE for High-Throughput Cryptographic Acceleration
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.2023.3321772openalex-snapshot
High-Performance ECC Scalar Multiplication Architecture Based on Comb Method and Low-Latency Window Recoding Algorithm
inferred← citeshttps://doi.org/10.1142/s0218126620501790openalex-snapshot
A 4-Stage Pipelined Architecture for Point Multiplication of Binary Huff Curves
inferred← citeshttps://doi.org/10.23919/eleco47770.2019.8990437openalex-snapshot
A Hardware Efficient Elliptic Curve Accelerator for FPGA Based Cryptographic Applications
inferred← citeshttps://doi.org/10.3390/app11157079openalex-snapshot
Elliptic-Curve Crypto Processor for RFID Applications
inferred← citeshttps://doi.org/10.3390/app12084091openalex-snapshot
Throughput/Area Optimized Architecture for Elliptic-Curve Diffie-Hellman Protocol
inferred← citeshttps://doi.org/10.3390/app12094312openalex-snapshot
A Scalable Digit-Parallel Polynomial Multiplier Architecture for NIST-Standardized Binary Elliptic Curves
inferred← citeshttps://doi.org/10.3390/app13020869openalex-snapshot
Large Field-Size Throughput/Area Accelerator for Elliptic-Curve Point Multiplication on FPGA
inferred← citeshttps://doi.org/10.3390/app13031240openalex-snapshot
Large Field-Size Elliptic Curve Processor for Area-Constrained Applications
inferred← citeshttps://doi.org/10.3390/app13127018openalex-snapshot
Area-Efficient Realization of Binary Elliptic Curve Point Multiplication Processor for Cryptographic Applications
inferred← citeshttps://doi.org/10.3390/app14083323openalex-snapshot
A Flexible Hardware Accelerator for Booth Polynomial Multiplier
inferred← citeshttps://doi.org/10.3390/cryptography8010011openalex-snapshot
Lookup Table-Based Design of Scalar Multiplication for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.3390/electronics12173611openalex-snapshot
Throughput/Area-Efficient Accelerator of Elliptic Curve Point Multiplication over GF(2233) on FPGA
inferred← citeshttps://doi.org/10.3390/electronics9111953openalex-snapshot
An Experimental Study of Building Blocks of Lattice-Based NIST Post-Quantum Cryptographic Algorithms
inferred← citeshttps://doi.org/10.3390/electronics9122126openalex-snapshot
An Efficient Elliptic-Curve Point Multiplication Architecture for High-Speed Cryptographic Applications
inferred← citeshttps://doi.org/10.3390/info16010017openalex-snapshot
A Pipelined Hardware Design of FNTT and INTT of CRYSTALS-Kyber PQC Algorithm
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.