Efficient Polynomial Multiplication for Lattice-based Cryptographic Schemes
Organization
Chair of Security and Theoretical Computer Science
Abstract
In this thesis, we will study on the polynomial multiplication methods for lattice-based cryptographic schemes. We will focus on reducing the number of arithmetic operations by using divide-and-conquer and/or Toeplitz matrix-vector product ideas (by considering Winograd's book). Our aim is to improve the complexity of NTT-based and/or Toom-Cook and/or Karatsuba-like polynomial multiplication methods. The implementation is also required to show the efficiency.
Graduation Theses defence year
2022-2023
Supervisor
Sedat Akleylek
Spoken language (s)
English
Requirements for candidates
Level
Bachelor, Masters
Application of contact
Name
Sedat Akleylek
Phone
E-mail