[crypto] [tanja at hyperelliptic.org: Workshop on Elliptic Curves and Computation]

[R. Hirschfeld]

------- Start of forwarded message -------
Date: 8 Oct 2010 22:14:15 -0000
From: Tanja Lange <tanja at hyperelliptic.org>
Subject: Workshop on Elliptic Curves and Computation

*********************************************************************
*                                                                   *
* Fourth announcement Workshop on Elliptic Curves and Computation   *
* Oct 18-22, 2010 at Microsoft Research in Redmond, Washington, USA *
*                                                                   *
*********************************************************************

News:
* The schedule is online. Note that there will be a rump session on
  Monday evening for short (and preferably entertaining) presentations.

* Please register now if you plan to attend. We're already over 100 
  registrations but we can still order more food. We need to know 
  the number of participants on Monday, October 11. 
  Register at
	http://2010.eccworkshop.org/
  Thanks to the National Science Foundation, Microsoft Research, 
  Certicom and PIMS we are able to offer registration at only
  200 USD for regular participants and 100 USD for students.

* The block of rooms with the Homestead Studio suites is about to 
  expire. The booking with the Fairfield Inn has expired.

* Note that the visa-waiver program has recently changed and requires
  travelers to fill in an electronic form at least 72 hours prior to
  departure. See
	http://www.cbp.gov/xp/cgov/travel/id_visa/esta/

*********************************************************************

Please excuse multiple mailings.

The study of elliptic curves has been closely connected with machine
computation almost since the invention of computers -- in 1952 Emil
Artin had John von Neumann perform an extensive calculation relating
to elliptic curves on the IAS MANIAC computer. The fundamental papers
of Birch and Swinnerton-Dyer in 1965, which gave rise to the
Birch-Swinnerton-Dyer conjecture, were buttressed with extensive
machine computation. There has been extensive interplay between theory
and computation relating to ranks of elliptic curves, Heegner points,
Galois representations, Sato-Tate distributions, and many other areas.

The year 1985 marks the beginning of a 25 year period in which a
number of influential papers initiated a fundamental connection
between elliptic curves, cryptology and the theory of computation.

* Rene Schoof about fast algorithms for counting points on elliptic
  curves over finite fields
* Hendrik Lenstra about integer factorization using elliptic curves
* Victor Miller and Neal Koblitz about the security of using elliptic
  curves over finite fields in a Diffie-Hellman key exchange.
* Shafi Goldwasser and Joe Kilian about primality proving using elliptic
  curves
* Len Adleman and Ming-Deh Huang about primality proving using abelian
  varieties
* Oliver Atkin and Francois Morain about primality proving using elliptic
  curves.

Since 1997 there has been an annual workshop on Elliptic Curve
Cryptography. To celebrate the 25th anniversary of the above papers we
will hold a full week meeting intermixing talks which are concerned
with the applications of elliptic curves in cryptography and other
fundamental results concerning elliptic curves and computation.

The meeting will be held from Oct 18-22, 2010 at Microsoft Research in
Redmond, Washington, USA.

More information is available online at
	http://2010.eccworkshop.org/
------- End of forwarded message -------