git ssb - Initial checkin. · dangerousbeans/%aPBe2k3ugtjBr4rrsU1…@a548e49b

Commit a548e49bf23003f0da89137eecb2a2d0779da38a

Initial checkin.

git-svn-id: http://bcrypt-ruby.rubyforge.org/svn/trunk@1 b1e0f299-433e-4bb3-9895-84128a6cfb6a

codahale committed on 2/27/2007, 7:58:30 PM

Files changed

COPYING	added
README	added
Rakefile	added
ext/bcrypt.c	added
ext/bcrypt_ext.c	added
ext/blf.h	added
ext/blowfish.c	added
ext/extconf.rb	added
lib/bcrypt.rb	added
spec/bcrypt/bcrypt_spec.rb	added
spec/bcrypt/internals_spec.rb	added
spec/bcrypt/password_spec.rb	added
spec/spec_helper.rb	added

COPYINGView
		@@ -1,0 +1,32 @@
	1 …	+Copyright 2007 Coda Hale <coda.hale@gmail.com>
	2 …	+
	3 …	+This product includes software developed by Niels Provos.
	4 …	+
	5 …	+All rights reserved.
	6 …	+
	7 …	+Redistribution and use in source and binary forms, with or without
	8 …	+modification, are permitted provided that the following conditions
	9 …	+are met:
	10 …	+1. Redistributions of source code must retain the above copyright
	11 …	+ notice, this list of conditions and the following disclaimer.
	12 …	+2. Redistributions in binary form must reproduce the above copyright
	13 …	+ notice, this list of conditions and the following disclaimer in the
	14 …	+ documentation and/or other materials provided with the distribution.
	15 …	+3. All advertising materials mentioning features or use of this software
	16 …	+ must display the following acknowledgement:
	17 …	+
	18 …	+ This product includes software developed by Niels Provos.
	19 …	+
	20 …	+4. The name of the author may not be used to endorse or promote products
	21 …	+ derived from this software without specific prior written permission.
	22 …	+
	23 …	+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
	24 …	+IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
	25 …	+OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
	26 …	+IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
	27 …	+INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
	28 …	+NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
	29 …	+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
	30 …	+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	31 …	+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
	32 …	+THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

