1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
use rug::Integer;
use scicrypt_numbertheory::{gen_coprime, gen_rsa_modulus};
use scicrypt_traits::cryptosystems::{
Associable, AsymmetricCryptosystem, DecryptionKey, EncryptionKey,
};
use scicrypt_traits::homomorphic::HomomorphicAddition;
use scicrypt_traits::randomness::GeneralRng;
use scicrypt_traits::randomness::SecureRng;
use scicrypt_traits::security::BitsOfSecurity;
use std::ops::Rem;
#[derive(Copy, Clone)]
pub struct Paillier {
modulus_size: u32,
}
#[derive(PartialEq, Debug)]
pub struct PaillierPK {
n: Integer,
g: Integer,
}
pub struct PaillierSK {
lambda: Integer,
mu: Integer,
}
pub struct PaillierCiphertext {
pub(crate) c: Integer,
}
impl Associable<PaillierPK> for PaillierCiphertext {}
impl AsymmetricCryptosystem for Paillier {
type PublicKey = PaillierPK;
type SecretKey = PaillierSK;
fn setup(security_param: &BitsOfSecurity) -> Self {
Paillier {
modulus_size: security_param.to_public_key_bit_length(),
}
}
fn generate_keys<R: SecureRng>(&self, rng: &mut GeneralRng<R>) -> (PaillierPK, PaillierSK) {
let (n, lambda) = gen_rsa_modulus(self.modulus_size, rng);
let g = &n + Integer::from(1);
let mu = Integer::from(lambda.invert_ref(&n).unwrap());
(PaillierPK { n, g }, PaillierSK { lambda, mu })
}
}
impl EncryptionKey for PaillierPK {
type Input = Integer;
type Plaintext = Integer;
type Ciphertext = PaillierCiphertext;
fn encrypt_raw<R: SecureRng>(
&self,
plaintext: &Integer,
rng: &mut GeneralRng<R>,
) -> PaillierCiphertext {
let n_squared = Integer::from(self.n.square_ref());
let r = gen_coprime(&n_squared, rng);
let first = Integer::from(self.g.pow_mod_ref(&plaintext.into(), &n_squared).unwrap());
let second = r.secure_pow_mod(&self.n, &n_squared);
PaillierCiphertext {
c: (first * second).rem(&n_squared),
}
}
}
impl DecryptionKey<PaillierPK> for PaillierSK {
fn decrypt_raw(&self, public_key: &PaillierPK, ciphertext: &PaillierCiphertext) -> Integer {
let n_squared = Integer::from(public_key.n.square_ref());
let mut inner = Integer::from(ciphertext.c.secure_pow_mod_ref(&self.lambda, &n_squared));
inner -= 1;
inner /= &public_key.n;
inner *= &self.mu;
inner.rem(&public_key.n)
}
}
impl HomomorphicAddition for PaillierPK {
fn add(
&self,
ciphertext_a: Self::Ciphertext,
ciphertext_b: Self::Ciphertext,
) -> Self::Ciphertext {
PaillierCiphertext {
c: Integer::from(&ciphertext_a.c * &ciphertext_b.c)
.rem(Integer::from(self.n.square_ref())),
}
}
fn mul(&self, ciphertext: Self::Ciphertext, input: Self::Input) -> Self::Ciphertext {
let modulus = Integer::from(self.n.square_ref());
PaillierCiphertext {
c: Integer::from(ciphertext.c.pow_mod_ref(&input, &modulus).unwrap()),
}
}
}
#[cfg(test)]
mod tests {
use crate::cryptosystems::paillier::Paillier;
use rand_core::OsRng;
use rug::Integer;
use scicrypt_traits::cryptosystems::{AsymmetricCryptosystem, DecryptionKey, EncryptionKey};
use scicrypt_traits::randomness::GeneralRng;
use scicrypt_traits::security::BitsOfSecurity;
#[test]
fn test_encrypt_decrypt() {
let mut rng = GeneralRng::new(OsRng);
let paillier = Paillier::setup(&BitsOfSecurity::Other { pk_bits: 160 });
let (pk, sk) = paillier.generate_keys(&mut rng);
let ciphertext = pk.encrypt(&Integer::from(15), &mut rng);
assert_eq!(15, sk.decrypt(&ciphertext));
}
#[test]
fn test_homomorphic_add() {
let mut rng = GeneralRng::new(OsRng);
let paillier = Paillier::setup(&BitsOfSecurity::Other { pk_bits: 160 });
let (pk, sk) = paillier.generate_keys(&mut rng);
let ciphertext_a = pk.encrypt(&Integer::from(7), &mut rng);
let ciphertext_b = pk.encrypt(&Integer::from(7), &mut rng);
let ciphertext_twice = ciphertext_a + ciphertext_b;
assert_eq!(Integer::from(14), sk.decrypt(&ciphertext_twice));
}
#[test]
fn test_homomorphic_scalar_mul() {
let mut rng = GeneralRng::new(OsRng);
let paillier = Paillier::setup(&BitsOfSecurity::Other { pk_bits: 160 });
let (pk, sk) = paillier.generate_keys(&mut rng);
let ciphertext = pk.encrypt(&Integer::from(9), &mut rng);
let ciphertext_twice = ciphertext * Integer::from(16);
assert_eq!(144, sk.decrypt(&ciphertext_twice));
}
}