cr.yp.to update

diff -ru .old-crypto/2005-261.html cr.yp.to/2005-261.html
--- .old-crypto/2005-261.html	2005-08-22 06:52:50.000000000 -0400
+++ cr.yp.to/2005-261.html	2005-08-22 17:30:31.000000000 -0400
@@ -4,7 +4,9 @@
 <br><a href="mathmisc.html">More mathematics</a>
 <h1>MCS 261, Discrete Mathematics, Fall 2005</h1>
 <h2>22 August 2005</h2>
-The lecture is scheduled for 13:00-13:50 MWF in 118 Douglas Hall.
+The lecture was scheduled for 13:00-13:50 MWF in 118 Douglas Hall
+but <b>will move to 427 SEO starting Friday 26 August</b>.
+<p>
 Call number for registration: 12339.
 Prerequisites: Grade of C or better in Math 180,
 and grade of C or better in MCS 260 (or CS 102).
@@ -76,5 +78,41 @@
 is helpful in clarifying the concept of a set.)
 As the course progresses,
 you should continue reading to keep up with the lectures.
+<p>
+Today's class material:
+The brace notation for a set with specified elements:
+e.g., {3,5} is the set that has 3 as an element,
+has 5 as an element,
+and doesn't have anything else as an element.
+A set can have more than two elements: e.g., {3,5,7}.
+A set can have one element: e.g., {3}.
+A set can have zero elements: {}.
+A set can have infinitely many elements: e.g., {0,1,2,3,...},
+the set of natural numbers.
+Warning: some people define ``natural number'' to exclude 0.
+Equality of sets:
+S = T means that S and T have the same elements.
+In other words:
+if S = T then every element of S is an element of T
+and every element of T is an element of S;
+if every element of S is an element of T,
+and every element of T is an element of S,
+then S = T.
+Examples:
+{3,5} = {5,3};
+{3,5} = {3,5,3,3};
+{3,5} != {3,5,7}.
+Sets don't care about order or repetition.
+In contrast, multisets care about repetition,
+and lists (strings) care about both order and repetition.
+S &lt;= T (with curved &lt;)
+means that S is a subset of T,
+i.e., that every element of S is an element of T.
+S &lt; T (with curved &lt;)
+means that S is a proper subset of T,
+i.e., that S &lt;= T and S != T.
+Warning: some people write S &lt; T to mean that S is a subset of T,
+and write S &lt;!= T to mean that S is a proper subset of T;
+beware the ambiguity of S &lt; T.
 </body>
 </html>
diff -ru .old-crypto/2005-501.html cr.yp.to/2005-501.html
--- .old-crypto/2005-501.html	2005-06-26 02:46:39.000000000 -0400
+++ cr.yp.to/2005-501.html	2005-08-22 17:32:00.000000000 -0400
@@ -84,5 +84,26 @@
 <p>
 My office hours will be
 15:10-16:00 Monday, 16:10-17:00 Monday, 17:10-18:00 Monday in 410 SEO.
+<h2>22 August 2005</h2>
+The class location was 306 Addams Hall
+but <b>is now changing to 303 Stevenson Hall</b>.
+Please go directly to 303 Stevenson Hall starting Wednesday 24 August 2005.
+<p>
+Today's class material:
+How fast is sorting?
+Several difficulties with an answer such as ``n log n comparisons'':
+comparison time isn't specified;
+time for other operations isn't specified;
+the sorting machine isn't specified.
+More precise question:
+a machine sorts n integers in {0,1,2,...,n^2},
+each integer represented in the usual way as a string of bits in binary;
+how long does ths machine take?
+Sorting machine #1: single-tape Turing machine using insertion sort.
+Machine finishes in n^(2+o(1)) seconds;
+machine costs n^(1+o(1)) dollars.
+Sorting machine #2: two-dimensional RAM using merge sort.
+Machine finishes in n^(1.5+o(1)) seconds;
+machine costs n^(1+o(1)) dollars.
 </body>
 </html>
