How to Install and Uninstall perl-Crypt-Primes.noarch Package on Fedora 35

Last updated: October 09,2024

1. Install "perl-Crypt-Primes.noarch" package

This guide let you learn how to install perl-Crypt-Primes.noarch on Fedora 35


    
        
            $
        

        
            
                sudo dnf update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf install
            
                        
                perl-Crypt-Primes.noarch
            
                    
    
    Copied

2. Uninstall "perl-Crypt-Primes.noarch" package

In this section, we are going to explain the necessary steps to uninstall perl-Crypt-Primes.noarch on Fedora 35:


    
        
            $
        

        
            
                sudo dnf remove
            
                        
                perl-Crypt-Primes.noarch
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo dnf autoremove
            
                    
    
    Copied

3. Information about the perl-Crypt-Primes.noarch package on Fedora 35

Last metadata expiration check: 5:10:43 ago on Wed Sep 7 02:25:42 2022.
Available Packages
Name : perl-Crypt-Primes
Version : 0.50
Release : 44.fc35
Architecture : noarch
Size : 126 k
Source : perl-Crypt-Primes-0.50-44.fc35.src.rpm
Repository : fedora
Summary : Provable prime number generator for cryptographic applications
URL : https://metacpan.org/release/Crypt-Primes
License : GPL+ or Artistic
Description : This module implements Ueli Maurer's algorithm for generating large provable
: primes and secure parameters for public-key cryptosystems. The generated primes
: are almost uniformly distributed over the set of primes of the specified
: bitsize and expected time for generation is less than the time required for
: generating a pseudo-prime of the same size with Miller-Rabin tests. Detailed
: description and running time analysis of the algorithm can be found in Maurer's
: paper, "Fast Generation of Prime Numbers and Secure Public-Key Cryptographic
: Parameters" (1994).