A fast software implementation for arithmetic operations in GF(2ⁿ)
From MaRDI portal
Publication:4536252
Recommendations
- Efficient software-implementation of finite fields with applications to cryptography
- Fast implementation of elliptic curve arithmetic in GF(p^n)
- Fast algorithms for elliptic curve cryptosystems over binary finite field
- Efficient software implementation for finite field multiplication in normal basis
- scientific article; zbMATH DE number 2058638
Cited in
(17)- Rings of low multiplicative complexity
- Practical fast algorithm for finite field arithmetics using group rings
- High-speed software multiplication in \(\mathbb{F}_{2^m}\)
- Binary fields on limited systems
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
- \(\mathrm{GF}(2^n)\) redundant representation using matrix embedding for irreducible trinomials
- Efficient computing of some vector operations over \(\mathrm{GF}(3)\) and \(\mathrm{GF}(4)\)
- scientific article; zbMATH DE number 4078798 (Why is no real title available?)
- Efficient software implementation for finite field multiplication in normal basis
- Fast implementation of elliptic curve arithmetic in GF(p^n)
- scientific article; zbMATH DE number 1457433 (Why is no real title available?)
- Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic
- An alternative class of irreducible polynomials for optimal extension fields
- The double-base number system and its application to elliptic curve cryptography
- Information Security and Privacy
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography.
- Efficient hardware implementation of finite fields with applications to cryptography
This page was built for publication: A fast software implementation for arithmetic operations in \(\text{GF}(2^n)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536252)