Sabancı University Mathematics Colloquium

Fast multiplication algorithms for cryptographic applications
Murat Cenk
METU, Turkey
Özet : 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.
  Tarih : 08.03.2018
  Saat : 13:30
  Yer : FENS-L055
  Dil : English
    Yazdır