CPC H04L 9/3239 (2013.01) [H04L 9/0643 (2013.01)] | 21 Claims |
1. A system to dynamically calculate a root hash value from a plurality of leaf hash values, the system comprising:
a flat associative memory to store said plurality of leaf hash values; and
a hash parser to extract a compressed number of branch nodes from said plurality of leaf hash values, to determine branch node relationships from said plurality of leaf hash values, and to save said compressed number of branch nodes, and said branch node relationships.
|