-
Notifications
You must be signed in to change notification settings - Fork 10
Open
Description
Overview
CGGMP paper defines ZK proof Π-mod (See Fig 16 https://eprint.iacr.org/2021/060.pdf#page=36) for ensuring that the Paillier modulus is a semiprime and gcd(N, phi(N)) = 1
. There is an attack which assumes that N
has many small factors described at https://www.fireblocks.com/blog/gg18-and-gg20-paillier-key-vulnerability-technical-report.
I tried searching for the implementation of Π-mod in the repository and wasn't able to find it. Does it seem right and if so, should we implement it? Or would it be sufficient if we test N
not to have small factors? (for example primes up to 2**20?)
Metadata
Metadata
Assignees
Labels
No labels