You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hello. this is not an issue. just a question I have. in GG18 (page 9) says that N must be greater than q (order of curve ) ^ 8.
q is almost equal to 2 ^ 256. and q ^8 is very close to 2 ^ 2048.
If I choose 1024 random prime numbers for "p" and "q" in paillier key pair, N ( = p * q) will be 2048 bits. and almost never can not satisfy GG18 consideration ( N must be greater than q ^ 8)
What was your solution for this? I am not very familiar with rust and I couldn't find your solution in code.
The text was updated successfully, but these errors were encountered:
Hello. this is not an issue. just a question I have. in GG18 (page 9) says that N must be greater than q (order of curve ) ^ 8.
q is almost equal to 2 ^ 256. and q ^8 is very close to 2 ^ 2048.
If I choose 1024 random prime numbers for "p" and "q" in paillier key pair, N ( = p * q) will be 2048 bits. and almost never can not satisfy GG18 consideration ( N must be greater than q ^ 8)
What was your solution for this? I am not very familiar with rust and I couldn't find your solution in code.
The text was updated successfully, but these errors were encountered: