Views
Lecture:
[m=ec^2] Complex Double Bases applied to Scalar Multiplication on Algebraic Curves
Speaker: Francesco Sica (Mount Allison University and AceCrypt)
Document Actions
In elliptic curve based cryptography, the costliest operation is the
computation of nP=P+...+P, that is n times a point P, called
scalar multiplication. It is acknowledged that the existence of fast
endomorphisms (such as the Frobenius on Koblitz curves) results in a
clear performance speedup. I will expose how the use of a double base
expansion of n gives way to a new class of scalar multiplication
algorithms capable of beating the fastest known implementations on
Koblitz curves, with negligible additional memory.
- For more information about m=ec^2 (including other lectures):
- m=ec^2 main site
- The slides for this presentation are available for downloading here:
- Download file. ( 463.0 kB PDF )
- What
- Lecture
- When
-
2006-11-24
from
14:30
to
15:15
- Where
- Dunn 108 (Mini Wu)
- Contact Name
- Francesco Sica
- Contact Email
- fmylastname@mta.ca
- Contact Phone
- 506-364-2171
SAC 2008 -- Workshop on Selected Areas in Cryptography
