Asymptotic Counting of RSA Integers

A few years ago, Pieter and I studied integers that can be expressed as the product of two constrained prime numbers, commonly known as RSA integers due to their relevance in cryptography. Our work focused on examining the asymptotic distribution of RSA integers and investigating earlier observations by Dummit, Granville, and Kisilevsky on the distribution of integers in arithmetic progressions, applied specifically to RSA integers.

This line of research has since evolved to consider other cases, for instance, the distribution of integers expressed as the product of three constrained prime numbers, which has interesting applications in the theory of coefficients of cyclotomic polynomials.

On this special occasion, I would like to highlight this collaboration with Pieter, which continues to inspire further exploration in this direction.