Search Results for "hash function"

HighwayHash is a fast, keyed hash function intended for scenarios where you need strong, DoS-resistant hashing without the full overhead of a general-purpose cryptographic hash. It’s designed to defeat hash-flooding attacks by mixing input with wide SIMD operations and a branch-free inner loop, so adversaries can’t cheaply craft many colliding keys. The implementation targets multiple CPU families with vectorized code paths while keeping a portable fallback, yielding high throughput across platforms. ...

cppcrypto provides optimized implementations of cryptographic primitives. Hash functions: BLAKE, BLAKE2, Echo, Esch, Groestl, JH, Kupyna, MD5, SHA-1, SHA-2, SHA-3, SHAKE, Skein, SM3, Streebog, Whirlpool. Block ciphers: Anubis, Aria, Camellia, CAST-256, Kalyna, Kuznyechik, Mars, Serpent, Simon, SM4, Speck, Threefish, Twofish, and Rijndael (AES) with all block/key sizes. Stream ciphers: HC-128, HC-256, Salsa20, XSalsa20, ChaCha, XChaCha. Encryption modes: CBC, CTR. AEAD modes:...

...It allows you to generate MD5 hashes from strings, arrays, ArrayBuffers, and other binary-like data types, making it useful for checksums, fingerprinting, and simple integrity checks on the client or server. The library is exposed as a plain function, so usage is as simple as calling md5(value) and receiving the 32-character hexadecimal hash. It supports multiple packaging formats, including UMD, making it easy to drop into legacy codebases as well as modern bundlers like webpack or Browserify. A comprehensive test suite and demo page are provided to validate behavior across platforms and edge cases.

...It contains the main data structures: single and double lists, special arrays (dynamic and of bits), many types of trees: multitrees, binary search trees, avl, red-black, randomized, treaps, splay and other interesting types. Several types of hash tables are implemented: separated chaining, open adressing with linear probing and double function hash; this last one has a garbage colector mechanism that allows to free deleted entries. Dynamic linear hash tables are implemented too. The main algorithms on graphs are implemented in an easy way and with good performance features. ...

...If you have special needs you can substitute your on hash calculation function for the built in one. There is also a library call that allows you to judge the efficiency of your hash function. The library has complete HTML documentation. And several tests of the library can be run with "make check".