Searched refs:hsiphash (Results 1 – 5 of 5) sorted by relevance
| /linux-6.15/Documentation/translations/zh_CN/security/ |
| H A D | siphash.rst | 54 如果向一个通用的hsiphash函数传递一个恒定长度的常量，他将
125 HalfSipHash是通过 "hsiphash" 系列函数提供的。
128 绝对不要在作为哈希表键函数之外使用hsiphash函数，只有在你
133 在64位的内核中，hsiphash函数实际上实现的是SipHash-1-3，这是一
156 u32 hsiphash(const void *data, size_t len, const hsiphash_key_t *key);
165 如果向一个通用的hsiphash函数传递一个恒定长度的常量，他将在编译
185 …return &table->hashtable[hsiphash(input, sizeof(*input), &table->key) & (HASH_SIZE(table->hashtabl…
193 hsiphash()大约比jhash()慢三倍，这是因为有许多替换，不过这些都不是问题，
194 因为哈希表查找不是瓶颈。而且，这些牺牲是为了hsiphash()的安全性和DoS抗
|
| /linux-6.15/Documentation/security/ |
| H A D | siphash.rst | 124 HalfSipHash support is provided through the "hsiphash" family of functions.
127 Do not ever use the hsiphash functions except for as a hashtable key
133 On 64-bit kernels, the hsiphash functions actually implement SipHash-1-3, a
136 Note, this does *not* mean that in 64-bit kernels the hsiphash functions are the
137 same as the siphash ones, or that they are secure; the hsiphash functions still
141 Generating a hsiphash key
152 Using the hsiphash functions
158 u32 hsiphash(const void *data, size_t len, const hsiphash_key_t *key);
167 If you pass the generic hsiphash function something of a constant length, it
196 hsiphash() is roughly 3 times slower than jhash(). For many replacements, this
[all …]
|
| /linux-6.15/lib/tests/ |
| H A D | siphash_kunit.c | 131 chk(hsiphash(in, i, &test_key_hsiphash), in siphash_test()
134 chk(hsiphash(in_unaligned + 1, i, &test_key_hsiphash), in siphash_test()
|
| /linux-6.15/include/linux/ |
| H A D | siphash.h | 131 static inline u32 hsiphash(const void *data, size_t len, in hsiphash() function
|
| /linux-6.15/net/netfilter/ipvs/ |
| H A D | ip_vs_mh.c | 101 return hsiphash(&v, sizeof(v), key); in ip_vs_mh_hashkey()
|