FHE Mathematical Foundations

2025-07-12   blogpage sketch fhe mathdependencygraph


FHE = Fully Homomorphic Encryption


Prompting style: "You're Timothy Gowers. A brilliant and most elegant math explainer"


Watch these for friendly intros


FHE Math Dependency Graph

x.com/i/grok/share/5tgjOQGzzRmZmKfULzNSCKHvY


FHE schemes: CKKS (Approximate Reals for ML); BGV (Exact Integers for Precise Ops)


FHE*
|
|
├── Ring-Learning With Errors (Ring-LWE)
|   |
│   ├── Learning With Errors (LWE)
|   |   |
│   │   ├── Lattices
|   |   |   |
│   │   │   ├── Linear Algebra
│   │   │   │   └── Basic Algebra
|   |   |   |
│   │   │   └── Number Theory
│   │   │       └── Modular Arithmetic
|   |   |
│   │   ├── Shortest Vector Problem (SVP)
│   │   │   └── Closest Vector Problem (CVP)
|   |   |
│   │   └── Probability and Statistics
│   │       ├── Gaussian Distributions
│   │       └── Statistical Distance
|   |
│   └── Polynomial Rings
|       |
│       ├── Rings
│       │   ├── Groups
│       │   │   └── Abelian Groups
│       │   └── Fields
|       |
│       └── Ideals and Quotient Rings
│           └── Ring Homomorphisms
|
|
├── Homomorphic Operations
|   |
│   ├── Noise Management and Growth
│   │   └── Error Analysis
|   |
│   └── Chinese Remainder Theorem (CRT)
│       └── Euler's Totient Function
|
|
├── Encoding/Decoding
|   |
│   ├── Plaintext Representations
│   │   └── Complex Numbers and Floating-Point (CKKS-specific)
│   │       └── Real Analysis
|   |
│   └── Polynomial Representations
│       └── Fast Fourier Transform (FFT) / Number Theoretic Transform (NTT)
|
|
├── Scheme-Specific Techniques
|   |
│   ├── Rescaling (CKKS)
│   │   └── Modulus Switching
│   │       └── Modular Arithmetic (dependency reinforced)
|   |
│   ├── Modulus Switching (BGV)
│   │   └── Chain of Moduli
│   │       └── Modular Arithmetic (dependency reinforced)
|   |
│   └── Key Switching / Relinearization (BGV)
│       └── Gadget Decomposition
│           └── Linear Algebra (dependency reinforced)
|
|
└── Bootstrapping
    |
    ├── Advanced Homomorphic Evaluation
    │   └── Ring Homomorphisms (dependency reinforced)
    |
    └── Lattice Reductions
        └── Linear Algebra (dependency reinforced)


[*] Note that this is a tree-view of an actual graph (more accurately, a non-tree graph). You may realize some nodes are duplicated on the leaves, they supposed to be a single node. It's shown as a tree since showing a (non-tree) graph on text is harder.


More detailed

https://claude.ai/chat/5b2bb8fb-114d-4ae1-a051-21f5007e7dc1

CKKS-specific

https://claude.ai/public/artifacts/035ef45e-00bd-4bec-a13f-e5acf69393bf

Pasted image 20250713162333.png

BFV-specific

https://claude.ai/public/artifacts/df731299-300c-43a0-ae13-04cb4dcac37c

Pasted image 20250713162459.png

A Study Structure for all concepts

https://claude.ai/public/artifacts/aa61c440-61e0-472c-b556-dd3ad7dd6801







Incoming Internal References (0)


Outgoing Web References (3)
  1. www.youtube.com/watch?v=oNek_BKu6IU
    • Craig B. Gentry Homomorphic Encryption
  2. www.youtube.com/watch?v=TySXpV86958
    • Fully Homomorphic Encryption from the Ground Up
  3. x.com/i/grok/share/5tgjOQGzzRmZmKfULzNSCKHvY
    • x.com/i/grok/share/5tgjOQGzzRmZmKfULzNSCKHvY

Receive my updates

Barış Özmen © 2025