Paperlane

no. 4 · Wednesday 28 October 2026

GKS Fully Homomorphic Encryption: Security Analysis

John Graham, Soundes Marzougui, Miloš Pavlović and Vladimir Shpilrain

math.RA · via cs.CR · 41 pp

Abstract

All traditional encryption schemes share a fundamental operational vulnerability: encrypted data must be decrypted before it can be used. Fully homomorphic encryption eliminates this vulnerability by enabling computation directly on encrypted data, but existing FHE schemes impose substantial practical constraints that limit deployment. This paper presents a formal security analysis of the Gribov-Kahrobaei-Shpilrain (GKS) private-key FHE scheme. GKS requires no bootstrapping or de-linearization, produces bit-exact decryption, supports native encrypted search, and scales to unbounded depth.

comments
41 pages
fields
Rings and Algebras
pdf ↗ page arXiv:2610.37061 ↗