Problem with gmp_randinit_set
Marco Bodrato
bodrato at mail.dm.unipi.it
Fri Mar 3 07:11:46 UTC 2017
Ciao,
Il Ven, 3 Marzo 2017 3:10 am, Pedro Gimeno ha scritto:
> Marco Bodrato wrote, On 2017-03-02 21:37:
> Just one comment. You're switching algorithms for the top half. Wouldn't
> it be easier to change the key (the k[] array) instead? That might also
> produce less correlation in the upper half, not sure. Obviously a
y = f(x), z = f^-1(x), implies y = f(f(z)). If f(x) is a "random"
permutation, f(f(x)) is less random; cycles with even order split in
shorter cycles. You are right.
I was lazy. But of course we do not need to use the same function for
randseed, and for the legacy_randseed, as I did in my code.
I vote for decryption in the main library, I like use of sum to detect the
end of the loop :-)
> Thanks for looking into this.
Best regards,
m
--
http://bodrato.it/papers/
More information about the gmp-bugs
mailing list