How to Install and Uninstall perl-Math-Random-ISAAC Package on openSuSE Tumbleweed

Last updated: December 24,2024

1. Install "perl-Math-Random-ISAAC" package

In this section, we are going to explain the necessary steps to install perl-Math-Random-ISAAC on openSuSE Tumbleweed


    
        
            $
        

        
            
                sudo zypper refresh
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo zypper install
            
                        
                perl-Math-Random-ISAAC
            
                    
    
    Copied

2. Uninstall "perl-Math-Random-ISAAC" package

Please follow the guidance below to uninstall perl-Math-Random-ISAAC on openSuSE Tumbleweed:


    
        
            $
        

        
            
                sudo zypper remove
            
                        
                perl-Math-Random-ISAAC
            
                    
    
    Copied

3. Information about the perl-Math-Random-ISAAC package on openSuSE Tumbleweed

Information for package perl-Math-Random-ISAAC:
-----------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : perl-Math-Random-ISAAC
Version : 1.004-2.24
Arch : noarch
Vendor : openSUSE
Installed Size : 74.0 KiB
Installed : No
Status : not installed
Source package : perl-Math-Random-ISAAC-1.004-2.24.src
Upstream URL : http://search.cpan.org/dist/Math-Random-ISAAC
Summary : Perl interface to the ISAAC PRNG algorithm
Description :
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.
The results are uniformly distributed, unbiased, and unpredictable unless
you know the seed. The algorithm was published by Bob Jenkins in the late
90s and despite the best efforts of many security researchers, no feasible
attacks have been found to date.