Computational Number Theory and Cryptography

Mar 05, 2003

Abstract

In this talk, we discuss various aspects of computational number theory
and cryptography. We first compare elliptic curve cryptography
to RSA. In particular, we provide a survey of attacks to the elliptic
curve discrete logarithm problem by taking into account recent
developments. Then we present the state of the art of hyperelliptic
curve cryptography and discuss other curve cryptosystems.
Time-permitting, we talk about an application of the Weil descent
methodology and its effects on elliptic curve cryptography.