|visits||member for||1 year, 11 months|
|seen||Oct 25 at 14:51|
Quasi-linear time fully homomorphic encryption using p-adic ring homomorphism
A warning about the paper: it doesn't sound like the author knows much about crypto. There's the misrepresentation of FHE that Mike pointed out; in addition, he claims his system is Informationally Secure (which is impossible for any public key system); he claims that a message cannot be uniquely decrypted; if this were true, this would imply that someone with the private key cannot decrypt it. His claim of $O(n \log n)$ time is also bogus. I would approach this system only with extreme caution.