Photo by Guillaume Jaillet on Unsplash

Which is the fastest hashing method … and has O(1) complexity?

Well, the fastest hash might be just taking the first eight bytes of our data to produce a hash. But that is likely to create lots of collisions where the first eight bytes are the same, such as “Edinburgh123” and “Edinburgh99”. A stronger method is to sample bytes, and merge these into a 64-byte hash. The complexity is then O(1), as it doesn’t matter how much data we have, as we…

This publication brings together interesting articles related to cyber security.

Recommended from Medium

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
Prof Bill Buchanan OBE

Prof Bill Buchanan OBE

Professor Cryptography. Serial innovator. Believer in fairness, justice & freedom. EU Citizen in heart. Living by the sea. Old World Breaker. New World Creator.

More from Medium