“Theoretical ideas have a real-life impact,” said Michael Oser Rabin in a 2009 interview, 14 and he spent nearly seven decades proving it. He died on April 14, 2026, in Jerusalem, Israel, at the age ...

The Pohlig-Hellman algorithm, published in 1978 by Stephen Pohlig and Martin Hellman [1], demonstrates that the discrete logarithm problem (DLP) becomes significantly easier when the group order has ...

Abstract: In this paper, we analyze several variants of a simple method for generating prime numbers with fewer random bits. To generate a prime p less than x, the basic idea is to fix a constant q ∝ ...

Given the large volumes of sensitive information transmitted over the Internet, digital signatures are essential for verifying message authenticity and integrity. A key challenge is minimizing ...

Mojo-V (pronounced “mojo-five”) is a new RISC-V extension that introduces privacy-oriented programming capabilities for RISC-V. Mojo-V implements secret computation, enabling secure, efficient, and ...

Number theory, the study of integers and their properties, has been a fundamental branch of mathematics for centuries. What many may not realize is that number theory plays a crucial role in the field ...

Prime numbers are tricky things. We learn in school that they’re numbers with no factors other than 1 and themselves, and that mathematicians have known for thousands of years that an infinite number ...

Since the very first days of computer science — a field known for its methodical approach to problem-solving — randomness has played an important role. The first program to run on the world’s first ...

Although it is not intended to have the formal rigor of a book, we tried to be as faithful as possible to the original algorithms and methods, only adding variants, when these were necessary for ...

$$\begin{aligned} F_1&= \left( \frac{0}{1}, \, \frac{1}{1} \right) , \\ F_2&= \left( \frac{0}{1}, \, \frac{1}{2}, \, \frac{1}{1} \right) , \\ F_3&= \left( \frac{0}{1 ...