0
I Use This!
Inactive
Analyzed about 17 hours ago. based on code collected about 19 hours ago.

Project Summary

As with other Pseudo-Random Number Generator (PRNG) algorithms like the Mersenne Twister (see Math::Random::MT), this algorithm is designed to take some seed information and produce seemingly random results as output.

However, ISAAC (Indirection, Shift, Accumulate, Add, and Count) has different goals than these commonly used algorithms. In particular, it's really fast - on average, it requires only 18.75 machine cycles to generate a 32-bit value. This makes it suitable for applications where a significant amount of random data needs to be produced quickly, such solving using the Monte Carlo method or for games.

This is a Pure Perl port and Perl binding for ISAAC.

Tags

No tags have been added

Badges

In a Nutshell, Math::Random::ISAAC...

Public Domain / GPL When Compiled
Permitted
Forbidden
Required

These details are provided for information only. No information here is legal advice and should not be used as such.

Project Security

Vulnerabilities per Version ( last 10 releases )

There are no reported vulnerabilities

Project Vulnerability Report

Security Confidence Index

Poor security track-record
Favorable security track-record

Vulnerability Exposure Index

Many reported vulnerabilities
Few reported vulnerabilities

Did You Know...

  • ...
    55% of companies leverage OSS for production infrastructure
  • ...
    you can embed statistics from Open Hub on your site
  • ...
    there are over 3,000 projects on the Open Hub with security vulnerabilities reported against them
  • ...
    compare projects before you chose one to use
About Project Security

Languages

C++
73%
Perl
23%
C
4%

30 Day Summary

Dec 17 2024 — Jan 16 2025

12 Month Summary

Jan 16 2024 — Jan 16 2025

Ratings

Be the first to rate this project
Click to add your rating
  
Review this Project!