
QuasiLinear Time Fully Homomorphic Public Key Encryption Algorithm (ZK111)Keywords: Fully Homomorphic Encryption (FHE) , Public Key Encryption (PKE) , Unconditionally Secure , Transition Function , padic numbers , Ring Homomorphism , Algebraic Homomorphism. Abstract: ZK111 is a quasilinear O(n · log n) fully Homomorphic encryption (FHE) algorithm. It works on a novel idea of “perfectly colorblind function” which is nothing but a very unique way of creating padic ring homomorphism from padic ring X to padic ring Y. Unlike its other FHE counterparts, there is NO “noise” in the cipher text. ZK111 preserves full algebraic homomorphism without compromising its quasilinear efficiency. It is not only FHE, but also the fastest publickey encryption (PKE) algorithm known as of today.. Both encryption and decryption are O(n · log n) and algorithm still retains it FHE property. Hence it solves the most intriguing and outstanding problem of cryptography. ZK111 is a probabilistic encryption algorithm by nature, and despite being FHE; it is absolutely immune to chosen and adoptive plaintext attack by design.