Deleted: .old-crypto/bib/1998/.tmp.higham-writing.bibtex.1124503680.353
New: bib/1998/.tmp.krawczyk.incl.1124503676.366
New: bib/1998/higham-writing.bibtex
diff -ru .old-crypto/bib/1998/higham-writing.by cr.yp.to/bib/1998/higham-writing.by
--- .old-crypto/bib/1998/higham-writing.by	2004-09-02 23:18:54.000000000 -0400
+++ cr.yp.to/bib/1998/higham-writing.by	2005-08-19 22:12:34.000000000 -0400
@@ -1 +1 @@
-1998/higham-writing *+higham,nicholas,j. *1998
+1998/higham-writing *+higham,nicholas,j. *1998 *Handbook of writing for the mathematical sciences
diff -ru .old-crypto/bib/1998/higham-writing.incl cr.yp.to/bib/1998/higham-writing.incl
--- .old-crypto/bib/1998/higham-writing.incl	2004-09-12 01:14:46.000000000 -0400
+++ cr.yp.to/bib/1998/higham-writing.incl	2005-08-19 22:08:00.000000000 -0400
@@ -11,4 +11,5 @@
 \seeolder \cite{<a href="#1993/higham-writing">1993/higham-writing</a>}
 \endref
 </pre>
+[<a href="1998/higham-writing.bibtex">BibTeX .bib file</a>]
 <p>
New: bib/1998/howgrave-graham.bibtex
diff -ru .old-crypto/bib/1998/howgrave-graham.by cr.yp.to/bib/1998/howgrave-graham.by
--- .old-crypto/bib/1998/howgrave-graham.by	2004-06-12 03:07:47.000000000 -0400
+++ cr.yp.to/bib/1998/howgrave-graham.by	2005-08-19 22:12:34.000000000 -0400
@@ -1 +1 @@
-1998/howgrave-graham *+howgrave-graham,nicholas *1998
+1998/howgrave-graham *+howgrave-graham,nicholas *1998 *Computational mathematics inspired by RSA
diff -ru .old-crypto/bib/1998/howgrave-graham.incl cr.yp.to/bib/1998/howgrave-graham.incl
--- .old-crypto/bib/1998/howgrave-graham.incl	2004-11-10 19:06:18.000000000 -0500
+++ cr.yp.to/bib/1998/howgrave-graham.incl	2005-08-19 22:07:59.000000000 -0400
@@ -8,5 +8,6 @@
 \url <a href="http://dimacs.rutgers.edu/~dieter/Seminar/Papers/nick-thesis.ps">http://dimacs.rutgers.edu/~dieter/Seminar/Papers/nick-thesis.ps</a>
 \endref
 </pre>
+[<a href="1998/howgrave-graham.bibtex">BibTeX .bib file</a>]
 [<a href="1998/howgrave-graham.ps">PS mirror</a>]
 <p>
New: bib/1998/kaczorowski.bibtex
diff -ru .old-crypto/bib/1998/kaczorowski.by cr.yp.to/bib/1998/kaczorowski.by
--- .old-crypto/bib/1998/kaczorowski.by	2004-06-12 03:07:47.000000000 -0400
+++ cr.yp.to/bib/1998/kaczorowski.by	2005-08-19 22:12:34.000000000 -0400
@@ -1 +1 @@
-1998/kaczorowski *+kaczorowski,jerzy+perelli,alberto *1998
+1998/kaczorowski *+kaczorowski,jerzy+perelli,alberto *1998 *On the distribution in short intervals of products of a prime and integers from a given set
diff -ru .old-crypto/bib/1998/kaczorowski.incl cr.yp.to/bib/1998/kaczorowski.incl
--- .old-crypto/bib/1998/kaczorowski.incl	2004-09-12 01:14:46.000000000 -0400
+++ cr.yp.to/bib/1998/kaczorowski.incl	2005-08-19 22:07:58.000000000 -0400
@@ -12,4 +12,5 @@
 \pages 1--14
 \endref
 </pre>
+[<a href="1998/kaczorowski.bibtex">BibTeX .bib file</a>]
 <p>
