\documentclass[12pt]{article}

\textwidth 16.5cm
\oddsidemargin -0.0cm
\evensidemargin -0.0cm
\textheight 25 cm
\topmargin -2cm
\pagestyle{empty}

\begin{document}

\begin{center}
{\bf \large {Faculty of Mathematics\\ Department of Combinatorics \&
Optimization}}
\\
{\bf \Large {C\&O 685\\The Mathematics of Public-Key Cryptography}}
\\
{\bf \large {Fall 2000 Course Outline}}
\end{center}
\medskip
\begin{tabbing}
{\bf Calendar Description:mmm} \= Handbook of Applied Cryptography
(Menezes, van Oorschot, Vanstone); \kill
{\bf Instructor:} \> Douglas Stinson, MC 4028 \\
\> \\
{\bf Time:} \> 11:30 - 12:45 TR \\
\> \\
{\bf Location:} \> DWE 1501 \\
\> \\
{\bf Texts:} \> Cryptography:  Theory and Practice (Stinson) \\
\> \\
{\bf Additional Material:} \> Handbook of Applied Cryptography
(Menezes, van Oorschot, \\
\> Vanstone); available to be downloaded from the internet \\
\> \\
{\bf Prerequisite:} \> PMATH 334, Introduction to Rings and Fields
(or equivalent) \\
\> \\
{\bf Calendar Description:} \> An in-depth study of public-key
cryptography.  Number-theoretic \\
\> problems: prime generation, integer factorization, discrete \\
\> logarithms.  Public-key encryption, digital signatures, key \\
\> establishment, secret sharing. Security definitions and proofs.\\
\> \\
{\bf Lecture Topics:} \> Introduction \\
\> $\bullet$ Goals of cryptography \\
\> $\bullet$ Adversarial models \\
\> $\bullet$ Provable security\\
\> \\
\> Algorithmic Number Theory \\
\> $\bullet$ One-way functions\\
\> $\bullet$ Prime generation\\
\> $\bullet$ Integer factorization \\
\> $\bullet$ Discrete logarithm problem \\
\> $\bullet$ Elliptic curve discrete logarithm problem \\
\> $\bullet$ Deffie-Hellman problem \\
\> \\
\> Public-Key Encryption \\
\> $\bullet$ RSA \\
\> $\bullet$ ElGamal and derivatives \\
\> $\bullet$ Security proofs \\
\> \\
\> Key Establishment \\
\> $\bullet$ Symmetric-key techniques \\
\> $\bullet$ Secret sharing schemes \\
\> $\bullet$ Public-key techniques \\
\> $\bullet$ Security proofs \\
\end{tabbing}

\end{document}