Photo by Annie Spratt on Unsplash

Haraka v2 — The Short Input Hash

In cryptography, we often focus on making sure we can create a hash for any number of bytes as an input. But what happens if we have a short input that we want to hash? Using methods such as SHA-1 and SHA-2 (aka SHA-256) will often be inefficient as they tend to compress (or squeeze) the data inputs through a number of stages. The focus is thus to squeeze the data down to a standard number of bits and then add collision protection…

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

Love podcasts or audiobooks? Learn on the go with our new app.

Recommended from Medium

Tackling Network Sensitivity: Adding Value to Enterprise UCaaS Applications with Overlay SD-WAN

A little more advanced git features — part 3

Adopting Business Agility at Moonpig, Part 8: Getting Faster

The image shows the article title: Adopting Business Agility at Moonpig, Part 8

No Framework?

Implementing a multi-select RecyclerView with a dynamic ActionBar in Android

Variables (public, private, and naming conventions)

RethinkDB installation guide and an overview

Let’s Tackle PHP Swoole Solemnly

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

Homomorphic Addition and Subtraction using ElGamal

Zero-Knowledge Proofs and Accumulators Using Kryptography and Crypto Pairings

96-bit Nonces Too Small? Try XChaCha20 and Rust

The Answer to Life, The Universe, and Cybersecurity …