This repo is the implmentation of the paper Pegasus: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic Encryption. Note that this repo should only be used for research and its code are still under heavy developments.
Additional Note
-
The reported performance of the F_mod in our paper used Han et al.'s method for the homomorphic Sin function. In this repo, we update the F_mod implementation to Bossuat et al.'s method, using the examples from the Lattigo repo.
-
This repo provides the implementation of binary LWE secret key. For the ternary secret key, we can use the technique of this paper at the cost of doubling the LUT time.
Additional Note (Update 2021-12-14)
- PEGASUS can evaluate any point-wise function
f(x)defined over the intervalx \in ZZ \caps [-N/2, N/2). This interval can be extended toZZ \caps [-N, N)when the target function is negacyclic, i.e.,f(x+N) = f(x). As we have pointed in our paper, we assume the CKKS ciphertext should encrypt message in the range[-q/4, q/4)so that it can be discreted to the proper range[-N/2, N/2). - To obtain a full domain look-up-table without the requirements of negacyclic functions, please refer to the paper FDFB: Full Domain Functional Bootstrapping Towards Practical Fully Homomorphic Encryption.
- git
- c++ compiler that supports at least C++14 standard
- cmake version >= 3.10
- GMP
mkdir -p build-release & cd build-releasecmake .. -DSEAL_USE_ZLIB=OFF -DSEAL_USE_MSGSL=OFF -DCMAKE_BUILD_TYPE=Releasemake -j4- check the executables in
build-release/bin/
- codes
examples/lut.cc - This demo show the LUTs in Pegasus.
- codes
examples/repacking.cc - This demo starts with a CKKS ciphertext that encodes a vector. Then we perform CoeffsToSlots and extraction on the CKKS ciphertext, and gets many LWE ciphertexts. After that, we perform LUT on the LWE ciphertexts. Finally, we pack a batch of LUT results (i.e., LWE ciphertexts) into a single CKKS ciphertext.