You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I mainly wrote this for a toy project which has by now been scraped.
When testing the code, the generated sequences "looked" random enough to me, however I never tried running it through some kind of randomness evaluator.
Internally it essentially uses a block cipher with a randomised key, however I could not find a published algorithm which supported sufficiently small / variable block sizes which is why I had to roll my own.
Where x1 and x2 are arbitrary numbers, & mask is essentially modulo 2^n and f1 and f2 are factors for which a multiplicative inverse modulo 2^n exists.
"No guarantees" is pretty discouraging... is this using a published algorithm? is there a high-level overview of what it does?
The text was updated successfully, but these errors were encountered: