4 ms·
My layman guess is that the FME penalty goes up exponentially to the complexity of an operation.
by miohtama 6y ago
My layman guess is that the FME penalty goes up exponentially to the complexity of an operation.
- SahAssar 6y agoDoing a exact string match on 200-ish rows in 80 seconds on a modern computer is so inefficient that I have a hard time seeing any less complex but useful operations whatsoever. Perhaps I'm just not clever enough, but for now homomorphic encryption seems like it isn't useful for common, real world usecases to me.
- Ar-Curunir 6y agoThis isn’t true, it’s just that different kinds of operations are more or less efficient in FHE