Created
October 1, 2019 15:36
-
-
Save mominbuet/33c9d38c3aeb059dad1e5ab906ab4b15 to your computer and use it in GitHub Desktop.
Adder multiplier binary ckts for NuFHE
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
def addBits(r, a, b, carry): | |
# Xor(t1[0], a, carry[0]) | |
t1 = vm.gate_xor(a, carry) | |
# Xor(t2[0], b, carry[0]) | |
t2 = vm.gate_xor(b, carry) | |
# Xor(r[0], a, t2[0]) | |
r[0] = vm.gate_xor(a, t2) | |
# And(t1[0], t1[0], t2[0]) | |
t1 = vm.gate_and(t1, t2) | |
# Xor(r[1], carry[0], t1[0]) | |
r[1] = vm.gate_xor(carry, t1) | |
return r | |
def addNumbers(ctA, ctB, nBits): | |
ctRes = [[vm.empty_ciphertext((1,))] for i in range(nBits)] | |
# carry = vm.empty_ciphertext((1,)) | |
bitResult = [[vm.empty_ciphertext((1,))] for i in range(2)] | |
ctRes[0] = vm.gate_xor(ctA[0], ctB[0]) | |
# Xor(ctRes[0], ctA[0], ctB[0]) | |
carry = vm.gate_and(ctA[0], ctB[0]) | |
# And(carry[0], ctA[0], ctB[0]) | |
for i in range(1, nBits): | |
bitResult = addBits(bitResult, ctA[i], ctB[i], carry) | |
# Copy(ctRes[i], bitResult[0]); | |
ctRes[i] = nufhe.LweSampleArray.copy(bitResult[0]) | |
# Copy(carry[0], bitResult[1]) | |
carry = nufhe.LweSampleArray.copy(bitResult[1]) | |
return ctRes | |
def mulNumbers(ctA, ctB, secret_key, input_bits, output_bits): | |
result = [ctx.encrypt(secret_key, [False]) for _ in | |
range(output_bits)] | |
# [[vm.empty_ciphertext((1,))] for _ in range(output_bits)] | |
# andRes = [[vm.empty_ciphertext((1,))] for _ in range(input_bits)] | |
for i in range(input_bits): | |
andResLeft = [ctx.encrypt(secret_key, [False]) for _ in | |
range(output_bits)] | |
for j in range(input_bits): | |
andResLeft[j + i] = vm.gate_and(ctA[j], ctB[i]) | |
# andResLeft[j + i] = nufhe.LweSampleArray.copy(andRes[j]) | |
result = addNumbers(andResLeft, result, output_bits) | |
return result | |
if __name__ == '__main__': | |
size=16 | |
bits = [[False] for i in range(size - 2)] | |
zeros = [[False] for i in range(size)] | |
bits1 = [[True]] + [[False]] + bits | |
bits2 = [[True]] + [[True]] + bits | |
ciphertext1 = [[vm.empty_ciphertext((1,))] for i in range(size)] | |
ciphertext2 = [[vm.empty_ciphertext((1,))] for i in range(size)] | |
for i in range(size): | |
ciphertext1[i] = ctx.encrypt(secret_key, bits1[i]) | |
ciphertext2[i] = ctx.encrypt(secret_key, bits2[i]) | |
start_time = time.time() | |
# result = addNumbers(ciphertext1, ciphertext2, size) | |
result = mulNumbers(ciphertext1, ciphertext2, secret_key, size, size * 2) | |
print(time.time() - start_time) | |
result_bits = [ctx.decrypt(secret_key, result[i]) for i in range(size * 2)] | |
print(result_bits) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
not giving correct result
i was tried for 20*30 result is 527