Academic Journals Database
Disseminating quality controlled scientific knowledge

Quasi-Linear Time Fully Homomorphic Public Key Encryption Algorithm (ZK111)

ADD TO MY LIST
 
Author(s): Zaryab Khan

Journal: Journal of Theoretical Physics and Cryptography
ISSN 2322-3138

Volume: 1;
Issue: 1;
Start page: 14;
Date: 2012;
VIEW PDF   PDF DOWNLOAD PDF   Download PDF Original page

Keywords: Fully Homomorphic Encryption (FHE) | Public Key Encryption (PKE) | Unconditionally Secure | Transition Function | p-adic numbers | Ring Homomorphism | Algebraic Homomorphism.

ABSTRACT
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.
Why do you need a reservation system?     Free Forms + CRM