The following summarizes the topic of each lecture.
There were 23 lectures, each being 2 hours.

<p>


<table border>
<tr>
<th colspan=2>
<h3>COMP 754 - Term 1 of 2002 - Lecture-by-Lecture Topic Summaries</h3>
</th>
</tr>

<tr>
<th>Lecture - Date</th>
<th>Topic</th>
</tr>

<tr>
<td> Lect 1 - 06.27 R </td>
<td> What is cryptography?  Four problems in cryptography: privacy in the 
     symmetric and asymmetric trust models, message authentication in the 
     symmetric and asymmetric trust models.   Writing precise, mathematical
     English: One-to-one functions,
</td></tr>

<td> Lect 2 - 07.02 T </td>
<td> More practice being mathematically precise; notions of one-to-one functions,
     onto functions, permutations, strings.  Probabilistic notation and computing
     some simple probabilities. 
</td></tr>

<td> Lect 3 - 07.04 R </td>
<td> Layered look at cryptographic mechanisms.  
     What is a block cipher? 
     History of DES and a complete description of DES.
     (Reading: Landau article on DES.)
</td></tr>

<td> Lect 4 - 07.10 W </td>
<td> Group axioms, field axioms.  A theorem about the existence and uniqueness
     of finite fields. Doing arithmetic in GF(2^8).
     A first look at the structure of AES.
</td></tr>

<td> Lect 5 - 07.11 R </td>
<td> A complete description of AES.  
     The ECB mode of operation: what is wrong with it?
</td></tr>

<td> Lect 6 - 07.16 T </td>
<td> Modes of operation.  Definitions for encryption-scheme security. 
</td></tr>
    
<td> Lect 7 - 07.18 R </td>
<td> Formalizing encryption: real-or-random security.  
</td></tr>

<td> Lect 8 - 07.29 T </td>
<td> Working to understand the ind-definition. Distinguishing
     an oracle that gives random samples in [1..10] from an oracle 
     that gives random samples in [1..11].  CBCrandom and CBCcounter.
</td></tr>

<td> Lect 9 - 08.01 R </td>
<td> Using our definition of encryption scheme security to break
     various constructions. </td>
</tr>

<td> Lect 10 - 08.05 M </TD>
<td> Definition of PRP security. Reductions. 
     The security of CTRctr.</td></tr>

<td> Lect 11 - 08.06 T </TD>
<td> A switching lemma.  More on the provable-security paradigm. 
     Fully proving the security of of CTRctr. </td></tr>

<td> Lect 12 - 08.07 W </td>
<td> Proving the security of CBCrandom.  Review of public-key encryption.
     Mathematical preliminaries for the RSA algorithm. 
</td></tr>

<td> Lect 13 - 08.08 R </td>
<td> Mathematical preliminaries for the RSA algorithm.  Definition of
     the RSA algorithm.  
</td></tr>

<td> Lect 14 - 08.13 T </td>
<td> Review of RSA. Definition of PK encryption-scheme security.
     (Raw) RSA is NOT secure.  Notion of a trapdoor permutation.
</td></tr>

<td> Lect 15 - 08.15 R </td>
<td> Ways to properly encrypt using a trapdoor permutation. 
     Hardcore bits.  The method of PKCS \#1.
</td></tr>

<td> Lect 16 - 08.27 T </td>
<td> Why PKCS \#1 is not provably secure.
     Cryptographic hash functions and their uses.
     Encryption by f(R) || H(R) xor M  and OAEP.  
     Merkle-Damg&acirc;rd iteration.  Block-cipher based constructions.
</td></tr>


<td> Lect 17 - 08.29 R </td>
<td> Definition of SHA1. 
     Formalization of hash-function goals.
     The Merkle-Damg&acirc;rd theorem.
</td></tr>

<td> Lect 18 - 09.03 T </td>
<td> Digital signature: definition of the goal.  RSA signatures. 
     The Secure Hash Standard.
</td></tr>

<td> Lect 19 - 09.10 T </td>
<td> An introduction to key-exchange.
</td></tr>

<td> Lect 20 - 09.12 R </td>
<td> An introduction to multiparty protocols. 
</td></tr>


<td> Lect 21 - 09.17 T </td>
<td> Student presentations: 
A Forward-Secure Digital Digital Signature Scheme,
Concrete Security Characterization of PRFs and PRPs,
Ciphers with Arbitrary Finite Domains,
Session Key Distribution Using Smart Cards,
The Security of All-or-Nothing Encryption,
Public-Key Encryption in a Multi-User Setting
</td></tr>

<td> Lect 22 - 09.18 W </td>
<td> Student presentations:
Tweakable Block Ciphers,
How to Leak a Secret,
Authenticated Key Exchange Secure Against Dictionary Attacks,
Optimal Asymmetric Encryption,
Random Oracles are Practical,
XOR MAC
</td></tr>

<td> Lect 23 - 09.19 R </td>
<td> Student presentations
Keying Hash Functions for Message Authentication,
On the Construction of VIL Ciphers,
SDSI & SPKI Specification,
Encode-then-Encipher Encryption,
Non-Malleable Encryption
</td></tr>

</table>