My research focuses on computational number theory and high-performance arithmetic as used in (post-quantum) public-key cryptography. On the one hand, I have an interest in the various mathematical problems used in applied cryptography. Examples include the integer factorization problem and the (elliptic curve) discrete logarithm problem. On the other hand I like to investigate the different techniques to realize efficient cryptographic implementations on various exotic or embedded architectures.