3 ms·
Are these operations encrypted also? Is this method more efficient rather than returning a mapping of all possible unencrypted inputs and outputs for a given op
by marius_k 6y ago
Are these operations encrypted also? Is this method more efficient rather than returning a mapping of all possible unencrypted inputs and outputs for a given operation.
[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)
- aruss 6y agoIt'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.