Slides

Slides from talks (in order of appearance)

Rene Peralta Small Circuits for Boolean Functions

Eric Bach Mathematical Prologue to the Study of Electronic Encryption

Nitin Saxena How to make algebraic computations GRH free?

Ueli Maurer Abstract models of computation in cryptography, The equivalence of breaking Diffie-Hellman and discrete logarithm

Ueli Maurer Breaking RSA generically is equivalent to factoring

Eric Bach Exemplary Designs from the Golden Age of Shift Register Cryptography