SipHash is an add–rotate–xor (ARX) based family of pseudorandom functions created by and Daniel J. Bernstein in 2012, in response to a spate of "hash flooding" denial-of-service attacks (HashDoS) in late 2011. Although designed for use as a hash function to ensure security, SipHash is fundamentally different from cryptographic hash functions like SHA in that it is only suitable as a message authentication code: a keyed hash function like HMAC. That is, SHA is designed so that it is difficult for an attacker to find two messages X and Y such that SHA(X) = SHA(Y), even though anyone may compute SHA(X). SipHash instead guarantees that, having seen Xi and SipHash(Xi, k), an attacker who does not know the key k cannot find (any information about) k or SipHash(Y, k) for any message Y ∉ {Xi} which they have not seen before. (Wikipedia).
From playlist Getting Started in Cryo-EM
DesmosLIVE: An Exploration of Desmos + Mathalicious
Kate Nowak of Mathalicious explores a few Mathalicious lessons with Desmos
From playlist Desmos LIVE
From playlist BeDMaSH
29C3: Hash-flooding DoS reloaded: attacks and defenses (EN)
Speakers: djb | Jean-Philippe Aumasson | Martin Boßlet At 28C3, Klink and Waelde showed that a number of technologies (PHP, ASP.NET, Ruby, Java, Python, etc.) were vulnerable to the decade-old hash-flooding DoS attacks. The vulnerability was then often fixed by adopting stronger hash func
From playlist 29C3: Not my department
From playlist 'Sleeping Sun' videos.
Live Stream ECS library + Deep Diving into the Rust std lib part 10 1
Brooks is exploring Rust live on Twitch, one standard library item at a time. He'll be looking through each item in depth, and then recording a video on that specific item...minus all the live stream shenanigans. Join the community on Discord at https://discord.gg/ Twitter: https://twitt
From playlist Uncut Live Streams