<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>ckks tutorial on Math ∩ Programming</title><link>https://www.jeremykun.com/tags/ckks-tutorial/</link><description>Recent content in ckks tutorial on Math ∩ Programming</description><generator>Hugo -- gohugo.io</generator><language>en-us</language><lastBuildDate>Wed, 29 Apr 2026 05:25:44 -0700</lastBuildDate><atom:link href="https://www.jeremykun.com/tags/ckks-tutorial/index.xml" rel="self" type="application/rss+xml"/><item><title>CKKS — Polynomials, the Canonical Embedding, and Encoding</title><link>https://www.jeremykun.com/2026/04/29/ckks-polynomials-the-canonical-embedding-and-encoding/</link><pubDate>Wed, 29 Apr 2026 05:25:44 -0700</pubDate><guid>https://www.jeremykun.com/2026/04/29/ckks-polynomials-the-canonical-embedding-and-encoding/</guid><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.
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.</description></item></channel></rss>