This is an automated email from the git hooks/post-receive script. p8n-guest pushed a commit to branch master in repository libsession-token-perl.
commit a7b62f5f2f6b6c543f6ef2222cffc6c9b863b434 Author: Per Carlson <pe...@hemmop.com> Date: Sat Jan 10 22:37:37 2015 +0100 Updated debian/control --- debian/control | 32 +------------------------------- 1 file changed, 1 insertion(+), 31 deletions(-) diff --git a/debian/control b/debian/control index c3d4e98..d318c68 100644 --- a/debian/control +++ b/debian/control @@ -14,37 +14,7 @@ Testsuite: autopkgtest-pkg-perl Package: libsession-token-perl Architecture: any Depends: ${misc:Depends}, ${perl:Depends}, ${shlibs:Depends} -Description: unknown +Description: Secure, efficient, simple random session token generation Session::Token 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 ISAAC-32|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. - . - Creators of server applications must choose whether a single generator will - be kept around and used to generate all tokens, or if a new Session::Token - object will be created every time a token is needed. - . - This description was automagically extracted from the module by dh-make-perl. -- Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-perl/packages/libsession-token-perl.git _______________________________________________ Pkg-perl-cvs-commits mailing list Pkg-perl-cvs-commits@lists.alioth.debian.org http://lists.alioth.debian.org/cgi-bin/mailman/listinfo/pkg-perl-cvs-commits