Five, six, and seven-term Karatsuba-like formulae
From MaRDI portal
(Redirected from Publication:3417015)
Recommendations
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\)
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
- Fast multiplication of polynomials over fields of characteristic 2
- Efficient multiplication in finite field extensions of degree 5
Cited in
(30)- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Kummer for genus one over prime-order fields
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- A long note on Mulders' short product
- On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
- Improved three-way split formulas for binary polynomial multiplication
- Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
- Multibase scalar multiplications in cryptographic pairings
- Efficient multiplication in finite field extensions of degree 5
- An analysis of affine coordinates for pairing computation
- Parallelizing the Weil and Tate pairings
- Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
- Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
- Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
- Faster Multiplication in GF(2)[x]
- Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
- Multiplication of polynomials modulo \(x^n\)
- A three-term Karatsuba multiplier for a special class of trinomials
- Highly optimized quantum circuits synthesized via data-flow engines
- Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\)
- Binary Kummer line
- Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication
- Missing a trick: Karatsuba variations
- Quantum circuit implementation for \(\mathbb{F}_{2^8}\) multiplication based on algebraic curve method
- A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
- On multiplication in finite fields
This page was built for publication: Five, six, and seven-term Karatsuba-like formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3417015)
