Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials (Q5007244)
From MaRDI portal
scientific article; zbMATH DE number 7385478
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials |
scientific article; zbMATH DE number 7385478 |
Statements
Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials (English)
0 references
26 August 2021
0 references