READMEView
		@@ -1,0 +1,158 @@
	1 …	+= bcrypt-ruby
	2 …	+
	3 …	+An easy way to keep your users' passwords secure.
	4 …	+
	5 …	+== Why you should use bcrypt
	6 …	+
	7 …	+If you store user passwords in the clear, then an attacker who steals a copy of your database has a giant list of emails
	8 …	+and passwords. Some of your users will only have one password -- for their email account, for their banking account, for
	9 …	+your application. A simple hack could escalate into massive identity theft.
	10 …	+
	11 …	+It's your responsibility as a web developer to make your web application secure -- blaming your users for not being
	12 …	+security experts is not a professional response to risk.
	13 …	+
	14 …	+bcrypt allows you to easily harden your application against these kinds of attacks.
	15 …	+
	16 …	+== How to install bcrypt
	17 …	+
	18 …	+ sudo gem install bcrypt-ruby
	19 …	+
	20 …	+You'll need a working compiler. (Win32 folks should use Cygwin or um, something else.)
	21 …	+
	22 …	+== How to use bcrypt in your Rails application
	23 …	+
	24 …	+=== The +User+ model
	25 …	+
	26 …	+ require 'bcrypt'
	27 …	+
	28 …	+ class User < ActiveRecord::Base
	29 …	+ # users.hash in the database is a :string
	30 …	+ include BCrypt
	31 …	+
	32 …	+ def password
	33 …	+ @password \|\|= Password.new(hash)
	34 …	+ end
	35 …	+
	36 …	+ def password=(new_password)
	37 …	+ @password = Password.create(new_password)
	38 …	+ self.hash = @password
	39 …	+ end
	40 …	+
	41 …	+ end
	42 …	+
	43 …	+=== Creating an account
	44 …	+
	45 …	+ def create
	46 …	+ @user = User.new(params[:user])
	47 …	+ @user.password = params[:password]
	48 …	+ @user.save!
	49 …	+ end
	50 …	+
	51 …	+=== Authenticating a user
	52 …	+
	53 …	+ def login
	54 …	+ @user = User.find_by_email(params[:email])
	55 …	+ if @user.password == params[:password]
	56 …	+ give_token
	57 …	+ else
	58 …	+ redirect_to home_url
	59 …	+ end
	60 …	+ end
	61 …	+
	62 …	+=== If a user forgets their password?
	63 …	+
	64 …	+ # assign them a random one and mail it to them, asking them to change it
	65 …	+ def forgot_password
	66 …	+ @user = User.find_by_email(params[:email])
	67 …	+ random_password = Array.new(10).map { (65 + rand(58)).chr }.join
	68 …	+ @user.password = random_password
	69 …	+ @user.save!
	70 …	+ Mailer.create_and_deliver_password_change(@user, random_password)
	71 …	+ end
	72 …	+
	73 …	+== How to use bcrypt-ruby in general
	74 …	+
	75 …	+ require 'bcrypt'
	76 …	+
	77 …	+ my_password = BCrypt::Password.create("my password") #=> "$2a$10$vI8aWBnW3fID.ZQ4/zo1G.q1lRps.9cGLcZEiGDMVr5yUP1KUOYTa"
	78 …	+
	79 …	+ my_password.version #=> "2a"
	80 …	+ my_password.cost #=> 10
	81 …	+ my_password == "my password" #=> true
	82 …	+ my_password == "not my password" #=> false
	83 …	+
	84 …	+ my_password = BCrypt::Password.new("$2a$10$vI8aWBnW3fID.ZQ4/zo1G.q1lRps.9cGLcZEiGDMVr5yUP1KUOYTa")
	85 …	+ my_password == "my password" #=> true
	86 …	+ my_password == "not my password" #=> false
	87 …	+
	88 …	+Check the rdocs for more details -- BCrypt, BCrypt::Password.
	89 …	+
	90 …	+== How bcrypt() works
	91 …	+
	92 …	+bcrypt() is a hashing algorithm designed by Niels Provos and David Mazières of the OpenBSD Project.
	93 …	+
	94 …	+Hash algorithms take a chunk of data (e.g., your user's password) and create a "digital fingerprint," or hash, of it.
	95 …	+Because this process is not reversible, there's no way to go from the hash back to the password.
	96 …	+
	97 …	+In other words:
	98 …	+
	99 …	+ hash(p) #=> <unique gibberish>
	100 …	+
	101 …	+You can store the hash and check it against a hash made of a potentially valid password:
	102 …	+
	103 …	+ <unique gibberish> =? hash(just_entered_password)
	104 …	+
	105 …	+But even this has weaknesses -- attackers can just run lists of possible passwords through the same algorithm, store the
	106 …	+results in a big database, and then look up the passwords by their hash:
	107 …	+
	108 …	+ PrecomputedPassword.find_by_hash(<unique gibberish>).password #=> "secret1"
	109 …	+
	110 …	+The solution to this is to add a small chunk of random data -- called a salt -- to the password before it's hashed:
	111 …	+
	112 …	+ hash(salt + p) #=> <really unique gibberish>
	113 …	+
	114 …	+The salt is then stored along with the hash in the database, and used to check potentially valid passwords:
	115 …	+
	116 …	+ <really unique gibberish> =? hash(salt + just_entered_password)
	117 …	+
	118 …	+bcrypt-ruby automatically handles the storage and generation of these salts for you.
	119 …	+
	120 …	+Adding a salt means that an attacker has to have a gigantic database for each unique salt -- for a salt made of 4
	121 …	+letters, that's 456,976 different databases. Pretty much no one has that much storage space, so attackers try a
	122 …	+different, slower method -- throw a list of potential passwords at each individual password:
	123 …	+
	124 …	+ hash(salt + "aadvark") =? <really unique gibberish>
	125 …	+ hash(salt + "abacus") =? <really unique gibberish>
	126 …	+ etc.
	127 …	+
	128 …	+This is much slower than the big database approach, but most hash algorithms are pretty quick -- and therein lies the
	129 …	+problem. Hash algorithms aren't usually designed to be slow, they're designed to turn gigabytes of data into secure
	130 …	+fingerprints as quickly as possible. bcrypt(), though, is designed to be computationally expensive:
	131 …	+
	132 …	+ Ten thousand iterations:
	133 …	+ user system total real
	134 …	+ md5 0.070000 0.000000 0.070000 ( 0.070415)
	135 …	+ bcrypt 22.230000 0.080000 22.310000 ( 22.493822)
	136 …	+
	137 …	+If an attacker was using Ruby to check each password, they could check ~140,000 passwords a second with MD5 but only
	138 …	+~450 passwords a second with bcrypt().
	139 …	+
	140 …	+In addition, bcrypt() allows you to increase the amount of work required to hash a password as computers get faster. Old
	141 …	+passwords will still work fine, but new passwords can keep up with the times.
	142 …	+
	143 …	+bcrypt() is currently used as the default password storage hash in OpenBSD, widely regarded as the most secure operating
	144 …	+system available.
	145 …	+
	146 …	+
	147 …	+For a more technical explanation of the algorithm and its design criteria, please read Niels Provos and David Mazières'
	148 …	+Usenix99 paper:
	149 …	+http://www.usenix.org/events/usenix99/provos.html
	150 …	+
	151 …	+If you'd like more down-to-earth advice regarding cryptography, I suggest reading <i>Practical Cryptography</i> by Niels
	152 …	+Ferguson and Bruce Schneier:
	153 …	+http://www.schneier.com/book-practical.html
	154 …	+
	155 …	+= Etc
	156 …	+
	157 …	+Author :: Coda Hale <coda.hale@gmail.com>
	158 …	+Website :: http://blog.codahale.com

RakefileView
		@@ -1,0 +1,78 @@
	1 …	+gem "rspec"
	2 …	+require "spec/rake/spectask"
	3 …	+require 'rake/gempackagetask'
	4 …	+require 'rake/contrib/rubyforgepublisher'
	5 …	+require 'rake/clean'
	6 …	+require 'rake/rdoctask'
	7 …	+
	8 …	+PKG_NAME = "bcrypt-ruby"
	9 …	+PKG_VERSION = "1.0.0"
	10 …	+PKG_FILE_NAME = "#{PKG_NAME}-#{PKG_VERSION}"
	11 …	+PKG_FILES = FileList[
	12 …	+ '[A-Z]*',
	13 …	+ 'lib/*/.rb',
	14 …	+ 'spec/*/.rb',
	15 …	+ 'ext/*.c',
	16 …	+ 'ext/*.h',
	17 …	+ 'ext/*.rb'
	18 …	+]
	19 …	+
	20 …	+task :default => [:spec]
	21 …	+
	22 …	+desc "Run all specs"
	23 …	+Spec::Rake::SpecTask.new do \|t\|
	24 …	+ t.spec_files = FileList['spec/*/_spec.rb']
	25 …	+ t.spec_opts = ['--color','--backtrace','--diff']
	26 …	+ t.rcov = true
	27 …	+ t.rcov_dir = 'doc/output/coverage'
	28 …	+ t.rcov_opts = ['--exclude', 'spec\/spec,spec\/.*_spec.rb']
	29 …	+end
	30 …	+
	31 …	+desc "Run all specs and store html output in doc/output/report.html"
	32 …	+Spec::Rake::SpecTask.new('spec_html') do \|t\|
	33 …	+ t.spec_files = FileList['spec/*/_spec.rb']
	34 …	+ t.spec_opts = ['--diff','--format html','--backtrace','--out doc/output/report.html']
	35 …	+end
	36 …	+
	37 …	+desc 'Generate RDoc'
	38 …	+rd = Rake::RDocTask.new do \|rdoc\|
	39 …	+ rdoc.rdoc_dir = 'doc/output/rdoc'
	40 …	+ rdoc.options << '--title' << 'bcrypt-ruby' << '--line-numbers' << '--inline-source' << '--main' << 'README'
	41 …	+ rdoc.template = ENV['TEMPLATE'] if ENV['TEMPLATE']
	42 …	+ rdoc.rdoc_files.include('README', 'COPYING', 'lib/*/.rb')
	43 …	+end
	44 …	+
	45 …	+spec = Gem::Specification.new do \|s\|
	46 …	+ s.name = PKG_NAME
	47 …	+ s.version = PKG_VERSION
	48 …	+ s.summary = "Blah."
	49 …	+ s.description = <<-EOF
	50 …	+ Woot.
	51 …	+ EOF
	52 …	+
	53 …	+ s.files = PKG_FILES.to_a
	54 …	+ s.require_path = 'lib'
	55 …	+
	56 …	+ s.has_rdoc = true
	57 …	+ s.rdoc_options = rd.options
	58 …	+ s.extra_rdoc_files = rd.rdoc_files.to_a
	59 …	+
	60 …	+ s.extensions = FileList["ext/extconf.rb"].to_a
	61 …	+
	62 …	+ s.autorequire = 'bcrypt'
	63 …	+ s.author = ["Coda Hale"]
	64 …	+ s.email = "coda.hale@gmail.com"
	65 …	+ s.homepage = "http://bcrypt-ruby.rubyforge.org"
	66 …	+ s.rubyforge_project = "bcrypt-ruby"
	67 …	+end
	68 …	+
	69 …	+Rake::GemPackageTask.new(spec) do \|pkg\|
	70 …	+ pkg.need_zip = true
	71 …	+ pkg.need_tar = true
	72 …	+end
	73 …	+
	74 …	+task :compile do
	75 …	+ Dir.chdir('./ext')
	76 …	+ system "ruby extconf.rb"
	77 …	+ system "make"
	78 …	+end

ext/bcrypt.cView
		@@ -1,0 +1,337 @@
	1 …	+/* $OpenBSD: bcrypt.c,v 1.22 2007/02/20 01:44:16 ray Exp $ */
	2 …	+
	3 …	+/*
	4 …	+ * Modified by <coda.hale@gmail.com> on 2007-02-27:
	5 …	+ *
	6 …	+ * - Changed bcrypt_gensalt to accept a random seed as a parameter,
	7 …	+ * to remove the code's dependency on arc4random(), which isn't
	8 …	+ * available on Linux.
	9 …	+ */
	10 …	+
	11 …	+/*
	12 …	+ * Copyright 1997 Niels Provos <provos@physnet.uni-hamburg.de>
	13 …	+ * All rights reserved.
	14 …	+ *
	15 …	+ * Redistribution and use in source and binary forms, with or without
	16 …	+ * modification, are permitted provided that the following conditions
	17 …	+ * are met:
	18 …	+ * 1. Redistributions of source code must retain the above copyright
	19 …	+ * notice, this list of conditions and the following disclaimer.
	20 …	+ * 2. Redistributions in binary form must reproduce the above copyright
	21 …	+ * notice, this list of conditions and the following disclaimer in the
	22 …	+ * documentation and/or other materials provided with the distribution.
	23 …	+ * 3. All advertising materials mentioning features or use of this software
	24 …	+ * must display the following acknowledgement:
	25 …	+ * This product includes software developed by Niels Provos.
	26 …	+ * 4. The name of the author may not be used to endorse or promote products
	27 …	+ * derived from this software without specific prior written permission.
	28 …	+ *
	29 …	+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
	30 …	+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
	31 …	+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
	32 …	+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
	33 …	+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
	34 …	+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
	35 …	+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
	36 …	+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	37 …	+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
	38 …	+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	39 …	+ */
	40 …	+
	41 …	+/* This password hashing algorithm was designed by David Mazieres
	42 …	+ * <dm@lcs.mit.edu> and works as follows:
	43 …	+ *
	44 …	+ * 1. state := InitState ()
	45 …	+ * 2. state := ExpandKey (state, salt, password) 3.
	46 …	+ * REPEAT rounds:
	47 …	+ * state := ExpandKey (state, 0, salt)
	48 …	+ * state := ExpandKey(state, 0, password)
	49 …	+ * 4. ctext := "OrpheanBeholderScryDoubt"
	50 …	+ * 5. REPEAT 64:
	51 …	+ * ctext := Encrypt_ECB (state, ctext);
	52 …	+ * 6. RETURN Concatenate (salt, ctext);
	53 …	+ *
	54 …	+ */
	55 …	+
	56 …	+#if 0
	57 …	+#include <stdio.h>
	58 …	+#endif
	59 …	+
	60 …	+#include <stdio.h>
	61 …	+#include <stdlib.h>
	62 …	+#include <sys/types.h>
	63 …	+#include <string.h>
	64 …	+#include "blf.h"
	65 …	+
	66 …	+/* This implementation is adaptable to current computing power.
	67 …	+ * You can have up to 2^31 rounds which should be enough for some
	68 …	+ * time to come.
	69 …	+ */
	70 …	+
	71 …	+#define BCRYPT_VERSION '2'
	72 …	+#define BCRYPT_MAXSALT 16 /* Precomputation is just so nice */
	73 …	+#define BCRYPT_BLOCKS 6 /* Ciphertext blocks */
	74 …	+#define BCRYPT_MINROUNDS 16 /* we have log2(rounds) in salt */
	75 …	+
	76 …	+char bcrypt_gensalt(u_int8_t, u_int8_t );
	77 …	+
	78 …	+static void encode_salt(char , u_int8_t , u_int16_t, u_int8_t);
	79 …	+static void encode_base64(u_int8_t , u_int8_t , u_int16_t);
	80 …	+static void decode_base64(u_int8_t , u_int16_t, u_int8_t );
	81 …	+
	82 …	+static char encrypted[_PASSWORD_LEN];
	83 …	+static char gsalt[7 + (BCRYPT_MAXSALT * 4 + 2) / 3 + 1];
	84 …	+static char error[] = ":";
	85 …	+
	86 …	+const static u_int8_t Base64Code[] =
	87 …	+"./ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789";
	88 …	+
	89 …	+const static u_int8_t index_64[128] = {
	90 …	+ 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
	91 …	+ 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
	92 …	+ 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
	93 …	+ 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
	94 …	+ 255, 255, 255, 255, 255, 255, 0, 1, 54, 55,
	95 …	+ 56, 57, 58, 59, 60, 61, 62, 63, 255, 255,
	96 …	+ 255, 255, 255, 255, 255, 2, 3, 4, 5, 6,
	97 …	+ 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
	98 …	+ 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27,
	99 …	+ 255, 255, 255, 255, 255, 255, 28, 29, 30,
	100 …	+ 31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
	101 …	+ 41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
	102 …	+ 51, 52, 53, 255, 255, 255, 255, 255
	103 …	+};
	104 …	+#define CHAR64(c) ( (c) > 127 ? 255 : index_64[(c)])
	105 …	+
	106 …	+static void
	107 …	+decode_base64(u_int8_t buffer, u_int16_t len, u_int8_t data)
	108 …	+{
	109 …	+ u_int8_t *bp = buffer;
	110 …	+ u_int8_t *p = data;
	111 …	+ u_int8_t c1, c2, c3, c4;
	112 …	+ while (bp < buffer + len) {
	113 …	+ c1 = CHAR64(*p);
	114 …	+ c2 = CHAR64(*(p + 1));
	115 …	+
	116 …	+ /* Invalid data */
	117 …	+ if (c1 == 255 \|\| c2 == 255)
	118 …	+ break;
	119 …	+
	120 …	+ *bp++ = (c1 << 2) \| ((c2 & 0x30) >> 4);
	121 …	+ if (bp >= buffer + len)
	122 …	+ break;
	123 …	+
	124 …	+ c3 = CHAR64(*(p + 2));
	125 …	+ if (c3 == 255)
	126 …	+ break;
	127 …	+
	128 …	+ *bp++ = ((c2 & 0x0f) << 4) \| ((c3 & 0x3c) >> 2);
	129 …	+ if (bp >= buffer + len)
	130 …	+ break;
	131 …	+
	132 …	+ c4 = CHAR64(*(p + 3));
	133 …	+ if (c4 == 255)
	134 …	+ break;
	135 …	+ *bp++ = ((c3 & 0x03) << 6) \| c4;
	136 …	+
	137 …	+ p += 4;
	138 …	+ }
	139 …	+}
	140 …	+
	141 …	+static void
	142 …	+encode_salt(char salt, u_int8_t csalt, u_int16_t clen, u_int8_t logr)
	143 …	+{
	144 …	+ salt[0] = '$';
	145 …	+ salt[1] = BCRYPT_VERSION;
	146 …	+ salt[2] = 'a';
	147 …	+ salt[3] = '$';
	148 …	+
	149 …	+ snprintf(salt + 4, 4, "%2.2u$", logr);
	150 …	+
	151 …	+ encode_base64((u_int8_t *) salt + 7, csalt, clen);
	152 …	+}
	153 …	+/* Generates a salt for this version of crypt.
	154 …	+ Since versions may change. Keeping this here
	155 …	+ seems sensible.
	156 …	+ */
	157 …	+
	158 …	+char *
	159 …	+bcrypt_gensalt(u_int8_t log_rounds, u_int8_t *rseed)
	160 …	+{
	161 …	+ u_int16_t i;
	162 …	+ u_int32_t seed = 0;
	163 …	+
	164 …	+ if (log_rounds < 4)
	165 …	+ log_rounds = 4;
	166 …	+ else if (log_rounds > 31)
	167 …	+ log_rounds = 31;
	168 …	+
	169 …	+ encode_salt(gsalt, rseed, BCRYPT_MAXSALT, log_rounds);
	170 …	+ return gsalt;
	171 …	+}
	172 …	+/* We handle $Vers$log2(NumRounds)$salt+passwd$
	173 …	+ i.e. $2$04$iwouldntknowwhattosayetKdJ6iFtacBqJdKe6aW7ou */
	174 …	+
	175 …	+char *
	176 …	+bcrypt(const char key, const char salt)
	177 …	+{
	178 …	+ blf_ctx state;
	179 …	+ u_int32_t rounds, i, k;
	180 …	+ u_int16_t j;
	181 …	+ u_int8_t key_len, salt_len, logr, minor;
	182 …	+ u_int8_t ciphertext[4 * BCRYPT_BLOCKS] = "OrpheanBeholderScryDoubt";
	183 …	+ u_int8_t csalt[BCRYPT_MAXSALT];
	184 …	+ u_int32_t cdata[BCRYPT_BLOCKS];
	185 …	+ int n;
	186 …	+
	187 …	+ /* Discard "$" identifier */
	188 …	+ salt++;
	189 …	+
	190 …	+ if (*salt > BCRYPT_VERSION) {
	191 …	+ /* How do I handle errors ? Return ':' */
	192 …	+ return error;
	193 …	+ }
	194 …	+
	195 …	+ /* Check for minor versions */
	196 …	+ if (salt[1] != '$') {
	197 …	+ switch (salt[1]) {
	198 …	+ case 'a':
	199 …	+ /* 'ab' should not yield the same as 'abab' */
	200 …	+ minor = salt[1];
	201 …	+ salt++;
	202 …	+ break;
	203 …	+ default:
	204 …	+ return error;
	205 …	+ }
	206 …	+ } else
	207 …	+ minor = 0;
	208 …	+
	209 …	+ /* Discard version + "$" identifier */
	210 …	+ salt += 2;
	211 …	+
	212 …	+ if (salt[2] != '$')
	213 …	+ /* Out of sync with passwd entry */
	214 …	+ return error;
	215 …	+
	216 …	+ /* Computer power doesn't increase linear, 2^x should be fine */
	217 …	+ n = atoi(salt);
	218 …	+ if (n > 31 \|\| n < 0)
	219 …	+ return error;
	220 …	+ logr = (u_int8_t)n;
	221 …	+ if ((rounds = (u_int32_t) 1 << logr) < BCRYPT_MINROUNDS)
	222 …	+ return error;
	223 …	+
	224 …	+ /* Discard num rounds + "$" identifier */
	225 …	+ salt += 3;
	226 …	+
	227 …	+ if (strlen(salt) * 3 / 4 < BCRYPT_MAXSALT)
	228 …	+ return error;
	229 …	+
	230 …	+ /* We dont want the base64 salt but the raw data */
	231 …	+ decode_base64(csalt, BCRYPT_MAXSALT, (u_int8_t *) salt);
	232 …	+ salt_len = BCRYPT_MAXSALT;
	233 …	+ key_len = strlen(key) + (minor >= 'a' ? 1 : 0);
	234 …	+
	235 …	+ /* Setting up S-Boxes and Subkeys */
	236 …	+ Blowfish_initstate(&state);
	237 …	+ Blowfish_expandstate(&state, csalt, salt_len,
	238 …	+ (u_int8_t *) key, key_len);
	239 …	+ for (k = 0; k < rounds; k++) {
	240 …	+ Blowfish_expand0state(&state, (u_int8_t *) key, key_len);
	241 …	+ Blowfish_expand0state(&state, csalt, salt_len);
	242 …	+ }
	243 …	+
	244 …	+ /* This can be precomputed later */
	245 …	+ j = 0;
	246 …	+ for (i = 0; i < BCRYPT_BLOCKS; i++)
	247 …	+ cdata[i] = Blowfish_stream2word(ciphertext, 4 * BCRYPT_BLOCKS, &j);
	248 …	+
	249 …	+ /* Now do the encryption */
	250 …	+ for (k = 0; k < 64; k++)
	251 …	+ blf_enc(&state, cdata, BCRYPT_BLOCKS / 2);
	252 …	+
	253 …	+ for (i = 0; i < BCRYPT_BLOCKS; i++) {
	254 …	+ ciphertext[4 * i + 3] = cdata[i] & 0xff;
	255 …	+ cdata[i] = cdata[i] >> 8;
	256 …	+ ciphertext[4 * i + 2] = cdata[i] & 0xff;
	257 …	+ cdata[i] = cdata[i] >> 8;
	258 …	+ ciphertext[4 * i + 1] = cdata[i] & 0xff;
	259 …	+ cdata[i] = cdata[i] >> 8;
	260 …	+ ciphertext[4 * i + 0] = cdata[i] & 0xff;
	261 …	+ }
	262 …	+
	263 …	+
	264 …	+ i = 0;
	265 …	+ encrypted[i++] = '$';
	266 …	+ encrypted[i++] = BCRYPT_VERSION;
	267 …	+ if (minor)
	268 …	+ encrypted[i++] = minor;
	269 …	+ encrypted[i++] = '$';
	270 …	+
	271 …	+ snprintf(encrypted + i, 4, "%2.2u$", logr);
	272 …	+
	273 …	+ encode_base64((u_int8_t *) encrypted + i + 3, csalt, BCRYPT_MAXSALT);
	274 …	+ encode_base64((u_int8_t *) encrypted + strlen(encrypted), ciphertext,
	275 …	+ 4 * BCRYPT_BLOCKS - 1);
	276 …	+ return encrypted;
	277 …	+}
	278 …	+
	279 …	+static void
	280 …	+encode_base64(u_int8_t buffer, u_int8_t data, u_int16_t len)
	281 …	+{
	282 …	+ u_int8_t *bp = buffer;
	283 …	+ u_int8_t *p = data;
	284 …	+ u_int8_t c1, c2;
	285 …	+ while (p < data + len) {
	286 …	+ c1 = *p++;
	287 …	+ *bp++ = Base64Code[(c1 >> 2)];
	288 …	+ c1 = (c1 & 0x03) << 4;
	289 …	+ if (p >= data + len) {
	290 …	+ *bp++ = Base64Code[c1];
	291 …	+ break;
	292 …	+ }
	293 …	+ c2 = *p++;
	294 …	+ c1 \|= (c2 >> 4) & 0x0f;
	295 …	+ *bp++ = Base64Code[c1];
	296 …	+ c1 = (c2 & 0x0f) << 2;
	297 …	+ if (p >= data + len) {
	298 …	+ *bp++ = Base64Code[c1];
	299 …	+ break;
	300 …	+ }
	301 …	+ c2 = *p++;
	302 …	+ c1 \|= (c2 >> 6) & 0x03;
	303 …	+ *bp++ = Base64Code[c1];
	304 …	+ *bp++ = Base64Code[c2 & 0x3f];
	305 …	+ }
	306 …	+ *bp = '\0';
	307 …	+}
	308 …	+#if 0
	309 …	+void
	310 …	+main()
	311 …	+{
	312 …	+ char blubber[73];
	313 …	+ char salt[100];
	314 …	+ char *p;
	315 …	+ salt[0] = '$';
	316 …	+ salt[1] = BCRYPT_VERSION;
	317 …	+ salt[2] = '$';
	318 …	+
	319 …	+ snprintf(salt + 3, 4, "%2.2u$", 5);
	320 …	+
	321 …	+ printf("24 bytes of salt: ");
	322 …	+ fgets(salt + 6, sizeof(salt) - 6, stdin);
	323 …	+ salt[99] = 0;
	324 …	+ printf("72 bytes of password: ");
	325 …	+ fpurge(stdin);
	326 …	+ fgets(blubber, sizeof(blubber), stdin);
	327 …	+ blubber[72] = 0;
	328 …	+
	329 …	+ p = crypt(blubber, salt);
	330 …	+ printf("Passwd entry: %s\n\n", p);
	331 …	+
	332 …	+ p = bcrypt_gensalt(5);
	333 …	+ printf("Generated salt: %s\n", p);
	334 …	+ p = crypt(blubber, p);
	335 …	+ printf("Passwd entry: %s\n", p);
	336 …	+}
	337 …	+#endif

ext/bcrypt_ext.cView
		@@ -1,0 +1,25 @@
	1 …	+#include "ruby.h"
	2 …	+
	3 …	+VALUE mBCrypt;
	4 …	+VALUE mBCryptInternals;
	5 …	+
	6 …	+/* Given a logarithmic cost parameter, generates a salt for use with +bc_crypt+.
	7 …	+ */
	8 …	+static VALUE bc_salt(VALUE self, VALUE cost, VALUE seed) {
	9 …	+ return rb_str_new2((char *)bcrypt_gensalt(NUM2INT(cost), RSTRING(seed)->ptr));
	10 …	+}
	11 …	+
	12 …	+/* Given a secret and a salt, generates a salted hash (which you can then store safely).
	13 …	+ */
	14 …	+static VALUE bc_crypt(VALUE self, VALUE key, VALUE salt) {
	15 …	+ return rb_str_new2((char *)bcrypt(RSTRING(key)->ptr, RSTRING(salt)->ptr));
	16 …	+}
	17 …	+
	18 …	+/* Create the BCrypt and BCrypt::Internals modules, and populate them with methods. */
	19 …	+void Init_bcrypt_ext(){
	20 …	+ mBCrypt = rb_define_module("BCrypt");
	21 …	+ mBCryptInternals = rb_define_module_under(mBCrypt, "Internals");
	22 …	+
	23 …	+ rb_define_method(mBCryptInternals, "__bc_salt", bc_salt, 2);
	24 …	+ rb_define_method(mBCryptInternals, "__bc_crypt", bc_crypt, 2);
	25 …	+}

ext/blf.hView
		@@ -1,0 +1,84 @@
	1 …	+/* $OpenBSD: blf.h,v 1.6 2002/02/16 21:27:17 millert Exp $ */
	2 …	+/*
	3 …	+ * Blowfish - a fast block cipher designed by Bruce Schneier
	4 …	+ *
	5 …	+ * Copyright 1997 Niels Provos <provos@physnet.uni-hamburg.de>
	6 …	+ * All rights reserved.
	7 …	+ *
	8 …	+ * Redistribution and use in source and binary forms, with or without
	9 …	+ * modification, are permitted provided that the following conditions
	10 …	+ * are met:
	11 …	+ * 1. Redistributions of source code must retain the above copyright
	12 …	+ * notice, this list of conditions and the following disclaimer.
	13 …	+ * 2. Redistributions in binary form must reproduce the above copyright
	14 …	+ * notice, this list of conditions and the following disclaimer in the
	15 …	+ * documentation and/or other materials provided with the distribution.
	16 …	+ * 3. All advertising materials mentioning features or use of this software
	17 …	+ * must display the following acknowledgement:
	18 …	+ * This product includes software developed by Niels Provos.
	19 …	+ * 4. The name of the author may not be used to endorse or promote products
	20 …	+ * derived from this software without specific prior written permission.
	21 …	+ *
	22 …	+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
	23 …	+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
	24 …	+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
	25 …	+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
	26 …	+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
	27 …	+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
	28 …	+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
	29 …	+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	30 …	+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
	31 …	+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	32 …	+ */
	33 …	+
	34 …	+#ifndef _BLF_H_
	35 …	+#define _BLF_H_
	36 …	+
	37 …	+// Imported from pwd.h. <coda.hale@gmail.com>
	38 …	+#define _PASSWORD_LEN 128 /* max length, not counting NUL */
	39 …	+
	40 …	+/* Schneier specifies a maximum key length of 56 bytes.
	41 …	+ * This ensures that every key bit affects every cipher
	42 …	+ * bit. However, the subkeys can hold up to 72 bytes.
	43 …	+ * Warning: For normal blowfish encryption only 56 bytes
	44 …	+ * of the key affect all cipherbits.
	45 …	+ */
	46 …	+
	47 …	+#define BLF_N 16 /* Number of Subkeys */
	48 …	+#define BLF_MAXKEYLEN ((BLF_N-2)4) / 448 bits */
	49 …	+
	50 …	+/* Blowfish context */
	51 …	+typedef struct BlowfishContext {
	52 …	+ u_int32_t S[4][256]; /* S-Boxes */
	53 …	+ u_int32_t P[BLF_N + 2]; /* Subkeys */
	54 …	+} blf_ctx;
	55 …	+
	56 …	+/* Raw access to customized Blowfish
	57 …	+ * blf_key is just:
	58 …	+ * Blowfish_initstate( state )
	59 …	+ * Blowfish_expand0state( state, key, keylen )
	60 …	+ */
	61 …	+
	62 …	+void Blowfish_encipher(blf_ctx , u_int32_t , u_int32_t *);
	63 …	+void Blowfish_decipher(blf_ctx , u_int32_t , u_int32_t *);
	64 …	+void Blowfish_initstate(blf_ctx *);
	65 …	+void Blowfish_expand0state(blf_ctx , const u_int8_t , u_int16_t);
	66 …	+void Blowfish_expandstate
	67 …	+(blf_ctx , const u_int8_t , u_int16_t, const u_int8_t *, u_int16_t);
	68 …	+
	69 …	+/* Standard Blowfish */
	70 …	+
	71 …	+void blf_key(blf_ctx , const u_int8_t , u_int16_t);
	72 …	+void blf_enc(blf_ctx , u_int32_t , u_int16_t);
	73 …	+void blf_dec(blf_ctx , u_int32_t , u_int16_t);
	74 …	+
	75 …	+void blf_ecb_encrypt(blf_ctx , u_int8_t , u_int32_t);
	76 …	+void blf_ecb_decrypt(blf_ctx , u_int8_t , u_int32_t);
	77 …	+
	78 …	+void blf_cbc_encrypt(blf_ctx , u_int8_t , u_int8_t *, u_int32_t);
	79 …	+void blf_cbc_decrypt(blf_ctx , u_int8_t , u_int8_t *, u_int32_t);
	80 …	+
	81 …	+/* Converts u_int8_t to u_int32_t */
	82 …	+u_int32_t Blowfish_stream2word(const u_int8_t , u_int16_t , u_int16_t );
	83 …	+
	84 …	+#endif

ext/blowfish.cView
		@@ -1,0 +1,685 @@
	1 …	+/* $OpenBSD: blowfish.c,v 1.18 2004/11/02 17:23:26 hshoexer Exp $ */
	2 …	+/*
	3 …	+ * Blowfish block cipher for OpenBSD
	4 …	+ * Copyright 1997 Niels Provos <provos@physnet.uni-hamburg.de>
	5 …	+ * All rights reserved.
	6 …	+ *
	7 …	+ * Implementation advice by David Mazieres <dm@lcs.mit.edu>.
	8 …	+ *
	9 …	+ * Redistribution and use in source and binary forms, with or without
	10 …	+ * modification, are permitted provided that the following conditions
	11 …	+ * are met:
	12 …	+ * 1. Redistributions of source code must retain the above copyright
	13 …	+ * notice, this list of conditions and the following disclaimer.
	14 …	+ * 2. Redistributions in binary form must reproduce the above copyright
	15 …	+ * notice, this list of conditions and the following disclaimer in the
	16 …	+ * documentation and/or other materials provided with the distribution.
	17 …	+ * 3. All advertising materials mentioning features or use of this software
	18 …	+ * must display the following acknowledgement:
	19 …	+ * This product includes software developed by Niels Provos.
	20 …	+ * 4. The name of the author may not be used to endorse or promote products
	21 …	+ * derived from this software without specific prior written permission.
	22 …	+ *
	23 …	+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
	24 …	+ * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
	25 …	+ * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
	26 …	+ * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
	27 …	+ * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
	28 …	+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
	29 …	+ * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
	30 …	+ * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
	31 …	+ * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
	32 …	+ * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
	33 …	+ */
	34 …	+
	35 …	+/*
	36 …	+ * This code is derived from section 14.3 and the given source
	37 …	+ * in section V of Applied Cryptography, second edition.
	38 …	+ * Blowfish is an unpatented fast block cipher designed by
	39 …	+ * Bruce Schneier.
	40 …	+ */
	41 …	+
	42 …	+#if 0
	43 …	+#include <stdio.h> /* used for debugging */
	44 …	+#include <string.h>
	45 …	+#endif
	46 …	+
	47 …	+#include <sys/types.h>
	48 …	+#include "blf.h"
	49 …	+
	50 …	+#undef inline
	51 …	+#ifdef __GNUC__
	52 …	+#define inline __inline
	53 …	+#else /* !__GNUC__ */
	54 …	+#define inline
	55 …	+#endif /* !__GNUC__ */
	56 …	+
	57 …	+/* Function for Feistel Networks */
	58 …	+
	59 …	+#define F(s, x) ((((s)[ (((x)>>24)&0xFF)] \
	60 …	+ + (s)[0x100 + (((x)>>16)&0xFF)]) \
	61 …	+ ^ (s)[0x200 + (((x)>> 8)&0xFF)]) \
	62 …	+ + (s)[0x300 + ( (x) &0xFF)])
	63 …	+
	64 …	+#define BLFRND(s,p,i,j,n) (i ^= F(s,j) ^ (p)[n])
	65 …	+
	66 …	+void
	67 …	+Blowfish_encipher(blf_ctx c, u_int32_t xl, u_int32_t *xr)
	68 …	+{
	69 …	+ u_int32_t Xl;
	70 …	+ u_int32_t Xr;
	71 …	+ u_int32_t *s = c->S[0];
	72 …	+ u_int32_t *p = c->P;
	73 …	+
	74 …	+ Xl = *xl;
	75 …	+ Xr = *xr;
	76 …	+
	77 …	+ Xl ^= p[0];
	78 …	+ BLFRND(s, p, Xr, Xl, 1); BLFRND(s, p, Xl, Xr, 2);
	79 …	+ BLFRND(s, p, Xr, Xl, 3); BLFRND(s, p, Xl, Xr, 4);
	80 …	+ BLFRND(s, p, Xr, Xl, 5); BLFRND(s, p, Xl, Xr, 6);
	81 …	+ BLFRND(s, p, Xr, Xl, 7); BLFRND(s, p, Xl, Xr, 8);
	82 …	+ BLFRND(s, p, Xr, Xl, 9); BLFRND(s, p, Xl, Xr, 10);
	83 …	+ BLFRND(s, p, Xr, Xl, 11); BLFRND(s, p, Xl, Xr, 12);
	84 …	+ BLFRND(s, p, Xr, Xl, 13); BLFRND(s, p, Xl, Xr, 14);
	85 …	+ BLFRND(s, p, Xr, Xl, 15); BLFRND(s, p, Xl, Xr, 16);
	86 …	+
	87 …	+ *xl = Xr ^ p[17];
	88 …	+ *xr = Xl;
	89 …	+}
	90 …	+
	91 …	+void
	92 …	+Blowfish_decipher(blf_ctx c, u_int32_t xl, u_int32_t *xr)
	93 …	+{
	94 …	+ u_int32_t Xl;
	95 …	+ u_int32_t Xr;
	96 …	+ u_int32_t *s = c->S[0];
	97 …	+ u_int32_t *p = c->P;
	98 …	+
	99 …	+ Xl = *xl;
	100 …	+ Xr = *xr;
	101 …	+
	102 …	+ Xl ^= p[17];
	103 …	+ BLFRND(s, p, Xr, Xl, 16); BLFRND(s, p, Xl, Xr, 15);
	104 …	+ BLFRND(s, p, Xr, Xl, 14); BLFRND(s, p, Xl, Xr, 13);
	105 …	+ BLFRND(s, p, Xr, Xl, 12); BLFRND(s, p, Xl, Xr, 11);
	106 …	+ BLFRND(s, p, Xr, Xl, 10); BLFRND(s, p, Xl, Xr, 9);
	107 …	+ BLFRND(s, p, Xr, Xl, 8); BLFRND(s, p, Xl, Xr, 7);
	108 …	+ BLFRND(s, p, Xr, Xl, 6); BLFRND(s, p, Xl, Xr, 5);
	109 …	+ BLFRND(s, p, Xr, Xl, 4); BLFRND(s, p, Xl, Xr, 3);
	110 …	+ BLFRND(s, p, Xr, Xl, 2); BLFRND(s, p, Xl, Xr, 1);
	111 …	+
	112 …	+ *xl = Xr ^ p[0];
	113 …	+ *xr = Xl;
	114 …	+}
	115 …	+
	116 …	+void
	117 …	+Blowfish_initstate(blf_ctx *c)
	118 …	+{
	119 …	+ /* P-box and S-box tables initialized with digits of Pi */
	120 …	+
	121 …	+ static const blf_ctx initstate =
	122 …	+ { {
	123 …	+ {
	124 …	+ 0xd1310ba6, 0x98dfb5ac, 0x2ffd72db, 0xd01adfb7,
	125 …	+ 0xb8e1afed, 0x6a267e96, 0xba7c9045, 0xf12c7f99,
	126 …	+ 0x24a19947, 0xb3916cf7, 0x0801f2e2, 0x858efc16,
	127 …	+ 0x636920d8, 0x71574e69, 0xa458fea3, 0xf4933d7e,
	128 …	+ 0x0d95748f, 0x728eb658, 0x718bcd58, 0x82154aee,
	129 …	+ 0x7b54a41d, 0xc25a59b5, 0x9c30d539, 0x2af26013,
	130 …	+ 0xc5d1b023, 0x286085f0, 0xca417918, 0xb8db38ef,
	131 …	+ 0x8e79dcb0, 0x603a180e, 0x6c9e0e8b, 0xb01e8a3e,
	132 …	+ 0xd71577c1, 0xbd314b27, 0x78af2fda, 0x55605c60,
	133 …	+ 0xe65525f3, 0xaa55ab94, 0x57489862, 0x63e81440,
	134 …	+ 0x55ca396a, 0x2aab10b6, 0xb4cc5c34, 0x1141e8ce,
	135 …	+ 0xa15486af, 0x7c72e993, 0xb3ee1411, 0x636fbc2a,
	136 …	+ 0x2ba9c55d, 0x741831f6, 0xce5c3e16, 0x9b87931e,
	137 …	+ 0xafd6ba33, 0x6c24cf5c, 0x7a325381, 0x28958677,
	138 …	+ 0x3b8f4898, 0x6b4bb9af, 0xc4bfe81b, 0x66282193,
	139 …	+ 0x61d809cc, 0xfb21a991, 0x487cac60, 0x5dec8032,
	140 …	+ 0xef845d5d, 0xe98575b1, 0xdc262302, 0xeb651b88,
	141 …	+ 0x23893e81, 0xd396acc5, 0x0f6d6ff3, 0x83f44239,
	142 …	+ 0x2e0b4482, 0xa4842004, 0x69c8f04a, 0x9e1f9b5e,
	143 …	+ 0x21c66842, 0xf6e96c9a, 0x670c9c61, 0xabd388f0,
	144 …	+ 0x6a51a0d2, 0xd8542f68, 0x960fa728, 0xab5133a3,
	145 …	+ 0x6eef0b6c, 0x137a3be4, 0xba3bf050, 0x7efb2a98,
	146 …	+ 0xa1f1651d, 0x39af0176, 0x66ca593e, 0x82430e88,
	147 …	+ 0x8cee8619, 0x456f9fb4, 0x7d84a5c3, 0x3b8b5ebe,
	148 …	+ 0xe06f75d8, 0x85c12073, 0x401a449f, 0x56c16aa6,
	149 …	+ 0x4ed3aa62, 0x363f7706, 0x1bfedf72, 0x429b023d,
	150 …	+ 0x37d0d724, 0xd00a1248, 0xdb0fead3, 0x49f1c09b,
	151 …	+ 0x075372c9, 0x80991b7b, 0x25d479d8, 0xf6e8def7,
	152 …	+ 0xe3fe501a, 0xb6794c3b, 0x976ce0bd, 0x04c006ba,
	153 …	+ 0xc1a94fb6, 0x409f60c4, 0x5e5c9ec2, 0x196a2463,
	154 …	+ 0x68fb6faf, 0x3e6c53b5, 0x1339b2eb, 0x3b52ec6f,
	155 …	+ 0x6dfc511f, 0x9b30952c, 0xcc814544, 0xaf5ebd09,
	156 …	+ 0xbee3d004, 0xde334afd, 0x660f2807, 0x192e4bb3,
	157 …	+ 0xc0cba857, 0x45c8740f, 0xd20b5f39, 0xb9d3fbdb,
	158 …	+ 0x5579c0bd, 0x1a60320a, 0xd6a100c6, 0x402c7279,
	159 …	+ 0x679f25fe, 0xfb1fa3cc, 0x8ea5e9f8, 0xdb3222f8,
	160 …	+ 0x3c7516df, 0xfd616b15, 0x2f501ec8, 0xad0552ab,
	161 …	+ 0x323db5fa, 0xfd238760, 0x53317b48, 0x3e00df82,
	162 …	+ 0x9e5c57bb, 0xca6f8ca0, 0x1a87562e, 0xdf1769db,
	163 …	+ 0xd542a8f6, 0x287effc3, 0xac6732c6, 0x8c4f5573,
	164 …	+ 0x695b27b0, 0xbbca58c8, 0xe1ffa35d, 0xb8f011a0,
	165 …	+ 0x10fa3d98, 0xfd2183b8, 0x4afcb56c, 0x2dd1d35b,
	166 …	+ 0x9a53e479, 0xb6f84565, 0xd28e49bc, 0x4bfb9790,
	167 …	+ 0xe1ddf2da, 0xa4cb7e33, 0x62fb1341, 0xcee4c6e8,
	168 …	+ 0xef20cada, 0x36774c01, 0xd07e9efe, 0x2bf11fb4,
	169 …	+ 0x95dbda4d, 0xae909198, 0xeaad8e71, 0x6b93d5a0,
	170 …	+ 0xd08ed1d0, 0xafc725e0, 0x8e3c5b2f, 0x8e7594b7,
	171 …	+ 0x8ff6e2fb, 0xf2122b64, 0x8888b812, 0x900df01c,
	172 …	+ 0x4fad5ea0, 0x688fc31c, 0xd1cff191, 0xb3a8c1ad,
	173 …	+ 0x2f2f2218, 0xbe0e1777, 0xea752dfe, 0x8b021fa1,
	174 …	+ 0xe5a0cc0f, 0xb56f74e8, 0x18acf3d6, 0xce89e299,
	175 …	+ 0xb4a84fe0, 0xfd13e0b7, 0x7cc43b81, 0xd2ada8d9,
	176 …	+ 0x165fa266, 0x80957705, 0x93cc7314, 0x211a1477,
	177 …	+ 0xe6ad2065, 0x77b5fa86, 0xc75442f5, 0xfb9d35cf,
	178 …	+ 0xebcdaf0c, 0x7b3e89a0, 0xd6411bd3, 0xae1e7e49,
	179 …	+ 0x00250e2d, 0x2071b35e, 0x226800bb, 0x57b8e0af,
	180 …	+ 0x2464369b, 0xf009b91e, 0x5563911d, 0x59dfa6aa,
	181 …	+ 0x78c14389, 0xd95a537f, 0x207d5ba2, 0x02e5b9c5,
	182 …	+ 0x83260376, 0x6295cfa9, 0x11c81968, 0x4e734a41,
	183 …	+ 0xb3472dca, 0x7b14a94a, 0x1b510052, 0x9a532915,
	184 …	+ 0xd60f573f, 0xbc9bc6e4, 0x2b60a476, 0x81e67400,
	185 …	+ 0x08ba6fb5, 0x571be91f, 0xf296ec6b, 0x2a0dd915,
	186 …	+ 0xb6636521, 0xe7b9f9b6, 0xff34052e, 0xc5855664,
	187 …	+ 0x53b02d5d, 0xa99f8fa1, 0x08ba4799, 0x6e85076a},
	188 …	+ {
	189 …	+ 0x4b7a70e9, 0xb5b32944, 0xdb75092e, 0xc4192623,
	190 …	+ 0xad6ea6b0, 0x49a7df7d, 0x9cee60b8, 0x8fedb266,
	191 …	+ 0xecaa8c71, 0x699a17ff, 0x5664526c, 0xc2b19ee1,
	192 …	+ 0x193602a5, 0x75094c29, 0xa0591340, 0xe4183a3e,
	193 …	+ 0x3f54989a, 0x5b429d65, 0x6b8fe4d6, 0x99f73fd6,
	194 …	+ 0xa1d29c07, 0xefe830f5, 0x4d2d38e6, 0xf0255dc1,
	195 …	+ 0x4cdd2086, 0x8470eb26, 0x6382e9c6, 0x021ecc5e,
	196 …	+ 0x09686b3f, 0x3ebaefc9, 0x3c971814, 0x6b6a70a1,
	197 …	+ 0x687f3584, 0x52a0e286, 0xb79c5305, 0xaa500737,
	198 …	+ 0x3e07841c, 0x7fdeae5c, 0x8e7d44ec, 0x5716f2b8,
	199 …	+ 0xb03ada37, 0xf0500c0d, 0xf01c1f04, 0x0200b3ff,
	200 …	+ 0xae0cf51a, 0x3cb574b2, 0x25837a58, 0xdc0921bd,
	201 …	+ 0xd19113f9, 0x7ca92ff6, 0x94324773, 0x22f54701,
	202 …	+ 0x3ae5e581, 0x37c2dadc, 0xc8b57634, 0x9af3dda7,
	203 …	+ 0xa9446146, 0x0fd0030e, 0xecc8c73e, 0xa4751e41,
	204 …	+ 0xe238cd99, 0x3bea0e2f, 0x3280bba1, 0x183eb331,
	205 …	+ 0x4e548b38, 0x4f6db908, 0x6f420d03, 0xf60a04bf,
	206 …	+ 0x2cb81290, 0x24977c79, 0x5679b072, 0xbcaf89af,
	207 …	+ 0xde9a771f, 0xd9930810, 0xb38bae12, 0xdccf3f2e,
	208 …	+ 0x5512721f, 0x2e6b7124, 0x501adde6, 0x9f84cd87,
	209 …	+ 0x7a584718, 0x7408da17, 0xbc9f9abc, 0xe94b7d8c,
	210 …	+ 0xec7aec3a, 0xdb851dfa, 0x63094366, 0xc464c3d2,
	211 …	+ 0xef1c1847, 0x3215d908, 0xdd433b37, 0x24c2ba16,
	212 …	+ 0x12a14d43, 0x2a65c451, 0x50940002, 0x133ae4dd,
	213 …	+ 0x71dff89e, 0x10314e55, 0x81ac77d6, 0x5f11199b,
	214 …	+ 0x043556f1, 0xd7a3c76b, 0x3c11183b, 0x5924a509,
	215 …	+ 0xf28fe6ed, 0x97f1fbfa, 0x9ebabf2c, 0x1e153c6e,
	216 …	+ 0x86e34570, 0xeae96fb1, 0x860e5e0a, 0x5a3e2ab3,
	217 …	+ 0x771fe71c, 0x4e3d06fa, 0x2965dcb9, 0x99e71d0f,
	218 …	+ 0x803e89d6, 0x5266c825, 0x2e4cc978, 0x9c10b36a,
	219 …	+ 0xc6150eba, 0x94e2ea78, 0xa5fc3c53, 0x1e0a2df4,
	220 …	+ 0xf2f74ea7, 0x361d2b3d, 0x1939260f, 0x19c27960,
	221 …	+ 0x5223a708, 0xf71312b6, 0xebadfe6e, 0xeac31f66,
	222 …	+ 0xe3bc4595, 0xa67bc883, 0xb17f37d1, 0x018cff28,
	223 …	+ 0xc332ddef, 0xbe6c5aa5, 0x65582185, 0x68ab9802,
	224 …	+ 0xeecea50f, 0xdb2f953b, 0x2aef7dad, 0x5b6e2f84,
	225 …	+ 0x1521b628, 0x29076170, 0xecdd4775, 0x619f1510,
	226 …	+ 0x13cca830, 0xeb61bd96, 0x0334fe1e, 0xaa0363cf,
	227 …	+ 0xb5735c90, 0x4c70a239, 0xd59e9e0b, 0xcbaade14,
	228 …	+ 0xeecc86bc, 0x60622ca7, 0x9cab5cab, 0xb2f3846e,
	229 …	+ 0x648b1eaf, 0x19bdf0ca, 0xa02369b9, 0x655abb50,
	230 …	+ 0x40685a32, 0x3c2ab4b3, 0x319ee9d5, 0xc021b8f7,
	231 …	+ 0x9b540b19, 0x875fa099, 0x95f7997e, 0x623d7da8,
	232 …	+ 0xf837889a, 0x97e32d77, 0x11ed935f, 0x16681281,
	233 …	+ 0x0e358829, 0xc7e61fd6, 0x96dedfa1, 0x7858ba99,
	234 …	+ 0x57f584a5, 0x1b227263, 0x9b83c3ff, 0x1ac24696,
	235 …	+ 0xcdb30aeb, 0x532e3054, 0x8fd948e4, 0x6dbc3128,
	236 …	+ 0x58ebf2ef, 0x34c6ffea, 0xfe28ed61, 0xee7c3c73,
	237 …	+ 0x5d4a14d9, 0xe864b7e3, 0x42105d14, 0x203e13e0,
	238 …	+ 0x45eee2b6, 0xa3aaabea, 0xdb6c4f15, 0xfacb4fd0,
	239 …	+ 0xc742f442, 0xef6abbb5, 0x654f3b1d, 0x41cd2105,
	240 …	+ 0xd81e799e, 0x86854dc7, 0xe44b476a, 0x3d816250,
	241 …	+ 0xcf62a1f2, 0x5b8d2646, 0xfc8883a0, 0xc1c7b6a3,
	242 …	+ 0x7f1524c3, 0x69cb7492, 0x47848a0b, 0x5692b285,
	243 …	+ 0x095bbf00, 0xad19489d, 0x1462b174, 0x23820e00,
	244 …	+ 0x58428d2a, 0x0c55f5ea, 0x1dadf43e, 0x233f7061,
	245 …	+ 0x3372f092, 0x8d937e41, 0xd65fecf1, 0x6c223bdb,
	246 …	+ 0x7cde3759, 0xcbee7460, 0x4085f2a7, 0xce77326e,
	247 …	+ 0xa6078084, 0x19f8509e, 0xe8efd855, 0x61d99735,
	248 …	+ 0xa969a7aa, 0xc50c06c2, 0x5a04abfc, 0x800bcadc,
	249 …	+ 0x9e447a2e, 0xc3453484, 0xfdd56705, 0x0e1e9ec9,
	250 …	+ 0xdb73dbd3, 0x105588cd, 0x675fda79, 0xe3674340,
	251 …	+ 0xc5c43465, 0x713e38d8, 0x3d28f89e, 0xf16dff20,
	252 …	+ 0x153e21e7, 0x8fb03d4a, 0xe6e39f2b, 0xdb83adf7},
	253 …	+ {
	254 …	+ 0xe93d5a68, 0x948140f7, 0xf64c261c, 0x94692934,
	255 …	+ 0x411520f7, 0x7602d4f7, 0xbcf46b2e, 0xd4a20068,
	256 …	+ 0xd4082471, 0x3320f46a, 0x43b7d4b7, 0x500061af,
	257 …	+ 0x1e39f62e, 0x97244546, 0x14214f74, 0xbf8b8840,
	258 …	+ 0x4d95fc1d, 0x96b591af, 0x70f4ddd3, 0x66a02f45,
	259 …	+ 0xbfbc09ec, 0x03bd9785, 0x7fac6dd0, 0x31cb8504,
	260 …	+ 0x96eb27b3, 0x55fd3941, 0xda2547e6, 0xabca0a9a,
	261 …	+ 0x28507825, 0x530429f4, 0x0a2c86da, 0xe9b66dfb,
	262 …	+ 0x68dc1462, 0xd7486900, 0x680ec0a4, 0x27a18dee,
	263 …	+ 0x4f3ffea2, 0xe887ad8c, 0xb58ce006, 0x7af4d6b6,
	264 …	+ 0xaace1e7c, 0xd3375fec, 0xce78a399, 0x406b2a42,
	265 …	+ 0x20fe9e35, 0xd9f385b9, 0xee39d7ab, 0x3b124e8b,
	266 …	+ 0x1dc9faf7, 0x4b6d1856, 0x26a36631, 0xeae397b2,
	267 …	+ 0x3a6efa74, 0xdd5b4332, 0x6841e7f7, 0xca7820fb,
	268 …	+ 0xfb0af54e, 0xd8feb397, 0x454056ac, 0xba489527,
	269 …	+ 0x55533a3a, 0x20838d87, 0xfe6ba9b7, 0xd096954b,
	270 …	+ 0x55a867bc, 0xa1159a58, 0xcca92963, 0x99e1db33,
	271 …	+ 0xa62a4a56, 0x3f3125f9, 0x5ef47e1c, 0x9029317c,
	272 …	+ 0xfdf8e802, 0x04272f70, 0x80bb155c, 0x05282ce3,
	273 …	+ 0x95c11548, 0xe4c66d22, 0x48c1133f, 0xc70f86dc,
	274 …	+ 0x07f9c9ee, 0x41041f0f, 0x404779a4, 0x5d886e17,
	275 …	+ 0x325f51eb, 0xd59bc0d1, 0xf2bcc18f, 0x41113564,
	276 …	+ 0x257b7834, 0x602a9c60, 0xdff8e8a3, 0x1f636c1b,
	277 …	+ 0x0e12b4c2, 0x02e1329e, 0xaf664fd1, 0xcad18115,
	278 …	+ 0x6b2395e0, 0x333e92e1, 0x3b240b62, 0xeebeb922,
	279 …	+ 0x85b2a20e, 0xe6ba0d99, 0xde720c8c, 0x2da2f728,
	280 …	+ 0xd0127845, 0x95b794fd, 0x647d0862, 0xe7ccf5f0,
	281 …	+ 0x5449a36f, 0x877d48fa, 0xc39dfd27, 0xf33e8d1e,
	282 …	+ 0x0a476341, 0x992eff74, 0x3a6f6eab, 0xf4f8fd37,
	283 …	+ 0xa812dc60, 0xa1ebddf8, 0x991be14c, 0xdb6e6b0d,
	284 …	+ 0xc67b5510, 0x6d672c37, 0x2765d43b, 0xdcd0e804,
	285 …	+ 0xf1290dc7, 0xcc00ffa3, 0xb5390f92, 0x690fed0b,
	286 …	+ 0x667b9ffb, 0xcedb7d9c, 0xa091cf0b, 0xd9155ea3,
	287 …	+ 0xbb132f88, 0x515bad24, 0x7b9479bf, 0x763bd6eb,
	288 …	+ 0x37392eb3, 0xcc115979, 0x8026e297, 0xf42e312d,
	289 …	+ 0x6842ada7, 0xc66a2b3b, 0x12754ccc, 0x782ef11c,
	290 …	+ 0x6a124237, 0xb79251e7, 0x06a1bbe6, 0x4bfb6350,
	291 …	+ 0x1a6b1018, 0x11caedfa, 0x3d25bdd8, 0xe2e1c3c9,
	292 …	+ 0x44421659, 0x0a121386, 0xd90cec6e, 0xd5abea2a,
	293 …	+ 0x64af674e, 0xda86a85f, 0xbebfe988, 0x64e4c3fe,
	294 …	+ 0x9dbc8057, 0xf0f7c086, 0x60787bf8, 0x6003604d,
	295 …	+ 0xd1fd8346, 0xf6381fb0, 0x7745ae04, 0xd736fccc,
	296 …	+ 0x83426b33, 0xf01eab71, 0xb0804187, 0x3c005e5f,
	297 …	+ 0x77a057be, 0xbde8ae24, 0x55464299, 0xbf582e61,
	298 …	+ 0x4e58f48f, 0xf2ddfda2, 0xf474ef38, 0x8789bdc2,
	299 …	+ 0x5366f9c3, 0xc8b38e74, 0xb475f255, 0x46fcd9b9,
	300 …	+ 0x7aeb2661, 0x8b1ddf84, 0x846a0e79, 0x915f95e2,
	301 …	+ 0x466e598e, 0x20b45770, 0x8cd55591, 0xc902de4c,
	302 …	+ 0xb90bace1, 0xbb8205d0, 0x11a86248, 0x7574a99e,
	303 …	+ 0xb77f19b6, 0xe0a9dc09, 0x662d09a1, 0xc4324633,
	304 …	+ 0xe85a1f02, 0x09f0be8c, 0x4a99a025, 0x1d6efe10,
	305 …	+ 0x1ab93d1d, 0x0ba5a4df, 0xa186f20f, 0x2868f169,
	306 …	+ 0xdcb7da83, 0x573906fe, 0xa1e2ce9b, 0x4fcd7f52,
	307 …	+ 0x50115e01, 0xa70683fa, 0xa002b5c4, 0x0de6d027,
	308 …	+ 0x9af88c27, 0x773f8641, 0xc3604c06, 0x61a806b5,
	309 …	+ 0xf0177a28, 0xc0f586e0, 0x006058aa, 0x30dc7d62,
	310 …	+ 0x11e69ed7, 0x2338ea63, 0x53c2dd94, 0xc2c21634,
	311 …	+ 0xbbcbee56, 0x90bcb6de, 0xebfc7da1, 0xce591d76,
	312 …	+ 0x6f05e409, 0x4b7c0188, 0x39720a3d, 0x7c927c24,
	313 …	+ 0x86e3725f, 0x724d9db9, 0x1ac15bb4, 0xd39eb8fc,
	314 …	+ 0xed545578, 0x08fca5b5, 0xd83d7cd3, 0x4dad0fc4,
	315 …	+ 0x1e50ef5e, 0xb161e6f8, 0xa28514d9, 0x6c51133c,
	316 …	+ 0x6fd5c7e7, 0x56e14ec4, 0x362abfce, 0xddc6c837,
	317 …	+ 0xd79a3234, 0x92638212, 0x670efa8e, 0x406000e0},
	318 …	+ {
	319 …	+ 0x3a39ce37, 0xd3faf5cf, 0xabc27737, 0x5ac52d1b,
	320 …	+ 0x5cb0679e, 0x4fa33742, 0xd3822740, 0x99bc9bbe,
	321 …	+ 0xd5118e9d, 0xbf0f7315, 0xd62d1c7e, 0xc700c47b,
	322 …	+ 0xb78c1b6b, 0x21a19045, 0xb26eb1be, 0x6a366eb4,
	323 …	+ 0x5748ab2f, 0xbc946e79, 0xc6a376d2, 0x6549c2c8,
	324 …	+ 0x530ff8ee, 0x468dde7d, 0xd5730a1d, 0x4cd04dc6,
	325 …	+ 0x2939bbdb, 0xa9ba4650, 0xac9526e8, 0xbe5ee304,
	326 …	+ 0xa1fad5f0, 0x6a2d519a, 0x63ef8ce2, 0x9a86ee22,
	327 …	+ 0xc089c2b8, 0x43242ef6, 0xa51e03aa, 0x9cf2d0a4,
	328 …	+ 0x83c061ba, 0x9be96a4d, 0x8fe51550, 0xba645bd6,
	329 …	+ 0x2826a2f9, 0xa73a3ae1, 0x4ba99586, 0xef5562e9,
	330 …	+ 0xc72fefd3, 0xf752f7da, 0x3f046f69, 0x77fa0a59,
	331 …	+ 0x80e4a915, 0x87b08601, 0x9b09e6ad, 0x3b3ee593,
	332 …	+ 0xe990fd5a, 0x9e34d797, 0x2cf0b7d9, 0x022b8b51,
	333 …	+ 0x96d5ac3a, 0x017da67d, 0xd1cf3ed6, 0x7c7d2d28,
	334 …	+ 0x1f9f25cf, 0xadf2b89b, 0x5ad6b472, 0x5a88f54c,
	335 …	+ 0xe029ac71, 0xe019a5e6, 0x47b0acfd, 0xed93fa9b,
	336 …	+ 0xe8d3c48d, 0x283b57cc, 0xf8d56629, 0x79132e28,
	337 …	+ 0x785f0191, 0xed756055, 0xf7960e44, 0xe3d35e8c,
	338 …	+ 0x15056dd4, 0x88f46dba, 0x03a16125, 0x0564f0bd,
	339 …	+ 0xc3eb9e15, 0x3c9057a2, 0x97271aec, 0xa93a072a,
	340 …	+ 0x1b3f6d9b, 0x1e6321f5, 0xf59c66fb, 0x26dcf319,
	341 …	+ 0x7533d928, 0xb155fdf5, 0x03563482, 0x8aba3cbb,
	342 …	+ 0x28517711, 0xc20ad9f8, 0xabcc5167, 0xccad925f,
	343 …	+ 0x4de81751, 0x3830dc8e, 0x379d5862, 0x9320f991,
	344 …	+ 0xea7a90c2, 0xfb3e7bce, 0x5121ce64, 0x774fbe32,
	345 …	+ 0xa8b6e37e, 0xc3293d46, 0x48de5369, 0x6413e680,
	346 …	+ 0xa2ae0810, 0xdd6db224, 0x69852dfd, 0x09072166,
	347 …	+ 0xb39a460a, 0x6445c0dd, 0x586cdecf, 0x1c20c8ae,
	348 …	+ 0x5bbef7dd, 0x1b588d40, 0xccd2017f, 0x6bb4e3bb,
	349 …	+ 0xdda26a7e, 0x3a59ff45, 0x3e350a44, 0xbcb4cdd5,
	350 …	+ 0x72eacea8, 0xfa6484bb, 0x8d6612ae, 0xbf3c6f47,
	351 …	+ 0xd29be463, 0x542f5d9e, 0xaec2771b, 0xf64e6370,
	352 …	+ 0x740e0d8d, 0xe75b1357, 0xf8721671, 0xaf537d5d,
	353 …	+ 0x4040cb08, 0x4eb4e2cc, 0x34d2466a, 0x0115af84,
	354 …	+ 0xe1b00428, 0x95983a1d, 0x06b89fb4, 0xce6ea048,
	355 …	+ 0x6f3f3b82, 0x3520ab82, 0x011a1d4b, 0x277227f8,
	356 …	+ 0x611560b1, 0xe7933fdc, 0xbb3a792b, 0x344525bd,
	357 …	+ 0xa08839e1, 0x51ce794b, 0x2f32c9b7, 0xa01fbac9,
	358 …	+ 0xe01cc87e, 0xbcc7d1f6, 0xcf0111c3, 0xa1e8aac7,
	359 …	+ 0x1a908749, 0xd44fbd9a, 0xd0dadecb, 0xd50ada38,
	360 …	+ 0x0339c32a, 0xc6913667, 0x8df9317c, 0xe0b12b4f,
	361 …	+ 0xf79e59b7, 0x43f5bb3a, 0xf2d519ff, 0x27d9459c,
	362 …	+ 0xbf97222c, 0x15e6fc2a, 0x0f91fc71, 0x9b941525,
	363 …	+ 0xfae59361, 0xceb69ceb, 0xc2a86459, 0x12baa8d1,
	364 …	+ 0xb6c1075e, 0xe3056a0c, 0x10d25065, 0xcb03a442,
	365 …	+ 0xe0ec6e0e, 0x1698db3b, 0x4c98a0be, 0x3278e964,
	366 …	+ 0x9f1f9532, 0xe0d392df, 0xd3a0342b, 0x8971f21e,
	367 …	+ 0x1b0a7441, 0x4ba3348c, 0xc5be7120, 0xc37632d8,
	368 …	+ 0xdf359f8d, 0x9b992f2e, 0xe60b6f47, 0x0fe3f11d,
	369 …	+ 0xe54cda54, 0x1edad891, 0xce6279cf, 0xcd3e7e6f,
	370 …	+ 0x1618b166, 0xfd2c1d05, 0x848fd2c5, 0xf6fb2299,
	371 …	+ 0xf523f357, 0xa6327623, 0x93a83531, 0x56cccd02,
	372 …	+ 0xacf08162, 0x5a75ebb5, 0x6e163697, 0x88d273cc,
	373 …	+ 0xde966292, 0x81b949d0, 0x4c50901b, 0x71c65614,
	374 …	+ 0xe6c6c7bd, 0x327a140a, 0x45e1d006, 0xc3f27b9a,
	375 …	+ 0xc9aa53fd, 0x62a80f00, 0xbb25bfe2, 0x35bdd2f6,
	376 …	+ 0x71126905, 0xb2040222, 0xb6cbcf7c, 0xcd769c2b,
	377 …	+ 0x53113ec0, 0x1640e3d3, 0x38abbd60, 0x2547adf0,
	378 …	+ 0xba38209c, 0xf746ce76, 0x77afa1c5, 0x20756060,
	379 …	+ 0x85cbfe4e, 0x8ae88dd8, 0x7aaaf9b0, 0x4cf9aa7e,
	380 …	+ 0x1948c25c, 0x02fb8a8c, 0x01c36ae4, 0xd6ebe1f9,
	381 …	+ 0x90d4f869, 0xa65cdea0, 0x3f09252d, 0xc208e69f,
	382 …	+ 0xb74e6132, 0xce77e25b, 0x578fdfe3, 0x3ac372e6}
	383 …	+ },
	384 …	+ {
	385 …	+ 0x243f6a88, 0x85a308d3, 0x13198a2e, 0x03707344,
	386 …	+ 0xa4093822, 0x299f31d0, 0x082efa98, 0xec4e6c89,
	387 …	+ 0x452821e6, 0x38d01377, 0xbe5466cf, 0x34e90c6c,
	388 …	+ 0xc0ac29b7, 0xc97c50dd, 0x3f84d5b5, 0xb5470917,
	389 …	+ 0x9216d5d9, 0x8979fb1b
	390 …	+ } };
	391 …	+
	392 …	+ *c = initstate;
	393 …	+}
	394 …	+
	395 …	+u_int32_t
	396 …	+Blowfish_stream2word(const u_int8_t *data, u_int16_t databytes,
	397 …	+ u_int16_t *current)
	398 …	+{
	399 …	+ u_int8_t i;
	400 …	+ u_int16_t j;
	401 …	+ u_int32_t temp;
	402 …	+
	403 …	+ temp = 0x00000000;
	404 …	+ j = *current;
	405 …	+
	406 …	+ for (i = 0; i < 4; i++, j++) {
	407 …	+ if (j >= databytes)
	408 …	+ j = 0;
	409 …	+ temp = (temp << 8) \| data[j];
	410 …	+ }
	411 …	+
	412 …	+ *current = j;
	413 …	+ return temp;
	414 …	+}
	415 …	+
	416 …	+void
	417 …	+Blowfish_expand0state(blf_ctx c, const u_int8_t key, u_int16_t keybytes)
	418 …	+{
	419 …	+ u_int16_t i;
	420 …	+ u_int16_t j;
	421 …	+ u_int16_t k;
	422 …	+ u_int32_t temp;
	423 …	+ u_int32_t datal;
	424 …	+ u_int32_t datar;
	425 …	+
	426 …	+ j = 0;
	427 …	+ for (i = 0; i < BLF_N + 2; i++) {
	428 …	+ /* Extract 4 int8 to 1 int32 from keystream */
	429 …	+ temp = Blowfish_stream2word(key, keybytes, &j);
	430 …	+ c->P[i] = c->P[i] ^ temp;
	431 …	+ }
	432 …	+
	433 …	+ j = 0;
	434 …	+ datal = 0x00000000;
	435 …	+ datar = 0x00000000;
	436 …	+ for (i = 0; i < BLF_N + 2; i += 2) {
	437 …	+ Blowfish_encipher(c, &datal, &datar);
	438 …	+
	439 …	+ c->P[i] = datal;
	440 …	+ c->P[i + 1] = datar;
	441 …	+ }
	442 …	+
	443 …	+ for (i = 0; i < 4; i++) {
	444 …	+ for (k = 0; k < 256; k += 2) {
	445 …	+ Blowfish_encipher(c, &datal, &datar);
	446 …	+
	447 …	+ c->S[i][k] = datal;
	448 …	+ c->S[i][k + 1] = datar;
	449 …	+ }
	450 …	+ }
	451 …	+}
	452 …	+
	453 …	+
	454 …	+void
	455 …	+Blowfish_expandstate(blf_ctx c, const u_int8_t data, u_int16_t databytes,
	456 …	+ const u_int8_t *key, u_int16_t keybytes)
	457 …	+{
	458 …	+ u_int16_t i;
	459 …	+ u_int16_t j;
	460 …	+ u_int16_t k;
	461 …	+ u_int32_t temp;
	462 …	+ u_int32_t datal;
	463 …	+ u_int32_t datar;
	464 …	+
	465 …	+ j = 0;
	466 …	+ for (i = 0; i < BLF_N + 2; i++) {
	467 …	+ /* Extract 4 int8 to 1 int32 from keystream */
	468 …	+ temp = Blowfish_stream2word(key, keybytes, &j);
	469 …	+ c->P[i] = c->P[i] ^ temp;
	470 …	+ }
	471 …	+
	472 …	+ j = 0;
	473 …	+ datal = 0x00000000;
	474 …	+ datar = 0x00000000;
	475 …	+ for (i = 0; i < BLF_N + 2; i += 2) {
	476 …	+ datal ^= Blowfish_stream2word(data, databytes, &j);
	477 …	+ datar ^= Blowfish_stream2word(data, databytes, &j);
	478 …	+ Blowfish_encipher(c, &datal, &datar);
	479 …	+
	480 …	+ c->P[i] = datal;
	481 …	+ c->P[i + 1] = datar;
	482 …	+ }
	483 …	+
	484 …	+ for (i = 0; i < 4; i++) {
	485 …	+ for (k = 0; k < 256; k += 2) {
	486 …	+ datal ^= Blowfish_stream2word(data, databytes, &j);
	487 …	+ datar ^= Blowfish_stream2word(data, databytes, &j);
	488 …	+ Blowfish_encipher(c, &datal, &datar);
	489 …	+
	490 …	+ c->S[i][k] = datal;
	491 …	+ c->S[i][k + 1] = datar;
	492 …	+ }
	493 …	+ }
	494 …	+
	495 …	+}
	496 …	+
	497 …	+void
	498 …	+blf_key(blf_ctx c, const u_int8_t k, u_int16_t len)
	499 …	+{
	500 …	+ /* Initialize S-boxes and subkeys with Pi */
	501 …	+ Blowfish_initstate(c);
	502 …	+
	503 …	+ /* Transform S-boxes and subkeys with key */
	504 …	+ Blowfish_expand0state(c, k, len);
	505 …	+}
	506 …	+
	507 …	+void
	508 …	+blf_enc(blf_ctx c, u_int32_t data, u_int16_t blocks)
	509 …	+{
	510 …	+ u_int32_t *d;
	511 …	+ u_int16_t i;
	512 …	+
	513 …	+ d = data;
	514 …	+ for (i = 0; i < blocks; i++) {
	515 …	+ Blowfish_encipher(c, d, d + 1);
	516 …	+ d += 2;
	517 …	+ }
	518 …	+}
	519 …	+
	520 …	+void
	521 …	+blf_dec(blf_ctx c, u_int32_t data, u_int16_t blocks)
	522 …	+{
	523 …	+ u_int32_t *d;
	524 …	+ u_int16_t i;
	525 …	+
	526 …	+ d = data;
	527 …	+ for (i = 0; i < blocks; i++) {
	528 …	+ Blowfish_decipher(c, d, d + 1);
	529 …	+ d += 2;
	530 …	+ }
	531 …	+}
	532 …	+
	533 …	+void
	534 …	+blf_ecb_encrypt(blf_ctx c, u_int8_t data, u_int32_t len)
	535 …	+{
	536 …	+ u_int32_t l, r;
	537 …	+ u_int32_t i;
	538 …	+
	539 …	+ for (i = 0; i < len; i += 8) {
	540 …	+ l = data[0] << 24 \| data[1] << 16 \| data[2] << 8 \| data[3];
	541 …	+ r = data[4] << 24 \| data[5] << 16 \| data[6] << 8 \| data[7];
	542 …	+ Blowfish_encipher(c, &l, &r);
	543 …	+ data[0] = l >> 24 & 0xff;
	544 …	+ data[1] = l >> 16 & 0xff;
	545 …	+ data[2] = l >> 8 & 0xff;
	546 …	+ data[3] = l & 0xff;
	547 …	+ data[4] = r >> 24 & 0xff;
	548 …	+ data[5] = r >> 16 & 0xff;
	549 …	+ data[6] = r >> 8 & 0xff;
	550 …	+ data[7] = r & 0xff;
	551 …	+ data += 8;
	552 …	+ }
	553 …	+}
	554 …	+
	555 …	+void
	556 …	+blf_ecb_decrypt(blf_ctx c, u_int8_t data, u_int32_t len)
	557 …	+{
	558 …	+ u_int32_t l, r;
	559 …	+ u_int32_t i;
	560 …	+
	561 …	+ for (i = 0; i < len; i += 8) {
	562 …	+ l = data[0] << 24 \| data[1] << 16 \| data[2] << 8 \| data[3];
	563 …	+ r = data[4] << 24 \| data[5] << 16 \| data[6] << 8 \| data[7];
	564 …	+ Blowfish_decipher(c, &l, &r);
	565 …	+ data[0] = l >> 24 & 0xff;
	566 …	+ data[1] = l >> 16 & 0xff;
	567 …	+ data[2] = l >> 8 & 0xff;
	568 …	+ data[3] = l & 0xff;
	569 …	+ data[4] = r >> 24 & 0xff;
	570 …	+ data[5] = r >> 16 & 0xff;
	571 …	+ data[6] = r >> 8 & 0xff;
	572 …	+ data[7] = r & 0xff;
	573 …	+ data += 8;
	574 …	+ }
	575 …	+}
	576 …	+
	577 …	+void
	578 …	+blf_cbc_encrypt(blf_ctx c, u_int8_t iv, u_int8_t *data, u_int32_t len)
	579 …	+{
	580 …	+ u_int32_t l, r;
	581 …	+ u_int32_t i, j;
	582 …	+
	583 …	+ for (i = 0; i < len; i += 8) {
	584 …	+ for (j = 0; j < 8; j++)
	585 …	+ data[j] ^= iv[j];
	586 …	+ l = data[0] << 24 \| data[1] << 16 \| data[2] << 8 \| data[3];
	587 …	+ r = data[4] << 24 \| data[5] << 16 \| data[6] << 8 \| data[7];
	588 …	+ Blowfish_encipher(c, &l, &r);
	589 …	+ data[0] = l >> 24 & 0xff;
	590 …	+ data[1] = l >> 16 & 0xff;
	591 …	+ data[2] = l >> 8 & 0xff;
	592 …	+ data[3] = l & 0xff;
	593 …	+ data[4] = r >> 24 & 0xff;
	594 …	+ data[5] = r >> 16 & 0xff;
	595 …	+ data[6] = r >> 8 & 0xff;
	596 …	+ data[7] = r & 0xff;
	597 …	+ iv = data;
	598 …	+ data += 8;
	599 …	+ }
	600 …	+}
	601 …	+
	602 …	+void
	603 …	+blf_cbc_decrypt(blf_ctx c, u_int8_t iva, u_int8_t *data, u_int32_t len)
	604 …	+{
	605 …	+ u_int32_t l, r;
	606 …	+ u_int8_t *iv;
	607 …	+ u_int32_t i, j;
	608 …	+
	609 …	+ iv = data + len - 16;
	610 …	+ data = data + len - 8;
	611 …	+ for (i = len - 8; i >= 8; i -= 8) {
	612 …	+ l = data[0] << 24 \| data[1] << 16 \| data[2] << 8 \| data[3];
	613 …	+ r = data[4] << 24 \| data[5] << 16 \| data[6] << 8 \| data[7];
	614 …	+ Blowfish_decipher(c, &l, &r);
	615 …	+ data[0] = l >> 24 & 0xff;
	616 …	+ data[1] = l >> 16 & 0xff;
	617 …	+ data[2] = l >> 8 & 0xff;
	618 …	+ data[3] = l & 0xff;
	619 …	+ data[4] = r >> 24 & 0xff;
	620 …	+ data[5] = r >> 16 & 0xff;
	621 …	+ data[6] = r >> 8 & 0xff;
	622 …	+ data[7] = r & 0xff;
	623 …	+ for (j = 0; j < 8; j++)
	624 …	+ data[j] ^= iv[j];
	625 …	+ iv -= 8;
	626 …	+ data -= 8;
	627 …	+ }
	628 …	+ l = data[0] << 24 \| data[1] << 16 \| data[2] << 8 \| data[3];
	629 …	+ r = data[4] << 24 \| data[5] << 16 \| data[6] << 8 \| data[7];
	630 …	+ Blowfish_decipher(c, &l, &r);
	631 …	+ data[0] = l >> 24 & 0xff;
	632 …	+ data[1] = l >> 16 & 0xff;
	633 …	+ data[2] = l >> 8 & 0xff;
	634 …	+ data[3] = l & 0xff;
	635 …	+ data[4] = r >> 24 & 0xff;
	636 …	+ data[5] = r >> 16 & 0xff;
	637 …	+ data[6] = r >> 8 & 0xff;
	638 …	+ data[7] = r & 0xff;
	639 …	+ for (j = 0; j < 8; j++)
	640 …	+ data[j] ^= iva[j];
	641 …	+}
	642 …	+
	643 …	+#if 0
	644 …	+void
	645 …	+report(u_int32_t data[], u_int16_t len)
	646 …	+{
	647 …	+ u_int16_t i;
	648 …	+ for (i = 0; i < len; i += 2)
	649 …	+ printf("Block %0hd: %08lx %08lx.\n",
	650 …	+ i / 2, data[i], data[i + 1]);
	651 …	+}
	652 …	+void
	653 …	+main(void)
	654 …	+{
	655 …	+
	656 …	+ blf_ctx c;
	657 …	+ char key[] = "AAAAA";
	658 …	+ char key2[] = "abcdefghijklmnopqrstuvwxyz";
	659 …	+
	660 …	+ u_int32_t data[10];
	661 …	+ u_int32_t data2[] =
	662 …	+ {0x424c4f57l, 0x46495348l};
	663 …	+
	664 …	+ u_int16_t i;
	665 …	+
	666 …	+ /* First test */
	667 …	+ for (i = 0; i < 10; i++)
	668 …	+ data[i] = i;
	669 …	+
	670 …	+ blf_key(&c, (u_int8_t *) key, 5);
	671 …	+ blf_enc(&c, data, 5);
	672 …	+ blf_dec(&c, data, 1);
	673 …	+ blf_dec(&c, data + 2, 4);
	674 …	+ printf("Should read as 0 - 9.\n");
	675 …	+ report(data, 10);
	676 …	+
	677 …	+ /* Second test */
	678 …	+ blf_key(&c, (u_int8_t *) key2, strlen(key2));
	679 …	+ blf_enc(&c, data2, 1);
	680 …	+ printf("\nShould read as: 0x324ed0fe 0xf413a203.\n");
	681 …	+ report(data2, 2);
	682 …	+ blf_dec(&c, data2, 1);
	683 …	+ report(data2, 2);
	684 …	+}
	685 …	+#endif

