Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

In point 4 of the Algorithm 4.2 (Classic Merkle Tree Traversal) of *"Post_Quantum_Cryptography.pdf"* shows *"Stack_h.update(2)"* each stack receives two updates. I am trying understand to understand why there are "two updates" but I don't. There is an example on page 19 of *"Boris_Ederov.bachelor.Merkle-Tree-Traversal-Techniques.pdf"*. In that thesis, it only updates one time. For example in the step 1. Why update stack one time?

Step 1: leaf=0
"For h=0 we run 0 Stack_0.update  , which only computes P_n(3), puts it onto the stack and stops."
share|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.