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 ...

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 ...

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 ...

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's p – 1 algorithm, which finds in ...

Part of “Complexity Theory,” a column on the tangled questions of our technological age. “Addressing algorithmic bias is like hygiene,” she told me. “You don’t brush once, you don’t floss once, you do ...

Over the past decade, various matrix completion algorithms have been developed. Thresholded singular value decomposition (SVD) is a popular technique in implementing many of them. A sizable number of ...