cr.yp.to update
[email protected] 12 Jun 2005 06:00:21 -0000
| Newsgroups | gmane.comp.djb.announce |
|---|---|
| Message-ID | <[email protected]> |
diff -ru .old-crypto/conferences/2005-cam/www.math.ucok.edu/_cam/cam.html cr.yp.to/conferences/2005-cam/www.math.ucok.edu/_cam/cam.html
--- .old-crypto/conferences/2005-cam/www.math.ucok.edu/_cam/cam.html 2005-05-04 11:09:07.000000000 -0400
+++ cr.yp.to/conferences/2005-cam/www.math.ucok.edu/_cam/cam.html 2005-05-27 16:15:25.000000000 -0400
@@ -6,7 +6,16 @@
<STRONG>Date: </STRONG>June 10--11<P>
<STRONG>Name: </STRONG> CAM 2005<P>
<STRONG>Location: </STRONG> University of Central Oklahoma, Edmond, Oklahoma.
-<HR>
+<HR>
+<B><FONT COLOR="#ff0000" size =+2>Updated Information</B></FONT>
+<BR>
+The workshop and lectures will take place in Howell Hall 201 (Crittendon Auditorium) which is located just to
+the west of the Nigh University Center.
+The visitor parking lot is located just east of the Nigh University Center and should be used
+until 12:00 on Friday. Those who have recieved housing support from the conference will be staying in the
+University Suites which are located in the northwest part of the campus.
+<a href="http://www.ucok.edu/resources/campus_map.html"> Campus Map.</a>
+
<H4>Workshop Topic</H4>
A cryptology workshop designed for the nonspecialist.
<a href="cryptologyworkshopannouncement.htm"> Conference description.</a>
diff -ru .old-crypto/conferences/2005-enigma/www.enigma.com.pl/konferencje/ix_kkzk/plan.html cr.yp.to/conferences/2005-enigma/www.enigma.com.pl/konferencje/ix_kkzk/plan.html
--- .old-crypto/conferences/2005-enigma/www.enigma.com.pl/konferencje/ix_kkzk/plan.html 2005-05-09 05:56:13.000000000 -0400
+++ cr.yp.to/conferences/2005-enigma/www.enigma.com.pl/konferencje/ix_kkzk/plan.html 2005-05-27 03:37:44.000000000 -0400
@@ -409,9 +409,12 @@
<br>
<DIV>
<TABLE CLASS=TBL CELLPADDING=0 CELLSPACING=5 BORDER=0 WIDTH=100%>
- <TR><TD NOWRAP VALIGN=TOP WIDTH=12%><font face="Verdana"><font size=-1>08:00 - 10:30</font>
+ <TR>
+ <TR><font size=-1><BLINK><FONT COLOR="#CC0000"><b>przepraszamy za wcze¶niejsz± b³êdnie podan± godzinê rozpoczêcia Tutorialu I!!!</B></FONT></blink></TR>
+ <TD NOWRAP VALIGN=TOP WIDTH=12%><font face="Verdana"><font size=-1><BLINK><FONT COLOR="#CC0000"><b>09:00</B></FONT></blink> - 10:30</font>
<A ></TD><TD>
- <font face="Verdana"><font size=-1>Zarz±dzanie ci±g³o¶ci± dzia³ania przedsiêbiorstwa, <i>
+ <font face="Verdana"><font size=-1>Zarz±dzanie ci±g³o¶ci± dzia³ania przedsiêbiorstwa,
+ <i>
<br>A. Ga³ach, Galach Consulting </i></font></A>
</TD></TR>
New: conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Abstracts/Blum.pdf
New: conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Abstracts/Kearns.pdf
New: conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Abstracts/Niyogi.pdf
New: conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Abstracts/Rudin.pdf
Binary files .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Abstracts/Verri.pdf and cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Abstracts/Verri.pdf differ
New: conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Abstracts/Vovk.pdf
New: conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Abstracts/Wainwright.pdf
New: conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Posters
diff -ru .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Posters.html cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Posters.html
--- .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Posters.html 2005-03-18 13:19:49.000000000 -0500
+++ cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/Posters.html 2005-05-31 03:53:08.000000000 -0400
@@ -65,47 +65,50 @@
</center>
<p>
-The poster session is restricted to those who are doctoral students,
- or are no more than 8 years beyond their doctorate.
+The following have been chosen to present posters at FoCM:
-<p>
-There will be three poster sessions, one in each of the three
- periods:
-<blockquote>
- <ul>
- <li> <font color=000070>PERIOD 1:</font> Thursday 30th June - Saturday
- 2nd July
- <li> <font color=000070>PERIOD 2:</font> Monday 4th July -
- Wednesday 6th July
- <li> <font color=000070>PERIOD 3:</font> Thursday 7th July - Saturday
- 9th July
- </ul>
-</blockquote>
-We shall have 30 posters in total (i.e. 10 posters per period).
-
-<p>
-All presenters of posters need to declare which period they want to
- present their poster in; or, if they are planning to attend more
- than one period, then give us the periods in order of preference.
-
-<p>
-If you wish to present a poster, please provide a one-page abstract
-(including title, name of author(s) and institutional affiliation) in
-either PDF or PS format to either <a
-href=mailto:[email protected]>Bernd Bank</a> or <a
-href=mailto:[email protected]>Marc Giusti</a>.
-
-<p>
-Deadline for submission:<br>
-<font color=006000><b>Monday, 25 April 2005,</b> 08:00 UTC.</font>
-
-<p>
-Deadline by which decision will be made:<br>
-<font color=600000><b>Tuesday 17 May 2005.</b></font>
-
-<p>
-The names of presenters whose posters have been accepted will be
- posted on the FoCM webpages, by period, shortly after the deadline.
+<ul>
+<li> <a href=Posters/capuni.pdf><b>Ilir Capuni</b></a> (University of
+Montenegro, Podgorica)<br>
+ <i>"Cryptography in BSS computational model"</i>
+
+<li> <a href=Posters/dahan.pdf><b>X. Dahan</b></a> (École
+Polytechnique, Palaiseau)<br>
+ <i>"On the complexity of the D5 principle"</i>
+
+<li> <a href=Posters/gradinaru.pdf><b>Vasile Gradinaru</b></a>
+(Universität Tübingen)<br>
+ <i>"Strang splitting for the time-dependent Schrödinger equation
+ on sparse grids"</i>
+
+<li> <a href=Posters/grm.pdf><b>Alexander Grm</b></a> (TU Keiserslautern)<br>
+ <i>"Numerical solution for anti-planar shear model for granular flow using
+ Runge-Kutta discontinuous-Galerkin method with adaptive mesh refinement"</i>
+
+<li> <a href=Posters/hein-alii.pdf><b>Mathias Hein</b></a> (Max Planck
+Institute, Tübingen)<br>
+ <i>"From graphs to manifolds - Strong pointwise consistency of
+ graph Laplacians"</i>
+
+<li> <a href=Posters/heinz.pdf><b>Sebastian Heinz</b></a> (Humboldt
+University, Berlin)<br>
+ <i>"Complexity of integer quasiconvex polynomial optimization"</i>
+
+<li> <a href=Posters/huguet.pdf><b>Guillem Huguet</b></a> (Universidad
+Pública de Navara, Pamplona)<br>
+ <i>"Invariant computation of linear hamiltonian vector fields"</i>
+
+<li> <a href=Posters/lopez.pdf><b>Vanessa López</b></a>
+(Lawrence Berkeley National Laboratory, Berkeley)<br>
+ <i>"Relative periodic solutions of the complex Ginzburg-Landau equation"</i>
+
+<li> <a href=Posters/pinzon.pdf><b>Sofia Pinzon</b></a> (Universidad Industriel de Santander, Colombia)<br>
+ <i>"The combinatorial geometry of general flag manifolds"</i>
+
+<li> <a href=Posters/scheiblechner.pdf><b>Peter Scheiblechner</b></a>
+(University of Paderborn)<br>
+ <i>"Counting irreducible components of algebraic varieties"</i>
+</ul>
</body>
</html>
diff -ru .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/info.html cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/info.html
--- .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/info.html 2005-04-28 13:34:21.000000000 -0400
+++ cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/info.html 2005-05-30 04:47:10.000000000 -0400
@@ -248,6 +248,17 @@
mins (walking) from the venue of the conference.
<p>
+<table width=100% bgcolor=a00000>
+<tr><td>
+ <font face=Helvetica color=ffd0d0 size=-1>Hotel Santemar is now full, but we
+ have now made alternative arrangements with <b>Hotel Chiqui</b>, for
+ the same price. You need to follow the same procedure: send your
+ reservations to Hotel Santemar and they will pass it to Hotel Chiqui,
+ who will confirm the reservation.
+</td></tr>
+</table>
+
+<p>
Once you <a href=http://www.orie.cornell.edu/focm_registration
target=_other>register</a>, you will receive detailed information on
various accommodation options at Santander and will be given an
diff -ru .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/semiplenary.html cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/semiplenary.html
--- .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/semiplenary.html 2005-05-09 09:09:22.000000000 -0400
+++ cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/semiplenary.html 2005-05-30 04:49:51.000000000 -0400
@@ -182,7 +182,7 @@
<font color=8000a0><b>Optimization</font></b><br>
<blockquote><font color=600000><ul>
<li> Robert Freund
- <li> Stefan Scholtes
+ <li> Katya Scheinberg
<li> Levent Tuncel
</ul></font></blockquote>
@@ -192,7 +192,7 @@
game theory and metric embeddings</b></font> <br>
<blockquote><font color=600000><ul>
- <li> Robert Krauthgamer
+ <li> Piotr Indyk
<li> Michael Kearns
<li> Berthold Voecking
</ul></font></blockquote>
@@ -211,7 +211,7 @@
<font color=8000a0><b>Symbolic analysis</b></font><br>
<blockquote><font color=600000><ul>
<li> Evelyne Hubert
- <li> Gloria Mari Beffa
+ <li> Jacques Sauloy
<li> Werner Seiler
</ul></font></blockquote>
diff -ru .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/workshop4.html cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/workshop4.html
--- .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/workshop4.html 2005-05-12 09:24:03.000000000 -0400
+++ cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/workshop4.html 2005-05-30 08:59:48.000000000 -0400
@@ -37,8 +37,11 @@
<p>
<font color=006000>SPEAKERS (so far):</font>
<ul>
-<li type=square> Peter BARTLETT <font color=a00040 size=-1>(UC Berkeley)</font>
-<li type=square> Avrim BLUM <font color=a00040 size=-1>(Carnegie-Mellon)</font>
+<li type=square> Avrim BLUM <font color=a00040
+size=-1>(Carnegie-Mellon)</font><br>
+<font size=-1>"Kernels as features: On kernels, margins, and low-dimensional
+ mappings" <b><a
+href=Abstracts/Blum.pdf>(abstract)</a></b></font>
<li type=square> Andrea CAPONNETTO <font color=a00040
size=-1>(MIT)</font><br>
<font size=-1>"Model selection and fast rates for regularized
@@ -52,18 +55,29 @@
Carolina)</font> <font size=-1><br>
"Adaptivity in learning" <b><a
href=Abstracts/DeVore.pdf>(abstract)</a></b></font>
-<li type=square> Sara van de GEER <font color=a00040 size=-1>(RU Leiden)</font>
-<li type=square> Mike KEARNS <font color=a00040 size=-1>(U Pennsylvania)</font>
+<li type=square> Sara van de GEER <font color=a00040 size=-1>(RU
+Leiden)</font><br>
+<font size=-1>"A theoretical comparison of regularized classifiers"<b><a
+href=Abstracts/van-de-Geer.pdf>(abstract)</a></b></font>
+<li type=square> Mike KEARNS <font color=a00040 size=-1>(U
+Pennsylvania)</font><br> <font size=-1>"Algorithmic trading in modern
+markets" <b><a
+href=Abstracts/Kearns.pdf>(abstract)</a></b></font>
<li type=square> David MCALLESTER <font color=a00040
size=-1>(Chicago)</font><br>
<font size=-1>"Generalization bounds for structured classification" <b><a
href=Abstracts/McAllister.pdf>(abstract)</a></b></font>
-<li type=square> Partha NIYOGI <font color=a00040 size=-1>(Chicago)</font>
+<li type=square> Partha NIYOGI <font color=a00040
+size=-1>(Chicago)</font><br> <font size=-1>"A geometric perspective on
+learning theory and algorithms"<b><a
+href=Abstracts/Niyogi.pdf>(abstract)</a></b></font>
<li type=square> Tomaso POGGIO <font color=a00040 size=-1>(MIT)</font><br>
<font size=-1>"Learning: new theoretical results and old applications"<b><a
href=Abstracts/Poggio.pdf>(abstract)</a></b></font>
<li type=square> Cynthia RUDIN <font color=a00040
-size=-1>(NYU)</font>
+size=-1>(NYU)</font><br> <font size=-1>"AdaBoost: The expected but
+untrue, and the unexpected but true" <b><a
+href=Abstracts/Rudin.pdf>(abstract)</a></b></font>
<li type=square> Steve SMALE <font color=a00040
size=-1>(Chicago):</font><br> <font size=-1>"Learning theory algorithms and estimates
without covering numbers" <b><a href=Abstracts/Smale.pdf>(abstract)</a></b></font>
@@ -71,13 +85,127 @@
Genoa)</font><br>
<font size=-1>"Functional methods for learning theory"<b><a
href=Abstracts/Verri.pdf>(abstract)</a></b></font>
-<li type=square> Vladimir VOVK <font color=a00040 size=-1>(RHBC, London)</font>
+<li type=square> Vladimir VOVK <font color=a00040 size=-1>(RHBC,
+London)</font><br> <font size=-1>"Defensive forecasting for decision
+making"<b><a
+href=Abstracts/Vovk.pdf>(abstract)</a></b></font>
<li type=square> Martin WAINWRIGHT <font color=a00040 size=-1>(UC
-Berkeley)</font>
+Berkeley)</font><br>
+<font size=-1>"Stable message-passing and convex surrogates for
+learning in Markov random fields" <b><a
+href=Abstracts/Wainwright.pdf>(abstract)</a></b></font>
<li type=square> Ding ZHOU <font color=a00040 size=-1>(CU Hong
Kong)</font><br>
<font size=-1>"Learning variable covariances via gradients" <b><a
href=Abstracts/Zhou.pdf>(abstract)</a></b></font>
</ul>
-</body>
+
+
+<p>
+<font color=006000>TIMETABLE:</font>
+
+<p>
+<table width=100% bgcolor=0000a0>
+<tr><td><center><font face=Helvetica color=ffff00> Day 1: 4 July</td></tr>
+</table>
+
+<center><table width=80%>
+
+<tr>
+ <td><font face=Helvetica>1:50pm - 2:35pm</td>
+ <td><font face=Helvetica>Nicoló Cesa Bianchi</td>
+ <td><font face=Helvetica color=a00000>Semiplenary</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>2:40pm - 3:25pm</td>
+ <td><font face=Helvetica> Avrim Blum</td>
+<tr>
+<tr>
+ <td><font face=Helvetica>3:30pm - 4:00pm</td>
+ <td><font face=Helvetica size=-1>--- Tea ---</td>
+<tr>
+ <td><font face=Helvetica>4:00pm - 4:45pm</td>
+ <td><font face=Helvetica> Andrea Caponnetto</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>4:50pm - 5.35pm</td>
+ <td><font face=Helvetica>Ron DeVore</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>5:40pm - 6:25pm</td>
+ <td><font face=Helvetica>Mike Kearns</td>
+</tr>
+</table></center>
+
+<p>
+<table width=100% bgcolor=0000a0>
+<tr><td><center><font face=Helvetica color=ffff00> Day 2: 5 July</td></tr>
+</table>
+
+<center><table width=80%>
+
+<tr>
+ <td><font face=Helvetica>1:50pm - 2:35pm</td>
+ <td><font face=Helvetica>David McAllister</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>2:40pm - 3:25pm</td>
+ <td><font face=Helvetica>Partha Niyogi</td>
+ <td><font face=Helvetica color=a00000>Semiplenary</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>3:30pm - 4:00pm</td>
+ <td><font face=Helvetica size=-1>--- Tea ---</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>4:00pm - 4:45pm</td>
+ <td><font face=Helvetica>Tomaso Poggio</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>4:50pm - 5.35pm</td>
+ <td><font face=Helvetica> Cynthia Rudin</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>5:40pm - 6:25pm</td>
+ <td><font face=Helvetica>Steve Smale</td>
+</tr>
+</table></center>
+
+<p>
+<table width=100% bgcolor=0000a0>
+<tr><td><center><font face=Helvetica color=ffff00> Day 3: 6 July</td></tr>
+</table>
+
+<center><table width=80%>
+
+<tr>
+ <td><font face=Helvetica>1:50pm - 2:35pm</td>
+ <td><font face=Helvetica>Sara Van de Geer</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>2:40pm - 3:25pm</td>
+ <td><font face=Helvetica>Alessandro Verri</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>3:30pm - 4:00pm</td>
+ <td><font face=Helvetica size=-1>--- Tea ---</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>4:00pm - 4:45pm</td>
+ <td><font face=Helvetica>Martin Wainwright</td>
+ <td><font face=Helvetica color=a00000>Semiplenary</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>4:50pm - 5.35pm</td>
+ <td><font face=Helvetica> Vladimir Vovk</td>
+</tr>
+<tr>
+ <td><font face=Helvetica>5:40pm - 6:25pm</td>
+ <td><font face=Helvetica>Ding Zhou</td>
+</tr></table></center>
+
+<p>
+<table width=100% bgcolor=0000a0>
+<tr><td><center><font face=Helvetica color=0000a0>------</td></tr>
+</table></body>
</html>
diff -ru .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/workshops.html cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/workshops.html
--- .old-crypto/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/workshops.html 2005-05-18 02:52:46.000000000 -0400
+++ cr.yp.to/conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/workshops.html 2005-05-30 04:30:16.000000000 -0400
@@ -134,8 +134,8 @@
Schumaker</a></b>
<p>
- <a href=http://www.math.umd.edu/~res/FoCM05.html
- target=_new><font color=806000><b>WORKSHOP 19</b></a></font></br>
+ <a href=http://www.math.umd.edu/~res/FoCM05.html target=_new>
+<font color=806000><b>WORKSHOP 19</b></a></font></br>
<font color=8000a0><b>Computational geometry and topology</b></font><br>
<font color=007070>ORGANISERS: <b><a
href=http://www.math.umd.edu/~res/ target=_new>Rich Schwartz</a> & <a
diff -ru .old-crypto/conferences/2005-skew/www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/index.html cr.yp.to/conferences/2005-skew/www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/index.html
--- .old-crypto/conferences/2005-skew/www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/index.html 2005-04-15 10:19:50.000000000 -0400
+++ cr.yp.to/conferences/2005-skew/www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/index.html 2005-06-04 05:21:28.000000000 -0400
@@ -8,46 +8,27 @@
<meta name="GENERATOR" content="StarOffice 6.0 (Solaris Sparc)">
<style>
- <!--
- @page { margin: 2cm }
- -->
</style>
<meta http-equiv="CONTENT-TYPE" content="text/html; charset=utf-8">
<meta name="GENERATOR" content="StarOffice 6.0 (Solaris Sparc)">
<style>
- <!--
- @page { margin: 2cm }
- -->
</style>
<meta http-equiv="CONTENT-TYPE" content="text/html; charset=utf-8">
<meta name="GENERATOR" content="StarOffice 6.0 (Solaris Sparc)">
<style>
- <!--
- @page { margin: 2cm }
- -->
</style>
<meta http-equiv="CONTENT-TYPE" content="text/html; charset=utf-8">
<meta name="GENERATOR" content="StarOffice 6.0 (Solaris Sparc)">
- <style>
- <!--
- @page { margin: 2cm }
- -->
- </style>
<meta http-equiv="CONTENT-TYPE" content="text/html; charset=utf-8">
<meta name="GENERATOR" content="StarOffice 6.0 (Solaris Sparc)">
- <style>
- <!--
- @page { margin: 2cm }
- -->
- </style>
<meta http-equiv="CONTENT-TYPE" content="text/html; charset=utf-8">
<meta name="GENERATOR" content="StarOffice 6.0 (Solaris Sparc)">
@@ -99,6 +80,10 @@
event </h3>
<h3 align="center">May 26 - May 27, 2005 </h3>
+
+<h3 align="center"><blink><a href="program.htm">
+Program</a>
+</blink> </h3>
<table cellpadding="4" cellspacing="2" border="3" width="100%">
<tbody>
New: conferences/2005-skew/www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/program.htm
diff -ru .old-crypto/conferences.html cr.yp.to/conferences.html
--- .old-crypto/conferences.html 2005-05-29 14:09:02.000000000 -0400
+++ cr.yp.to/conferences.html 2005-06-11 19:17:18.000000000 -0400
@@ -413,7 +413,7 @@
Travel unnecessary.
Hotel room unnecessary.)
<p>
-2005.05.30-2005.05.30, invited, plan to attend:
+2005.05.30-2005.05.30, invited, attended:
Quo Vadis Cryptology? Advances in Cryptanalysis.
<a href="http://ece.gmu.edu/quovadis/quovadis3/quovadis3.htm">http://ece.gmu.edu/quovadis/quovadis3/quovadis3.htm</a>;
mirror.
@@ -423,7 +423,7 @@
Have purchased CPH-WAW-CPH.
Organizers have reserved hotel room for 28 May 2005 to 2 June 2005.)
<p>
-2005.05.31-2005.06.02, invited, plan to attend:
+2005.05.31-2005.06.02, invited, attended:
ENIGMA 2005.
<a href="http://www.enigma.com.pl/konferencje/ix_kkzk/index.htm">http://www.enigma.com.pl/konferencje/ix_kkzk/index.htm</a>;
<a href="conferences/2005-enigma/www.enigma.com.pl/konferencje/ix_kkzk/index.html">mirror</a>.
@@ -451,7 +451,6 @@
Have purchased ORD-LHR.
Have to figure out LHR-STN.
Have purchased STN-SDR.
-Have to figure out LHR-Santander; probably via Stansted.
Have reserved hotel room from 28 June to 11 July.)
<p>
2005.07.14-2005.07.15, plan to attend:
diff -ru .old-crypto/cv.html cr.yp.to/cv.html
--- .old-crypto/cv.html 2005-05-30 18:15:09.000000000 -0400
+++ cr.yp.to/cv.html 2005-06-03 12:29:14.000000000 -0400
@@ -60,6 +60,10 @@
<a href="talks.html#2005.05.27">SKEW 2005</a>.
<li>2005.05.30: Gave invited conference talk at
<a href="talks.html#2005.05.30">Quo Vadis Cryptology</a>.
+<li>2005.06.01: Gave invited conference talk at
+<a href="talks.html#2005.06.01">ENIGMA 2005</a>.
+<li>2005.06.02: powers2
+has been accepted to Mathematics of Computation.
</ul>
Also a clarification:
I should have said in Section 4 of activities-20050107
diff -ru .old-crypto/papers.html cr.yp.to/papers.html
--- .old-crypto/papers.html 2005-05-09 18:26:15.000000000 -0400
+++ cr.yp.to/papers.html 2005-06-08 22:34:26.000000000 -0400
@@ -766,13 +766,15 @@
<td valign=top>17pp</td>
<td valign=top>2004.10.19</td>
<td valign=top>refereed</td>
-<td valign=top></td>
+<td valign=top>printed</td>
<td valign=top>2005.02.27
[<a href="antiforgery/securitywcs-20050227.pdf">PDF</a>]
[<a href="mac.html#securitywcs">more</a>]
</td></tr><tr><td colspan="6">
DJB.
``Stronger security bounds for Wegman-Carter-Shoup authenticators.''
+Printed in
+<i>Proceedings of Eurocrypt 2005</i>.
<hr></td></tr>
<tr><td valign=top><a name="permutations">http://cr.yp.to/papers.html#permutations</a></td>
@@ -786,6 +788,8 @@
</td></tr><tr><td colspan="6">
DJB.
``Stronger security bounds for permutations.''
+To be incorporated into author's
+<i>High-speed cryptography</i> book.
<hr></td></tr>
<tr><td valign=top><a name="poly1305">http://cr.yp.to/papers.html#poly1305</a></td>
@@ -819,7 +823,7 @@
<tr><td valign=top><a name="bruteforce">http://cr.yp.to/papers.html#bruteforce</a></td>
<td valign=top>10pp</td>
<td valign=top>2005.04.25</td>
-<td valign=top></td>
+<td valign=top>refereed</td>
<td valign=top></td>
<td valign=top>2005.04.25
[<a href="snuffle/bruteforce-20050425.pdf">PDF</a>]
@@ -832,7 +836,7 @@
<tr><td valign=top><a name="powers2">http://cr.yp.to/papers.html#powers2</a></td>
<td valign=top>4pp</td>
<td valign=top>2004.06.30</td>
-<td valign=top></td>
+<td valign=top>refereed</td>
<td valign=top></td>
<td valign=top>2005.05.09
[<a href="lineartime/powers2-20050509.pdf">PDF</a>]
diff -ru .old-crypto/streamciphers.html cr.yp.to/streamciphers.html
--- .old-crypto/streamciphers.html 2005-05-31 11:19:49.000000000 -0400
+++ cr.yp.to/streamciphers.html 2005-06-09 18:19:45.000000000 -0400
@@ -23,29 +23,21 @@
<li>Mir-1, by Maximov.
<li>Phelix, by Whiting, Schneier, Lucks, and Muller:
<a href="http://www.schneier.com/paper-phelix.html">http://www.schneier.com/paper-phelix.html</a>.
-<li>TSC-3, by Hong, Lee, Yeom, Han, and Chee. Aimed at hardware.
-<li>F-FCSR-8, by Arnault, Berger, and Lauradoux. Aimed at hardware.
-<li>F-FCSR-H, by Arnault, Berger, and Lauradoux. Aimed at hardware.
-<li>Achterbahn, by Gammel, Goettfert, and Kniffler. Aimed at hardware.
+<li>TSC-3, by Hong, Lee, Yeom, Han, and Chee.
+<li>F-FCSR-8, by Arnault, Berger, and Lauradoux.
+<li>F-FCSR-H, by Arnault, Berger, and Lauradoux.
+<li>Achterbahn, by Gammel, Goettfert, and Kniffler.
<li>SFINKS, by Braeken, Lano, Mentens, Preneel, and Verbauwhede.
-Aimed at hardware.
-<li>WG, by Nawaz and Gong. Aimed at hardware.
+<li>WG, by Nawaz and Gong.
<li>Py, by Biham and Seberry.
<li>Py6, by Biham and Seberry.
<li>Mosquito, by Daemen and Kitsos.
-Aimed at hardware.
-``More of a research object than a standard proposal,'' Daemen says.
<li>Polar Bear, by Hastad and Naeslund.
<li>Edon80, by Gligoroski, Markovski, Kocarev, and Gusev.
-Aimed at hardware.
<li>CJCSG, by Jansen, Helleseth, and Kholosha.
-Aimed at hardware.
<li>DECIM, by Berbain et al.
-Aimed at hardware.
<li>MICKEY, by Babbage and Dodd.
-Aimed at hardware.
<li>MICKEY-128, by Babbage and Dodd.
-Aimed at hardware.
<li>YAMB, by Lebedev, Ivanov, Starodubtzev, and Kolchkov.
<li>LEX, by Biryukov.
<li>Fubuki, by Matsumoto, Nishimura, Hagita, and Saito.
@@ -78,6 +70,44 @@
constant-time high-speed AES software for modern CPUs.
</ul>
A new cipher can avoid these structural errors.
+<h2>Competition among the submissions</h2>
+The speed part of the competition is predictable:
+<ul>
+<li>Ciphers that do a huge amount of work per byte
+(for example, Fubuki, taking 133 cycles/byte to encrypt a large block)
+will be criticized as being too slow
+for most applications.
+In response,
+the authors will say that what they care about is security,
+and that speed is irrelevant for most applications.
+<li>Ciphers that take a long time to load a key or nonce
+(for example, over 7000 cycles for Py)
+will be criticized as being too slow
+for applications where the average message length is short.
+In response,
+the authors will say that the average message length is actually very long.
+<li>Ciphers that rely heavily on variable-index table lookups
+(for example, YAMB)
+will be criticized as being too slow
+for applications that need to resist timing attacks.
+In response,
+the authors will say that most applications don't need to resist timing attacks.
+<li>Ciphers that rely heavily on multiplications
+(for example, Rabbit)
+will be criticized as being too slow
+for applications that use dedicated hardware.
+In response,
+the authors will say that dedicated hardware
+is a tiny part of the cryptographic market.
+<li>Ciphers that rely heavily on bit twiddling
+will be criticized as being too slow
+for applications that don't use dedicated hardware.
+In response,
+the authors will say that anyone who really cares about speed
+will use dedicated hardware.
+</ul>
+<p>
+The security part of the competition is much less predictable.
<h2>Notes on Salsa20</h2>
My own submission.
Quite conservative.
@@ -104,7 +134,7 @@
<p>
Each 16-byte output block involves 8 squarings and various other operations.
<p>
-Initial impressions:
+Initial impression:
The multiplier means large price-performance ratio for hardware,
but Rabbit's software speed is quite attractive.
From a timing-attack perspective,
@@ -142,13 +172,36 @@
(5 adds, 5 xors, 5 rotations),
plus final xoring, plus the cost of authentication.
<p>
-Initial impressions:
+Initial impression:
Phelix, like Salsa20, follows TEA in using a long chain of simple operations.
It's fine from a timing-attack perspective.
Phelix is less conservative than Salsa20 but is usually faster.
Exceptions:
Salsa20 is faster than Phelix when the hardware offers more parallelism,
and (in conjunction with Poly1305) is faster at rejecting forged packets.
+<h2>Notes on TSC-3</h2>
+Key is only 80 bits.
+Authors report, for a Pentium 4,
+1500 cycles to load a key and nonce,
+plus 50 cycles/byte to encrypt a big block.
+<h2>Notes on F-FCSR-8</h2>
+128-bit key.
+Authors report,
+for the Pentium 3 and 4,
+about 10000 cycles to load a key and nonce,
+plus 100 cycles per byte to encrypt a big block;
+for the PowerPC 7457 (G4e),
+about 20 cycles per byte to encrypt a big block.
+<h2>Notes on F-FCSR-H</h2>
+80-bit key.
+<h2>Notes on Achterbahn</h2>
+80-bit key.
+Authors don't report software speeds.
+<h2>Notes on SFINKS</h2>
+80-bit key.
+Authors don't report software speeds.
+<h2>Notes on WG</h2>
+Authors report insanely slow software speeds.
<h2>Notes on SOSEMANUK</h2>
Key length between 16 bytes and 32 bytes.
Nonce length: 16 bytes.
@@ -184,7 +237,7 @@
693 cycles to load a nonce;
314 cycles per block (39.25 cycles/byte, I believe) to encrypt a big block.
<p>
-Initial impressions:
+Initial impression:
The reported speeds are too slow to attract any interest.
On the other hand,
I think that this function could be computed at considerably higher speed.
@@ -213,6 +266,9 @@
Scaled-down version of Py.
Smaller key-loading time and nonce-loading time;
same cycles/byte to encrypt a big block.
+<h2>Notes on Mosquito</h2>
+``More of a research object than a standard proposal,''
+Daemen said in his SKEW presentation.
<h2>Notes on Polar Bear</h2>
Key length: as large as 16 bytes?
Nonce length: as large as 32 bytes.
@@ -228,6 +284,17 @@
The cycles-per-byte count isn't even on the same scale as RC4;
the authors are wildly misrepresenting RC4 speed.
What advantages is Polar Bear supposed to have over AES?
+<h2>Notes on Edon80</h2>
+80-bit key.
+80-bit nonce.
+<h2>Notes on CJCSG</h2>
+Aimed at hardware.
+<h2>Notes on DECIM</h2>
+Aimed at hardware.
+<h2>Notes on MICKEY</h2>
+Aimed at hardware.
+<h2>Notes on MICKEY-128</h2>
+Aimed at hardware.
<h2>Notes on YAMB</h2>
Key as large as 32 bytes.
Nonce as large as 16 bytes.
@@ -291,7 +358,7 @@
addition, xor, constant-distance shift, table lookups.
The designers claim, incorrectly, that table lookup takes constant time.
<p>
-Initial impressions:
+Initial impression:
Timing-attack problems.
</body>
</html>
New: talks/1987.06.01
New: talks/1992.12-1
New: talks/1992.12-2
New: talks/1994.05.02
New: talks/1994.10.12
New: talks/1995.02.06
New: talks/1995.03.01
New: talks/1995.04.05
New: talks/1995.05
New: talks/1995.10.03
New: talks/1995.10.17
New: talks/1995.11.15
New: talks/1995.12.02
New: talks/1996.05.22
New: talks/1997.03.07
New: talks/1997.03.17
New: talks/1997.05.30
New: talks/1997.10.25
New: talks/1997.11.19
New: talks/1997.12.03
New: talks/1998.02.13
New: talks/1998.06.21
New: talks/1998.09.12
New: talks/1998.10.29
New: talks/1999.02.23-1
New: talks/1999.02.23-2
New: talks/1999.06.13
New: talks/1999.07.06
New: talks/1999.10.13
New: talks/2000.04.08
New: talks/2000.05.22
New: talks/2000.06.10
New: talks/2000.06.27
New: talks/2000.07.27
New: talks/2000.08.14
New: talks/2000.08.15
New: talks/2000.08.18
New: talks/2000.09.07
New: talks/2000.10.06
New: talks/2000.10.20
New: talks/2001.03.23
New: talks/2001.05.07
New: talks/2001.05.14
New: talks/2001.06.13
New: talks/2001.07.27
New: talks/2001.09.22
New: talks/2001.10.29
New: talks/2001.11.02
New: talks/2002.01.28
New: talks/2002.04.24
New: talks/2002.06.15
New: talks/2002.08.20-1
New: talks/2002.08.20-2
New: talks/2002.10.31
New: talks/2003.02.11
New: talks/2003.03.18
New: talks/2003.03.23
New: talks/2003.03.25
New: talks/2003.03.26
New: talks/2003.04.03
New: talks/2003.04.04
New: talks/2003.04.24
New: talks/2003.05.03
New: talks/2003.05.10
New: talks/2003.05.26
New: talks/2003.07.24
New: talks/2003.11.08-1
New: talks/2003.11.08-2
New: talks/2004.04.28
New: talks/2004.05.14
New: talks/2004.06.14
New: talks/2004.06.24
New: talks/2004.07.07
New: talks/2004.07.29
New: talks/2004.08.17
diff -ru .old-crypto/talks.html cr.yp.to/talks.html
--- .old-crypto/talks.html 2005-06-01 05:07:49.000000000 -0400
+++ cr.yp.to/talks.html 2005-06-11 22:37:17.000000000 -0400
@@ -3,60 +3,132 @@
<a href="djb.html">D. J. Bernstein</a>
<h1>Talks</h1>
Chronological order.
-The number in parentheses is the number of minutes
-officially assigned to the talk.
-<p>
-<a name="1987.06.01">1987.06.01</a> (10), contributed conference talk:
+Some statistics:
+<ul>
+<li>94 lectures.
+76 invited;
+6 refereed;
+11 contributed;
+1 unclassified.
+91 done.
+<li>83 lectures of known length,
+totalling 3382 minutes,
+averaging 40 minutes.
+<li>50 lectures with slides online here.
+</ul>
+<p>
+<table>
+<tbody>
+
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1987.06.01">1987.06.01</a></td>
+<td>10 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Ramanujan Centenary Conference.
University of Illinois at Urbana-Champaign.
-``New fast algorithms for pi and e'':
-Westinghouse project.
-<p>
-1992.12, contributed conference talk:
+``New fast algorithms for pi and e.''
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1992.12-1">1992.12</a></td>
+<td></td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
West Coast Number Theory Conference.
Oregon State University, Corvallis.
3x+1 results.
-<a href="papers.html#231">[231 paper]</a>
-<a href="papers.html#3x1conjmap">[3x1conjmap paper]</a>
-<p>
-1992.12, contributed conference talk:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1992.12-2">1992.12</a></td>
+<td></td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
West Coast Number Theory Conference.
Oregon State University, Corvallis.
Computing Dickman's rho function.
-I thought of this as research at the time,
-but the central idea had already been discovered and published in 1989
-by Marsaglia, Zaman, and Marsaglia.
-Oops.
-<p>
-<a name="1994.05.02">1994.05.02</a>, invited conference talk (45):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1994.05.02">1994.05.02</a></td>
+<td>45 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+
+
Computational Number Theory.
-Fields Institute, Waterloo, Ontario, Canada.
+Fields Institute, Waterloo, Ontario.
``Practical aspects of the number field sieve.''
This talk included the first public announcement of the
multiple-lattice number field sieve.
<a href="papers.html#nfsi">[nfsi paper]</a>
<a href="papers.html#mlnfs">[mlnfs paper]</a>
-<p>
-<a name="1994.10.12">1994.10.12</a>, invited conference talk:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1994.10.12">1994.10.12</a></td>
+<td></td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+
+
Algorithms and Number Theory.
-Schloss Dagstuhl, Germany.
+Schloss Dagstuhl.
Preliminary report on detecting perfect powers.
<a href="papers.html#powers">[powers paper]</a>
-<p>
-<a name="1995.02.06">1995.02.06</a>, invited seminar talk:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1995.02.06">1995.02.06</a></td>
+<td></td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Seminar,
Department of Mathematics,
Texas A&M University, College Station, Texas.
Detecting perfect powers.
<a href="papers.html#powers">[powers paper]</a>
-<p>
-<a name="1995.03.01">1995.03.01</a>, invited colloquium talk (50):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1995.03.01">1995.03.01</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>colloquium</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Department of Mathematics, Statistics, and Computer Science.
University of Illinois at Chicago.
Detecting perfect powers.
<a href="papers.html#powers">[powers paper]</a>
-<p>
-<a name="1995.04.05">1995.04.05</a>, invited seminar talk (50):
-Number Theory,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1995.04.05">1995.04.05</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Number Theory Seminar,
Department of Mathematics,
University of California at Berkeley.
``Detecting perfect powers.''
@@ -69,52 +141,118 @@
The time analysis requires
some recent results from transcendental number theory.''
<a href="papers.html#powers">[powers paper]</a>
-<p>
-1995.05, invited conference talk:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1995.05">1995.05</a></td>
+<td></td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+
+
<a href="http://www.mfo.de/Meetings/Meeting_Program_1995.html#T9522">Computational Number Theory</a>.
-Mathematisches Forschungsinstitut, Oberwolfach, Germany.
+Mathematisches Forschungsinstitut, Oberwolfach.
Multidigit modular multiplication with ECRT.
<a href="papers.html#mmecrt">[mmecrt paper]</a>
-<p>
-<a name="1995.10.03">1995.10.03</a>, invited seminar talk (50):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1995.10.03">1995.10.03</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Seminar,
Department of Mathematics, Statistics, and Computer Science,
University of Illinois at Chicago.
Survey of topics related to number field sieve.
-<p>
-<a name="1995.10.17">1995.10.17</a>, invited seminar talk (50):
-Number Theory,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1995.10.17">1995.10.17</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Number Theory Seminar,
Department of Mathematics, Statistics, and Computer Science,
University of Illinois at Chicago.
Generalized Gaussian elimination.
-<p>
-<a name="1995.11.15">1995.11.15</a>, invited seminar talk (50):
-Computer Science,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1995.11.15">1995.11.15</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Computer Science Seminar,
Department of Mathematics, Statistics, and Computer Science,
University of Illinois at Chicago.
Universal pattern-matching automaton.
<a href="papers.html#unipat">[unipat paper]</a>
-<p>
-<a name="1995.12.02">1995.12.02</a>, invited conference talk (40):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1995.12.02">1995.12.02</a></td>
+<td>40 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Midwest Algebraic Number Theory Day III.
University of Michigan, Ann Arbor.
``Fast ideal arithmetic via lazy localization.''
<a href="papers.html#fiall">[fiall paper]</a>
-<p>
-<a name="1996.05.22">1996.05.22</a>, refereed conference talk (20):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1996.05.22">1996.05.22</a></td>
+<td>20 minutes</td>
+<td>refereed lecture</td>
+<td>conference</td>
+<td>France</td>
+</tr><tr><td colspan="5">
+
+
Algorithmic Number Theory Symposium (ANTS) II.
-University of Bordeaux, France.
+University of Bordeaux.
``Fast ideal arithmetic via lazy localization.''
<a href="papers.html#fiall">[fiall paper]</a>
-<p>
-<a name="1997.03.07">1997.03.07</a>, invited conference talk (30):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1997.03.07">1997.03.07</a></td>
+<td>30 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Mathematics of Cryptography and Security.
-<a href="www.math.arizona.edu/~rims/">Southwest Regional Institute in the Mathematical Sciences (SWRIMS)</a>,
+Southwest Regional Institute in the Mathematical Sciences (SWRIMS),
University of Arizona, Tucson.
``The world's fastest digital signature system.''
<a href="sigs.html">[sigs software]</a>
<a href="papers.html#sigs">[sigs paper]</a>
-<p>
-<a name="1997.03.17">1997.03.17</a>, invited seminar talk (50):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1997.03.17">1997.03.17</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Seminar,
Department of Mathematics and Computer Science,
Butler University.
``The world's fastest digital signature system.''
@@ -132,10 +270,18 @@
but with much faster verification.''
<a href="sigs.html">[sigs software]</a>
<a href="papers.html#sigs">[sigs paper]</a>
-<p>
-<a name="1997.05.30">1997.05.30</a>, invited conference talk:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1997.05.30">1997.05.30</a></td>
+<td></td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+
+
Computational Aspects of Commutative Algebra and Algebraic Geometry.
-Schloss Dagstuhl, Germany.
+Schloss Dagstuhl.
``Composing power series over a finite ring in essentially linear time.''
Abstract written after the talk:
``Fix a finite commutative ring R.
@@ -147,8 +293,16 @@
The algorithm is very fast in practice
when char R is a product of small primes.''
<a href="papers.html#compose">[compose paper]</a>
-<p>
-<a name="1997.10.25">1997.10.25</a>, invited conference talk (20):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1997.10.25">1997.10.25</a></td>
+<td>20 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Special Session on Number Theory and Cryptography;
Central Section Meeting, American Mathematical Society (AMS).
University of Wisconsin at Milwaukee.
@@ -156,9 +310,17 @@
with verification ten times faster than RSA.''
<a href="sigs.html">[sigs software]</a>
<a href="papers.html#sigs">[sigs paper]</a>
-<p>
-<a name="1997.11.19">1997.11.19</a>, invited seminar talk (50):
-Number Theory,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1997.11.19">1997.11.19</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Number Theory Seminar,
Department of Mathematics, Statistics, and Computer Science,
University of Illinois at Chicago.
``Factoring into coprimes in essentially linear time.''
@@ -171,9 +333,17 @@
(2) explain the Bach-Driscoll-Shallit quadratic-time factorization method,
and (3) describe my essentially-linear-time factorization method.''
<a href="papers.html#dcba">[dcba paper]</a>
-<p>
-<a name="1997.12.03">1997.12.03</a>, invited seminar talk (50):
-Number Theory,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1997.12.03">1997.12.03</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Number Theory Seminar,
Department of Mathematics, Statistics, and Computer Science,
University of Illinois at Chicago.
``Improving on the Sieve of Eratosthenes,''
@@ -188,29 +358,61 @@
that uses O(N/log log N) additions with roughly N^{1/2} bits of storage.''
<a href="primegen.html">[primegen software]</a>
<a href="papers.html#primesieves">[primesieves paper]</a>
-<p>
-<a name="1998.02.13">1998.02.13</a>, invited colloquium talk (50):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1998.02.13">1998.02.13</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>colloquium</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Department of Mathematics, Statistics, and Computer Science.
University of Illinois at Chicago.
``Computing everything in essentially linear time'':
computational one-dimensional commutative algebra.
-<p>
-<a name="1998.06.21">1998.06.21</a>, refereed conference talk (20):
-<a href="http://www.reed.edu/ants/">Algorithmic Number Theory Symposium (ANTS) III</a>.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1998.06.21">1998.06.21</a></td>
+<td>20 minutes</td>
+<td>refereed lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Algorithmic Number Theory Symposium (ANTS) III.
Reed College, Portland, Oregon.
``Bounding smooth integers.''
<a href="psibound.html">[psibound software]</a>
<a href="papers.html#psi">[psi paper]</a>
-<p>
-<a name="1998.09.12">1998.09.12</a>, invited conference talk:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1998.09.12">1998.09.12</a></td>
+<td></td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Special Session on Number Theory;
Central Section Meeting, American Mathematical Society (AMS).
DePaul University, Chicago, Illinois.
``Estimating the speed of the quadratic sieve (preliminary report).''
-<p>
-<a name="1998.10.29">1998.10.29</a>, invited conference talk (30):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1998.10.29">1998.10.29</a></td>
+<td>30 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+
+
Algorithms and Number Theory.
-Schloss Dagstuhl, Germany.
+Schloss Dagstuhl.
``Ten topics in computational number theory.''
Abstract:
``1. Fast Fourier transforms.
@@ -225,15 +427,31 @@
10. Estimating factorization time.''
This was a talk on estimating
the speed of the quadratic sieve and the number field sieve.
-<p>
-<a name="1999.02.23-1">1999.02.23</a>, invited seminar talk (50):
-Mathematics in Science and Society, Department of Mathematics,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1999.02.23-1">1999.02.23</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Mathematics in Science and Society Seminar, Department of Mathematics,
University of Illinois at Urbana-Champaign.
``How to become an international arms dealer'':
an introduction to cryptography.
-<p>
-<a name="1999.02.23-2">1999.02.23</a>, invited seminar talk (50):
-Number Theory, Department of Mathematics,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1999.02.23-2">1999.02.23</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Number Theory Seminar, Department of Mathematics,
University of Illinois at Urbana-Champaign.
``Fast, arbitrarily precise computation of Psi.''
Abstract:
@@ -251,33 +469,63 @@
<a href="papers.html#primesieves">[primesieves paper]</a>
<a href="papers.html#m3">[m3 paper]</a>
<a href="papers.html#fastnewton">[fastnewton paper]</a>
-<p>
-<a name="1999.06.13">1999.06.13</a> (20), contributed conference talk:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1999.06.13">1999.06.13</a></td>
+<td>20 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+
+
The Mathematics of Public-Key Cryptography.
-Fields Institute, Toronto, Ontario, Canada.
+Fields Institute, Toronto, Ontario.
``Guaranteed message authentication faster than MD5.''
<a href="hash127.html">[hash127 software]</a>
<a href="papers.html#hash127">[hash127 paper]</a>
-<p>
-<a name="1999.07.06">1999.07.06</a>, invited conference talk
-<a href="talks/1999ss.ps">[PS slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1999.07.06">1999.07.06</a></td>
+<td></td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+<a href="talks/1999.07.06/slides.ps">[PS slides]</a>
+
Explicit Methods in Number Theory.
-Mathematisches Forschungsinstitut, Oberwolfach, Germany.
+Mathematisches Forschungsinstitut, Oberwolfach.
``Counting rational points by brute force'':
fast algorithms to find all points of low height
on the Euler-Elkies surface.
<a href="sortedsums.html">[sortedsums software]</a>
<a href="papers.html#sortedsums">[sortedsums paper]</a>
-<p>
-<a name="1999.10.13">1999.10.13</a> 10:45, invited conference talk (40)
-<a href="talks/1999newton.ps">[PS slides]</a>:
-<a href="http://www.damtp.cam.ac.uk/user/na/FoCM/HK_Wshop2.html">Workshop on Complexity of Equation Solving and Algebra, Foundations of Computational Mathematics</a>.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="1999.10.13">1999.10.13 10:45</a></td>
+<td>40 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>China</td>
+</tr><tr><td colspan="5">
+<a href="talks/1999.10.13/slides.ps">[PS slides]</a>
+
+Workshop on Complexity of Equation Solving and Algebra, Foundations of Computational Mathematics.
City University of Hong Kong.
``Solving equations to high precision'':
reducing the algebraic complexity of Newton's method.
<a href="papers.html#fastnewton">[fastnewton paper]</a>
-<p>
-<a name="2000.04.08">2000.04.08</a>, invited conference talk (20):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.04.08">2000.04.08</a></td>
+<td>20 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Special Session on Number Theory, Algorithms, and Cryptography;
Central Section Meeting, American Mathematical Society (AMS).
University of Notre Dame, Indiana.
@@ -290,9 +538,17 @@
why Zmult is so fast.''
<a href="zmult.html">[Zmult software]</a>
<a href="papers.html#m3">[m3 paper]</a>
-<p>
-<a name="2000.05.22">2000.05.22</a>, invited conference talk (30):
-<a href="http://www.math.uiuc.edu/nt2000/millennial.html">Millennial Conference in Number Theory</a>.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.05.22">2000.05.22</a></td>
+<td>30 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Millennial Conference in Number Theory.
University of Illinois at Urbana-Champaign.
``Arbitrarily precise bounds on the distribution of smooth integers.''
Abstract:
@@ -301,11 +557,19 @@
This talk will explain the mathematics behind Psibound and show some results.''
<a href="psibound.html">[psibound software]</a>
<a href="papers.html#psi">[psi paper]</a>
-<p>
-<a name="2000.06.10">2000.06.10</a>, invited conference talk (25):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.06.10">2000.06.10</a></td>
+<td>25 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+
+
Session on Cryptography and Number Theory,
-<a href="http://www.cms.math.ca/CMS/Events/math2000/">Canadian Mathematical Society summer meeting, MATH 2000</a>.
-McMaster University, Hamilton, Ontario, Canada.
+Canadian Mathematical Society summer meeting, MATH 2000.
+McMaster University, Hamilton, Ontario.
``Sieving in cache.''
Abstract:
``Modern integer factorization algorithms
@@ -314,21 +578,36 @@
can take advantage of fast arithmetic on stupendously large integers.''
<a href="smallfactors.html">[smallfactors software]</a>
<a href="papers.html#sf">[sf paper]</a>
-<p>
-<a name="2000.06.27">2000.06.27</a>, invited conference talk (30):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.06.27">2000.06.27</a></td>
+<td>30 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Russia</td>
+</tr><tr><td colspan="5">
+
+
Session on Algebraic Algorithms and Complexity,
-<a href="www.pdmi.ras.ru/~aca00/">6th IMACS Conference on Applications of Computer Algebra (ACA)</a>.
-Shuvalov Palace, St. Petersburg, Russia.
+6th IMACS Conference on Applications of Computer Algebra (ACA).
+Shuvalov Palace, St. Petersburg.
Preliminary title:
``How quickly can we split generic polynomials?''
Final title:
``High-precision high-degree polynomial factorization (preliminary report).''
<a href="papers.html#fastgraeffe">[fastgraeffe paper]</a>
-<p>
-<a name="2000.07.27">2000.07.27</a>, invited conference talk (50)
-<a href="talks/2000nfs.ps">[PS slides]</a>:
-<a href="http://www.maths.nottingham.ac.uk/personal/jec/durham">London Mathematical Society (LMS) Durham Symposium on Computational Number Theory</a>.
-University of Durham, England.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.07.27">2000.07.27</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>England</td>
+</tr><tr><td colspan="5">
+<a href="talks/2000.07.27/slides.ps">[PS slides]</a>
+
+London Mathematical Society (LMS) Durham Symposium on Computational Number Theory.
+University of Durham.
``Rethinking the number field sieve.''
Abstract:
``How quickly can we factor 300-digit integers?
@@ -340,35 +619,63 @@
<a href="papers.html#dcba">[dcba paper]</a>
<a href="papers.html#psi">[psi paper]</a>
<a href="papers.html#mlnfs">[mlnfs paper]</a>
-<p>
-<a name="2000.08.14">2000.08.14</a>, invited conference talk (60)
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.08.14">2000.08.14</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2000.08.14/slides.ps">[PS slides]</a>
+
<a href="http://www.msri.org/publications/ln/msri/2000/introant/bernstein/1/index.html">[video at www.msri.org]</a>
-<a href="talks/2000msri1.ps">[PS slides]</a>:
-<a href="http://zeta.msri.org/calendar/workshops/WorkshopInfo/26/show_workshop">Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory</a>.
+Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory.
Mathematical Sciences Research Institute, Berkeley, California.
``Fast multiplication.''
<a href="papers.html#multapps">[multapps paper]</a>
-<p>
-<a name="2000.08.15">2000.08.15</a>, invited conference talk (60)
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.08.15">2000.08.15</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2000.08.15/slides.ps">[PS slides]</a>
+
<a href="http://www.msri.org/publications/ln/msri/2000/introant/bernstein/2/index.html">[video at www.msri.org]</a>
-<a href="talks/2000msri2.ps">[PS slides]</a>:
-<a href="http://zeta.msri.org/calendar/workshops/WorkshopInfo/26/show_workshop">Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory</a>.
+Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory.
Mathematical Sciences Research Institute, Berkeley, California.
``Applications of fast multiplication.''
<a href="papers.html#multapps">[multapps paper]</a>
-<p>
-<a name="2000.08.18">2000.08.18</a>, invited conference talk (60)
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.08.18">2000.08.18</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2000.08.18/slides.ps">[PS slides]</a>
+
<a href="http://www.msri.org/publications/ln/msri/2000/introant/bernstein/3/index.html">[video at www.msri.org]</a>
-<a href="talks/2000msri3.ps">[PS slides with notes]</a>:
-<a href="http://zeta.msri.org/calendar/workshops/WorkshopInfo/26/show_workshop">Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory</a>.
+Clay Mathematics Institute Introductory Workshop in Algorithmic Number Theory.
Mathematical Sciences Research Institute, Berkeley, California.
``Protecting communications against forgery'':
a survey of secret-key authentication,
public-key authentication, and public-key signatures.
<a href="papers.html#forgery">[forgery paper]</a>
-<p>
-<a name="2000.09.07">2000.09.07</a>, invited colloquium talk (50)
-<a href="talks/2000dcba.ps">[PS slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.09.07">2000.09.07</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>colloquium</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2000.09.07/slides.ps">[PS slides]</a>
+
Department of Mathematics, University of California at Berkeley.
``Factoring into coprimes.''
Abstract: ``We do not know a fast algorithm to factor integers into primes.
@@ -378,9 +685,17 @@
explain exactly how fast the algorithm is,
and present some of the techniques behind the proof.''
<a href="papers.html#dcba">[dcba paper]</a>
-<p>
-<a name="2000.10.06">2000.10.06</a>, invited seminar talk (48):
-Number Theory, Department of Mathematics,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.10.06">2000.10.06</a></td>
+<td>48 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Number Theory Seminar, Department of Mathematics,
University of California at Berkeley.
``Arbitrarily precise bounds on smooth integers.''
Abstract: ``An integer is called smooth if all its prime divisors are small.
@@ -394,17 +709,33 @@
to modern integer factorization algorithms.''
<a href="psibound.html">[psibound software]</a>
<a href="papers.html#psi">[psi paper]</a>
-<p>
-<a name="2000.10.20">2000.10.20</a>, invited conference talk (60)
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2000.10.20">2000.10.20</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2000.10.20/slides.ps">[PS slides]</a>
+
<a href="http://www.msri.org/publications/ln/msri/2000/crypto/bernstein/1/index.html">[video at www.msri.org]</a>
-<a href="talks/2000sigs.ps">[PS slides with notes]</a>:
-<a href="http://zeta.msri.org/calendar/workshops/WorkshopInfo/5/show_workshop">Number-Theoretic Cryptography</a>.
+Number-Theoretic Cryptography.
Mathematical Sciences Research Institute, Berkeley, California.
``Design and implementation of a public-key signature system.''
<a href="sigs.html">[sigs software]</a>
<a href="papers.html#sigs">[sigs paper]</a>
-<p>
-<a name="2001.03.23">2001.03.23</a>, invited seminar talk (50):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2001.03.23">2001.03.23</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Seminar,
Computer Science Department, Butler University.
``The NSA sieving circuit.''
Abstract:
@@ -418,18 +749,32 @@
It is possible that the circuit
has already been built in secret by a major government.''
<a href="papers.html#nfscircuit">[nfscircuit paper]</a>
-<p>
-<a name="2001.05.07">2001.05.07</a>, contributed conference talk (6)
-<a href="talks/2001rump.ps">[PS slides]</a>:
-<a href="http://www.iacr.org/conferences/eurocrypt2001/">Eurocrypt 2001</a>.
-Innsbruck, Austria.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2001.05.07">2001.05.07</a></td>
+<td>6 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>Austria</td>
+</tr><tr><td colspan="5">
+<a href="talks/2001.05.07/slides.ps">[PS slides]</a>
+
+Eurocrypt 2001.
+Innsbruck.
``The NSA sieving circuit.''
<a href="papers.html#nfscircuit">[nfscircuit paper]</a>
-<p>
-<a name="2001.05.14">2001.05.14</a>, invited conference talk (40)
-<a href="talks/2001sort.ps">[PS slides]</a>:
-<a href="http://www.dagstuhl.de/DATA/Seminars/01/#01201">Algorithms and Number Theory</a>.
-Schloss Dagstuhl, Germany.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2001.05.14">2001.05.14</a></td>
+<td>40 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+<a href="talks/2001.05.14/slides.ps">[PS slides]</a>
+
+Algorithms and Number Theory.
+Schloss Dagstuhl.
``An introduction to Schimmler sorting.''
Abstract written after the talk:
``One can sort n^2 numbers on an nxn processor mesh
@@ -442,8 +787,17 @@
Schimmler sorting is one good choice of sorting algorithm
for the NSA sieving circuit.
<a href="papers.html#nfscircuit">[nfscircuit paper]</a>
-<p>
-<a name="2001.06.13">2001.06.13</a>, invited seminar talk (45):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2001.06.13">2001.06.13</a></td>
+<td>45 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
+Seminar,
Cambridge Research Laboratory,
Compaq Computer Corporation, Cambridge, Massachusetts.
``The state of the art in RSA-type signatures.''
@@ -454,12 +808,18 @@
You are not required to know anything about cryptography in advance.''
<a href="sigs.html">[sigs software]</a>
<a href="papers.html#sigs">[sigs paper]</a>
-<p>
-<a name="2001.07.27">2001.07.27</a>, invited conference talk (35)
-<a href="talks/2001height.ps">[PS slides]</a>:
-<a href="http://www.mfo.de/Meetings/Meeting_Program_2001.html#T0130">Explicit Methods in Number Theory</a>.
-Mathematisches Forschungsinstitut, Oberwolfach, Germany.
-Official title:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2001.07.27">2001.07.27</a></td>
+<td>35 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+<a href="talks/2001.07.27/slides.ps">[PS slides]</a>
+
+Explicit Methods in Number Theory.
+Mathematisches Forschungsinstitut, Oberwolfach.
``Finding polynomial values of small height.''
Unofficial title:
``The algorithm of
@@ -468,11 +828,18 @@
The organizers offered me a 45-minute slot;
in retrospect, I should have taken it.
<a href="papers.html#smallheight">[smallheight paper]</a>
-<p>
-<a name="2001.09.22">2001.09.22</a>, invited conference talk (30)
-<a href="talks/2001nist1.ps">[PS slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2001.09.22">2001.09.22</a></td>
+<td>30 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2001.09.22/slides.ps">[PS slides]</a>
+
Special Session on Cryptography and Computational and Algorithmic Number Theory;
-<a href="http://www.ams.org/amsmtgs/2059_program.html">Central Section Meeting</a>,
+Central Section Meeting,
American Mathematical Society (AMS).
Ohio State University, Columbus.
``Elliptic curve cryptography: the case of NIST P-224.''
@@ -496,11 +863,18 @@
I'll explain the rest of how nistp224 works.''
<a href="papers.html#sqroot">[sqroot paper]</a>
<a href="nistp224.html">[nistp224 software]</a>
-<p>
-<a name="2001.10.29">2001.10.29</a>, invited conference talk (60)
-<a href="talks/2001nist2.ps">[PS slides]</a>:
-<a href="http://www.cacr.math.uwaterloo.ca/conferences/2001/ecc/announcement.html">Elliptic Curve Cryptography (ECC) 2001</a>.
-University of Waterloo, Ontario, Canada.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2001.10.29">2001.10.29</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+<a href="talks/2001.10.29/slides.ps">[PS slides]</a>
+
+Elliptic Curve Cryptography (ECC) 2001.
+University of Waterloo, Ontario.
``A software implementation of NIST P-224.''
Abstract:
``This is the second in a series of three talks on nistp224,
@@ -515,10 +889,17 @@
In the third talk, at the MAGC meeting in Urbana,
I'll focus on non-x86 processors such as the UltraSPARC.''
<a href="nistp224.html">[nistp224 software]</a>
-<p>
-<a name="2001.11.02">2001.11.02</a>, invited conference talk (60)
-<a href="talks/2001nist3.ps">[PS slides]</a>:
-<a href="http://www.math.uiuc.edu/~boston/magc3.html">Midwest Arithmetical Geometry in Cryptography</a> (MAGC).
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2001.11.02">2001.11.02</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2001.11.02/slides.ps">[PS slides]</a>
+
+Midwest Arithmetical Geometry in Cryptography (MAGC).
University of Illinois at Urbana-Champaign.
``A complete software implementation of NIST P-224.''
Abstract:
@@ -534,8 +915,16 @@
or the second talk,
in which I focused on x86 processors.''
<a href="nistp224.html">[nistp224 software]</a>
-<p>
-<a name="2002.01.28">2002.01.28</a>, invited colloquium talk (50):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2002.01.28">2002.01.28</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>colloquium</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Department of Mathematics, University of Pittsburgh.
``Is a 2048-bit factorization worth $200,000?''
Abstract:
@@ -549,10 +938,17 @@
I'll talk about fast Fourier transforms, generalized power series,
better-than-perfect parallelization,
and how easy it is to disable the Internet.''
-<p>
-<a name="2002.04.24">2002.04.24</a>, invited seminar talk (50)
-<a href="talks/2002roots.ps">[PS slides]</a>:
-Mathematics and Applications,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2002.04.24">2002.04.24</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2002.04.24/slides.ps">[PS slides]</a>
+
+Mathematics and Applications Seminar,
Department of Mathematics, Statistics, and Computer Science,
University of Illinois at Chicago.
``Finding roots of high-degree polynomials.''
@@ -570,11 +966,18 @@
that relies on multiplication of extremely large integers.
The audience will not be assumed
to have any prior knowledge of numerical analysis.''
-<p>
-<a name="2002.06.15">2002.06.15</a>, invited conference talk (25/30)
-<a href="talks/2002records.ps">[PS slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2002.06.15">2002.06.15</a></td>
+<td>25 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+<a href="talks/2002.06.15/slides.ps">[PS slides]</a>
+
Symposium on Cryptography;
-<a href="http://www.cms.math.ca/Events/summer02/">2002 Summer Meeting</a>,
+2002 Summer Meeting,
Canadian Mathematical Society (CMS).
University of Laval, Quebec.
``Speed records for cryptographic software: an update.''
@@ -583,23 +986,44 @@
secret-key message authentication,
public-key signature verification,
and public-key secret sharing.''
-<p>
-<a name="2002.08.20-1">2002.08.20</a>, invited conference talk (10/10)
-<a href="talks/2002aks.ps">[PS slides]</a>:
-<a href="http://www.iacr.org/conferences/c2002/">Crypto 2002</a>.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2002.08.20-1">2002.08.20</a></td>
+<td>10 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2002.08.20-1/slides.ps">[PS slides]</a>
+
+Crypto 2002.
Santa Barbara.
``Deterministic polynomial-time primality tests.''
<a href="papers.html#aks">[aks paper]</a>
-<p>
-<a name="2002.08.20-2">2002.08.20</a>, contributed conference talk (5/5):
-<a href="talks/2002circuits.ps">[PS slides]</a>:
-<a href="http://www.iacr.org/conferences/c2002/">Crypto 2002</a>.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2002.08.20-2">2002.08.20</a></td>
+<td>5 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2002.08.20-2/slides.ps">[PS slides]</a>
+
+Crypto 2002.
Santa Barbara.
``The cost of integer factorization.''
<a href="papers.html#nfscircuit">[nfscircuit paper]</a>
-<p>
-<a name="2002.10.31">2002.10.31</a>, invited colloquium talk (50/50)
-<a href="talks/2002primality.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2002.10.31">2002.10.31</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>colloquium</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2002.10.31/slides.pdf">[PDF slides]</a>
+
Department of Mathematics, University of California at Berkeley.
``Proving primality.''
Abstract: ``I'll survey techniques
@@ -608,10 +1032,17 @@
I'll explain the August 2002 Agrawal-Kayal-Saxena theorem,
which gave a remarkably simple solution
to the long-standing `PRIMES in P' problem.''
-<p>
-<a name="2003.02.11">2003.02.11</a>, invited seminar talk (60/60)
-<a href="talks/2003dnssec.pdf">[PDF slides]</a>:
-Security,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.02.11">2003.02.11</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.02.11/slides.pdf">[PDF slides]</a>
+
+Security Seminar,
Computer Science Department,
Stanford University.
``The DNS security mess.''
@@ -632,30 +1063,68 @@
going to remain an abject failure for another ten years? This talk is
a case study of the integration of cryptography into the real world.
</blockquote>
-<p>
-<a name="2003.03.18">2003.03.18</a> 15:00, invited seminar talk (60)
-<a href="talks/2003dnssec2.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.03.18">2003.03.18</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.03.18/slides.pdf">[PDF slides]</a>
+
+Seminar,
Sun Microsystems.
``The DNS security mess.''
-<p>
-<a name="2003.03.23">2003.03.23</a> 09:30, invited conference talk (45)
-<a href="talks/2003prime83.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.03.23">2003.03.23 09:30</a></td>
+<td>45 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.03.23/slides.pdf">[PDF slides]</a>
+
Lenstra Treurfeest.
``A new proof that 83 is prime.''
-<p>
-<a name="2003.03.25">2003.03.25</a> 15:45, invited conference talk (60):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.03.25">2003.03.25 15:45</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Future directions in algorithmic number theory.
American Institute of Mathematics, Palo Alto, California.
``Randomized primality proving in essentially quartic time.''
-<p>
-<a name="2003.03.26">2003.03.26</a> 11:30, invited conference talk (30):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.03.26">2003.03.26 11:30</a></td>
+<td>30 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Future directions in algorithmic number theory.
American Institute of Mathematics, Palo Alto, California.
``Rethinking the number-field sieve: an update.''
-<p>
-<a name="2003.04.03">2003.04.03</a> 14:00, invited seminar talk (50/60)
-<a href="talks/2003abc.pdf">[PDF slides]</a>:
-Algebraic Number Theory, Department of Mathematics,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.04.03">2003.04.03 14:00</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.04.03/slides.pdf">[PDF slides]</a>
+
+Algebraic Number Theory Seminar, Department of Mathematics,
University of Illinois at Urbana-Champaign.
``Sharper ABC-based bounds for congruent polynomials.''
Abstract:
@@ -666,11 +1135,18 @@
for the size of the group generated by several elements of a finite field.
I will discuss an intriguing idea introduced by Voloch
for using ABC to obtain such lower bounds.''
-<p>
-<a name="2003.04.04">2003.04.04</a> 15:30, invited conference talk (45)
-<a href="talks/2003quartic.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.04.04">2003.04.04 15:30</a></td>
+<td>45 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.04.04/slides.pdf">[PDF slides]</a>
+
Special Session on Cryptography and Computational and Algorithmic Number Theory;
-<a href="http://www.ams.org/amsmtgs/2085_program.html">Central Section Meeting</a>,
+Central Section Meeting,
American Mathematical Society (AMS).
Indiana University, Bloomington.
``Randomized primality proving in essentially quartic time.''
@@ -684,10 +1160,17 @@
I'll present a typical proof of this type,
that an integer satisfying certain conditions must be prime.
I'll also discuss the question of whether this approach
-is competitive in practice with previous primality-proving methods.''
-<p>
-<a name="2003.04.24">2003.04.24</a> 08:00, invited class talk (75)
-<a href="talks/2003compress.pdf">[PDF slides]</a>:
+is competitive in practice with previous primality-proving methods.''
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.04.24">2003.04.24 08:00</a></td>
+<td>75 minutes</td>
+<td>invited lecture</td>
+<td>class</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.04.24/slides.pdf">[PDF slides]</a>
+
Butler University.
``Compressing RSA keys and signatures.''
Abstract:
@@ -697,7 +1180,7 @@
However, it is often difficult to fit
a message, a key, and a signature into a single Internet packet.
<p>
-Elliptic-curve cryptography is often advertised
+Elliptic-curve cryptography is often advertised
as offering much shorter keys and signatures than RSA.
For example, 224-bit elliptic-curve keys with 448-bit signatures
offer the same apparent security
@@ -712,8 +1195,16 @@
an improved version of RSA.
This talk will explain the latest compression techniques.
</blockquote>
-<p>
-<a name="2003.05.03">2003.05.03</a> 17:00, invited conference talk (40):
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.05.03">2003.05.03 17:00</a></td>
+<td>40 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Special Session on Geometry and Arithmetic over Finite Fields;
Western Section Meeting,
American Mathematical Society (AMS).
@@ -735,15 +1226,30 @@
the second improvement
generalizes to m>=3 polynomials A_1,...,A_m,
with a degree bound of ((3m-5)/(3m-7)) deg h - (6/m(3m-7)) deg rad A_1...A_m.''
-<p>
-<a name="2003.05.10">2003.05.10</a>, invited conference talk:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.05.10">2003.05.10</a></td>
+<td></td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
Midwest Algebraic Number Theory Day.
``Sharper ABC-based bounds for congruent polynomials.''
-<p>
-<a name="2003.05.26">2003.05.26</a> 11:00, invited conference talk (30/30)
-<a href="talks/2003focus.pdf">[PDF slides]</a>:
-<a href="http://www.fields.utoronto.ca/programs/scientific/02-03/numtheory">Conference in Number Theory in Honour of Professor H. C. Williams</a>.
-Banff Centre, Alberta, Canada.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.05.26">2003.05.26 11:00</a></td>
+<td>30 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.05.26/slides.pdf">[PDF slides]</a>
+
+Conference in Number Theory in Honour of Professor H. C. Williams.
+Banff Centre, Alberta.
``Doubly focused enumeration of locally square polynomial values.''
Abstract:
``It is well known
@@ -754,39 +1260,72 @@
As a typical application,
I'll present the results of a record-setting `pseudosquare' computation,
i.e., an enumeration of locally square integers.''
-<p>
-<a name="2003.07.24">2003.07.24</a>, contributed conference talk (20/20):
-<a href="http://www.mfo.de/Meetings/Meeting_Program_2003.html#T0330">Explicit Methods in Number Theory</a>.
-Mathematisches Forschungsinstitut, Oberwolfach, Germany.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.07.24">2003.07.24</a></td>
+<td>20 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+
+
+Explicit Methods in Number Theory.
+Mathematisches Forschungsinstitut, Oberwolfach.
``Translating Chudnovsky into English.''
Asymptotically fast computation of exponential integrals.
-<p>
-<a name="2003.11.08-1">2003.11.08</a> 15:10-15:30, contributed conference talk
-<a href="talks/2003front.ps">[PS slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.11.08-1">2003.11.08 15:10</a></td>
+<td>20 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.11.08-1/slides.ps">[PS slides]</a>
+
Mathematics of Public Key Cryptography (MPKC) 2003.
University of Illinois at Chicago.
``News from the Rabin-Williams front.''
-<p>
-<a name="2003.11.08-2">2003.11.08</a> 16:40-17:00, contributed conference talk
-<a href="talks/2003front2.ps">[PS slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2003.11.08-2">2003.11.08 16:40</a></td>
+<td>20 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2003.11.08-2/slides.ps">[PS slides]</a>
+
Mathematics of Public Key Cryptography (MPKC) 2003.
University of Illinois at Chicago.
``More news from the Rabin-Williams front.''
-<p>
-<a name="2004.04.28">2004.04.28</a> 11:00-11:50, invited seminar talk
-<a href="talks/2004dns.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.04.28">2004.04.28 11:00</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.04.28/slides.pdf">[PDF slides]</a>
+
Special Seminar,
Department of Electrical and Computer Engineering,
University of Illinois at Urbana-Champaign.
``The DNS security mess.''
-<p>
-<a name="2004.05.14">2004.05.14</a> 09:00-09:30,
-invited conference talk
-<a href="talks/2004smoothparts.txt">[approximate transcript]</a>
-<a href="talks/2004smoothparts.pdf">[PDF slides]</a>
-<a href="talks/2004spfigure.pdf">[stretched figure]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.05.14">2004.05.14 09:00</a></td>
+<td>30 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.05.14/slides.pdf">[PDF slides]</a>
+<a href="talks/2004.05.14/transcript.txt">[approximate transcript]</a>
Special Session on Coding Theory and Cryptography;
-<a href="http://www.ams.org/amsmtgs/2104_program.html">Sixth International Joint Meeting</a>,
+Sixth International Joint Meeting,
American Mathematical Society (AMS)
and Sociedad Matematica Mexicana.
Hyatt Regency Houston, Texas.
@@ -808,12 +1347,17 @@
In this talk I will present an algorithm
that always answers the first two questions
in time b (log b)^{2+o(1)}.''
-<p>
-<a name="2004.06.14">2004.06.14</a> 09:00-10:00,
-invited conference talk
-<a href="talks/2004myths.txt">[approximate transcript]</a>
-<a href="talks/2004myths.pdf">[PDF slides]</a>:
-<a href="http://web.ew.usna.edu/~ants/">Algorithmic Number Theory Symposium (ANTS) VI</a>.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.06.14">2004.06.14 09:00</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.06.14/slides.pdf">[PDF slides]</a>
+<a href="talks/2004.06.14/transcript.txt">[approximate transcript]</a>
+Algorithmic Number Theory Symposium (ANTS) VI.
University of Vermont, Burlington.
``Factorization myths.''
Abstract written after the talk:
@@ -827,14 +1371,19 @@
8. We want to minimize time on a conventional computer.
9. Mesh architectures simply make everything faster.
10. MPQS beats ECM for finding huge factors.''
-<p>
-<a name="2004.06.24">2004.06.24</a> 10:20-10:45,
-invited conference talk
-<a href="talks/2004focus.txt">[approximate transcript]</a>
-<a href="talks/2004focus.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.06.24">2004.06.24 10:20</a></td>
+<td>25 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.06.24/slides.pdf">[PDF slides]</a>
+<a href="talks/2004.06.24/transcript.txt">[approximate transcript]</a>
Special Session on Computational Number Theory;
-<a href="http://fields.utoronto.ca/programs/scientific/03-04/CNTA8/">Canadian Number Theory Association (CNTA) VIII</a>.
-University of Toronto, Ontario, Canada.
+Canadian Number Theory Association (CNTA) VIII.
+University of Toronto, Ontario.
``Doubly focused enumeration in two dimensions.''
Abstract:
``Doubly focused enumeration speeds up various sieving tasks
@@ -846,35 +1395,57 @@
for higher-dimensional problems,
such as sieving for locally square Gaussian integers.
Prior exposure to computational geometry is not required.''
-<p>
-<a name="2004.07.07">2004.07.07</a> 11:00-12:00,
-invited conference talk
-<a href="talks/2004sp2.pdf">[PDF slides]</a>:
-<a href="http://www.it.deakin.edu.au/cryptography2004/">Polynomial-Based Cryptography</a>.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.07.07">2004.07.07 11:00</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Australia</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.07.07/slides.pdf">[PDF slides]</a>
+
+Polynomial-Based Cryptography.
University of Melbourne.
-Australia.
``How to find smooth parts of integers.''
-<p>
-<a name="2004.07.29">2004.07.29</a> 15:00-16:00,
-invited seminar talk
-<a href="talks/2004myths2.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.07.29">2004.07.29 15:00</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>Australia</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.07.29/slides.pdf">[PDF slides]</a>
+
Computational Algebra Seminar,
School of Mathematics and Statistics,
University of Sydney.
-Australia.
``Factorization myths.''
-<p>
-<a name="2004.08.17">2004.08.17</a> 20:35-20:40,
-contributed conference talk
-<a href="talks/2004bandwidth.pdf">[PDF slides]</a>:
-<a href="http://www.iacr.org/conferences/c2004/">Crypto 2004</a>.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.08.17">2004.08.17 20:35</a></td>
+<td>5 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.08.17/slides.pdf">[PDF slides]</a>
+
+Crypto 2004.
Santa Barbara.
``Stop overestimating RSA bandwidth!''
-<p>
-<a name="2004.09.16">2004.09.16</a> 15:00-16:00,
-invited colloquium talk
-<a href="talks/2004sigs.pdf">[PDF slides]</a>:
-colloquium aimed at graduate students,
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.09.16">2004.09.16 15:00</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>colloquium</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.09.16/slides.pdf">[PDF slides]</a>
+
+Colloquium aimed at graduate students,
University of Illinois at Chicago.
``A state-of-the-art public-key signature system.''
Abstract:
@@ -886,12 +1457,18 @@
I'll describe a modern public-key signature system:
how it works, why it was designed the way it was,
and what has been proven about its security.''
-<p>
-<a name="2004.11.15">2004.11.15</a> 14:00-15:00,
-invited conference talk
-<a href="talks/2004nfs.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.11.15">2004.11.15 14:00</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.11.15/slides.pdf">[PDF slides]</a>
+
Explicit Methods in Number Theory.
-Banff Centre, Alberta, Canada.
+Banff Centre, Alberta.
``Three algorithms related to the number-field sieve.''
Abstract:
``1. The number-field sieve tries to factor an integer n
@@ -912,14 +1489,19 @@
How long does this take?
I'll explain an algorithm
that's 2.6+o(1) times faster than the previous record.''
-<p>
-<a name="2004.11.19">2004.11.19</a> 14:00-14:50,
-invited seminar talk
-<a href="talks/2004coprimes.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2004.11.19">2004.11.19 14:00</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+<a href="talks/2004.11.19/slides.pdf">[PDF slides]</a>
+
Discrete Math Seminar,
Department of Mathematics and Statistics,
University of Calgary.
-Canada.
``Faster factorization into coprimes.''
Abstract:
<blockquote>
@@ -941,15 +1523,20 @@
is that coprime factorization has surpassed the special-purpose techniques,
saving time in these computations.
</blockquote>
-<p>
-<a name="2005.02.15">2005.02.15</a>
-14:00-14:50,
-invited seminar talk
-<a href="talks/20050215.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.02.15">2005.02.15 14:00</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.02.15/slides.pdf">[PDF slides]</a>
+
Computer Security Seminar,
Department of Computer Science,
University of Illinois at Chicago.
-``The Poly1305-AES message-authentication code.''
+``The Poly1305-AES message-authentcation code.''
Abstract:
``Poly1305-AES is a state-of-the-art message-authentication code
suitable for a wide variety of applications.
@@ -965,100 +1552,135 @@
(I decided to spend more time on the framework;
I finished the framework by the end of the talk
and then skipped to the URLs.)
-<p>
-<a name="2005.02.21"></a>
-<a name="2005.02.21-1">2005.02.21</a>
-10:05-10:30,
-refereed conference talk
-<a href="talks/20050221.txt">[approximate transcript]</a>
-<a href="talks/20050221.pdf">[PDF slides]</a>:
-Fast Software Encryption 2005.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.02.21-1">2005.02.21 10:05</a></td>
+<td>25 minutes</td>
+<td>refereed lecture</td>
+<td>conference</td>
+<td>France</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.02.21-1/slides.pdf">[PDF slides]</a>
+<a href="talks/2005.02.21-1/transcript.txt">[approximate transcript]</a>
+Fast Software Encryption (FSE) 2005.
Paris.
-``The Poly1305-AES message-authentication code.''
+``The Poly1305-AES message-authentcation code.''
Abstract:
``Poly1305-AES is a state-of-the-art message-authentication code
suitable for a wide variety of applications.
I'll discuss the security of Poly1305-AES, the speed of Poly1305-AES,
and five forms of deceptive benchmarks in the cryptographic literature.''
-<p>
-<a name="2005.02.21-2">2005.02.21</a>
-16:52-16:56,
-contributed conference talk
-<a href="talks/20050221x.pdf">[PDF slides]</a>:
-Fast Software Encryption 2005.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.02.21-2">2005.02.21 16:52</a></td>
+<td>4 minutes</td>
+<td>contributed lecture</td>
+<td>conference</td>
+<td>France</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.02.21-2/slides.pdf">[PDF slides]</a>
+
+Fast Software Encryption (FSE) 2005.
Paris.
``Have any challenges for qhasm?''
-<p>
-<a name="2005.02.25">2005.02.25</a>
-09:00-10:00,
-invited conference talk
-<a href="talks/20050225.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.02.25">2005.02.25 09:00</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>France</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.02.25/slides.pdf">[PDF slides]</a>
+
Special-purpose Hardware for Attacking Cryptographic Systems (SHARCS).
-<a href="http://www.sharcs.org">http://www.sharcs.org</a>;
-mirror.
+Paris.
``Building circuits for integer factorization.''
Abstract: ``I'll present my latest work on <i>verifiable</i>
upper bounds for the money and time needed to factor 1024-bit integers.
One important observation is that the switch from conventional computers
to mesh computers produces even larger gains for the elliptic-curve
method than for the number-field sieve.''
-<p>
-<a name="2005.04.26">2005.04.26</a>
-16:00-16:15,
-invited panelist talk
-[video not available yet]:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.04.26">2005.04.26 16:00</a></td>
+<td>15 minutes</td>
+<td>invited lecture</td>
+<td>panel</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+
+
University of Illinois at Chicago.
On panel responding to 2005 Nakata Lecture by R. Michael Tanner.
-<p>
-<a name="2005.05.19">2005.05.19</a>
-14:00-14:50,
-invited seminar talk
-<a href="talks/20050519.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.05.19">2005.05.19 14:00</a></td>
+<td>50 minutes</td>
+<td>invited lecture</td>
+<td>seminar</td>
+<td>Denmark</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.05.19/slides.pdf">[PDF slides]</a>
+
Department of Mathematics,
-Technical University of Denmark, Copenhagen.
+Technical University of Denmark,
+Copenhagen.
``High-speed elliptic-curve cryptography.''
Abstract:
``I'll explain the techniques used to set speed records
for elliptic-curve Diffie-Hellman on popular CPUs.
You do not need prior knowledge of computer microarchitecture.''
-<p>
-<a name="2005.05.23">2005.05.23</a>
-16:10-16:35,
-refereed conference talk
-<a href="talks/20050523.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.05.23">2005.05.23 16:10</a></td>
+<td>25 minutes</td>
+<td>refereed lecture</td>
+<td>conference</td>
+<td>Denmark</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.05.23/slides.pdf">[PDF slides]</a>
+
Eurocrypt 2005.
-<a href="http://www.brics.dk/eurocrypt05/">http://www.brics.dk/eurocrypt05/</a>;
-<a href="conferences/2005-eurocrypt/www.brics.dk/eurocrypt05/index.html">mirror</a>.
-Scandinavian Congress Center, Aarhus, Denmark.
+Scandinavian Congress Center, Aarhus.
``Stronger security bounds for Wegman-Carter-Shoup authenticators.''
-<p>
-<a name="2005.05.26">2005.05.26</a>
-14:15-14:27,
-refereed conference talk
-<a href="talks/20050526.pdf">[PDF slides]</a>:
-ECRYPT STVL Workshop on Symmetric Key Encryption (SKEW).
-<a href="http://www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/">http://www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl</a>;
-<a href="conferences/2005-skew/www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/index.html">mirror</a>.
-Scandinavian Congress Center, Aarhus, Denmark.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.05.26">2005.05.26 14:15</a></td>
+<td>12 minutes</td>
+<td>refereed lecture</td>
+<td>conference</td>
+<td>Denmark</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.05.26/slides.pdf">[PDF slides]</a>
+
+ECRYPT STVL Workshop on Symmetric Key Encryption (SKEW 2005).
+Scandinavian Congress Center, Aarhus.
``The Salsa20 stream cipher.''
-<p>
-<a name="2005.05.27">2005.05.27</a>
-10:45-10:57,
-refereed conference talk
-<a href="talks/20050527.pdf">[PDF slides]</a>:
-ECRYPT STVL Workshop on Symmetric Key Encryption (SKEW).
-<a href="http://www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/">http://www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl</a>;
-<a href="conferences/2005-skew/www2.mat.dtu.dk/people/Lars.R.Knudsen/stvl/index.html">mirror</a>.
-Scandinavian Congress Center, Aarhus, Denmark.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.05.27">2005.05.27 10:45</a></td>
+<td>12 minutes</td>
+<td>refereed lecture</td>
+<td>conference</td>
+<td>Denmark</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.05.27/slides.pdf">[PDF slides]</a>
+
+ECRYPT STVL Workshop on Symmetric Key Encryption (SKEW 2005).
+Scandinavian Congress Center, Aarhus.
``Understanding brute force.''
-<p>
-<a name="2005.05.30-1">2005.05.30</a>
-11:00-12:30,
-invited conference talk
-<a href="talks/20050530.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.05.30">2005.05.30 11:00</a></td>
+<td>90 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Poland</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.05.30/slides.pdf">[PDF slides]</a>
+
Quo Vadis Cryptology? Advances in Cryptanalysis.
-<a href="http://ece.gmu.edu/quovadis/quovadis3/quovadis3.htm">http://ece.gmu.edu/quovadis/quovadis3/quovadis3.htm</a>;
-mirror.
Warsaw, Poland.
``The power of parallel computation.''
Abstract:
@@ -1069,73 +1691,87 @@
I will explain what is known---and what is not known---about
the gains that can be achieved from massive parallelism.
I will, in particular, discuss the problem of integer factorization.''
-<p>
-<a name="2005.05.30-2">2005.05.30</a>
-16:00-17:30,
-invited panelist
-[no slides].
-Quo Vadis Cryptology? Advances in Cryptanalysis.
-<a href="http://ece.gmu.edu/quovadis/quovadis3/quovadis3.htm">http://ece.gmu.edu/quovadis/quovadis3/quovadis3.htm</a>;
-mirror.
-Warsaw, Poland.
-``Advances in factorization.''
-<p>
-<a name="2005.06.01">2005.06.01</a>
-09:00-09:40,
-invited conference talk
-<a href="talks/20050601.pdf">[PDF slides]</a>:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.06.01">2005.06.01 09:00</a></td>
+<td>40 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>Poland</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.06.01/slides.pdf">[PDF slides]</a>
+
ENIGMA 2005.
-<a href="http://www.enigma.com.pl/konferencje/ix_kkzk/index.htm">http://www.enigma.com.pl/konferencje/ix_kkzk/index.htm</a>;
-<a href="conferences/2005-enigma/www.enigma.com.pl/konferencje/ix_kkzk/index.html">mirror</a>.
Warsaw, Poland.
``Cache-timing attacks on AES.''
-Abstract:
-``I recently succeeded in extracting a complete AES key
-from a network server on another computer.
-The targeted server used its key
-solely to encrypt data using the OpenSSL AES implementation
-on a Pentium III.
-I will explain the AES design error that led to this attack,
-and I will discuss the difficult problem of stopping the attack.''
-<p>
-<a name="2005.06.11-1">2005.06.11</a>
-10:30-11:30,
-invited conference talk
-[PDF slides not available yet]:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.06.11-1">2005.06.11 10:30</a></td>
+<td>60 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.06.11-1/slides.pdf">[PDF slides]</a>
+
CAM 2005.
-<a href="http://www.math.ucok.edu/_cam/cam.html">http://www.math.ucok.edu/_cam/cam.html</a>;
-<a href="conferences/2005-cam/www.math.ucok.edu/_cam/cam.html">mirror</a>.
University of Central Oklahoma, Edmond, Oklahoma.
``The power of parallel computation.''
-<p>
-<a name="2005.06.11-2">2005.06.11</a>
-14:40-15:25,
-invited conference talk
-[PDF slides not available yet]:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.06.11-2">2005.06.11 14:40</a></td>
+<td>45 minutes</td>
+<td>invited lecture</td>
+<td>conference</td>
+<td>USA</td>
+</tr><tr><td colspan="5">
+<a href="talks/2005.06.11-2/slides.pdf">[PDF slides]</a>
+
CAM 2005.
-<a href="http://www.math.ucok.edu/_cam/cam.html">http://www.math.ucok.edu/_cam/cam.html</a>;
-<a href="conferences/2005-cam/www.math.ucok.edu/_cam/cam.html">mirror</a>.
University of Central Oklahoma, Edmond, Oklahoma.
``Integer factorization.''
-<p>
-2005.07.07-2005.07.09
-40 min,
-invited conference talk
-[PDF slides not available yet]:
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.07.08">2005.07.08 16:00</a></td>
+<td>45 minutes</td>
+<td>invited lecture (planned)</td>
+<td>conference</td>
+<td>Spain</td>
+</tr><tr><td colspan="5">
+
+
Computational Number Theory Workshop;
Foundations of Computational Mathematics (FoCM) 2005.
-<a href="http://www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/">http://www.damtp.cam.ac.uk/user/na/FoCM/FoCM05</a>;
-<a href="conferences/2005-focm/www.damtp.cam.ac.uk/user/na/FoCM/FoCM05/index.html">mirror</a>.
Universidad de Cantabria, Santander, Spain.
``Integer factorization: a progress report.''
Abstract:
``There have been several recent improvements to the number-field sieve.
I'll explain some of what's going on.''
-<p>
-2005.07.17-2005.07.23.
-Oberwolfach, Germany (tentative).
-<p>
-2005.11.05-2005.11.10.
-Banff, Canada.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.07.18">2005.07.18</a></td>
+<td></td>
+<td>unclassified lecture (planned)</td>
+<td>conference</td>
+<td>Germany</td>
+</tr><tr><td colspan="5">
+
+
+Oberwolfach.
+</td></tr>
+<tr><td colspan="5"><hr></td></tr><tr>
+<td><a name="2005.11.05">2005.11.05</a></td>
+<td></td>
+<td>invited lecture (planned)</td>
+<td>conference</td>
+<td>Canada</td>
+</tr><tr><td colspan="5">
+
+
+Banff.
+</td></tr>
+
+</tbody>
+</table>
</body>
</html>
New: cr.yp.to/talks.html.bak1
New: cr.yp.to/talks.html.do