Quadratic time $O(n^2)$ Fully Homomorphic public key encryption algorithm based on a unique technique to create p-adic homomorphism from ring X to ring Y

This addresses the need for efficient fully homomorphic encryption, which is crucial for secure data processing in fields like cloud computing and privacy-preserving machine learning, but appears incremental as it builds on existing homomorphic encryption concepts.

The paper tackles the problem of fully homomorphic public key encryption by introducing ZK111, an algorithm that runs in quadratic time O(n^2), with security based on a unique 'color-blind' function to create p-adic ring homomorphism.