Can anyone give me the answer of the following question.

Justify why Blum-Micali algorithm is deterministic algorithm ?

  • $\begingroup$ I know about deterministic, my question is why Blum-Micali algorithm is deterministic algorithm ? $\endgroup$ – Zubair Ahmed Sep 26 '18 at 19:02
  • $\begingroup$ Blum-Micali algorithm cryptographically secure pseudorandom number generator $\endgroup$ – kelalaka Sep 26 '18 at 19:09

Blum-Micali algorithm is is a cryptographically secure pseudorandom number generator.

Let $p$ be a prime, and $g$ is a primitive root mod $p$ and $x_0$ is the seed. Then, let $x_{i+1} = g^{x_i}\ \bmod{\ p} $.

The i-th output is $$ 1 \text{ if } x_i<(p−1)/2. $$ $$ 0 \text{ Otherwise}$$

Since whenever you started from the same seed, you will get the same results, so it is deterministic. There is no randomness in the calculations.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.