Low‐space bit‐serial systolic array architecture for interleaved multiplication over GF(2m)
Abstract This article offers a new bit‐serial systolic array architecture to implement the interleaved multiplication algorithm in the binary‐extended field. The exhibited multiplier structure is more proper for VLSI implementation as it has regular cell structures as well as local communication wir...
Main Author: | Atef Ibrahim |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi-IET
2021-05-01
|
Series: | IET Computers & Digital Techniques |
Subjects: | |
Online Access: | https://doi.org/10.1049/cdt2.12026 |
Similar Items
-
A speed‐area‐efficient hardware ECPM‐engine in GF(p) over generic Weierstrass curves
by: Yujun Xie, et al.
Published: (2024-02-01) -
Low‐Power and Low‐Hardware Bit‐Parallel Polynomial Basis Systolic Multiplier over GF(2m) for Irreducible Polynomials
by: Sudha Ellison Mathe, et al.
Published: (2017-08-01) -
Low-Complexity One-Dimensional Parallel Semi-Systolic Structure for Field Montgomery Multiplication Algorithm Perfect for Small IoT Edge Nodes
by: Atef Ibrahim, et al.
Published: (2022-12-01) -
Towards High-Performance Supersingular Isogeny Cryptographic Hardware Accelerator Design
by: Guantong Su, et al.
Published: (2023-03-01) -
Multiple Bit Error Tolerant Galois Field Architectures Over GF (2m)
by: Mahesh Poolakkaparambil, et al.
Published: (2012-06-01)