Crypt-SaltedHash-0.09/0000755000077000007700000000000012176065344014103 5ustar gshankgshankCrypt-SaltedHash-0.09/Changes0000644000077000007700000000170012176065344015374 0ustar gshankgshankRevision history for Perl extension Crypt::SaltedHash. 0.09 Tue Jul 30 - add Test::Fatal test requires 0.08 Tue Jul 30 - correct version in package 0.07 Tue Jul 30 - switch to use Dist::Zilla - fix bug with failed regex and localization of $1 - handle some uninitialized variables - RT Bug #78505 for Crypt-SaltedHash: Noisy tests (Unescaped left brace in regex is deprecated) - RT Bug #85627 for Crypt-SaltedHash: [PATCH] POD fix 0.06 Sun Feb 28 01:55:22 2010 - added clear method - add returns now $self 0.05 Thu Aug 10 03:04:33 2006 - switched to Module::Build 0.04 Thu Jan 26 04:56:56 2006 - algorithm recognition fixed 0.03 Mon Nov 14 23:59:59 2005 - spelling fixed 0.02 Mon Nov 14 17:54:00 2005 - fixed some bugs; added tests and documentation 0.01 Sun Nov 13 05:41:23 2005 - original version; created by h2xs 1.23 with options -XA -n Crypt::SaltedHash Crypt-SaltedHash-0.09/dist.ini0000644000077000007700000000130712176065344015550 0ustar gshankgshankname = Crypt-SaltedHash main_module = lib/Crypt/SaltedHash.pm author = Sascha Kiefer, L license = Perl_5 copyright_holder = Sascha Kiefer copyright_year = 2013 version = 0.09 [@Git] tag_format = %v [@Basic] [MetaJSON] [MetaResources] bugtracker.web = http://rt.cpan.org/Public/Dist/Display.html?Name=Crypt-SaltedHash ; If you have a repository... repository.url = git://github.com/campus-explorer/crypt-saltedhash.git repository.web = http://github.com/campus-explorer/crypt-saltedhash repository.type = git [Prereqs] Digest = 0 [Prereqs / TestRequires] Test::More = 0 Test::Fatal = 0 Crypt-SaltedHash-0.09/lib/0000755000077000007700000000000012176065344014651 5ustar gshankgshankCrypt-SaltedHash-0.09/lib/Crypt/0000755000077000007700000000000012176065344015752 5ustar gshankgshankCrypt-SaltedHash-0.09/lib/Crypt/SaltedHash.pm0000644000077000007700000003144312176065344020335 0ustar gshankgshankpackage Crypt::SaltedHash; use strict; use MIME::Base64 (); use Digest (); use vars qw($VERSION); $VERSION = '0.09'; =encoding latin1 =head1 NAME Crypt::SaltedHash - Perl interface to functions that assist in working with salted hashes. =head1 SYNOPSIS use Crypt::SaltedHash; my $csh = Crypt::SaltedHash->new(algorithm => 'SHA-1'); $csh->add('secret'); my $salted = $csh->generate; my $valid = Crypt::SaltedHash->validate($salted, 'secret'); =head1 DESCRIPTION The C module provides an object oriented interface to create salted (or seeded) hashes of clear text data. The original formalization of this concept comes from RFC-3112 and is extended by the use of different digital agorithms. =head1 ABSTRACT =head2 Setting the data The process starts with 2 elements of data: =over =item * a clear text string (this could represent a password for instance). =item * the salt, a random seed of data. This is the value used to augment a hash in order to ensure that 2 hashes of identical data yield different output. =back For the purposes of this abstract we will analyze the steps within code that perform the necessary actions to achieve the endresult hashes. Cryptographers call this hash a digest. We will not however go into an explanation of a one-way encryption scheme. Readers of this abstract are encouraged to get information on that subject by their own. Theoretically, an implementation of a one-way function as an algorithm takes input, and provides output, that are both in binary form; realistically though digests are typically encoded and stored in a database or in a flat text or XML file. Take slappasswd5 for instance, it performs the exact functionality described above. We will use it as a black box compiled piece of code for our analysis. In pseudocode we generate a salted hash as follows: Get the source string and salt as separate binary objects Concatenate the 2 binary values Hash the concatenation into SaltedPasswordHash Base64Encode(concat(SaltedPasswordHash, Salt)) We take a clear text string and hash this into a binary object representing the hashed value of the clear text string plus the random salt. Then we have the Salt value, which are typically 4 bytes of purely random binary data represented as hexadecimal notation (Base16 as 8 bytes). Using SHA-1 as the hashing algorithm, SaltedPasswordHash is of length 20 (bytes) in raw binary form (40 bytes if we look at it in hex). Salt is then 4 bytes in raw binary form. The SHA-1 algorithm generates a 160 bit hash string. Consider that 8 bits = 1 byte. So 160 bits = 20 bytes, which is exactly what the algorithm gives us. The Base64 encoding of the binary result looks like: {SSHA}B0O0XSYdsk7g9K229ZEr73Lid7HBD9DX Take note here that the final output is a 32-byte string of data. The Base64 encoding process uses bit shifting, masking, and padding as per RFC-3548. A couple of examples of salted hashes using on the same exact clear-text string: slappasswd -s testing123 {SSHA}72uhy5xc1AWOLwmNcXALHBSzp8xt4giL slappasswd -s testing123 {SSHA}zmIAVaKMmTngrUi4UlS0dzYwVAbfBTl7 slappasswd -s testing123 {SSHA}Be3F12VVvBf9Sy6MSqpOgAdEj6JCZ+0f slappasswd -s testing123 {SSHA}ncHs4XYmQKJqL+VuyNQzQjwRXfvu6noa 4 runs of slappasswd against the same clear text string each yielded unique endresult hashes. The random salt is generated silently and never made visible. =head2 Extracting the data One of the keys to note is that the salt is dealt with twice in the process. It is used once for the actual application of randomness to the given clear text string, and then it is stored within the final output as purely Base64 encoded data. In order to perform an authentication query for instance, we must break apart the concatenation that was created for storage of the data. We accomplish this by splitting up the binary data we get after Base64 decoding the stored hash. In pseudocode we would perform the extraction and verification operations as such: Strip the hash identifier from the Digest Base64Decode(Digest, 20) Split Digest into 2 byte arrays, one for bytes 0 – 20(pwhash), one for bytes 21 – 32 (salt) Get the target string and salt as separate binary object Concatenate the 2 binary values SHA hash the concatenation into targetPasswordHash Compare targetPasswordHash with pwhash Return corresponding Boolean value Our job is to split the original digest up into 2 distinct byte arrays, one of the left 20 (0 - 20 including the null terminator) bytes and the other for the rest of the data. The left 0 – 20 bytes will represent the salted binary value we will use for a byte-by-byte data match against the new clear text presented for verification. The string presented for verification will have to be salted as well. The rest of the bytes (21 – 32) represent the random salt which when decoded will show the exact hex characters that make up the once randomly generated seed. We are now ready to verify some data. Let's start with the 4 hashes presented earlier. We will run them through our code to extract the random salt and then using that verify the clear text string hashed by slappasswd. First, let's do a verification test with an erroneous password; this should fail the matching test: {SSHA}72uhy5xc1AWOLwmNcXALHBSzp8xt4giL Test123 Hash extracted (in hex): ef6ba1cb9c5cd4058e2f098d71700b1c14b3a7cc Salt extracted (in hex): 6de2088b Hash length is: 20 Salt length is: 4 Hash presented in hex: 256bc48def0ce04b0af90dfd2808c42588bf9542 Hashes DON'T match: Test123 The match failure test was successful as expected. Now let's use known valid data through the same exact code: {SSHA}72uhy5xc1AWOLwmNcXALHBSzp8xt4giL testing123 Hash extracted (in hex): ef6ba1cb9c5cd4058e2f098d71700b1c14b3a7cc Salt extracted (in hex): 6de2088b Hash length is: 20 Salt length is: 4 Hash presented in hex: ef6ba1cb9c5cd4058e2f098d71700b1c14b3a7cc Hashes match: testing123 The process used for salted passwords should now be clear. We see that salting hashed data does indeed add another layer of security to the clear text one-way hashing process. But we also see that salted hashes should also be protected just as if the data was in clear text form. Now that we have seen salted hashes actually work you should also realize that in code it is possible to extract salt values and use them for various purposes. Obviously the usage can be on either side of the colored hat line, but the data is there. =head1 METHODS =over 4 =item B Returns a new Crypt::SaltedHash object. Possible keys for I<%options> are: =over =item * I: It's also possible to use common string representations of the algorithm (e.g. "sha256", "SHA-384"). If the argument is missing, SHA-1 will be used by default. =item * I: You can specify your on salt. You can either specify it as a sequence of charactres or as a hex encoded string of the form "HEX{...}". If the argument is missing, a random seed is provided for you (recommended). =item * I: By default, the module assumes a salt length of 4 bytes (or 8, if it is encoded in hex). If you choose a different length, you have to tell the I function how long your seed was. =back =cut sub new { my ( $class, %options ) = @_; $options{algorithm} ||= 'SHA-1'; $options{salt_len} ||= 4; $options{salt} ||= &__generate_hex_salt( $options{salt_len} * 2 ); $options{algorithm} = uc( $options{algorithm} ); $options{algorithm} .= '-1' if $options{algorithm} =~ m!SHA$!; # SHA => SHA-1, HMAC-SHA => HMAC-SHA-1 my $digest = Digest->new( $options{algorithm} ); my $self = { salt => $options{salt}, algorithm => $options{algorithm}, digest => $digest, scheme => &__make_scheme( $options{algorithm} ), }; return bless $self, $class; } =item B Logically joins the arguments into a single string, and uses it to update the current digest state. For more details see L. =cut sub add { my $self = shift; $self->obj->add(@_); return $self; } =item B Resets the digest. =cut sub clear { my $self = shift; $self->{digest} = Digest->new( $self->{algorithm} ); return $self; } =item B Returns the salt in binary form. =cut sub salt_bin { my $self = shift; return $self->{salt} =~ m!^HEX\{(.*)\}$!i ? pack( "H*", $1 ) : $self->{salt}; } =item B Returns the salt in hexadecimal form ('HEX{...}') =cut sub salt_hex { my $self = shift; return $self->{salt} =~ m!^HEX\{(.*)\}$!i ? $self->{salt} : 'HEX{' . join( '', unpack( 'H*', $self->{salt} ) ) . '}'; } =item B Generates the seeded hash. Uses the I-method of L before actually performing the digest calculation, so adding more cleardata after a call of I to an instance of I has the same effect as adding the data before the call of I. =cut sub generate { my $self = shift; my $clone = $self->obj->clone; my $salt = $self->salt_bin; $clone->add($salt); my $gen = &MIME::Base64::encode_base64( $clone->digest . $salt, '' ); my $scheme = $self->{scheme}; return "{$scheme}$gen"; } =item B Validates a hasheddata previously generated against cleardata. I<$salt_len> defaults to 4 if not set. Returns 1 if the validation is successful, 0 otherwise. =cut sub validate { my ( undef, $hasheddata, $cleardata, $salt_len ) = @_; # trim white-spaces $hasheddata =~ s!^\s+!!; $hasheddata =~ s!\s+$!!; my $scheme = &__get_pass_scheme($hasheddata); $scheme = uc( $scheme ) if $scheme; my $algorithm = &__make_algorithm($scheme); my $hash = &__get_pass_hash($hasheddata) || ''; my $salt = &__extract_salt( $hash, $salt_len ); my $obj = __PACKAGE__->new( algorithm => $algorithm, salt => $salt, salt_len => $salt_len ); $obj->add($cleardata); my $gen_hasheddata = $obj->generate; my $gen_hash = &__get_pass_hash($gen_hasheddata); return $gen_hash eq $hash; } =item B Returns a handle to L object. =cut sub obj { return shift->{digest}; } =back =head1 FUNCTIONS I =cut sub __make_scheme { my $scheme = shift; my @parts = split /-/, $scheme; pop @parts if $parts[-1] eq '1'; # SHA-1 => SHA $scheme = join '', @parts; return uc("S$scheme"); } sub __make_algorithm { my ( $algorithm ) = @_; $algorithm ||= ''; local $1; if ( $algorithm =~ m!^S(.*)$! ) { $algorithm = $1; # print STDERR "algorithm: $algorithm\n"; if ( $algorithm =~ m!([a-zA-Z]+)([0-9]+)! ) { my $name = uc($1); my $digits = $2; # print STDERR "name: $name\n"; # print STDERR "digits: $digits\n"; $name = "HMAC-$2" if $name =~ m!^HMAC(.*)$!; # HMAC-SHA-1 $digits = "-$digits" unless $name =~ m!MD$!; # MD2, MD4, MD5 $algorithm = "$name$digits"; } } return $algorithm; } sub __get_pass_scheme { local $1; return unless $_[0] =~ m/{([^}]*)/; return $1; } sub __get_pass_hash { local $1; return unless $_[0] =~ m/}(.*)/; return $1; } sub __generate_hex_salt { my @keychars = ( "0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f" ); my $length = shift || 8; my $salt = ''; my $max = scalar @keychars; for my $i ( 0 .. $length - 1 ) { my $skip = $i == 0 ? 1 : 0; # don't let the first be 0 $salt .= $keychars[ $skip + int( rand( $max - $skip ) ) ]; } return "HEX{$salt}"; } sub __extract_salt { my ( $hash, $salt_len ) = @_; my $binhash = &MIME::Base64::decode_base64($hash); my $binsalt = substr( $binhash, length($binhash) - ( $salt_len || 4 ) ); return $binsalt; } =head1 SEE ALSO L, L =head1 AUTHOR Sascha Kiefer, L =head1 ACKNOWLEDGMENTS The author is particularly grateful to Andres Andreu for his article: Salted hashes demystified - A Primer (L) =head1 COPYRIGHT AND LICENSE Copyright (C) 2010 Sascha Kiefer This library is free software; you can redistribute it and/or modify it under the same terms as Perl itself. =cut 1; Crypt-SaltedHash-0.09/LICENSE0000644000077000007700000004370312176065344015117 0ustar gshankgshankThis software is copyright (c) 2013 by Sascha Kiefer. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. Terms of the Perl programming language system itself a) the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version, or b) the "Artistic License" --- The GNU General Public License, Version 1, February 1989 --- This software is Copyright (c) 2013 by Sascha Kiefer. This is free software, licensed under: The GNU General Public License, Version 1, February 1989 GNU GENERAL PUBLIC LICENSE Version 1, February 1989 Copyright (C) 1989 Free Software Foundation, Inc. 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The license agreements of most software companies try to keep users at the mercy of those companies. By contrast, our General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. The General Public License applies to the Free Software Foundation's software and to any other program whose authors commit to using it. You can use it for your programs, too. When we speak of free software, we are referring to freedom, not price. Specifically, the General Public License is designed to make sure that you have the freedom to give away or sell copies of free software, that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of a such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must tell them their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License Agreement applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any work containing the Program or a portion of it, either verbatim or with modifications. Each licensee is addressed as "you". 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this General Public License and to the absence of any warranty; and give any other recipients of the Program a copy of this General Public License along with the Program. You may charge a fee for the physical act of transferring a copy. 2. You may modify your copy or copies of the Program or any portion of it, and copy and distribute such modifications under the terms of Paragraph 1 above, provided that you also do the following: a) cause the modified files to carry prominent notices stating that you changed the files and the date of any change; and b) cause the whole of any work that you distribute or publish, that in whole or in part contains the Program or any part thereof, either with or without modifications, to be licensed at no charge to all third parties under the terms of this General Public License (except that you may choose to grant warranty protection to some or all third parties, at your option). c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the simplest and most usual way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this General Public License. d) You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. Mere aggregation of another independent work with the Program (or its derivative) on a volume of a storage or distribution medium does not bring the other work under the scope of these terms. 3. You may copy and distribute the Program (or a portion or derivative of it, under Paragraph 2) in object code or executable form under the terms of Paragraphs 1 and 2 above provided that you also do one of the following: a) accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Paragraphs 1 and 2 above; or, b) accompany it with a written offer, valid for at least three years, to give any third party free (except for a nominal charge for the cost of distribution) a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Paragraphs 1 and 2 above; or, c) accompany it with the information you received as to where the corresponding source code may be obtained. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form alone.) Source code for a work means the preferred form of the work for making modifications to it. For an executable file, complete source code means all the source code for all modules it contains; but, as a special exception, it need not include source code for modules which are standard libraries that accompany the operating system on which the executable file runs, or for standard header files or definitions files that accompany that operating system. 4. You may not copy, modify, sublicense, distribute or transfer the Program except as expressly provided under this General Public License. Any attempt otherwise to copy, modify, sublicense, distribute or transfer the Program is void, and will automatically terminate your rights to use the Program under this License. However, parties who have received copies, or rights to use copies, from you under this General Public License will not have their licenses terminated so long as such parties remain in full compliance. 5. By copying, distributing or modifying the Program (or any work based on the Program) you indicate your acceptance of this license to do so, and all its terms and conditions. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. 7. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of the license which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the license, you may choose any version ever published by the Free Software Foundation. 8. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 9. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 10. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS Appendix: How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to humanity, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) 19yy This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 1, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program; if not, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19xx name of author Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (a program to direct compilers to make passes at assemblers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice That's all there is to it! --- The Artistic License 1.0 --- This software is Copyright (c) 2013 by Sascha Kiefer. This is free software, licensed under: The Artistic License 1.0 The Artistic License Preamble The intent of this document is to state the conditions under which a Package may be copied, such that the Copyright Holder maintains some semblance of artistic control over the development of the package, while giving the users of the package the right to use and distribute the Package in a more-or-less customary fashion, plus the right to make reasonable modifications. Definitions: - "Package" refers to the collection of files distributed by the Copyright Holder, and derivatives of that collection of files created through textual modification. - "Standard Version" refers to such a Package if it has not been modified, or has been modified in accordance with the wishes of the Copyright Holder. - "Copyright Holder" is whoever is named in the copyright or copyrights for the package. - "You" is you, if you're thinking about copying or distributing this Package. - "Reasonable copying fee" is whatever you can justify on the basis of media cost, duplication charges, time of people involved, and so on. (You will not be required to justify it to the Copyright Holder, but only to the computing community at large as a market that must bear the fee.) - "Freely Available" means that no fee is charged for the item itself, though there may be fees involved in handling the item. It also means that recipients of the item may redistribute it under the same conditions they received it. 1. You may make and give away verbatim copies of the source form of the Standard Version of this Package without restriction, provided that you duplicate all of the original copyright notices and associated disclaimers. 2. You may apply bug fixes, portability fixes and other modifications derived from the Public Domain or from the Copyright Holder. A Package modified in such a way shall still be considered the Standard Version. 3. You may otherwise modify your copy of this Package in any way, provided that you insert a prominent notice in each changed file stating how and when you changed that file, and provided that you do at least ONE of the following: a) place your modifications in the Public Domain or otherwise make them Freely Available, such as by posting said modifications to Usenet or an equivalent medium, or placing the modifications on a major archive site such as ftp.uu.net, or by allowing the Copyright Holder to include your modifications in the Standard Version of the Package. b) use the modified Package only within your corporation or organization. c) rename any non-standard executables so the names do not conflict with standard executables, which must also be provided, and provide a separate manual page for each non-standard executable that clearly documents how it differs from the Standard Version. d) make other distribution arrangements with the Copyright Holder. 4. You may distribute the programs of this Package in object code or executable form, provided that you do at least ONE of the following: a) distribute a Standard Version of the executables and library files, together with instructions (in the manual page or equivalent) on where to get the Standard Version. b) accompany the distribution with the machine-readable source of the Package with your modifications. c) accompany any non-standard executables with their corresponding Standard Version executables, giving the non-standard executables non-standard names, and clearly documenting the differences in manual pages (or equivalent), together with instructions on where to get the Standard Version. d) make other distribution arrangements with the Copyright Holder. 5. You may charge a reasonable copying fee for any distribution of this Package. You may charge any fee you choose for support of this Package. You may not charge a fee for this Package itself. However, you may distribute this Package in aggregate with other (possibly commercial) programs as part of a larger (possibly commercial) software distribution provided that you do not advertise this Package as a product of your own. 6. The scripts and library files supplied as input to or produced as output from the programs of this Package do not automatically fall under the copyright of this Package, but belong to whomever generated them, and may be sold commercially, and may be aggregated with this Package. 7. C or perl subroutines supplied by you and linked into this Package shall not be considered part of this Package. 8. The name of the Copyright Holder may not be used to endorse or promote products derived from this software without specific prior written permission. 9. THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. The End Crypt-SaltedHash-0.09/Makefile.PL0000644000077000007700000000207312176065344016057 0ustar gshankgshank use strict; use warnings; use ExtUtils::MakeMaker 6.30; my %WriteMakefileArgs = ( "ABSTRACT" => "Perl interface to functions that assist in working\r\nwith salted hashes.\r", "AUTHOR" => "Sascha Kiefer, L", "BUILD_REQUIRES" => { "Test::Fatal" => 0, "Test::More" => 0 }, "CONFIGURE_REQUIRES" => { "ExtUtils::MakeMaker" => "6.30" }, "DISTNAME" => "Crypt-SaltedHash", "EXE_FILES" => [], "LICENSE" => "perl", "NAME" => "Crypt::SaltedHash", "PREREQ_PM" => { "Digest" => 0 }, "VERSION" => "0.09", "test" => { "TESTS" => "t/*.t" } ); unless ( eval { ExtUtils::MakeMaker->VERSION(6.56) } ) { my $br = delete $WriteMakefileArgs{BUILD_REQUIRES}; my $pp = $WriteMakefileArgs{PREREQ_PM}; for my $mod ( keys %$br ) { if ( exists $pp->{$mod} ) { $pp->{$mod} = $br->{$mod} if $br->{$mod} > $pp->{$mod}; } else { $pp->{$mod} = $br->{$mod}; } } } delete $WriteMakefileArgs{CONFIGURE_REQUIRES} unless eval { ExtUtils::MakeMaker->VERSION(6.52) }; WriteMakefile(%WriteMakefileArgs); Crypt-SaltedHash-0.09/MANIFEST0000644000077000007700000000027112176065344015234 0ustar gshankgshankChanges LICENSE MANIFEST META.json META.yml Makefile.PL README dist.ini lib/Crypt/SaltedHash.pm t/01use.t t/02pod.t t/03podcoverage.t t/04Crypt-SaltedHash.t t/bug-localize-regex-vars.t Crypt-SaltedHash-0.09/META.json0000644000077000007700000000226612176065344015532 0ustar gshankgshank{ "abstract" : "Perl interface to functions that assist in working\r\nwith salted hashes.\r", "author" : [ "Sascha Kiefer, L" ], "dynamic_config" : 0, "generated_by" : "Dist::Zilla version 4.300020, CPAN::Meta::Converter version 2.120921", "license" : [ "perl_5" ], "meta-spec" : { "url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec", "version" : "2" }, "name" : "Crypt-SaltedHash", "prereqs" : { "configure" : { "requires" : { "ExtUtils::MakeMaker" : "6.30" } }, "runtime" : { "requires" : { "Digest" : "0" } }, "test" : { "requires" : { "Test::Fatal" : "0", "Test::More" : "0" } } }, "release_status" : "stable", "resources" : { "bugtracker" : { "web" : "http://rt.cpan.org/Public/Dist/Display.html?Name=Crypt-SaltedHash" }, "repository" : { "type" : "git", "url" : "git://github.com/campus-explorer/crypt-saltedhash.git", "web" : "http://github.com/campus-explorer/crypt-saltedhash" } }, "version" : "0.09" } Crypt-SaltedHash-0.09/META.yml0000644000077000007700000000122512176065344015354 0ustar gshankgshank--- abstract: "Perl interface to functions that assist in working\r\nwith salted hashes.\r" author: - 'Sascha Kiefer, L' build_requires: Test::Fatal: 0 Test::More: 0 configure_requires: ExtUtils::MakeMaker: 6.30 dynamic_config: 0 generated_by: 'Dist::Zilla version 4.300020, CPAN::Meta::Converter version 2.120921' license: perl meta-spec: url: http://module-build.sourceforge.net/META-spec-v1.4.html version: 1.4 name: Crypt-SaltedHash requires: Digest: 0 resources: bugtracker: http://rt.cpan.org/Public/Dist/Display.html?Name=Crypt-SaltedHash repository: git://github.com/campus-explorer/crypt-saltedhash.git version: 0.09 Crypt-SaltedHash-0.09/README0000644000077000007700000000052612176065344014766 0ustar gshankgshank This archive contains the distribution Crypt-SaltedHash, version 0.09: Perl interface to functions that assist in working with salted hashes. This software is copyright (c) 2013 by Sascha Kiefer. This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself. Crypt-SaltedHash-0.09/t/0000755000077000007700000000000012176065344014346 5ustar gshankgshankCrypt-SaltedHash-0.09/t/01use.t0000644000077000007700000000007112176065344015466 0ustar gshankgshankuse Test::More tests => 1; use_ok('Crypt::SaltedHash'); Crypt-SaltedHash-0.09/t/02pod.t0000644000077000007700000000027612176065344015464 0ustar gshankgshankuse Test::More; eval "use Test::Pod 1.14"; plan skip_all => 'Test::Pod 1.14 required' if $@; plan skip_all => 'set TEST_POD to enable this test' unless $ENV{TEST_POD}; all_pod_files_ok(); Crypt-SaltedHash-0.09/t/03podcoverage.t0000644000077000007700000000032512176065344017174 0ustar gshankgshankuse Test::More; eval "use Test::Pod::Coverage 1.04"; plan skip_all => 'Test::Pod::Coverage 1.04 required' if $@; plan skip_all => 'set TEST_POD to enable this test' unless $ENV{TEST_POD}; all_pod_coverage_ok(); Crypt-SaltedHash-0.09/t/04Crypt-SaltedHash.t0000644000077000007700000000324712176065344020024 0ustar gshankgshank# Before `make install' is performed this script should be runnable with # `make test'. After `make install' it should work as `perl Crypt-SaltedHash.t' ######################### # change 'tests => 1' to 'tests => last_test_to_print'; use strict; use Test::More tests => 6; BEGIN { use_ok('Crypt::SaltedHash') } ######################### my ( $csh, $salted, $valid ); my %known_salts = ( 'MD5' => '{SMD5}vfwtsKpZn1kZ5WXDKCFqUTEyMzQ=', # 'SHA-1' => '{SSHA}kRnWqCDFvZFoV7A6cTGBdq1Xv7cxMjM0', ); foreach my $alg (keys %known_salts) { $csh = Crypt::SaltedHash->new( algorithm => $alg ); $csh->add('secret'); $salted = $csh->generate; $valid = Crypt::SaltedHash->validate( $salted, 'secret' ); ok( $valid, "$alg: default test" ); $csh = Crypt::SaltedHash->new( algorithm => $alg, salt_len => 32 ); $csh->add('secret'); $salted = $csh->generate; $valid = Crypt::SaltedHash->validate( $salted, 'secret', 32 ); ok( $valid, "$alg: salt_len test" ); $csh = Crypt::SaltedHash->new( algorithm => $alg ); $csh->add('secret'); $salted = $csh->generate; $csh->add('secret'); $salted = $csh->generate; $valid = Crypt::SaltedHash->validate( $salted, 'secretsecret' ); ok( $valid, "$alg: generate test" ); $csh = Crypt::SaltedHash->new( algorithm => $alg, salt => '1234' ); $csh->add('secret'); ok( $csh->generate eq $known_salts{$alg}, "$alg: own bin-salt test" ); $csh = Crypt::SaltedHash->new( algorithm => $alg, salt => 'HEX{31323334}' ); $csh->add('secret'); ok( $csh->generate eq $known_salts{$alg}, "$alg: own hex-salt test" ); } Crypt-SaltedHash-0.09/t/bug-localize-regex-vars.t0000644000077000007700000000107612176065344021175 0ustar gshankgshankuse strict; use warnings; use Test::More; use Crypt::SaltedHash; use Test::Fatal; my $string = "+++linux"; $string =~ m/[+]*(.*)/; is $1, 'linux', '$1 set to "linux"'; my $stored_password = '$PBKDF2$HMACSHA1:1000:bHV4ZW1idXJna0tB4/Lo9MtMLaGHOtY9ig==$sUKYw9mZ66E8fLL2w01Rq2EotiY='; my $password = 'somepw'; my $return; my $lives = exception { $return = Crypt::SaltedHash->validate( $stored_password, $password, undef ) }; is $lives, undef, 'validate() lived even through non-match and $1 already set!'; ok !$return, 'validate() returns false properly'; done_testing;