Montgomery multiplier and squarer in GF(2ᵐ)
From MaRDI portal
Publication:4536232
Recommendations
Cited in
(8)- Efficient circuits for multiplying in GF(\(2^ m\)) for certain values of \(m\)
- Montgomery multiplication in \(\text{GF}(2^ k)\)
- On complexity of polynomial basis squaring in \(\mathbb{F}_{2^m}\)
- Efficient GF(p^m) arithmetic architectures for cryptographic applications
- Mastrovito multiplier for general irreducible polynomials
- Montgomery multiplication over rings
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
- Programmable cellular automata based Montgomery hardware architecture
This page was built for publication: Montgomery multiplier and squarer in \(\text{GF}(2^m)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536232)