Abstract
HElib is a C++ library that implements fully homomorphic encryption (FHE). This supports homomorphic linear transformations on plaintext slots which consist of many rotation operations on plaintext slots, and currently, each rotation involves one or two automorphisms. In this paper, we describe a new method for linear transformations that perform only one automorphism for the rotation operation for many kinds of linear transformations. We then further investigate our new method to have algorithmic improvement, which can be understood as a generalization of the baby-step/giant-step strategy on HElib. Finally, we verify that our improvement works well by implementation, and see 2-4 times speedup than the current HElib implementation.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
