Published April 29, 2026 | https://doi.org/10.59350/cw0yd-09r52

CKKS — Polynomials, the Canonical Embedding, and Encoding

Creators & Contributors

Table of Contents In this tutorial series, I will introduce the CKKS homomorphic encryption scheme from the ground up, in rather intricate detail. Each article in this series corresponds to a pull request on a GitHub repository. The code for this article is in this pull request. Follow along by cloning the repository and checking out the code at the relevant commit. This first article will cover some of the mathematical background necessary in the formulation of the CKKS encryption scheme, specifically the polynomial ring used in the most basic version of CKKS, and the canonical embedding used to encode cleartext messages as plaintexts.

Additional details

Description

Table of Contents In this tutorial series, I will introduce the CKKS homomorphic encryption scheme from the ground up, in rather intricate detail. Each article in this series corresponds to a pull request on a GitHub repository. The code for this article is in this pull request. Follow along by cloning the repository and checking out the code at the relevant commit.

Identifiers

UUID
d40a9d96-d026-492e-a72a-983b41d132c5
GUID
https://www.jeremykun.com/2026/04/29/ckks-polynomials-the-canonical-embedding-and-encoding/
URL
https://www.jeremykun.com/2026/04/29/ckks-polynomials-the-canonical-embedding-and-encoding/

Dates

Issued
2026-04-29T12:25:44
Updated
2026-04-29T12:25:44