Welcome to the resource topic for
**2021/052**

**Title:**

Elementary Attestation of Cryptographically Useful Composite Moduli

**Authors:**
Rémi Géraud-Stewart, David Naccache

**Abstract:**

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. The new protocol relies upon elementary number-theoretic properties and can be implemented efficiently using very few operations. This contrasts with state-of-the-art zero-knowledge protocols for RSA modulus proper generation assessment. The heuristic argument at the end of our construction calls for further cryptanalysis by the community and is, as such, an interesting research question in its own right.

**ePrint:**
https://eprint.iacr.org/2021/052

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

**Example resources include:**
implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .