How to Install and Uninstall perl-Session-Token Package on openSuSE Tumbleweed
Last updated: December 26,2024
1. Install "perl-Session-Token" package
Please follow the steps below to install perl-Session-Token on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
perl-Session-Token
Copied
2. Uninstall "perl-Session-Token" package
This guide let you learn how to uninstall perl-Session-Token on openSuSE Tumbleweed:
$
sudo zypper remove
perl-Session-Token
Copied
3. Information about the perl-Session-Token package on openSuSE Tumbleweed
Information for package perl-Session-Token:
-------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : perl-Session-Token
Version : 1.503-1.17
Arch : x86_64
Vendor : openSUSE
Installed Size : 77.2 KiB
Installed : No
Status : not installed
Source package : perl-Session-Token-1.503-1.17.src
Upstream URL : http://search.cpan.org/dist/Session-Token/
Summary : Secure, efficient, simple random session token generation
Description :
This module provides a secure, efficient, and simple interface for creating
session tokens, password reset codes, temporary passwords, random
identifiers, and anything else you can think of.
When a Session::Token object is created, 1024 bytes are read from
'/dev/urandom' (Linux, Solaris, most BSDs), '/dev/arandom' (some older
BSDs), or Crypt::Random::Source::Strong::Win32 (Windows). These bytes are
used to seed the at http://www.burtleburtle.net/bob/rand/isaacafa.html
pseudo random number generator.
Once a generator is created, you can repeatedly call the 'get' method on
the generator object and it will return a new token each time.
*IMPORTANT*: If your application calls 'fork', make sure that any
generators are re-created in one of the processes after the fork since
forking will duplicate the generator state and both parent and child
processes will go on to produce identical tokens (just like perl's rand
after it is seeded).
After the generator context is created, no system calls are used to
generate tokens. This is one way that Session::Token helps with efficiency.
However, this is only important for certain use cases (generally not web
sessions).
ISAAC is a cryptographically secure PRNG that improves on the well-known
RC4 algorithm in some important areas. For instance, it doesn't have short
cycles or initial bias like RC4 does. A theoretical shortest possible cycle
in ISAAC is '2**40', although no cycles this short have ever been found
(and probably don't exist at all). On average, ISAAC cycles are '2**8295'.
-------------------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : perl-Session-Token
Version : 1.503-1.17
Arch : x86_64
Vendor : openSUSE
Installed Size : 77.2 KiB
Installed : No
Status : not installed
Source package : perl-Session-Token-1.503-1.17.src
Upstream URL : http://search.cpan.org/dist/Session-Token/
Summary : Secure, efficient, simple random session token generation
Description :
This module provides a secure, efficient, and simple interface for creating
session tokens, password reset codes, temporary passwords, random
identifiers, and anything else you can think of.
When a Session::Token object is created, 1024 bytes are read from
'/dev/urandom' (Linux, Solaris, most BSDs), '/dev/arandom' (some older
BSDs), or Crypt::Random::Source::Strong::Win32 (Windows). These bytes are
used to seed the at http://www.burtleburtle.net/bob/rand/isaacafa.html
pseudo random number generator.
Once a generator is created, you can repeatedly call the 'get' method on
the generator object and it will return a new token each time.
*IMPORTANT*: If your application calls 'fork', make sure that any
generators are re-created in one of the processes after the fork since
forking will duplicate the generator state and both parent and child
processes will go on to produce identical tokens (just like perl's rand
after it is seeded).
After the generator context is created, no system calls are used to
generate tokens. This is one way that Session::Token helps with efficiency.
However, this is only important for certain use cases (generally not web
sessions).
ISAAC is a cryptographically secure PRNG that improves on the well-known
RC4 algorithm in some important areas. For instance, it doesn't have short
cycles or initial bias like RC4 does. A theoretical shortest possible cycle
in ISAAC is '2**40', although no cycles this short have ever been found
(and probably don't exist at all). On average, ISAAC cycles are '2**8295'.