Lines Matching defs:leaf
104 * Computes a leaf from a WOTS public key using an L-tree.
106 static void l_tree(unsigned char *leaf, unsigned char *wots_pk, const xmss_params *params, const unsigned char *pub_seed, uint32_t addr[8])
141 memcpy(leaf, wots_pk, n);
145 * Computes the leaf at a given address. First generates the WOTS key pair, then computes leaf using l_tree. As this happens position independent, we only require that addr encodes the right ltree-address.
147 static void gen_leaf_wots(unsigned char *leaf, const unsigned char *sk_seed, const xmss_params *params, const unsigned char *pub_seed, uint32_t ltree_addr[8], uint32_t ots_addr[8])
155 l_tree(leaf, pk, params, pub_seed, ltree_addr);
289 * Computes a root node given a leaf and an authapth
291 static void validate_authpath(unsigned char *root, const unsigned char *leaf, unsigned long leafidx, const unsigned char *authpath, const xmss_params *params, const unsigned char *pub_seed, uint32_t addr[8])
302 buffer[n+j] = leaf[j];
308 buffer[j] = leaf[j];
375 * Updates the state (typically NEXT_i) by adding a leaf and updating the stack
376 * Returns 1 if all leaf nodes have already been processed
438 * next leaf node, using the algorithm described by Buchmann, Dahmen and Szydlo