Tag
Trail of Bits introduces SequenceHash and SequenceMAC, open-source multihashing constructions that work with any standard cryptographic hash function (SHA2, BLAKE, RIPEMD) rather than being tied to Keccak like NIST's TupleHash. The C2SP-approved spec ships with Rust, Go, and Python implementations plus test vectors, aimed at preventing ambiguous-input attacks in protocols like the Fiat-Shamir transform.
This blog post provides an in-depth analysis of adversarial examples targeting fast hash functions, comparing their speed and collision resistance, and detailing vulnerabilities across multiple implementations.
An educational blog post explaining Merkle's authentication tree and the Lamport-Diffie one-time signature scheme, covering the history of digital signatures and how one-way functions enable secure authentication.
A detailed historical and mathematical explanation of hash functions, from their invention by Arnold Dumey in 1956 as a memory indexing technique to modern cryptographic hashes, including Python implementations.
Daniel Lemire explores what fraction of 64-bit integers can be expressed as the product of two 32-bit integers, finding that only about 17% are, with implications for hash function design.
OpenAI researchers demonstrate that a simple count-based exploration approach using hash codes can achieve near state-of-the-art performance on high-dimensional deep RL benchmarks, challenging the assumption that count-based methods cannot scale to continuous state spaces.