Expand description
A framework for symmetric cryptography primitives.
Structs§
- Compression
Function From Hasher - Hash
- A wrapper around an array digest, with a phantom type parameter to ensure that the digest is associated with a particular field.
- Increment
- A derangement d(x) = x + increment.
- Merkle
Cap - The Merkle cap of height
hof a Merkle tree is theh-th layer (from the root) of the tree. It can be used in place of the root to verify Merkle paths, which arehelements shorter. - Multi
Field32 Pad10 Sponge - 10-padded sponge over a large prime field, accepting 32-bit field elements as input.
- Multi
Field32 Padding Free Sponge - Padding-free sponge over a large prime field, accepting 32-bit field elements as input.
- Pad10
Sponge - An overwrite-mode sponge with 10-padding.
- Padding
Free Sponge - A padding-free, overwrite-mode sponge.
- Serializing
Hasher - Converts a hasher which can hash bytes, u32’s or u64’s into a hasher which can hash field elements.
- Truncated
Permutation
Traits§
- Compression
Function - An
N-to-1 compression function. - Cryptographic
Hasher - A generic trait for cryptographic hashers that consume an arbitrary sequence of input items and produce a fixed-size output.
- Cryptographic
Permutation - A permutation thought to be cryptographically secure, in the sense that it is thought to be difficult to distinguish (in a nontrivial way) from a random permutation.
- Derangement
- A derangement: a permutation with no fixed points (d(x) != x for all x).
- Permutation
- A permutation in the mathematical sense.
- Pseudo
Compression Function - An
N-to-1 compression function collision-resistant in a hash tree setting.