Passphrases with the vms purdy polynomial system
use Authen::Passphrase::VMSPurdy;
$ppr = Authen::Passphrase::VMSPurdy->new(
username => "jrandom", salt => 25362,
hash_hex => "832a0c270179584a");
$ppr = Authen::Passphrase::VMSPurdy->new(
username => "jrandom", salt_random => 1,
passphrase => "passphrase");
$ppr = Authen::Passphrase::VMSPurdy->from_crypt(
'$VMS3$1263832A0C270179584AJRANDOM');
$ppr = Authen::Passphrase::VMSPurdy->from_rfc2307(
'{CRYPT}$VMS3$1263832A0C270179584AJRANDOM');
$algorithm = $ppr->algorithm;
$username = $ppr->username;
$salt = $ppr->salt;
$hash = $ppr->hash;
$hash_hex = $ppr->hash_hex;
if($ppr->match($passphrase)) { ...
$passwd = $ppr->as_crypt;
$userPassword = $ppr->as_rfc2307;
An object of this class encapsulates a passphrase hashed using one of the Purdy polynomial hash functions used in \s-1VMS\s0. This is a subclass of Authen::Passphrase, and this document assumes that the reader is familiar with the documentation for that class.
The core of the Purdy polynomial hashing algorithm transforms one 64-bit number into another 64-bit number. It was developed by George B. Purdy, and described in the paper \*(L"A High Security Log-in Procedure\*(R" which can be found at <http://portal.acm.org/citation.cfm?id=361089&dl=GUIDE&coll=ACM&CFID=15151515&CFTOKEN=6184618>.
For practical use in passphrase hashing, the Purdy polynomial must be augmented by a procedure to turn a variable-length passphrase into the initial 64-bit number to be hashed. In \s-1VMS\s0 this pre-hashing phase also incorporates the username of the account to which access is being controlled, in order to prevent identical passphrases yielding identical hashes. This is a form of salting. Another salt parameter, a 16-bit integer, is also included, this one going under the name \*(L"salt\*(R".
There are three variants of the pre-hashing algorithm. The original version, known as "\s-1PURDY\s0\*(L" and used during field testing of \s-1VMS\s0 2.0, truncates or space-pads the username to a fixed length. The second version, known as \*(R"\s-1PURDY_V\s0\*(L" and used from \s-1VMS\s0 2.0 up to (but not including) \s-1VMS\s0 5.4, properly handles the variable-length nature of the username. The third version, known as \*(R"\s-1PURDY_S\s0" and used from \s-1VMS\s0 5.4 onwards, performs some extra bit rotations to avoid aliasing problems when pre-hashing long strings. All three versions are supported by this module.
\s-1VMS\s0 heavily restricts the composition of both usernames and passphrases. They may only contain alphanumerics, "$\*(L", and \*(R"_". Case is insignificant. Usernames must be between 1 and 31 characters long, and passphrases must be between 1 and 32 characters long. This module enforces these rules. An invalid passphrase is never accepted as matching.
Generates a new passphrase recogniser object using the \s-1VMS\s0 Purdy polynomial algorithm family. The following attributes may be given:
A string indicating which variant of the algorithm is to be used. Valid values are "\s-1PURDY\s0\*(L" (the original), \*(R"\s-1PURDY_V\s0\*(L" (modified to use full length of the username), and \*(R"\s-1PURDY_S\s0\*(L" (extra rotations to avoid aliasing when processing long strings). Default \*(R"\s-1PURDY_S\s0".
A string to be used as the `username' salt parameter. It is limited to \s-1VMS\s0 username syntax.
The salt, as an integer in the range [0, 65536).
The salt, as a string of four hexadecimal digits. The first two digits must give the least-significant byte and the last two give the most-significant byte, with most-significant nybble first within each byte.
Causes salt to be generated randomly. The value given for this attribute is ignored. The source of randomness may be controlled by the facility described in Data::Entropy.
The hash, as a string of eight bytes.
The hash, as a string of 16 hexadecimal digits.
A passphrase that will be accepted. It is limited to \s-1VMS\s0 passphrase syntax.
The username and salt must be given, and either the hash or the passphrase.
Generates a new passphrase recogniser object using the \s-1VMS\s0 Purdy polynomial algorithm family, from a crypt string. The string must consist of an algorithm identifier, the salt in hexadecimal, the hash in hexadecimal, then the username. The salt must be given as four hexadecimal digits, the first two giving the least-significant byte and the last two giving the most-significant byte, with most-significant nybble first within each byte. The algorithm identifier must be "$VMS1$\*(L" for \*(R"\s-1PURDY\s0\*(L", \*(R"$VMS2$\*(L" for \*(R"\s-1PURDY_V\s0\*(L", or \*(R"$VMS3$\*(L" for \*(R"\s-1PURDY_S\s0". The whole crypt string must be uppercase.
Generates a new passphrase recogniser object using the \s-1VMS\s0 Purdy polynomial algorithm family, from an \s-1RFC\s0 2307 string. The string must consist of "{\s-1CRYPT\s0}" (case insensitive) followed by an acceptable crypt string.
Returns the algorithm variant identifier string. It may be "\s-1PURDY\s0\*(L" (the original), \*(R"\s-1PURDY_V\s0\*(L" (modified to use full length of the username), and \*(R"\s-1PURDY_S\s0" (extra rotations to avoid aliasing when processing long strings). Returns the username string. All alphabetic characters in it are uppercase, which is the canonical form. Returns the salt, as an integer. Returns the salt, as a string of four hexadecimal digits. The first two digits give the least-significant byte and the last two give the most-significant byte, with most-significant nybble first within each byte. Returns the hash value, as a string of eight bytes. Returns the hash value, as a string of 16 uppercase hexadecimal digits. These methods are part of the standard Authen::Passphrase interface.
Authen::DecHpwd, Authen::Passphrase
Andrew Main (Zefram) <[email protected]>
Copyright (C) 2006, 2007, 2009, 2010, 2012 Andrew Main (Zefram) <[email protected]>
This module is free software; you can redistribute it and/or modify it under the same terms as Perl itself.