CKKS – Addition and Multiplication

Automated excerpt

and implemented modular polynomial arithmetic (using NTTs as a black box). performed on ciphertexts (without relinearization). Again, if you already know about CKKS, we are still avoiding the RNS which means that we’re momentarily ignoring cryptographic security. The code for this article is in this pull request. Reminder of CKKS ciphertext structureCiphertext additionCiphertext multiplicationNotesReminder of CKKS ciphertext structureAs a quick reminder, with $(1, s(x))$, where $s(x)$ is the secret key polynomial. the decoding algorithm will divide by the scale and effectively remove the error. For symmetric encryption, the structure is\[ the ternary secret key, and $m(x)$ the (encoded) plaintext.

Selected automatically from source text; not independently written or fact-checked. Read the original for full context.