This research project investigates whether the increasing use of finite field theory and coding theory in cryptographic algorithms could lead to new attack strategies. One goal is to extend existing attacks (e.g. interpolation and saturation attacks). At the same time, we try to address fundamental research issues related to provable security against those attacks. The project's final objective is to contribute to the development of new cryptographic algorithms based on these insights.
Supervisor:
Prof.Dr. Bart Preneel (KU Leuven).