# ACAC Seminar Abstract

## The discrete logarithm problem in an interval

Speaker: Steven Galbraith
Date, Time: Tue, 22 Mar 2011 15:00

The DLP in an interval is: Given g, h, N to find z such that h = g^z and 0 \le z < N << order(g). I will present some new methods to solve this problem, especially in groups where computing inverses is very efficient. Appropriately for a talk in Australia, I will mention kangaroos. This is joint work with Pollard and Ruprai.