Rearrange the file tree.

[u/mdw/catacomb] / papers / rand.tex

diff --git a/papers/rand.tex b/papers/rand.tex
index 1c489cc..a82387b 100644 (file)
--- a/papers/rand.tex
+++ b/papers/rand.tex
@@ -1,7 +1,5 @@
 %%% -*-latex-*-
 %%%
-%%% $Id: rand.tex,v 1.3 1999/10/15 21:05:56 mdw Exp $
-%%%
 %%% Description of Catacomb's random number generator
 %%%
 %%% (c) 1999 Straylight/Edgeware
@@ -15,30 +13,17 @@
 %%% it under the terms of the GNU Library General Public License as
 %%% published by the Free Software Foundation; either version 2 of the
 %%% License, or (at your option) any later version.
-%%% 
+%%%
 %%% Catacomb is distributed in the hope that it will be useful,
 %%% but WITHOUT ANY WARRANTY; without even the implied warranty of
 %%% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 %%% GNU Library General Public License for more details.
-%%% 
+%%%
 %%% You should have received a copy of the GNU Library General Public
 %%% License along with Catacomb; if not, write to the Free
 %%% Software Foundation, Inc., 59 Temple Place - Suite 330, Boston,
 %%% MA 02111-1307, USA.
 
-%%%----- Revision history ---------------------------------------------------
-%%%
-%%% $Log: rand.tex,v $
-%%% Revision 1.3  1999/10/15 21:05:56  mdw
-%%% Add a little more explanatory text for the pool and buffer sizes.
-%%%
-%%% Revision 1.2  1999/10/12 21:00:34  mdw
-%%% Updated.  Almost finished, in fact. ;-)
-%%%
-%%% Revision 1.1  1999/09/03 08:41:13  mdw
-%%% Initial import.
-%%%
-
 %%%----- Header -------------------------------------------------------------
 
 \documentclass[a4paper, article, 10pt, notitlepage, numbering]{strayman}
@@ -75,7 +60,7 @@
   superficially similar to (for example) the Linux and OpenBSD random number
   generators, it introduces a number of its own innovations which improve
   both security and performance.
-  
+
   The Catacomb generator uses an optional secret key, which can provide
   additional security against forward state compromise extension.  It uses a
   catastrophic reseeding operation to prevent a compromise yielding
@@ -144,8 +129,8 @@ follows:
     I'[8j + b] =
     \begin{cases}
       x\bigl[(r + b) \bmod 8\bigr] \xor
-        \bigxor_{0 \le k < N_I}
-          a_k I\bigl[8\bigl((j + k) \bmod N_I\bigr) + b\bigr] & if $i = j$ \\
+       \bigxor_{0 \le k < N_I}
+         a_k I\bigl[8\bigl((j + k) \bmod N_I\bigr) + b\bigr] & if $i = j$ \\
       I[j + b] & otherwise
     \end{cases} \\
     \textrm{for all integers $j$ and $b$ where $0 \le j < N_I$ and
@@ -223,7 +208,7 @@ performance improvement stops being linear with the buffer size on my
 machine.
 
 \begin{thebibliography}{99}
-  
+
 \bibitem{cp:rand}
   J.~Kelsey, B.~Schneier, D.~Wagner, and C.~Hall, ``Cryptographic Attacks on
   Pseudorandom Number Generators'', \emph{Fast Software Encryption, Fifth
@@ -242,4 +227,4 @@ machine.
 
 %%%----- That's all, folks --------------------------------------------------
 
-\end{document}
\ No newline at end of file
+\end{document}