Re:Cingulata: Run C++ code over encrypted data with fully ho...
by aruss on Saturday June 06, 2020 @06:28PM
(#23442860)
It's a requirement of these algorithms that they run in polynomial time with respect to the size of the input. They're large polynomials with big constants, but they're dwarfed by the exponentials you're considering.
[edit] I just did the math. 1. mapping of adding two bytes would make ~64kB list of values. 2. mapping of adding two i32 would make ~73786976294838.2MB list of values (looks like encryption would do a better job)