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
Zaryab Khan

TL;DR
This paper introduces ZK111, a fully homomorphic encryption algorithm operating in quadratic time, utilizing a novel 'color-blind' function to establish p-adic ring homomorphism, enhancing cryptographic capabilities.
Contribution
The paper presents a new fully homomorphic encryption scheme based on a unique p-adic homomorphism technique, differing from existing methods.
Findings
Operates in quadratic time (O(n^2))
Uses a novel 'color-blind' function for security
Establishes p-adic ring homomorphism
Abstract
ZK111 is a fully homomorphic public key encryption algorithm which runs in quadratic time. It's security solely relies upon a very unique 'color-blind' function which is used to create p-adic ring homomorphism.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · advanced mathematical theories · Chaos-based Image/Signal Encryption