ext/extconf.rbView
		@@ -1,0 +1,3 @@
	1 …	+require "mkmf"
	2 …	+dir_config("bcrypt_ext")
	3 …	+create_makefile("bcrypt_ext")

lib/bcrypt.rbView
		@@ -1,0 +1,149 @@
	1 …	+# A wrapper for OpenBSD's bcrypt/crypt_blowfish password-hashing algorithm.
	2 …	+require "ext/bcrypt_ext"
	3 …	+require "openssl"
	4 …	+
	5 …	+# A Ruby library implementing OpenBSD's bcrypt()/crypt_blowfish algorithm for
	6 …	+# hashing passwords.
	7 …	+module BCrypt
	8 …	+ module Errors # :nodoc:
	9 …	+ # The salt parameter provided to bcrypt() is invalid.
	10 …	+ class InvalidSalt < Exception; end
	11 …	+ # The hash parameter provided to bcrypt() is invalid.
	12 …	+ class InvalidHash < Exception; end
	13 …	+ # The cost parameter provided to bcrypt() is invalid.
	14 …	+ class InvalidCost < Exception; end
	15 …	+ end
	16 …	+
	17 …	+ # The default computational expense parameter.
	18 …	+ DEFAULT_COST = 10
	19 …	+
	20 …	+ module Internals # :nodoc:
	21 …	+ # contains the C-level methods and other internally bits
	22 …	+
	23 …	+ # Maximum length of salts.
	24 …	+ MAX_SALT_LENGTH = 16
	25 …	+
	26 …	+ # Wrap this in some error checking otherwise it'll explode.
	27 …	+ def _bc_crypt(key, salt)
	28 …	+ if valid_salt?(salt)
	29 …	+ __bc_crypt(key, salt)
	30 …	+ else
	31 …	+ raise Errors::InvalidSalt.new("invalid salt")
	32 …	+ end
	33 …	+ end
	34 …	+
	35 …	+ def _bc_salt(cost = DEFAULT_COST)
	36 …	+ if cost.to_i > 0
	37 …	+ __bc_salt(cost, OpenSSL::Random.random_bytes(MAX_SALT_LENGTH))
	38 …	+ else
	39 …	+ raise Errors::InvalidCost.new("cost must be numeric and > 0")
	40 …	+ end
	41 …	+ end
	42 …	+
	43 …	+ def valid_salt?(s)
	44 …	+ s =~ /^\$[0-9a-z]{2,}\$[0-9]{2,}\$[A-Za-z0-9\.\/]{22,}$/
	45 …	+ end
	46 …	+ end
	47 …	+
	48 …	+ # Returns the cost factor which will result in computation times less than +upper_time_limit_in_ms+.
	49 …	+ #
	50 …	+ # Example:
	51 …	+ #
	52 …	+ # BCrypt.calibrate(200) #=> 10
	53 …	+ # BCrypt.calibrate(1000) #=> 12
	54 …	+ #
	55 …	+ # # should take less than 200ms
	56 …	+ # BCrypt::Password.create("woo", :cost => 10)
	57 …	+ #
	58 …	+ # # should take less than 1000ms
	59 …	+ # BCrypt::Password.create("woo", :cost => 12)
	60 …	+ def self.calibrate(upper_time_limit_in_ms)
	61 …	+ 40.times do \|i\|
	62 …	+ start_time = Time.now
	63 …	+ Password.create("testing testing", :cost => i+1)
	64 …	+ end_time = Time.now - start_time
	65 …	+ return i if end_time * 1_000 > upper_time_limit_in_ms
	66 …	+ end
	67 …	+ end
	68 …	+
	69 …	+ # A password management class which allows you to safely store users' passwords and compare them.
	70 …	+ #
	71 …	+ # Example usage:
	72 …	+ #
	73 …	+ # include BCrypt
	74 …	+ #
	75 …	+ # # hash a user's password
	76 …	+ # @password = Password.create("my grand secret")
	77 …	+ # @password #=> "$2a$10$GtKs1Kbsig8ULHZzO1h2TetZfhO4Fmlxphp8bVKnUlZCBYYClPohG"
	78 …	+ #
	79 …	+ # # store it safely
	80 …	+ # @user.update_attribute(:password, @password)
	81 …	+ #
	82 …	+ # # read it back
	83 …	+ # @user.reload!
	84 …	+ # @db_password = Password.new(@user.password)
	85 …	+ #
	86 …	+ # # compare it after retrieval
	87 …	+ # @db_password == "my grand secret" #=> true
	88 …	+ # @db_password == "a paltry guess" #=> false
	89 …	+ #
	90 …	+ class Password < String
	91 …	+ # The hash portion of the stored password hash.
	92 …	+ attr_reader :hash
	93 …	+ # The salt of the store password hash (including version and cost).
	94 …	+ attr_reader :salt
	95 …	+ # The version of the bcrypt() algorithm used to create the hash.
	96 …	+ attr_reader :version
	97 …	+ # The cost factor used to create the hash.
	98 …	+ attr_reader :cost
	99 …	+
	100 …	+ class << self
	101 …	+ # Hashes a secret, returning a BCrypt::Password instance. Takes an optional <tt>:cost</tt> option, which is a
	102 …	+ # logarithmic variable which determines how computational expensive the hash is to calculate (a <tt>:cost</tt> of
	103 …	+ # 4 is twice as much work as a <tt>:cost</tt> of 3). The higher the <tt>:cost</tt> the harder it becomes for
	104 …	+ # attackers to try to guess passwords (even if a copy of your database is stolen), but the slower it is to check
	105 …	+ # users' passwords.
	106 …	+ #
	107 …	+ # Example:
	108 …	+ #
	109 …	+ # @password = BCrypt::Password.create("my secret", :cost => 13)
	110 …	+ def create(secret, options = { :cost => DEFAULT_COST })
	111 …	+ Password.new(_bc_crypt(secret, _bc_salt(options[:cost])))
	112 …	+ end
	113 …	+ private
	114 …	+ include Internals
	115 …	+ end
	116 …	+
	117 …	+ # Initializes a BCrypt::Password instance with the data from a stored hash.
	118 …	+ def initialize(raw_hash)
	119 …	+ if valid_hash?(raw_hash)
	120 …	+ self.replace(raw_hash)
	121 …	+ @version, @cost, @salt, @hash = split_hash(self)
	122 …	+ else
	123 …	+ raise Errors::InvalidHash.new("invalid hash")
	124 …	+ end
	125 …	+ end
	126 …	+
	127 …	+ alias_method :exactly_equals, :==
	128 …	+
	129 …	+ # Compares a potential secret against the hash. Returns true if the secret is the original secret, false otherwise.
	130 …	+ def ==(secret)
	131 …	+ self.exactly_equals(self.class._bc_crypt(secret, @salt))
	132 …	+ end
	133 …	+
	134 …	+ private
	135 …	+ # Returns true if +h+ is a valid hash.
	136 …	+ def valid_hash?(h)
	137 …	+ h =~ /^\$[0-9a-z]{2}\$[0-9]{2}\$[A-Za-z0-9\.\/]{53}$/
	138 …	+ end
	139 …	+
	140 …	+ # call-seq:
	141 …	+ # split_hash(raw_hash) -> version, cost, salt, hash
	142 …	+ #
	143 …	+ # Splits +h+ into version, cost, salt, and hash and returns them in that order.
	144 …	+ def split_hash(h)
	145 …	+ b, v, c, mash = h.split('$')
	146 …	+ return v, c.to_i, h[0, 29], mash[-31, 31]
	147 …	+ end
	148 …	+ end
	149 …	+end

