When Shafi Goldwasser chose to focus on cryptography and algorithmic number theory as a new graduate student in computer science at the University of California, Berkeley, in 1979, her timing was ...

Algorithmic information theory provides a rigorous framework for quantifying the inherent complexity of data, most notably through the concept of Kolmogorov complexity. This theoretical underpinning ...

Researchers have solved one aspect of the discrete logarithm problem. This is considered to be one of the 'holy grails' of algorithmic number theory, on which the security of many cryptographic ...

The ANTS meetings, held biannually since 1994, are the premier international forum for the presentation of new research in computational number theory and its applications. They are devoted to ...

The School of Mathematics is pleased to be hosting the 15th edition of the ANTS meeting, from 8 – 12 August. The ANTS meetings are the premier international forum for the presentation of new research ...