Juggling With Points on an Elliptic Curve
|Affiliation:||University of Waterloo|
|Room:||Mathematics and Computer Building (MC) 5136B|
Elliptic curves are a useful tool in cryptography, because they can be endowed with an Abelian group structure for which the discrete logarithm problem is believed to be intractable. Much research has gone into improving the computational efficiency of scalar multiplication algorithms on elliptic curves. We will discuss strategies which involve multiplying multiple points by scalars simultaneously.
200 University Avenue West
Waterloo, ON N2L 3G1