47 lines
2.0 KiB
Markdown
47 lines
2.0 KiB
Markdown
|
# rand_isaac
|
||
|
|
|
||
|
|
[](https://travis-ci.org/rust-lang-nursery/rand)
|
||
|
|
[](https://ci.appveyor.com/project/alexcrichton/rand)
|
||
|
|
[](https://crates.io/crates/rand_isaac)
|
||
|
|
[](https://docs.rs/rand_isaac)
|
||
|
|
[](https://github.com/rust-lang-nursery/rand#rust-version-requirements)
|
||
|
|
[](https://github.com/rust-lang-nursery/rand/tree/master/rand_isaac#license)
|
||
|
|
|
||
|
|
Implements the ISAAC and ISAAC-64 random number generators.
|
||
|
|
|
||
|
|
ISAAC stands for "Indirection, Shift, Accumulate, Add, and Count" which are
|
||
|
|
the principal bitwise operations employed. It is the most advanced of a
|
||
|
|
series of array based random number generator designed by Robert Jenkins
|
||
|
|
in 1996[^1][^2].
|
||
|
|
|
||
|
|
ISAAC is notably fast and produces excellent quality random numbers for
|
||
|
|
non-cryptographic applications.
|
||
|
|
|
||
|
|
Documentation:
|
||
|
|
[master branch](https://rust-lang-nursery.github.io/rand/rand_isaac/index.html),
|
||
|
|
[by release](https://docs.rs/rand_isaac)
|
||
|
|
|
||
|
|
[Changelog](CHANGELOG.md)
|
||
|
|
|
||
|
|
[rand]: https://crates.io/crates/rand
|
||
|
|
|
||
|
|
[^1]: Bob Jenkins, [*ISAAC: A fast cryptographic random number generator*](http://burtleburtle.net/bob/rand/isaacafa.html)
|
||
|
|
[^2]: Bob Jenkins, [*ISAAC and RC4*](http://burtleburtle.net/bob/rand/isaac.html)
|
||
|
|
|
||
|
|
|
||
|
|
## Crate Features
|
||
|
|
|
||
|
|
`rand_isaac` is `no_std` compatible. It does not require any functionality
|
||
|
|
outside of the `core` lib, thus there are no features to configure.
|
||
|
|
|
||
|
|
The `serde1` feature includes implementations of `Serialize` and `Deserialize`
|
||
|
|
for the included RNGs.
|
||
|
|
|
||
|
|
|
||
|
|
# License
|
||
|
|
|
||
|
|
`rand_isaac` is distributed under the terms of both the MIT license and the
|
||
|
|
Apache License (Version 2.0).
|
||
|
|
|
||
|
|
See [LICENSE-APACHE](LICENSE-APACHE) and [LICENSE-MIT](LICENSE-MIT) for details.
|