Blum-Micali construction reverse order



Hi,

I am trying to figure out why one has to output the bits in the
reverse order in the Blum-Micali pseudorandom generator construction.
I.e.
Let f be a one way function and h a hardcore predicate. Assume I want
to output 4 bits then I compute internally:
x_1=f(x)
x_2=f(x_1)
x_3=f(x_2)
x_4=f(x_3)

After that I output h(x_4), h(x_3), h(x_2), h(x_1). Why can I not just
output from left to right, i.e.: h(x_1), h(x_2), h(x_3), h(x_4)?

Thanks for your help!

.



Relevant Pages

  • Re: Blum-Micali construction reverse order
    ... reverse order in the Blum-Micali pseudorandom generator construction. ... I think some security proofs ... first reverse the output sequence before proving that it is pseudorandom. ...
    (sci.crypt)
  • Re: Blum-Micali construction reverse order
    ... reverse order in the Blum-Micali pseudorandom generator construction. ... first reverse the output sequence before proving that it is pseudorandom. ...
    (sci.crypt)
  • Re: Blum-Micali construction reverse order
    ... reverse order in the Blum-Micali pseudorandom generator construction. ... first reverse the output sequence before proving that it is pseudorandom. ...
    (sci.crypt)