**(click here for colloquia)**

# Mathematics Colloquium: A New Foundation for Public Key Cryptography

2008-03-04

4:10 pm; Neill 5W

Anna Johnston

Abstract: Public key cryptosystems are built on computationally infeasible mathematical problems. The two most common problems are factoring large composite integers and computing discrete logarithms. It is well known that the problems of factoring a composite integer N and computing a square root modulo N are equivalent, with several cryptosystems designed from this hard problem. A lesser known equivalency exists between the discrete logarithm and q-th root problems. This talk discusses this equivalence and describes a key exchange provably secure against the man-in-the-middle attack based on this problem. (Dr. Anna Johnston is a candidate for the faculty position in Discrete Mathematics at WSU.)