Fast polynomial arithmetic for post-quantum cryptography
Algorithms and their complexity for polynomial multiplication in the rings used by lattice-based cryptography.
- Suitable for
- PhD thesis
- Supervision
- Tülay Ayyıldız
- Prerequisites
- Algebra; algorithms and complexity; cryptography basics
Lattice-based post-quantum schemes spend most of their time multiplying polynomials in rings such as Z_q[x]/(x^n+1). Faster multiplication directly gives faster cryptography.
Goal
Study and design multiplication algorithms for these rings, such as variants of the number-theoretic transform and Karatsuba-type methods, analyse their complexity, and implement them efficiently.