Computational number theory algorithms for computing invariants of number fields and hyperelliptic curves
discrete logarithm problems in various groups
tabulation of number-theoretic invariants
algorithms for solving non-linear Diophantine equations
asymptotic complexity of number-theoretic problems
Public-key cryptography efficiency of cryptographic protocols
investigation of number-theoretic intractibility assumptions
alternative number-theoretic problems as bases of secure cryptosystems
This supervisor is currently accepting inquires.
Looking for students with strong interest and background in discrete mathematics (number theory, abstract algebra in particular), algorithms, and object-oriented programming (C++).
Complete the following form if you are interested in working with this Supervisor for your Graduate Program:
All fields are required, unless indicated otherwise.