%0 Journal Article
%T Quasi-Linear Time Fully Homomorphic Public Key Encryption Algorithm (ZK111)
%A Zaryab Khan
%J Journal of Theoretical Physics and Cryptography
%D 2012
%I University of Mohaghegh Ardabili
%X ZK111 is a quasi-linear 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 p-adic ring homomorphism from p-adic ring X to p-adic ring Y. Unlike its other FHE counterparts, there is NO ¡°noise¡± in the cipher text. ZK111 preserves full algebraic homomorphism without compromising its quasi-linear efficiency. It is not only FHE, but also the fastest public-key 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.
%K Fully Homomorphic Encryption (FHE)
%K Public Key Encryption (PKE)
%K Unconditionally Secure
%K Transition Function
%K p-adic numbers
%K Ring Homomorphism
%K Algebraic Homomorphism.
%U http://www.ijtpc.org/volume1/JTPC1386.pdf