Sciweavers

Share
WAIFI
2010
Springer

Type-II Optimal Polynomial Bases

11 years 10 months ago
Type-II Optimal Polynomial Bases
In the 1990s and early 2000s several papers investigated the relative merits of polynomial-basis and normal-basis computations for F2n . Even for particularly squaring-friendly applications, such as implementations of Koblitz curves, normal bases fell behind in performance unless a type-I normal basis existed for F2n . In 2007 Shokrollahi proposed a new method of multiplying in a type-II normal basis. Shokrollahi’s method efficiently transforms the normal-basis multiplication into a single multiplication of two size-(n + 1) polynomials. This paper speeds up Shokrollahi’s method in several ways. It first presents a simpler algorithm that uses only size-n polynomials. It then explains how to reduce the transformation cost by dynamically switching to a ‘type-II optimal polynomial basis’ and by using a new reduction strategy for multiplications that produce output in type-II polynomial basis. As an illustration of its improvements, this paper explains in detail how the multiplicat...
Daniel J. Bernstein, Tanja Lange
Added 11 Jul 2010
Updated 11 Jul 2010
Type Conference
Year 2010
Where WAIFI
Authors Daniel J. Bernstein, Tanja Lange
Comments (0)
books