2 ms·Hash the input (O(n)), search for a second preimage (very much not O(n) if you use a cryptographic hash).by fdupress 4y agoHash the input (O(n)), search for a second preimage (very much not O(n) if you use a cryptographic hash).