## Elliptic curves and sieve methods

Professor **Kumar Murty**
,

U of T

abstract: A problem that arises from cryptography is

to study the primality of the number of points on an

elliptic curve over a finite field. We shall show how

sieve methods give some information on this problem.

We will begin by describing the cryptographic motivation

and background.