spec/bcrypt/bcrypt_spec.rbView
		@@ -1,0 +1,9 @@
	1 …	+require File.join(File.dirname(__FILE__), "..", "spec_helper")
	2 …	+
	3 …	+context "BCrypt" do
	4 …	+ specify "should calculate the optimal cost factor to fit in a specific time" do
	5 …	+ first = BCrypt.calibrate(100)
	6 …	+ second = BCrypt.calibrate(300)
	7 …	+ second.should >(first + 1)
	8 …	+ end
	9 …	+end

spec/bcrypt/internals_spec.rbView
		@@ -1,0 +1,48 @@
	1 …	+require File.join(File.dirname(__FILE__), "..", "spec_helper")
	2 …	+
	3 …	+context "Generating BCrypt salts" do
	4 …	+ include BCrypt::Internals
	5 …	+
	6 …	+ specify "should produce strings" do
	7 …	+ _bc_salt.should be_an_instance_of(String)
	8 …	+ end
	9 …	+
	10 …	+ specify "should produce random data" do
	11 …	+ _bc_salt.should_not equal(_bc_salt)
	12 …	+ end
	13 …	+
	14 …	+ specify "should raise a InvalidCostError if the cost parameter isn't numeric" do
	15 …	+ lambda { _bc_salt('woo') }.should raise_error(BCrypt::Errors::InvalidCost)
	16 …	+ end
	17 …	+end
	18 …	+
	19 …	+context "Generating BCrypt hashes" do
	20 …	+ include BCrypt::Internals
	21 …	+
	22 …	+ setup do
	23 …	+ @salt = _bc_salt
	24 …	+ @password = "woo"
	25 …	+ end
	26 …	+
	27 …	+ specify "should produce a string" do
	28 …	+ _bc_crypt(@password, @salt).should be_an_instance_of(String)
	29 …	+ end
	30 …	+
	31 …	+ specify "should raise an InvalidSaltError if the salt is invalid" do
	32 …	+ lambda { _bc_crypt(@password, 'nino') }.should raise_error(BCrypt::Errors::InvalidSalt)
	33 …	+ end
	34 …	+
	35 …	+ specify "should be interoperable with other implementations" do
	36 …	+ # test vectors from the OpenWall implementation <http://www.openwall.com/crypt/>
	37 …	+ test_vectors = [
	38 …	+ ["U*U", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.E5YPO9kmyuRGyh0XouQYb4YMJKvyOeW"],
	39 …	+ ["UU", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.VGOzA784oUp/Z0DY336zx7pLYAy0lwK"],
	40 …	+ ["UUU", "$2a$05$XXXXXXXXXXXXXXXXXXXXXO", "$2a$05$XXXXXXXXXXXXXXXXXXXXXOAcXxm9kjPGEMsLznoKqmqw7tc8WCx4a"],
	41 …	+ ["", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.7uG0VCzI2bS7j6ymqJi9CdcdxiRTWNy"],
	42 …	+ ["0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789", "$2a$05$abcdefghijklmnopqrstuu", "$2a$05$abcdefghijklmnopqrstuu5s2v8.iXieOjg/.AySBTTZIIVFJeBui"]
	43 …	+ ]
	44 …	+ for secret, salt, test_vector in test_vectors
	45 …	+ _bc_crypt(secret, salt).should eql(test_vector)
	46 …	+ end
	47 …	+ end
	48 …	+end

spec/bcrypt/password_spec.rbView
		@@ -1,0 +1,53 @@
	1 …	+require File.join(File.dirname(__FILE__), "..", "spec_helper")
	2 …	+
	3 …	+context "Creating a hashed password" do
	4 …	+
	5 …	+ setup do
	6 …	+ @secret = "wheedle"
	7 …	+ @password = BCrypt::Password.create(@secret)
	8 …	+ end
	9 …	+
	10 …	+ specify "should return a BCrypt::Password" do
	11 …	+ @password.should be_an_instance_of(BCrypt::Password)
	12 …	+ end
	13 …	+
	14 …	+ specify "should return a valid bcrypt password" do
	15 …	+ lambda { BCrypt::Password.new(@password) }.should_not raise_error
	16 …	+ end
	17 …	+
	18 …	+end
	19 …	+
	20 …	+context "Reading a hashed password" do
	21 …	+ setup do
	22 …	+ @secret = "U*U"
	23 …	+ @hash = "$2a$05$CCCCCCCCCCCCCCCCCCCCC.E5YPO9kmyuRGyh0XouQYb4YMJKvyOeW"
	24 …	+ end
	25 …	+
	26 …	+ specify "should read the version, cost, salt, and hash" do
	27 …	+ password = BCrypt::Password.new(@hash)
	28 …	+ password.version.should eql("2a")
	29 …	+ password.cost.should equal(5)
	30 …	+ password.salt.should eql("$2a$05$CCCCCCCCCCCCCCCCCCCCC.")
	31 …	+ password.to_s.should_eql @hash
	32 …	+ end
	33 …	+
	34 …	+ specify "should raise an InvalidHashError when given an invalid hash" do
	35 …	+ lambda { BCrypt::Password.new('weedle') }.should raise_error(BCrypt::Errors::InvalidHash)
	36 …	+ end
	37 …	+end
	38 …	+
	39 …	+context "Comparing a hashed password with a secret" do
	40 …	+ setup do
	41 …	+ @secret = "U*U"
	42 …	+ @hash = "$2a$05$CCCCCCCCCCCCCCCCCCCCC.E5YPO9kmyuRGyh0XouQYb4YMJKvyOeW"
	43 …	+ @password = BCrypt::Password.create(@secret)
	44 …	+ end
	45 …	+
	46 …	+ specify "should compare successfully to the original secret" do
	47 …	+ (@password == @secret).should be(true)
	48 …	+ end
	49 …	+
	50 …	+ specify "should compare unsuccessfully to anything besides original secret" do
	51 …	+ (@password == "@secret").should be(false)
	52 …	+ end
	53 …	+end

spec/spec_helper.rbView
		@@ -1,0 +1,4 @@
	1 …	+$LOAD_PATH.unshift File.dirname(__FILE__) + '/../lib'
	2 …	+require "rubygems"
	3 …	+require "spec"
	4 …	+require "bcrypt"

Built with git-ssb-web

dangerousbeans / %aPBe2k3ugtjBr4rrsU1…

Commit a548e49bf23003f0da89137eecb2a2d0779da38a

Initial checkin.

Files changed