LightPHE compares BGN BV GHV encryption performance

sefiks.com15 min read

The author compares four somewhat homomorphic encryption algorithms—Boneh-Goh-Nissim, Freeman-Boneh-Goh-Nissim, Brakerski-Vaikuntanathan, and Gentry-Halevi-Vaikuntanathan—which support unlimited additions and a single multiplication. Testing them across Python, Go, Java, and TypeScript using the LightPHE library demonstrates that their security assumptions, ciphertext sizes, and performance vary dramatically. The author concludes that Brakerski-Vaikuntanathan is generally best for real-world use cases due to its speed, large plaintext space, and quantum resistance. Open article →