LATTICES AND EXPONENTIAL SUMS

Macquarie University, Austrália

Terça-feira, 5 de fevereiro de 2002 às 14 horas

Sala Antonio Gilioli, IME-USP

Resumo:

I will describe a very interesting combination of two number theoretic techniques: exponential sums and lattice reduction. This combination provides two faces:

it can be used to prove bit security results for some important cryptoshemes (such as Diffie-Hellman, Shamir 3-Pass scheme, XTR, etc.)
it can be used to design provable attacks on DSA, Nyberg-Rueppel, and other DSA like schemes.

(No background in number theory or cryptography is required.)

Last modified: Mon Feb 4 19:41:35 EDT 2002