public class BinaryTreeRootCalculator extends java.lang.Object implements ERSRootNodeCalculator
Constructor and Description |
---|
BinaryTreeRootCalculator() |
Modifier and Type | Method and Description |
---|---|
org.bouncycastle.asn1.tsp.PartialHashtree[] |
computePathToRoot(DigestCalculator digCalc,
org.bouncycastle.asn1.tsp.PartialHashtree node,
int index)
Calculate a path from the leaf node to the root of the last computed Merkle tree.
|
byte[] |
computeRootHash(DigestCalculator digCalc,
org.bouncycastle.asn1.tsp.PartialHashtree[] nodes)
Calculate the root hash of the Merkle tree from the partial hash-tree nodes.
|
byte[] |
recoverRootHash(DigestCalculator digCalc,
org.bouncycastle.asn1.tsp.PartialHashtree[] nodes)
Recover the root hash from a path made up of PartialHashtrees.
|
public byte[] computeRootHash(DigestCalculator digCalc, org.bouncycastle.asn1.tsp.PartialHashtree[] nodes)
ERSRootNodeCalculator
computeRootHash
in interface ERSRootNodeCalculator
digCalc
- the digest calculator to use.nodes
- the partial hash-trees forming the basis of the Merkle tree.public org.bouncycastle.asn1.tsp.PartialHashtree[] computePathToRoot(DigestCalculator digCalc, org.bouncycastle.asn1.tsp.PartialHashtree node, int index)
ERSRootNodeCalculator
computePathToRoot
in interface ERSRootNodeCalculator
digCalc
- the digest calculator to use.node
- the leaf node at the start of the path.index
- the index of the node in the original list of partial hash trees.public byte[] recoverRootHash(DigestCalculator digCalc, org.bouncycastle.asn1.tsp.PartialHashtree[] nodes)
ERSRootNodeCalculator
recoverRootHash
in interface ERSRootNodeCalculator
digCalc
- the digest calculator to use.nodes
- the partial hash-trees forming a path from a leaf to the root of the Merkle tree.