Expand description
A framework for symmetric cryptography primitives.
Structs§
- A wrapper around an array digest, with a phantom type parameter to ensure that the digest is associated with a particular field.
- A padding-free, overwrite-mode sponge function that operates natively over PF but accepts elements of F: PrimeField32.
- A padding-free, overwrite-mode sponge function.
- Serializes 32-bit field elements to bytes (i.e. the little-endian encoding of their canonical values), then hashes those bytes using some inner hasher, and outputs a
[u8; 32]
. - Serializes 64-bit field elements to bytes (i.e. the little-endian encoding of their canonical values), then hashes those bytes using some inner hasher, and outputs a
[u8; 32]
. - Serializes 32-bit field elements to u64s (packing two canonical values together), then hashes those u64s using some inner hasher, and outputs a
[u64; 4]
.
Traits§
- An
N
-to-1 compression function. - 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.
- A permutation in the mathematical sense.
- An
N
-to-1 compression function collision-resistant in a hash tree setting.