Professor Murat Cenk, Institute of Applied Mathematics, Middle East Technical University
Some new results on binary polynomial multiplication
Some cryptographic systems require millions of multiplications of polynomials over the binary field of two elements. This talk focuses on methods for reducing the minimum number of bit operations for the multiplication of polynomials over the binary field. In particular, a modified Bernstein's 3-way algorithm, a new 5-way algorithm and a new 3-way algorithm will be presented at the talk. These algorithms improve the best known results on the number of bit operations for the multiplication of binary polynomials of cryptographic sizes.
Murat Cenk obtained his BS degree in Mathematics from the Middle East Technical University, Ankara, Turkey in 2000, and his PhD degree from the same university in 2009. From September 2010 to January 2014, he was a post-doctoral researcher in the Department of Electrical and Computer Engineering at the University of Waterloo, Waterloo, Canada. Currently, he is an Assistant Professor with the Institute of Applied Mathematics at the Middle East Technical University. His main research interests include arithmetic and matrix computations for cryptographic applications.
Invited by Professor Anwar Hasan
200 University Avenue West
Waterloo, ON N2L 3G1