Questions tagged [multi-prime-rsa]
A variant of RSA where the modulus is the product of more than two primes.
23 questions
2
votes
1
answer
244
views
Factor multi-prime RSA
I have a multi prime 2043 bit modulus with 8 prime factors, each 256 bit.
...
- 21
2
votes
3
answers
576
views
Balanced Primes for the RSA modulus
I am currently working on a Multipower RSA given by Takagi. I am following the book 'Cryptanalysis of RSA and Its Variants' by Jason Hinek. It gives the definition of balanced primes for standard RSA ...
- 23
1
vote
1
answer
167
views
Why are the primes all the same size in pqRSA?
pqRSA is MP-RSA with 4096-bit primes to build up a modulus of up to 1TB.
If the objective is to make processing the modulus as expensive as possible for the quantum computer why not use just two 4096-...
user113099
5
votes
2
answers
2k
views
Does any proof exist for the optimal number of primes in a RSA key?
My guess is:
Known attack algorithms only work on 2 primes factorization, they don't work on 3+ RSA primes.
More than 3 primes is cpu waste time, better is to increase key length.
So 3 primes will be ...
- 51
2
votes
1
answer
1k
views
RSA: exploiting consecutive primes
It's given 2 plaintexts $m_1$ and $m_2$, and 5 different values of $n\quad\{n_1, n_2, n_3, n_4, n_5\}$ which are generated as follows:
$n_1$ is a a product of two relatively small 128-bit $p$ and $q$ ...
- 21
0
votes
1
answer
275
views
Can we do Multi-Prime Diffie-Hellman?
What is the correct way, if any, to do Multi-Prime DH?
From security point of view, is there any benefit to do it?
Multi-Prime is not about multi participants.
Multi prime is when we use two or more ...
- 103
2
votes
1
answer
3k
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 ...
- 21
0
votes
1
answer
419
views
Plain RSA with $3$ primes, find all integers $x$ so that $x$ is equal to $y$ when $y= e_K(x) = x^{b} \bmod n$
I'm using the notation from the book: Cryptography: Theory and Practice, Third Edition.
I have a cryptosystem with the following information:
$n = p_1 p_2 p_3$ and integer $x$ is encrypted using $y = ...
- 1
4
votes
2
answers
4k
views
What is multi-prime RSA (RSA-MP)?
I found some related question but no real explanation of what it is and when and why to use it. What are the benefits and downsides and is it recommended?
- 263
2
votes
0
answers
467
views
Chinese Remainder Theorem and Elgamal
I am studying an encryption scheme which is Elgamal-like where I think CRT can help optimise the encryption and decryption but I am not sure if I am applying CRT the correct way.
I have a cyclic ...
- 273
17
votes
2
answers
2k
views
Why is pqRSA in the NIST PQC submissions?
In the NIST post-quantum cryptography workshop, the round one submissions included pqRSA. If memory serves, this is an implementation of RSA using the product of a very large number of 4096-bit primes ...
- 16.2k
12
votes
1
answer
12k
views
RSA with 3 primes
I was trying to understand how does RSA with 3 primes work. I have checked Wikipedia but yet I didn’t fully understand their solution.
I would like to know how do you encrypt for $n=p*q*r$
How do you ...
- 127
1
vote
0
answers
157
views
Lower bound for the size of prime factors?
We all know classic RSA and that we should pick moduli of at least 2048-bit length to get decent (112 bit) security.
Now there's also multi-prime RSA, which can yield significant speed-ups using the ...
- 46.8k
2
votes
1
answer
145
views
Can multi-prime RSA be used to create an abuse-resistant lawful interception mechanism?
New to site so this may have been asked before: Can multi-prime RSA, i.e. where N is product of three or more distinct primes, be used for secure communication while allowing distinct authoritative ...
- 21
9
votes
1
answer
7k
views
RSA encryption and decryption with multiple prime modulus using CRT
Every information I found on internet about RSA-CRT encryption/decryption uses only two primes. I'm interested in my project in doing that using multiple (up to 8) primes.
The general idea is to ...
- 93