# Questions tagged [multi-prime-rsa]

A variant of RSA where the modulus is the product of more than two primes.

18 questions
Filter by
Sorted by
Tagged with
28 views

### There are 3 factors in RSA [duplicate]

A Variant RSA. $n$ has 3 factors $p,q,r$. $\gcd(e,\phi(n))=1$, can decrypt it like normal RSA,or should use chinese remainder theory to decrypt it?
510 views

### Decrypting Multi-Prime RSA with e, N, and factors of N given

I was wondering if there was any way to compute the private key $d$ when knowing only $e$ and $N$, and being able to factor $N$ as 4 prime numbers $p, q, r$ and $s$. I've been searching for days and I ...
150 views

2k views

### Who first published the interest of more than two prime factors in RSA?

Multi-prime RSA is now a well known technique (described here): it uses $k>2$ distinct secret prime factors in the public RSA modulus, with the advantage that, using the CRT, we can gain a speed ...
4k views

### RSA with composite numbers

It has been said that RSA uses a modulus product of two prime numbers for security reasons. But does RSA even work correctly if we allow composite integers instead? I think that the answer is "NO". ...
I would like to ask what happens if we build an RSA system with modulus a product of more than 2 primes, for example let $n=p_{1}p_{2}...p_{L}$. I know only the classical RSA system with $n=pq$ with \$...