Computational Number Theory and Cryptography

Page Content

Andreas Stein - UIUC Math Department

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.

Unless otherwise noted, the security seminar is held on Wednesdays at 4:30P.M. STEW G52, West Lafayette Campus. More information...

© 1999-2013 Purdue University. All rights reserved.

Use/Reuse Guidelines

CERIAS Seminar materials are intended for educational, non-commercial use only and any or all commercial use is prohibited. Any use must attribute "The CERIAS Seminar at Purdue University." Opinions expressed in the recordings are not necessarily representative of the views of CERIAS or of Purdue University.