[RNG-32] Implement more generators

• Type: Wish
• Status: Open
• Priority: Minor
• Resolution: Unresolved
• Labels: contributors gsoc2019 scope
• Flags: Important
• Assignee: Unassigned
• Reporter: Gilles Sadowski
• Created: 13/Dec/16 18:45
• Updated: 17/Jun/19 12:18

Description

Commons RNG is focused on pure-Java implementations of standard deterministic generators.

Quite a few algorithms could be added, but priority is on fast generators that generate sequences of pseudo-random numbers; i.e. the requirement is strong uniformity, but not strong unpredictability (a.k.a. true random numbers).
In particular, in Commons RNG, there is no provision for using an external entropy pool.

Beware that some well-known (and much used) algorithms have been proven to fail spectacularly on the uniformity requirement.

Would-be contributors should look at the commons-rng-core module for how to implement a generator, and at the commons-rng-examples module for how to test the uniformity requirement.

Issue Links

• relates to: RNG-70 xoshiro generators

Sub-Tasks

• Linear congruential generators: Open
• Lagged Fibonacci generators: Open
• PCG: Closed
• Middle Square Weyl Sequence generator: Closed