Elementary Attestation of Cryptographically Useful Composite Moduli.

This paper describes a non-interactive process allowing a prover to convince a verifier that a modulus n is the product of two primes (p, q) of about the same size. A further heuristic argument conjectures that \(p-1\) and \(q-1\) have sufficiently large prime factors for cryptographic applications.