You are cordially invited to attend the colloquium given by Murat Cenk (METU) on Thursday, 8 March 2018, in FENS-L055 at 1.30 pm.
Speaker: Murat Cenk
Title: Fast multiplication algorithms for cryptographic applications
Abstract: Most of the cryptographic applications include computationally expensive algorithms. These algorithms cause the system to be slow, so they need to be improved. One of the ways of enhancing the performance of such systems is to develop new algorithms for the finite field multiplication. In this talk, first, the known such multiplication algorithms are introduced. Then, the recent improvements are presented. How these new results affect the cryptographic applications is also discussed.
Yasemin Şengül Tezel