BHT processing efficiency

• receiver & sender:

  (mean no. of hashes per key)
  
  = (no. of branches) / (no. of leaves)
  
  = (2(D+1) - 1) / 2D < 2

• key manager:

  • it depends...
    • store all intermediate seeds, or cache & re-hash?

Previous slide

Next slide

Back to first slide

View graphic version