TreeUtil

Undocumented in source.

package

template TreeUtil (

alias hash_2n_n

H

M

) if (

is_hash_2n_n!(hash_2n_n, H) &&

2 * H.length == M.length

) {

alias hash_nodes = hash_2n_n_mask!(hash_2n_n, H, M);

H validate_authpath(H leaf, uint leafidx, H[] authpath, M[] masks);

H hash_tree(H[] leaves, M[] masks);

struct hash_stack(uint height);

}

Members

Aliases

hash_nodes alias hash_nodes = hash_2n_n_mask!(hash_2n_n, H, M): Undocumented in source.

Functions

hash_tree H hash_tree(H[] leaves, M[] masks): Calculate root hash of a L-tree or a binary tree. The number of leaves is not required to be a power of 2.
validate_authpath H validate_authpath(H leaf, uint leafidx, H[] authpath, M[] masks): Compute the root hash of a tree given a leaf and its authentication path.

Structs

hash_stack struct hash_stack(uint height): Helper struct for treehash algorithm.

Meta

Source

See Implementation

dcrypt pqc sphincs treeutil templates

TreeUtil