The Universal Hash and The HalftimeHash

In computer science, we often want to limit our data ranges. Along with this we might take large amounts of data and represent them as a data hash value. So let’s say we have a data universe of U, and which contains m possible output values. These output values could be defined a data bins, and our inputs as keys. We can then have n possible keys which will map to these m possible bins. As n is likely to be greater than…

--

--

--

This publication brings together interesting articles related to cyber security.

Recommended from Medium

{UPDATE} Pirates! - the match 3 Hack Free Resources Generator

🔥🔥 Free Resources to learn hacking, Everything in one place

Epic Women in Cyber —Lekshmi Nair

Developments in Australian Privacy Law and Responses to Data Flows

⛱ Burn and Airdrop distributes detail

Encrypted Searches Using Crypto Pairing, Rust and MIRACL

Who are white hackers and what do they do?

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

Taher Elgamal —One of the Fathers of SSL and Creator of ElGamal Encryption

Thank you to Adrien-Marie Legendre and Carl Gustav Jacob Jacobi for their symbols

A Cybersecurity Tongue Twister: Some Simple Signature, So Something Schnorr

A Rusty Key: At The Core of Cybersecurity is Random Numbers