CERIAS - Center for Education and Research in Information Assurance and Security

Skip Navigation
Purdue University - Discovery Park
Center for Education and Research in Information Assurance and Security

Computational Number Theory and Cryptography

Andreas Stein - UIUC Math Department

Mar 05, 2003


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...


The views, opinions and assumptions expressed in these videos are those of the presenter and do not necessarily reflect the official policy or position of CERIAS or Purdue University. All content included in these videos, are the property of Purdue University, the presenter and/or the presenter’s organization, and protected by U.S. and international copyright laws. The collection, arrangement and assembly of all content in these videos and on the hosting website exclusive property of Purdue University. You may not copy, reproduce, distribute, publish, display, perform, modify, create derivative works, transmit, or in any other way exploit any part of copyrighted material without permission from CERIAS, Purdue University.