Speaker: Nicolas Pécheux
Date, Time: Thu, 13 Aug 2009 15:30
Double-Base Number System, which allow very sparse representation of integers, has been introduce to speed up the scalar multiplication in Elliptic Curves. Several algorithms have been used to find short expansions, but those are not always the cheapest in term of computation. We have studied improved Double-Base Chains with lowest cost which can reuse intermediate computations as internal coefficients. This small improvements can have a major impact when used in the Elliptic Curve Factorisation Method.