Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Archer, D., Chen, L., Cheon, J.H., Gilad-Bachrach, R., Hallman, R.A., Huang, Z., Jiang, X., Kumaresan, R., Malin, B.A., Sofia, H., Song, Y., Wang, S.: Applications of homomorphic encryption. Technical report (2017)
Brakerski, Z., Gentry, C., Vaikuntanathan, V.: Fully Homomorphic Encryption without Bootstrapping. Technical report (2011). https://eprint.iacr.org/2011/277
Chen, Y., Gong, G.: Integer arithmetic over ciphertext and homomorphic data aggregation. In: IEEE Conference on Communications and Network Security (2015)
Chillotti, I., Gama, N., Georgieva, M., Izabachène, M.: Faster Fully Homomorphic Encryption: Bootstrapping in less than 0.1 Seconds. Technical report (2016). https://eprint.iacr.org/2016/870
Chillotti, I., Gama, N., Georgieva, M., Izabachène, M.: Improving TFHE: faster packed homomorphic operations and efficient circuit bootstrapping. Techical report (2017). https://eprint.iacr.org/2017/430
Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) Advances in Cryptology - CRYPTO 2013. Springer, Heidelberg (2013)
Seo, K., Kim, P., Lee, Y.: Implementation and performance enhancement of arithmetic adder for fully homomorphic encrypted data. J. Korea Inst. Inf. Secur. Cryptol. 27, 413–426 (2017)
Suzuki, K., Yokoo, M.: Secure generalized vickrey auction using homomorphic encryption. In: International Conference on Financial Cryptography, pp. 239–249. Springer (2003)
Acknowledgements
This work was supported by the ICT R&D programs (No.2017-0-00545) and the National Research Foundation (NRF) funded by the Ministry of Science and ICT (2017H1D8A2031628).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Oh, Y., Kim, T., kim, H. (2019). Efficient Software Implementation of Homomorphic Encryption for Addition and Multiplication Operations. In: Lee, S., Ismail, R., Choo, H. (eds) Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication (IMCOM) 2019. IMCOM 2019. Advances in Intelligent Systems and Computing, vol 935. Springer, Cham. https://doi.org/10.1007/978-3-030-19063-7_61
Download citation
DOI: https://doi.org/10.1007/978-3-030-19063-7_61
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19062-0
Online ISBN: 978-3-030-19063-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)