TY - GEN
T1 - Efficient software implementation of homomorphic encryption for addition and multiplication operations
AU - Oh, Yongwoo
AU - Kim, Taeyun
AU - kim, Hyoungshick
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - Fully homomorphic encryption enables any type of calculation on encrypted data. There are several crypto libraries that provide such fully homomorphic encryption. However, since most libraries only support single level binary circuit operations, it is required for developers to efficiently implement basic arithmetic algorithms such as addition, subtraction, multiplication, and division for their own applications. In this paper, we propose fast binary addition and multiplication algorithms to support various bit-wise operations. To show the feasibility of the proposed algorithms, we implemented the proposed algorithms for 16, 32, 48, and 64 bits integers using the TFHE library. Our experiment results demonstrate that the proposed addition operation decreases the running time by 11 to 12%, and our multiplication implementation is about 3 to 4 times faster than the non-threaded method for 16, 32, 48 and 64 bits integers.
AB - Fully homomorphic encryption enables any type of calculation on encrypted data. There are several crypto libraries that provide such fully homomorphic encryption. However, since most libraries only support single level binary circuit operations, it is required for developers to efficiently implement basic arithmetic algorithms such as addition, subtraction, multiplication, and division for their own applications. In this paper, we propose fast binary addition and multiplication algorithms to support various bit-wise operations. To show the feasibility of the proposed algorithms, we implemented the proposed algorithms for 16, 32, 48, and 64 bits integers using the TFHE library. Our experiment results demonstrate that the proposed addition operation decreases the running time by 11 to 12%, and our multiplication implementation is about 3 to 4 times faster than the non-threaded method for 16, 32, 48 and 64 bits integers.
KW - Binary operation
KW - Concurrent calculation
KW - Homomorphic encryption
UR - https://www.scopus.com/pages/publications/85066875368
U2 - 10.1007/978-3-030-19063-7_61
DO - 10.1007/978-3-030-19063-7_61
M3 - Conference contribution
AN - SCOPUS:85066875368
SN - 9783030190620
T3 - Advances in Intelligent Systems and Computing
SP - 761
EP - 768
BT - Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019
A2 - Lee, Sukhan
A2 - Ismail, Roslan
A2 - Choo, Hyunseung
PB - Springer Verlag
T2 - 13th International Conference on Ubiquitous Information Management and Communication, IMCOM 2019
Y2 - 4 January 2019 through 6 January 2019
ER -