Computational Number Theory Study Group
		^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

The inaugural meeting of the Computational Number Theory Study Group will
be held in the (old) Mahler Room, Mathematical Sciences Building, RSISE,
11-12 on Thursday 13 June.  Anyone interested is welcome.

We plan to meet every second or third week to informally discuss topics such
as integer factorization algorithms, applications to cryptography, chaos (?),
etc. This may involve a presentation by a volunteer or reading of a paper
on the topic.

On 13 June Steve Donnelly will lead a discussion of elementary integer
factorization algorithms such as the Pollard p-1 algorithm. Later meetings
will consider the elliptic curve method (ECM) and the number field sieve (NFS).

Please forward this notice to anyone who may be interested but is not on
the list of recipients.

Richard Brent