Post-quantum Cryptosystems from Diophantine equations

Host Faculty: Engineering
General Subject Area: Pure Mathematics
Project Level: PhD
View the Research Website
FIND A PROJECT - Engineering

While hiding a secret rational point on a curve is easy, recovering the point (even within some bounds), given the curve, is hard. Can we convince someone we know the hidden point without revealing it? This is potentially a good post-quantum cryptographic primitive. We've had success in using these to build a simple cryptographic primitive known as a commitment scheme and want to see if it can be extended to an encryption or a digital signature scheme. Alternatively, we would like to look at ways of breaking such schemes by solving the equations or exploiting other weaknesses.


Supervisor: Felipe Voloch

Does the project come with funding


Final date for receiving applications



Number theory, Cryptography