On the arithmetic operations over finite fields of characteristic three with low complexity
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1979307
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
- On multiplication in finite fields
- On hardware and software implementation of arithmetic in finite fields of characteristic 7 for calculation of pairings
Cites work
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 1942431 (Why is no real title available?)
- scientific article; zbMATH DE number 1979307 (Why is no real title available?)
- Batch Binary Edwards
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
- Efficient \(p\)th root computations in finite fields of characteristic \(p\)
- Elliptic periods for finite fields
- Finding optimal formulae for bilinear maps
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Low Complexity Cubing and Cube Root Computation over $\F_{3^m}$ in Polynomial Basis
- Modified Redundant Representation for Designing Arithmetic Circuits with Small Complexity
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
- Software Implementation of Finite Fields of Characteristic Three, for Use in Pairing-based Cryptosystems
- The Magma algebra system. I: The user language
- The combinatorics of associated Hermite polynomials
This page was built for publication: On the arithmetic operations over finite fields of characteristic three with low complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349632)
