Fwd: MSR Talk Series: Buchmann's algorithms and Arakelov class groups; Rene Schoof - Buchmann's algorithms and Arakelov class groups

15 views
Skip to first unread message

Dan Shumow

unread,
Feb 18, 2009, 1:22:36 AM2/18/09
to ntuw, uw-crypto
Forwarded from Kristin Lauter

-----Original Appointment-----
From: MS Research Lecture Room 1919 (Private)
Sent: Thursday, February 12, 2009 3:09 PM
To: MS Research Lecture Room 1919 (Private); Microsoft Research Tech
Talk, Sem. Notice; Kristin Lauter
Subject: MSR Talk Series: Buchmann's algorithms and Arakelov class
groups; Rene Schoof - Buchmann's algorithms and Arakelov class groups
When: Thursday, February 19, 2009 10:30 AM-12:00 PM (GMT-08:00)
Pacific Time (US & Canada).
Where: 99/1919 Research Lecture Room C


When: Thursday, February 19, 2009 10:30 AM-12:00 PM (GMT-08:00)
Pacific Time (US & Canada).
Where: 99/1919 Research Lecture Room C

*~*~*~*~*~*~*~*~*~*

You are invited to attend… please pass on to internal MS employees who
may be interested.
*****************************************************************************************************
WHO: Rene Schoof
TITLE: Buchmann's algorithms and Arakelov class groups
WHEN: Thu 2/19/2009
WHERE: 99/1919, Research lecture room C
TIME: 10:30AM-12PM
HOST: Kristin Lauter
MSRNS: For Live/On Demand viewing availability check http://resnet/msrn
******************************************************************************************************

ABSTRACT:
Class groups have been proposed as the basis for public key
cryptosystems. A natural setting for Buchmann's algorithm for
computing class groups and unit groups of number fields, is provided
by Arakelov theory.
We take this point of view in order to explain the `scanning
algorithm', which is an alternative to another algorithm due to
Buchmann for computing class groups.

BIO:
Rene Schoof, is a professor at the university of Rome "Tor Vergata".
He is working in number theory, computational aspects as well as
arithmetical geometry aspects. Schoof's algorithm was the first
polynomial time algorithm for counting points on elliptic curves over
finite fields, which are now widely used in cryptography. He is the
author of a book on Catalan's conjecture.

Reply all
Reply to author
Forward
0 new messages