Search Heuristics and Constructive Algorithms for Maximally Idempotent Integers

Abstract

Previous work established the set of square-free integers n with at least one factorization $n=\overline{p}\overline{q}$ for which $\overline{p}$ and $\overline{q}$ are valid RSA keys, whether they are prime or composite. These integers are exactly those with the property $\lambda \left(n\right)\mid (\overline{p}-1)(\overline{q}-1)$, where $\lambda$ is the Carmichael totient function. We refer to these integers as idempotent, because $\forall a\in Z_n,a^{k(\overline{p}-1)(\overline{q}-1)+1}\underset{n}{\equiv }a$ for any positive integer k. This set was initially known to contain only the semiprimes, and later expanded to include some of the Carmichael numbers. Recent work by the author gave the explicit formulation for the set, showing that the set includes numbers that are neither semiprimes nor Carmichael numbers. Numbers in this last category had not been previously analyzed in the literature. While only the semiprimes have useful cryptographic properties, idempotent integers are deserving of study in their own right as they lie at the border of hard problems in number theory and computer science. Some idempotent integers, the maximally idempotent integers, have the property that all their factorizations are idempotent. We discuss their structure here, heuristics to assist in finding them, and algorithms from graph theory that can be used to construct examples of arbitrary size.