Computer Security and Cryptography Seminar:
February 2004 Events

In this talk, we will discuss two of the more popular mathematical problems upon which modern cryptographic schemes are based: integer factorization and the elliptic curve discrete logarithm problem. The best known algorithm for factoring integers is the number field sieve which has subexponential complexity, while the best technique for solving the elliptic curve discrete logarithm problem are general purpose algorithms which have exponential complexity. However, there are techniques for solving the discrete logarithm problem for hyperelliptic curves which have high genus. We will try and present insight into how these two problems are related, and not related, by discussing how the algorithms for high genus hyperelliptic curves relate to integer factorization. Moreover, we will discuss the similarity between hyperelliptic curves and class groups of quadratic fields, which happens to be another alternative to RSA.

 Cookies will be served at 3:30 PM in 2310 CS.