bitcoin_hashes/
siphash24.rs

1// SPDX-License-Identifier: CC0-1.0
2
3//! SipHash 2-4 implementation.
4//!
5
6use core::ops::Index;
7use core::slice::SliceIndex;
8use core::{cmp, mem, ptr, str};
9
10use crate::{FromSliceError, Hash as _, HashEngine as _};
11
12crate::internal_macros::hash_type! {
13    64,
14    false,
15    "Output of the SipHash24 hash function."
16}
17
18#[cfg(not(hashes_fuzz))]
19fn from_engine(e: HashEngine) -> Hash { Hash::from_u64(Hash::from_engine_to_u64(e)) }
20
21#[cfg(hashes_fuzz)]
22fn from_engine(e: HashEngine) -> Hash {
23    let state = e.midstate();
24    Hash::from_u64(state.v0 ^ state.v1 ^ state.v2 ^ state.v3)
25}
26
27macro_rules! compress {
28    ($state:expr) => {{
29        compress!($state.v0, $state.v1, $state.v2, $state.v3)
30    }};
31    ($v0:expr, $v1:expr, $v2:expr, $v3:expr) => {{
32        $v0 = $v0.wrapping_add($v1);
33        $v1 = $v1.rotate_left(13);
34        $v1 ^= $v0;
35        $v0 = $v0.rotate_left(32);
36        $v2 = $v2.wrapping_add($v3);
37        $v3 = $v3.rotate_left(16);
38        $v3 ^= $v2;
39        $v0 = $v0.wrapping_add($v3);
40        $v3 = $v3.rotate_left(21);
41        $v3 ^= $v0;
42        $v2 = $v2.wrapping_add($v1);
43        $v1 = $v1.rotate_left(17);
44        $v1 ^= $v2;
45        $v2 = $v2.rotate_left(32);
46    }};
47}
48
49/// Load an integer of the desired type from a byte stream, in LE order. Uses
50/// `copy_nonoverlapping` to let the compiler generate the most efficient way
51/// to load it from a possibly unaligned address.
52///
53/// Unsafe because: unchecked indexing at `i..i+size_of(int_ty)`.
54macro_rules! load_int_le {
55    ($buf:expr, $i:expr, $int_ty:ident) => {{
56        debug_assert!($i + mem::size_of::<$int_ty>() <= $buf.len());
57        let mut data = 0 as $int_ty;
58        ptr::copy_nonoverlapping(
59            $buf.get_unchecked($i),
60            &mut data as *mut _ as *mut u8,
61            mem::size_of::<$int_ty>(),
62        );
63        data.to_le()
64    }};
65}
66
67/// Internal state of the [`HashEngine`].
68#[derive(Debug, Clone)]
69pub struct State {
70    // v0, v2 and v1, v3 show up in pairs in the algorithm,
71    // and simd implementations of SipHash will use vectors
72    // of v02 and v13. By placing them in this order in the struct,
73    // the compiler can pick up on just a few simd optimizations by itself.
74    v0: u64,
75    v2: u64,
76    v1: u64,
77    v3: u64,
78}
79
80/// Engine to compute the SipHash24 hash function.
81#[derive(Debug, Clone)]
82pub struct HashEngine {
83    k0: u64,
84    k1: u64,
85    length: usize, // how many bytes we've processed
86    state: State,  // hash State
87    tail: u64,     // unprocessed bytes le
88    ntail: usize,  // how many bytes in tail are valid
89}
90
91impl HashEngine {
92    /// Creates a new SipHash24 engine with keys.
93    #[inline]
94    pub const fn with_keys(k0: u64, k1: u64) -> HashEngine {
95        HashEngine {
96            k0,
97            k1,
98            length: 0,
99            state: State {
100                v0: k0 ^ 0x736f6d6570736575,
101                v1: k1 ^ 0x646f72616e646f6d,
102                v2: k0 ^ 0x6c7967656e657261,
103                v3: k1 ^ 0x7465646279746573,
104            },
105            tail: 0,
106            ntail: 0,
107        }
108    }
109
110    /// Creates a new SipHash24 engine.
111    #[inline]
112    pub const fn new() -> HashEngine { HashEngine::with_keys(0, 0) }
113
114    /// Retrieves the keys of this engine.
115    pub fn keys(&self) -> (u64, u64) { (self.k0, self.k1) }
116
117    #[inline]
118    fn c_rounds(state: &mut State) {
119        compress!(state);
120        compress!(state);
121    }
122
123    #[inline]
124    fn d_rounds(state: &mut State) {
125        compress!(state);
126        compress!(state);
127        compress!(state);
128        compress!(state);
129    }
130}
131
132impl Default for HashEngine {
133    fn default() -> Self { HashEngine::new() }
134}
135
136impl crate::HashEngine for HashEngine {
137    type MidState = State;
138
139    fn midstate(&self) -> State { self.state.clone() }
140
141    const BLOCK_SIZE: usize = 8;
142
143    #[inline]
144    fn input(&mut self, msg: &[u8]) {
145        let length = msg.len();
146        self.length += length;
147
148        let mut needed = 0;
149
150        if self.ntail != 0 {
151            needed = 8 - self.ntail;
152            self.tail |= unsafe { u8to64_le(msg, 0, cmp::min(length, needed)) } << (8 * self.ntail);
153            if length < needed {
154                self.ntail += length;
155                return;
156            } else {
157                self.state.v3 ^= self.tail;
158                HashEngine::c_rounds(&mut self.state);
159                self.state.v0 ^= self.tail;
160                self.ntail = 0;
161            }
162        }
163
164        // Buffered tail is now flushed, process new input.
165        let len = length - needed;
166        let left = len & 0x7;
167
168        let mut i = needed;
169        while i < len - left {
170            let mi = unsafe { load_int_le!(msg, i, u64) };
171
172            self.state.v3 ^= mi;
173            HashEngine::c_rounds(&mut self.state);
174            self.state.v0 ^= mi;
175
176            i += 8;
177        }
178
179        self.tail = unsafe { u8to64_le(msg, i, left) };
180        self.ntail = left;
181    }
182
183    fn n_bytes_hashed(&self) -> usize { self.length }
184}
185
186impl Hash {
187    /// Hashes the given data with an engine with the provided keys.
188    pub fn hash_with_keys(k0: u64, k1: u64, data: &[u8]) -> Hash {
189        let mut engine = HashEngine::with_keys(k0, k1);
190        engine.input(data);
191        Hash::from_engine(engine)
192    }
193
194    /// Hashes the given data directly to u64 with an engine with the provided keys.
195    pub fn hash_to_u64_with_keys(k0: u64, k1: u64, data: &[u8]) -> u64 {
196        let mut engine = HashEngine::with_keys(k0, k1);
197        engine.input(data);
198        Hash::from_engine_to_u64(engine)
199    }
200
201    /// Produces a hash as `u64` from the current state of a given engine.
202    #[inline]
203    pub fn from_engine_to_u64(e: HashEngine) -> u64 {
204        let mut state = e.state;
205
206        let b: u64 = ((e.length as u64 & 0xff) << 56) | e.tail;
207
208        state.v3 ^= b;
209        HashEngine::c_rounds(&mut state);
210        state.v0 ^= b;
211
212        state.v2 ^= 0xff;
213        HashEngine::d_rounds(&mut state);
214
215        state.v0 ^ state.v1 ^ state.v2 ^ state.v3
216    }
217
218    /// Returns the (little endian) 64-bit integer representation of the hash value.
219    pub fn as_u64(&self) -> u64 { u64::from_le_bytes(self.0) }
220
221    /// Creates a hash from its (little endian) 64-bit integer representation.
222    pub fn from_u64(hash: u64) -> Hash { Hash(hash.to_le_bytes()) }
223}
224
225/// Load an u64 using up to 7 bytes of a byte slice.
226///
227/// Unsafe because: unchecked indexing at `start..start+len`.
228#[inline]
229unsafe fn u8to64_le(buf: &[u8], start: usize, len: usize) -> u64 {
230    debug_assert!(len < 8);
231    let mut i = 0; // current byte index (from LSB) in the output u64
232    let mut out = 0;
233    if i + 3 < len {
234        out = u64::from(load_int_le!(buf, start + i, u32));
235        i += 4;
236    }
237    if i + 1 < len {
238        out |= u64::from(load_int_le!(buf, start + i, u16)) << (i * 8);
239        i += 2
240    }
241    if i < len {
242        out |= u64::from(*buf.get_unchecked(start + i)) << (i * 8);
243        i += 1;
244    }
245    debug_assert_eq!(i, len);
246    out
247}
248
249#[cfg(test)]
250mod tests {
251    use super::*;
252
253    #[test]
254    fn test_siphash_2_4() {
255        #[rustfmt::skip]
256        let vecs: [[u8; 8]; 64] = [
257            [0x31, 0x0e, 0x0e, 0xdd, 0x47, 0xdb, 0x6f, 0x72],
258            [0xfd, 0x67, 0xdc, 0x93, 0xc5, 0x39, 0xf8, 0x74],
259            [0x5a, 0x4f, 0xa9, 0xd9, 0x09, 0x80, 0x6c, 0x0d],
260            [0x2d, 0x7e, 0xfb, 0xd7, 0x96, 0x66, 0x67, 0x85],
261            [0xb7, 0x87, 0x71, 0x27, 0xe0, 0x94, 0x27, 0xcf],
262            [0x8d, 0xa6, 0x99, 0xcd, 0x64, 0x55, 0x76, 0x18],
263            [0xce, 0xe3, 0xfe, 0x58, 0x6e, 0x46, 0xc9, 0xcb],
264            [0x37, 0xd1, 0x01, 0x8b, 0xf5, 0x00, 0x02, 0xab],
265            [0x62, 0x24, 0x93, 0x9a, 0x79, 0xf5, 0xf5, 0x93],
266            [0xb0, 0xe4, 0xa9, 0x0b, 0xdf, 0x82, 0x00, 0x9e],
267            [0xf3, 0xb9, 0xdd, 0x94, 0xc5, 0xbb, 0x5d, 0x7a],
268            [0xa7, 0xad, 0x6b, 0x22, 0x46, 0x2f, 0xb3, 0xf4],
269            [0xfb, 0xe5, 0x0e, 0x86, 0xbc, 0x8f, 0x1e, 0x75],
270            [0x90, 0x3d, 0x84, 0xc0, 0x27, 0x56, 0xea, 0x14],
271            [0xee, 0xf2, 0x7a, 0x8e, 0x90, 0xca, 0x23, 0xf7],
272            [0xe5, 0x45, 0xbe, 0x49, 0x61, 0xca, 0x29, 0xa1],
273            [0xdb, 0x9b, 0xc2, 0x57, 0x7f, 0xcc, 0x2a, 0x3f],
274            [0x94, 0x47, 0xbe, 0x2c, 0xf5, 0xe9, 0x9a, 0x69],
275            [0x9c, 0xd3, 0x8d, 0x96, 0xf0, 0xb3, 0xc1, 0x4b],
276            [0xbd, 0x61, 0x79, 0xa7, 0x1d, 0xc9, 0x6d, 0xbb],
277            [0x98, 0xee, 0xa2, 0x1a, 0xf2, 0x5c, 0xd6, 0xbe],
278            [0xc7, 0x67, 0x3b, 0x2e, 0xb0, 0xcb, 0xf2, 0xd0],
279            [0x88, 0x3e, 0xa3, 0xe3, 0x95, 0x67, 0x53, 0x93],
280            [0xc8, 0xce, 0x5c, 0xcd, 0x8c, 0x03, 0x0c, 0xa8],
281            [0x94, 0xaf, 0x49, 0xf6, 0xc6, 0x50, 0xad, 0xb8],
282            [0xea, 0xb8, 0x85, 0x8a, 0xde, 0x92, 0xe1, 0xbc],
283            [0xf3, 0x15, 0xbb, 0x5b, 0xb8, 0x35, 0xd8, 0x17],
284            [0xad, 0xcf, 0x6b, 0x07, 0x63, 0x61, 0x2e, 0x2f],
285            [0xa5, 0xc9, 0x1d, 0xa7, 0xac, 0xaa, 0x4d, 0xde],
286            [0x71, 0x65, 0x95, 0x87, 0x66, 0x50, 0xa2, 0xa6],
287            [0x28, 0xef, 0x49, 0x5c, 0x53, 0xa3, 0x87, 0xad],
288            [0x42, 0xc3, 0x41, 0xd8, 0xfa, 0x92, 0xd8, 0x32],
289            [0xce, 0x7c, 0xf2, 0x72, 0x2f, 0x51, 0x27, 0x71],
290            [0xe3, 0x78, 0x59, 0xf9, 0x46, 0x23, 0xf3, 0xa7],
291            [0x38, 0x12, 0x05, 0xbb, 0x1a, 0xb0, 0xe0, 0x12],
292            [0xae, 0x97, 0xa1, 0x0f, 0xd4, 0x34, 0xe0, 0x15],
293            [0xb4, 0xa3, 0x15, 0x08, 0xbe, 0xff, 0x4d, 0x31],
294            [0x81, 0x39, 0x62, 0x29, 0xf0, 0x90, 0x79, 0x02],
295            [0x4d, 0x0c, 0xf4, 0x9e, 0xe5, 0xd4, 0xdc, 0xca],
296            [0x5c, 0x73, 0x33, 0x6a, 0x76, 0xd8, 0xbf, 0x9a],
297            [0xd0, 0xa7, 0x04, 0x53, 0x6b, 0xa9, 0x3e, 0x0e],
298            [0x92, 0x59, 0x58, 0xfc, 0xd6, 0x42, 0x0c, 0xad],
299            [0xa9, 0x15, 0xc2, 0x9b, 0xc8, 0x06, 0x73, 0x18],
300            [0x95, 0x2b, 0x79, 0xf3, 0xbc, 0x0a, 0xa6, 0xd4],
301            [0xf2, 0x1d, 0xf2, 0xe4, 0x1d, 0x45, 0x35, 0xf9],
302            [0x87, 0x57, 0x75, 0x19, 0x04, 0x8f, 0x53, 0xa9],
303            [0x10, 0xa5, 0x6c, 0xf5, 0xdf, 0xcd, 0x9a, 0xdb],
304            [0xeb, 0x75, 0x09, 0x5c, 0xcd, 0x98, 0x6c, 0xd0],
305            [0x51, 0xa9, 0xcb, 0x9e, 0xcb, 0xa3, 0x12, 0xe6],
306            [0x96, 0xaf, 0xad, 0xfc, 0x2c, 0xe6, 0x66, 0xc7],
307            [0x72, 0xfe, 0x52, 0x97, 0x5a, 0x43, 0x64, 0xee],
308            [0x5a, 0x16, 0x45, 0xb2, 0x76, 0xd5, 0x92, 0xa1],
309            [0xb2, 0x74, 0xcb, 0x8e, 0xbf, 0x87, 0x87, 0x0a],
310            [0x6f, 0x9b, 0xb4, 0x20, 0x3d, 0xe7, 0xb3, 0x81],
311            [0xea, 0xec, 0xb2, 0xa3, 0x0b, 0x22, 0xa8, 0x7f],
312            [0x99, 0x24, 0xa4, 0x3c, 0xc1, 0x31, 0x57, 0x24],
313            [0xbd, 0x83, 0x8d, 0x3a, 0xaf, 0xbf, 0x8d, 0xb7],
314            [0x0b, 0x1a, 0x2a, 0x32, 0x65, 0xd5, 0x1a, 0xea],
315            [0x13, 0x50, 0x79, 0xa3, 0x23, 0x1c, 0xe6, 0x60],
316            [0x93, 0x2b, 0x28, 0x46, 0xe4, 0xd7, 0x06, 0x66],
317            [0xe1, 0x91, 0x5f, 0x5c, 0xb1, 0xec, 0xa4, 0x6c],
318            [0xf3, 0x25, 0x96, 0x5c, 0xa1, 0x6d, 0x62, 0x9f],
319            [0x57, 0x5f, 0xf2, 0x8e, 0x60, 0x38, 0x1b, 0xe5],
320            [0x72, 0x45, 0x06, 0xeb, 0x4c, 0x32, 0x8a, 0x95],
321        ];
322
323        let k0 = 0x_07_06_05_04_03_02_01_00;
324        let k1 = 0x_0f_0e_0d_0c_0b_0a_09_08;
325        let mut vin = [0u8; 64];
326        let mut state_inc = HashEngine::with_keys(k0, k1);
327
328        for i in 0..64 {
329            vin[i] = i as u8;
330            let vec = Hash::from_slice(&vecs[i][..]).unwrap();
331            let out = Hash::hash_with_keys(k0, k1, &vin[0..i]);
332            assert_eq!(vec, out, "vec #{}", i);
333
334            let inc = Hash::from_engine(state_inc.clone());
335            assert_eq!(vec, inc, "vec #{}", i);
336            state_inc.input(&[i as u8]);
337        }
338    }
339}
340
341#[cfg(bench)]
342mod benches {
343    use test::Bencher;
344
345    use crate::{siphash24, Hash, HashEngine};
346
347    #[bench]
348    pub fn siphash24_1ki(bh: &mut Bencher) {
349        let mut engine = siphash24::Hash::engine();
350        let bytes = [1u8; 1024];
351        bh.iter(|| {
352            engine.input(&bytes);
353        });
354        bh.bytes = bytes.len() as u64;
355    }
356
357    #[bench]
358    pub fn siphash24_64ki(bh: &mut Bencher) {
359        let mut engine = siphash24::Hash::engine();
360        let bytes = [1u8; 65536];
361        bh.iter(|| {
362            engine.input(&bytes);
363        });
364        bh.bytes = bytes.len() as u64;
365    }
366
367    #[bench]
368    pub fn siphash24_1ki_hash(bh: &mut Bencher) {
369        let k0 = 0x_07_06_05_04_03_02_01_00;
370        let k1 = 0x_0f_0e_0d_0c_0b_0a_09_08;
371        let bytes = [1u8; 1024];
372        bh.iter(|| {
373            let _ = siphash24::Hash::hash_with_keys(k0, k1, &bytes);
374        });
375        bh.bytes = bytes.len() as u64;
376    }
377
378    #[bench]
379    pub fn siphash24_1ki_hash_u64(bh: &mut Bencher) {
380        let k0 = 0x_07_06_05_04_03_02_01_00;
381        let k1 = 0x_0f_0e_0d_0c_0b_0a_09_08;
382        let bytes = [1u8; 1024];
383        bh.iter(|| {
384            let _ = siphash24::Hash::hash_to_u64_with_keys(k0, k1, &bytes);
385        });
386        bh.bytes = bytes.len() as u64;
387    }
388}