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...
Saved in:
| Main Author: | Atef Ibrahim |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-05-01
|
| Series: | IET Computers & Digital Techniques |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cdt2.12026 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
CONSTRUCTION OF SUBSTITUTION BOX (S-BOX) BASED ON IRREDUCIBLE POLYNOMIALS ON GF(2^8)
by: Faldy Tita, et al.
Published: (2024-03-01) -
Efficient design of 15:4 counter using a novel 5:3 counter for high‐speed multiplication
by: Hemanth Krishna L., et al.
Published: (2021-01-01) -
Compact 8-Bit S-Boxes Based on Multiplication in a Galois Field <i>GF</i>(2<sup>4</sup>)
by: Phuc-Phan Duong, et al.
Published: (2025-04-01) -
S-BOX CONSTRUCTION IN THE ADVANCED ENCRYPTION STANDARD (AES) DEVELOPMENT ALGORITHM IN GF(2^2), GF(2^4) & GF(2^6)
by: Adi Setiawan, et al.
Published: (2024-10-01) -
Synthesis of a reversible quantum Vedic multiplier on IBM quantum computers
by: Mojtaba Noorallahzadeh, et al.
Published: (2025-05-01)