Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">GF(2ᵐ)</tex> </formula> for NIST Recommended Pentanomials
From MaRDI portal
Publication:5007724
Recommendations
- Efficient Bit-Parallel GF(2^m) Multiplier for a Large Class of Irreducible Pentanomials
- Low Complexity Systolic Architecture for Modular Multiplication over GF(2 m )
- Efficient FPGA Implementation of Low-Complexity Systolic Karatsuba Multiplier Over $GF(2^{m})$ Based on NIST Polynomials
- Low Latency $GF(2^{m})$ Polynomial Basis Multiplier
- Progress in Cryptology - INDOCRYPT 2003
- Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\)
- A dual basis bit-serial systolic multiplier for GF(2 )
- A low latency architecture for computing multiplicative inverses and divisions in GF(2/sup m/)
- Low-Latency Digit-Serial Systolic Double Basis Multiplier over <formula formulatype="inline"> <tex Notation="TeX">$\mbi GF{(2^m})$</tex> </formula> Using Subquadratic Toeplitz Matrix-Vector Product Approach
- Computational Science and Its Applications – ICCSA 2004
Cited in
(4)- Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates
- Efficient systolic multiplications in composite fields for cryptographic systems
- Novel hybrid-size digit-serial systolic multiplier over \(\mathrm{GF}(2^m)\)
- Fast Bit-Parallel Binary Multipliers Based on Type-I Pentanomials
This page was built for publication: Low-Latency High-Throughput Systolic Multipliers Over <formula formulatype="inline"><tex Notation="TeX">$GF(2^{m})$</tex> </formula> for NIST Recommended Pentanomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5007724)