AceCrypt Cryptography Workshop m=ec^2

There will be a series of three talks on the implementation of curve-based cryptography, which provides current state-of-the-art encryption techniques endorsed by American federal agencies.

The lineup is as follows (Slides are now available for download):

Divisor Class Halving on Hyperelliptic Curves
  Dunn 108 (Mini Wu), 2006-11-24 13:00 - 2006-11-24 13:45

We begin the m=ec^2 conference with Peter Birkner presenting a halving algorithm for divisor classes of genus 2 curves over finite fields of characteristic 2.

Fast Arithmetic in the Jacobian of non-Hyperelliptic Curves of Genus 3
  Dunn 108 (Mini Wu), 2006-11-24 13:45 - 2006-11-24 14:30

For the second seminar of m=ec^2, Roger Oyono will present a fast addition algorithm in the Jacobian of non-hyperelliptic curves of genus 3. The presented algorithm has a nice geometric interpretation, comparable to the classic chord and tangent law for the elliptic curves.

Complex Double Bases applied to Scalar Multiplication on Algebraic Curves
  Dunn 108 (Mini Wu), 2006-11-24 14:30 - 2006-11-24 15:15

Francesco Sica wraps up m=ec^2 by exposing how the use of a double base expansion of a scalar multiplier gives way to a new class of scalar multiplication algorithms capable of beating the fastest known implementations on Koblitz curves, with negligible additional memory.