The research areas of OLCRYPT are the mathematical and algorithmic foundations of cryptography, explicit number theory and computer algebra. The focus lies on theoretical and computational aspects of algebraic curves, abelian varieties and number fields, real-world applications and implementations of cryptographic algorithms.
Some sample research topics include ...
- Abelian varieties, isogeny graphs and endomorphism rings, complex multiplication
- Construction of families of curves with many rational points
- Numerical verification of conjectures from arithmetic geometry in examples
- Numerical and symbolic methods for Riemann surfaces and complex Jacobians with applications in number theory and theoretical physics
- Elliptic curves and other number theoretic objects in cryptographic applications
- Applications of computer algebra
Research is conducted in small teams of students and at least two advisors. There are exchange and collaboration between the students on a daily basis, frequent team sessions with the advisors, reading courses and a seminar. There is also an exchange programme with research teams in Paris and Bordeaux. The graduate academy of the Carl von Ossietzky university offers additional, professional courses.
There are currently two PhD positions open. If you are interested in OLCRYPT please contact the coordinators for further information.