TÜ arvutiteaduse instituudi lõputööde teemade register

Organisatsiooni nimi

Chair of Security and Theoretical Computer Science

Kokkuvõte

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.

Lõputöö kaitsmise aasta

2022-2023

Juhendaja

Sedat Akleylek

Suhtlemiskeel(ed)

inglise keel

Nõuded kandideerijale

Tase

Bakalaureus, Magister

Märksõnad

#polynomial multiplication, post-quantum cryptography, lattice-based cryptography, arithmetic complexity

 

Nimi

Sedat Akleylek

Tel

E-mail