binary hash tree

s2,2

s2,1

s2,0

s2,3

s1,0

s1,1

s0,0

s4,0

=

k0

s4,1

=

k1

s4,2

=

k2

s4,3

=

k3

s4,4

=

k4

s4,5

=

k5

s4,6

=

k6

s4,7

=

k7

s4,8

=

k8

s4,9

=

k9

s4,10

=

k10

s4,11

=

k11

s4,12

=

k12

s4,13

=

k13

s4,14

=

k14

s4,15

=

k15

b0

b1

s3,0

s3,1

s3,2

s3,3

s3,4

s3,5

s3,6

s3,7

Previous slide

Next slide

Back to first slide

View graphic version