Lines Matching refs:hashing

86    blocked hashing algorithms in restricted environments. ``False`` indicates
87    that the hashing algorithm is not used in a security context, e.g. as a
233 hashing. Naive algorithms such as ``sha1(password)`` are not resistant against
234 brute-force attacks. A good password hashing function must be tunable, slow, and
306 **salted hashing**, **personalization**, and **tree hashing**.
337 * *key*: key for keyed hashing (up to 64 bytes for BLAKE2b, up to 32 bytes for
340 * *salt*: salt for randomized hashing (up to 16 bytes for BLAKE2b, up to 8
366 Constructor functions also accept the following tree hashing parameters:
392 hashing.
425 Simple hashing
492 Keyed hashing
495 Keyed hashing can be used for authentication as a faster and simpler
540 Even though there's a native keyed hashing mode, BLAKE2 can, of course, be used
550 Randomized hashing
554 function. Randomized hashing is useful for protecting against collision attacks
557     Randomized hashing is designed for situations where one party, the message
568     hashing offers the signer additional protection by reducing the likelihood
572     of randomized hashing may reduce the amount of security provided by a
584     *Salted hashing* (or just hashing) with BLAKE2 or any other general-purpose
585     cryptographic hash function, such as SHA-256, is not suitable for hashing
654 Here's an example of hashing a minimal tree with two leaf nodes::