Pages that link to "Item:Q4571442"
From MaRDI portal
The following pages link to Efficient multiplier architectures for Galois fields GF(2/sup 4n/) (Q4571442):
Displaying 5 items.
- An optimal algorithm for multiplication in \(\mathbb{F}_{256}/\mathbb{F}_ 4\) (Q1177865) (← links)
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
- Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates (Q2291393) (← links)
- A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs (Q2989498) (← links)
- (Q4443244) (← links)
