New answers tagged homomorphic-encryption
0
votes
Accepted
BV FHE Scheme symbolic polynomial
Note that
$$\left(b-\sum a[i]x[i]\right)\cdot\left(b'-\sum a'[i]x[i]\right)
=bb'-b\sum a'[i]x[i]-b'\sum a[i]x[i] +\sum\sum a[i]a'[j]x[i]x[j]$$
and we can extract the coefficients
$$h_0=bb'$$
$$h_i=-ba'...
- 18.1k
1
vote
Paillier cryptosystem break with random number
Yes, it would be possible to decrypt the ciphertext of the Paillier cryptosystem if the random number $r$ leaked.
Encryption if per $c=(g^m)(r^n)\bmod n^2$. We know that $g=n+1$. Thus $c=((n+1)^m)(r^n)...
- 132k
2
votes
Paillier cryptosystem break with random number
Once you know $r$, you can remove it from the ciphertext. If $c=(1+n)^m\bmod n^2$ then $m=(c-1)/n\mod n.$
- 558
Top 50 recent answers are included
Related Tags
homomorphic-encryption × 832encryption × 138
paillier × 79
multiparty-computation × 63
public-key × 56
zero-knowledge-proofs × 48
lattice-crypto × 42
elgamal-encryption × 37
ring-lwe × 35
lwe × 27
rsa × 22
secret-sharing × 21
hash × 19
homomorphic-signatures × 18
protocol-design × 16
cryptanalysis × 15
provable-security × 14
implementation × 14
post-quantum-cryptography × 13
modular-arithmetic × 13
ntru × 12
aes × 11
algorithm-design × 11
reference-request × 11
voting × 11