Hello Everyone, I have a usecase for OpenFHE, where I need plaintext-matrix A with ciphertext-vector v multiplication. I implemented this via the giant-step, baby-step method with A.v = \sum_{k=0}^{n_2-1} \mathrm{Rot} \left( \sum_{j=0}^{n_1-1} \mathrm{Rot}\left(diag(A, kn_1 + j), -kn_1\right) \cdo…

Hi @LHenke This issue is expected. For the setting you described, you would need n_1 + n_2 - 2 rotation keys. Theoretically speaking, you can reduce the number of rotation keys by applying the baby-step-giant-step key switching procedure in a hierarchical manner. In other words, the inner loop can…

Does the memory usage scale linearly? So is there a way to estimate how much memory one has to use beforehand?

Size of Rotation keys

FHE Questions

ypolyakov May 5, 2023, 3:45pm 4

See the key estimates at Bootstrapping AutomorphismKey keys exceeds maximum protobuf size of 2GB

Topic		Replies	Views
CKKS Memory Issue for Matrix Multiplication by 256x256 Library Questions	3	129	March 14, 2025
How to reduce memory usage with using many rotate key and bootstrap key? Library Questions openfhe-help	1	310	July 17, 2023
CKKS Rotation Key Memory Size Library Questions	1	117	July 5, 2024
Generating all possible rotations of a vector encrypted in a CKKS ciphertext FHE Questions	4	483	November 9, 2023
About rotation key FHE Questions questions	3	367	July 28, 2023

Size of Rotation keys

Related topics