University of Tartu - ©2011 Rafik Chaabouni - Last update: 10.12.2013 23:35
Date: 13/12/2013, Time: 15:15, Location: J. Liivi 2, room 404 (Please note unusual time and location)
Title: Some polynomials over finite fields and their applications in cryptography and coding theory
Abstract:
I am going to talk about several types of polynomials and their applications in cryptography and coding theory. The applications include the discrete logarithm problem (DLP) in finite fields, almost perfect nonlinear (APN) functions, Kloosterman sums and BCH codes.
Brief Bio:
Faruk Gologlu received his Ph.D. in 2009 from Otto-von-Guericke University, Magdeburg. He worked as a postdoctoral researcher at the University College Dublin. His research interests are finite fields and their applications in cryptography and coding theory.
Dr. Gologlu is a co-recipient of the Best Paper Award at CRYPTO 2013 for his work on discrete logarithm problem.