University of Calgary
UofC Navigation

Some new results on binary polynomial multiplication

Date & Time:
May 10, 2017 | 11:30 am
MS 431
Murat Cenk, Middle East Technical University, Ankara, Turkey

There are plenty of work on the design of algorithms for binary polynomial multiplication in the literature because of the applications in different areas such as cryptography and coding theory. In this talk, after introducing the well known methods, several new techniques to improve the efficiency of the algorithms and the best known results will be presented.