New: bib/1998/kaltofen.bibtex
diff -ru .old-crypto/bib/1998/kaltofen.by cr.yp.to/bib/1998/kaltofen.by
--- .old-crypto/bib/1998/kaltofen.by	2004-06-12 03:07:47.000000000 -0400
+++ cr.yp.to/bib/1998/kaltofen.by	2005-08-19 22:12:34.000000000 -0400
@@ -1 +1 @@
-1998/kaltofen *+kaltofen,erich+shoup,victor *1998
+1998/kaltofen *+kaltofen,erich+shoup,victor *1998 *Subquadratic-time factoring of polynomials over finite fields
diff -ru .old-crypto/bib/1998/kaltofen.incl cr.yp.to/bib/1998/kaltofen.incl
--- .old-crypto/bib/1998/kaltofen.incl	2004-09-12 01:14:46.000000000 -0400
+++ cr.yp.to/bib/1998/kaltofen.incl	2005-08-19 22:07:58.000000000 -0400
@@ -13,5 +13,6 @@
 \url <a href="http://www.ams.org/journal-getitem?pii=S0025571898009442">http://www.ams.org/journal-getitem?pii=S0025571898009442</a>
 \endref
 </pre>
+[<a href="1998/kaltofen.bibtex">BibTeX .bib file</a>]
 [<a href="1998/kaltofen.pdf">PDF mirror</a>]
 <p>
New: bib/1998/kirrinnis.bibtex
diff -ru .old-crypto/bib/1998/kirrinnis.by cr.yp.to/bib/1998/kirrinnis.by
--- .old-crypto/bib/1998/kirrinnis.by	2004-06-12 03:07:47.000000000 -0400
+++ cr.yp.to/bib/1998/kirrinnis.by	2005-08-19 22:12:34.000000000 -0400
@@ -1 +1 @@
-1998/kirrinnis *+kirrinnis,peter *1998
+1998/kirrinnis *+kirrinnis,peter *1998 *Partial fraction decomposition in $\C(z)$ and simultaneous Newton iteration for factorization in $\C[z]$
diff -ru .old-crypto/bib/1998/kirrinnis.incl cr.yp.to/bib/1998/kirrinnis.incl
--- .old-crypto/bib/1998/kirrinnis.incl	2004-09-12 01:14:45.000000000 -0400
+++ cr.yp.to/bib/1998/kirrinnis.incl	2005-08-19 22:07:57.000000000 -0400
@@ -11,6 +11,7 @@
 \url <a href="http://www.idealibrary.com/retrieve/doi/10.1006/jcom.1998.0481">http://www.idealibrary.com/retrieve/doi/10.1006/jcom.1998.0481</a>
 \endref
 </pre>
+[<a href="1998/kirrinnis.bibtex">BibTeX .bib file</a>]
 [<a href="1998/kirrinnis.pdf">PDF mirror</a>]
 Nice paper.
 <p>
New: bib/1998/knuth-3.bibtex
diff -ru .old-crypto/bib/1998/knuth-3.by cr.yp.to/bib/1998/knuth-3.by
--- .old-crypto/bib/1998/knuth-3.by	2004-06-12 03:07:47.000000000 -0400
+++ cr.yp.to/bib/1998/knuth-3.by	2005-08-19 22:12:34.000000000 -0400
@@ -1 +1 @@
-1998/knuth-3 *+knuth,donald,e. *1998
+1998/knuth-3 *+knuth,donald,e. *1998 *The art of computer programming, volume 3: sorting and searching
diff -ru .old-crypto/bib/1998/knuth-3.incl cr.yp.to/bib/1998/knuth-3.incl
--- .old-crypto/bib/1998/knuth-3.incl	2004-09-12 01:14:45.000000000 -0400
+++ cr.yp.to/bib/1998/knuth-3.incl	2005-08-19 22:07:57.000000000 -0400
@@ -11,4 +11,5 @@
 \seeolder \cite{<a href="#1973/knuth-3">1973/knuth-3</a>}
 \endref
 </pre>
+[<a href="1998/knuth-3.bibtex">BibTeX .bib file</a>]
 <p>
New: bib/1998/krawczyk.bibtex
diff -ru .old-crypto/bib/1998/krawczyk.by cr.yp.to/bib/1998/krawczyk.by
--- .old-crypto/bib/1998/krawczyk.by	2004-06-12 03:07:47.000000000 -0400
+++ cr.yp.to/bib/1998/krawczyk.by	2005-08-19 22:12:34.000000000 -0400
@@ -1 +1 @@
-1998/krawczyk *+krawczyk,hugo *1998
+1998/krawczyk *+krawczyk,hugo *1998 *Advances in cryptology: CRYPTO '98