Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Five, six, and seven-term Karatsuba-like formulae - MaRDI portal

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

From MaRDI portal
Publication:3417015

DOI10.1109/TC.2005.49zbMath1171.11329OpenAlexW2129745589MaRDI QIDQ3417015

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




Related Items (23)

Multibase scalar multiplications in cryptographic pairingsCocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computationFinding Optimal Chudnovsky-Chudnovsky Multiplication AlgorithmsEfficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18Highly optimized quantum circuits synthesized via data-flow enginesImpact of Intel's new instruction sets on software implementation of \(GF(2)[x\) multiplication] ⋮ Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\)Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithmFaster Multiplication in GF(2)[x] ⋮ Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)Efficient Multiplication in Finite Field Extensions of Degree 5Missing a trick: Karatsuba variationsOn multiplication in finite fieldsMultiplication of polynomials modulo \(x^n\)Improved method for finding optimal formulas for bilinear maps in a finite fieldOn the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fieldsAn Analysis of Affine Coordinates for Pairing ComputationExplicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliersKummer for genus one over prime-order fieldsA short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security levelParallelizing the Weil and Tate PairingsA three-term Karatsuba multiplier for a special class of trinomials




This page was built for publication: Five, six, and seven-term Karatsuba-like formulae