# Visualising SipHash

DevFeed: [Visualising SipHash](<https://devfeed.tech/articles/visualising-siphash-38930.md>)

Original publisher: [Read original article](<https://idea.popcount.org/2013-10-09-visualising-siphash>)

Author: Marek

Published: 2013-10-08T22:00:00Z

Content type: tutorial

Language: en

Sources: [Marek Majkowski](<https://devfeed.tech/sources/marek-majkowski.md>)

Topics: [Cryptography](<https://devfeed.tech/topics/cryptography.md>), [hash](<https://devfeed.tech/topics/hash.md>), [C](<https://devfeed.tech/topics/c.md>), [Code](<https://devfeed.tech/topics/code.md>)

Tags: [c](<https://devfeed.tech/tags/c.md>), [code](<https://devfeed.tech/tags/code.md>), [cryptanalysis](<https://devfeed.tech/tags/cryptanalysis.md>), [hash](<https://devfeed.tech/tags/hash.md>), [pixel](<https://devfeed.tech/tags/pixel.md>), [program](<https://devfeed.tech/tags/program.md>), [random](<https://devfeed.tech/tags/random.md>), [xor](<https://devfeed.tech/tags/xor.md>)

## AI overview

An article visualises SipHash's SipRound using differential cryptanalysis. It explains the 256-bit internal state, the operations used by SipRound, and how flipping individual input bits affects the output.

## Source excerpt

Visualising SipHash Siphash is a PRF using a "SipRound" primitive as a building block. The recommended SipHash variant, SipHash-2-4, is running two SipRounds after every message block and four rounds at the end to finalise the hash. SipRound SipRound is a simple construct - it mangles 256 bits of internal state using just a few operations on 64 bit registers: - 4 bit rotations - 2 rotations by 32 bits - 4 xors - 4 additions Here's an equivalent code in C (from csiphash): Differential...