3 ms·
Yeah, one should probably add a randomisations step for each channel for good measure. With random byte->byte lookup tables those costs should be hidden by the
by j-pb 5y ago
Yeah, one should probably add a randomisations step for each channel for good measure.
With random byte->byte lookup tables those costs should be hidden by the cache.
so hash = HR[r] ^ HG[g] ^ HB[b] ^ HA[a].