Here's a version without If, but with the paper, then. Since, it's not an official standard, I figured that the HISTORY section would be the right place. Correct?
Index: share/man/man9/SipHash24.9 =================================================================== RCS file: /cvs/src/share/man/man9/SipHash24.9,v retrieving revision 1.3 diff -u -p -r1.3 SipHash24.9 --- share/man/man9/SipHash24.9 5 Nov 2014 07:01:49 -0000 1.3 +++ share/man/man9/SipHash24.9 6 Dec 2014 21:17:03 -0000 @@ -42,6 +42,12 @@ inputs which produces a 64-bit digest of The SipHash24 functions implement the algorithm with 2 compression rounds and 4 finalisation rounds. .Pp +SipHash is well-suited for hash tables because of its good +performance on short inputs and because it provides resistance to +hash-flooding denial-of-service attacks. +The key should be generated using +.Xr arc4random_buf 9 . +.Pp .Fn SipHash24_Init initialises a .Vt SIPHASH_CTX @@ -86,12 +92,6 @@ of length .Fa len with the secret .Fa key . -.Pp -If SipHash is being used to mitigate against hash-table flooding -attacks, it is recommended that the -.Vt SIPHASH_KEY -key be generated with -.Xr arc4random_buf 9 . .Sh CONTEXT .Fn SipHash24_Init , .Fn SipHash24_Update , @@ -107,3 +107,13 @@ and return the 64-bit message digest in the host's native endian representation. .Sh SEE ALSO .Xr arc4random_buf 9 +.Sh HISTORY +The SipHash algorithm was published in +.Pp +.Rs +.%A Jean-Philippe Aumasson +.%A Daniel J. Bernstein +.%T SipHash: a fast short-input PRF +.%U https://131002.net/siphash/siphash.pdf +.%D 2012 +.Re
