struct pwhash [src]

A password hashing function derives a uniform key from low-entropy input material such as passwords. It is intentionally slow or expensive. With the standard definition of a key derivation function, if a key space is small, an exhaustive search may be practical. Password hashing functions make exhaustive searches way slower or way more expensive, even when implemented on GPUs and ASICs, by using different, optionally combined strategies: Requiring a lot of computation cycles to complete Requiring a lot of memory to complete Requiring multiple CPU cores to complete Requiring cache-local data to complete in reasonable time Requiring large static tables Avoiding precomputations and time/memory tradeoffs Requiring multi-party computations Combining the input material with random per-entry data (salts), application-specific contexts and keys Password hashing functions must be used whenever sensitive data has to be directly derived from a password.

Members

argon2 (struct)
bcrypt (struct)
Encoding (enum)
Error (Error Set)
HasherError (Error Set)
KdfError (Error Set)
pbkdf2 (Function)
phc_format (struct)
scrypt (struct)

Source

  pub const pwhash = struct {
    pub const Encoding = enum {
        phc,
        crypt,
    };

    pub const Error = HasherError || error{AllocatorRequired};
    pub const HasherError = KdfError || phc_format.Error;
    pub const KdfError = errors.Error || std.mem.Allocator.Error || std.Thread.SpawnError;

    pub const argon2 = @import("crypto/argon2.zig");
    pub const bcrypt = @import("crypto/bcrypt.zig");
    pub const scrypt = @import("crypto/scrypt.zig");
    pub const pbkdf2 = @import("crypto/pbkdf2.zig").pbkdf2;

    pub const phc_format = @import("crypto/phc_encoding.zig");
}  