Skip to content

Fully Homomorphic Encryption Using Ideal Lattices

Authors: Craig Gentry
Year: 2009
Venue: STOC 2009

type: scheme status: auto

Links: DOI

Visual lesson: Gentry's FHE · Scheme table row: Gentry's FHE

Scheme card: Gentry's FHE

Group 5. Earlier and other FHE constructions
Kind Scheme
Hardness assumption Ideal lattices + sparse subset sum
Plaintext type Bits
SIMD packing No
Bootstrapping Yes (first ever)
Post-quantum Yes
Status Foundational
Fit for LLM inference Historical. It introduced bootstrapping, but it is far too slow.
Follow-ups Gentry–Halevi implementation (EUROCRYPT 2011).

System card: Gentry's FHE

Group 4. Alternative FHE schemes
Family Ideal lattices + bootstrapping
Arithmetic Bits
Interaction Non-interactive
Model scale -
Status Foundational
Relation to the SoK First FHE construction, ancestor of all schemes.
Note Introduced bootstrapping. Impractical today but defines the paradigm.
Code https://crypto.stanford.edu/craig/craig-thesis.pdf
Systems page Gentry's FHE

Files

No local PDF in the archive.


Database key: fully-homomorphic-encryption-using-ideal-lattices · created 2026-11-05 · updated 2026-11-05 · edit with python3 tools/paperdb.py set fully-homomorphic-encryption-using-ideal-lattices COLUMN VALUE