Five, six, and seven-term Karatsuba-like formulae

DOI10.1109/TC.2005.49zbMATH Open1171.11329OpenAlexW2129745589MaRDI QIDQ3417015FDOQ3417015

Authors: Peter L. Montgomery 

Publication date: 9 January 2007

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2005.49

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

zbMATH Keywords

elliptic curve arithmetic.

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Error analysis and interval analysis (65G99) Number-theoretic algorithms; complexity (11Y16)

Cited In (28)

• Kummer for genus one over prime-order fields
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
• Faster Multiplication in GF(2)[x]
• Multiplication of polynomials modulo \(x^n\)
• Improved method for finding optimal formulas for bilinear maps in a finite field
• Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
• Impact of Intel's new instruction sets on software implementation of \(GF(2)[x]\) multiplication
• A three-term Karatsuba multiplier for a special class of trinomials
• Multibase scalar multiplications in cryptographic pairings
• On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields
• On multiplication in finite fields
• Parallelizing the Weil and Tate pairings
• Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication
• Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
• An analysis of affine coordinates for pairing computation
• 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
• A long note on Mulders' short product
• Binary Kummer line
• Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\)
• Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
• Efficient multiplication in finite field extensions of degree 5
• Improved three-way split formulas for binary polynomial multiplication
• Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
• Highly optimized quantum circuits synthesized via data-flow engines
• Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
• Missing a trick: Karatsuba variations

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)