-
Notifications
You must be signed in to change notification settings - Fork 290
Expand file tree
/
Copy pathbfv-mult-method-benchmark.cpp
More file actions
129 lines (107 loc) · 4.49 KB
/
bfv-mult-method-benchmark.cpp
File metadata and controls
129 lines (107 loc) · 4.49 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
//==================================================================================
// BSD 2-Clause License
//
// Copyright (c) 2014-2022, NJIT, Duality Technologies Inc. and other contributors
//
// All rights reserved.
//
// Author TPOC: contact@openfhe.org
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// 1. Redistributions of source code must retain the above copyright notice, this
// list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright notice,
// this list of conditions and the following disclaimer in the documentation
// and/or other materials provided with the distribution.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
// OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//==================================================================================
/*
* Compares the performance of different multiplication methods in BFV
* using EvalMultMany operation.
*/
#define PROFILE
#define _USE_MATH_DEFINES
#include "scheme/bfvrns/gen-cryptocontext-bfvrns.h"
#include "gen-cryptocontext.h"
#include "cryptocontext.h"
#include "benchmark/benchmark.h"
#include <iostream>
#include <fstream>
#include <limits>
#include <iterator>
#include <random>
using namespace lbcrypto;
constexpr uint32_t RING_DIM = 16384;
constexpr uint32_t MULT_DEPTH = 7;
constexpr uint32_t PTM = 2;
constexpr uint32_t DCRT_BITS = 60;
constexpr KeySwitchTechnique KS_TECH = BV;
static std::vector<MultiplicationTechnique> MULT_METHOD_ARGS = {BEHZ, HPS, HPSPOVERQ, HPSPOVERQLEVELED};
static void MultBFVArguments(benchmark::internal::Benchmark* b) {
for (MultiplicationTechnique multMethod : MULT_METHOD_ARGS) {
b->ArgNames({"mult_method"})->Args({multMethod})->MinTime(10);
}
}
/*
* Context setup utility methods
*/
CryptoContext<DCRTPoly> GenerateBFVrnsContext(MultiplicationTechnique multMethod) {
CCParams<CryptoContextBFVRNS> parameters;
parameters.SetPlaintextModulus(PTM);
parameters.SetMultiplicativeDepth(MULT_DEPTH);
parameters.SetScalingModSize(DCRT_BITS);
parameters.SetKeySwitchTechnique(KS_TECH);
parameters.SetRingDim(RING_DIM);
parameters.SetMultiplicationTechnique(multMethod);
parameters.SetSecurityLevel(HEStd_128_classic);
parameters.SetMaxRelinSkDeg(2);
parameters.SetStandardDeviation(3.19);
CryptoContext<DCRTPoly> cc = GenCryptoContext(parameters);
cc->Enable(PKE);
cc->Enable(KEYSWITCH);
cc->Enable(LEVELEDSHE);
cc->Enable(ADVANCEDSHE);
return cc;
}
/*
* benchmarks
*/
void BFVrns_EvalMult(benchmark::State& state) {
CryptoContext<DCRTPoly> cc = GenerateBFVrnsContext(MULT_METHOD_ARGS[state.range(0) - 1]);
// KeyGen
KeyPair<DCRTPoly> keyPair = cc->KeyGen();
cc->EvalMultKeyGen(keyPair.secretKey);
std::vector<int64_t> vectorOfInts = {1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
Plaintext plaintext;
plaintext = cc->MakeCoefPackedPlaintext(vectorOfInts);
std::vector<Ciphertext<DCRTPoly>> ciphertexts;
int treeSize = 1 << MULT_DEPTH;
for (int i = 0; i < treeSize; i++)
ciphertexts.push_back(cc->Encrypt(keyPair.publicKey, plaintext));
Ciphertext<DCRTPoly> ciphertextMult;
while (state.KeepRunning()) {
ciphertextMult = cc->EvalMultMany(ciphertexts);
}
Plaintext plaintextDec;
cc->Decrypt(keyPair.secretKey, ciphertextMult, &plaintextDec);
plaintextDec->SetLength(plaintext->GetLength());
if (plaintext != plaintextDec) {
std::cout << "Original plaintext: " << plaintext << std::endl;
std::cout << "Evaluated plaintext: " << plaintextDec << std::endl;
}
}
BENCHMARK(BFVrns_EvalMult)->Unit(benchmark::kMillisecond)->Apply(MultBFVArguments);
BENCHMARK_MAIN();