├── Gemfile ├── .rspec ├── spec ├── spec_helper.rb ├── bcrypt │ ├── error_spec.rb │ ├── engine_spec.rb │ └── password_spec.rb └── TestBCrypt.java ├── .gitignore ├── .travis.yml ├── ext ├── mri │ ├── crypt.h │ ├── extconf.rb │ ├── ow-crypt.h │ ├── crypt.c │ ├── bcrypt_ext.c │ ├── crypt_gensalt.c │ ├── wrapper.c │ └── crypt_blowfish.c └── jruby │ └── bcrypt_jruby │ └── BCrypt.java ├── lib ├── bcrypt.rb └── bcrypt │ ├── error.rb │ ├── password.rb │ └── engine.rb ├── Gemfile.lock ├── bcrypt.gemspec ├── COPYING ├── Rakefile ├── CHANGELOG └── README.md /Gemfile: -------------------------------------------------------------------------------- 1 | source 'https://rubygems.org' 2 | gemspec 3 | -------------------------------------------------------------------------------- /.rspec: -------------------------------------------------------------------------------- 1 | --color 2 | --backtrace 3 | --format documentation 4 | -------------------------------------------------------------------------------- /spec/spec_helper.rb: -------------------------------------------------------------------------------- 1 | $:.unshift File.expand_path('../../lib', __FILE__) 2 | require 'bcrypt' 3 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | *.o 2 | *.bundle 3 | *.so 4 | *.jar 5 | ext/mri/Makefile 6 | doc 7 | pkg 8 | *.class 9 | tmp/ 10 | .DS_Store 11 | -------------------------------------------------------------------------------- /.travis.yml: -------------------------------------------------------------------------------- 1 | language: ruby 2 | rvm: 3 | - 1.8.7 4 | - 1.9.2 5 | - 1.9.3 6 | - 2.0.0 7 | - 2.1.0 8 | - ruby-head 9 | - jruby-18mode 10 | - jruby-19mode 11 | - jruby-head 12 | - rbx-2 13 | - ree 14 | script: bundle exec rake 15 | -------------------------------------------------------------------------------- /ext/mri/crypt.h: -------------------------------------------------------------------------------- 1 | /* 2 | * Written by Solar Designer and placed in the public domain. 3 | * See crypt_blowfish.c for more information. 4 | */ 5 | 6 | #include 7 | 8 | #if defined(_OW_SOURCE) || defined(__USE_OW) 9 | #define __SKIP_GNU 10 | #undef __SKIP_OW 11 | #include 12 | #undef __SKIP_GNU 13 | #endif 14 | -------------------------------------------------------------------------------- /lib/bcrypt.rb: -------------------------------------------------------------------------------- 1 | # A Ruby library implementing OpenBSD's bcrypt()/crypt_blowfish algorithm for 2 | # hashing passwords. 3 | module BCrypt 4 | end 5 | 6 | if RUBY_PLATFORM == "java" 7 | require 'java' 8 | else 9 | require "openssl" 10 | end 11 | 12 | begin 13 | RUBY_VERSION =~ /(\d+.\d+)/ 14 | require "#{$1}/bcrypt_ext" 15 | rescue LoadError 16 | require "bcrypt_ext" 17 | end 18 | 19 | require 'bcrypt/error' 20 | require 'bcrypt/engine' 21 | require 'bcrypt/password' 22 | -------------------------------------------------------------------------------- /ext/mri/extconf.rb: -------------------------------------------------------------------------------- 1 | if RUBY_PLATFORM == "java" 2 | # Don't do anything when run in JRuby; this allows gem installation to pass. 3 | # We need to write a dummy Makefile so that RubyGems doesn't think compilation 4 | # failed. 5 | File.open('Makefile', 'w') do |f| 6 | f.puts "all:" 7 | f.puts "\t@true" 8 | f.puts "install:" 9 | f.puts "\t@true" 10 | end 11 | exit 0 12 | else 13 | require "mkmf" 14 | have_header('ruby/util.h') 15 | dir_config("bcrypt_ext") 16 | create_makefile("bcrypt_ext") 17 | end 18 | -------------------------------------------------------------------------------- /lib/bcrypt/error.rb: -------------------------------------------------------------------------------- 1 | module BCrypt 2 | 3 | class Error < StandardError # :nodoc: 4 | end 5 | 6 | module Errors # :nodoc: 7 | 8 | # The salt parameter provided to bcrypt() is invalid. 9 | class InvalidSalt < BCrypt::Error; end 10 | 11 | # The hash parameter provided to bcrypt() is invalid. 12 | class InvalidHash < BCrypt::Error; end 13 | 14 | # The cost parameter provided to bcrypt() is invalid. 15 | class InvalidCost < BCrypt::Error; end 16 | 17 | # The secret parameter provided to bcrypt() is invalid. 18 | class InvalidSecret < BCrypt::Error; end 19 | 20 | end 21 | 22 | end 23 | -------------------------------------------------------------------------------- /Gemfile.lock: -------------------------------------------------------------------------------- 1 | PATH 2 | remote: . 3 | specs: 4 | bcrypt (3.1.7) 5 | 6 | GEM 7 | remote: https://rubygems.org/ 8 | specs: 9 | diff-lcs (1.2.5) 10 | json (1.8.1) 11 | json (1.8.1-java) 12 | rake (10.1.0) 13 | rake-compiler (0.9.2) 14 | rake 15 | rdoc (3.12.2) 16 | json (~> 1.4) 17 | rspec (3.0.0) 18 | rspec-core (~> 3.0.0) 19 | rspec-expectations (~> 3.0.0) 20 | rspec-mocks (~> 3.0.0) 21 | rspec-core (3.0.2) 22 | rspec-support (~> 3.0.0) 23 | rspec-expectations (3.0.2) 24 | diff-lcs (>= 1.2.0, < 2.0) 25 | rspec-support (~> 3.0.0) 26 | rspec-mocks (3.0.2) 27 | rspec-support (~> 3.0.0) 28 | rspec-support (3.0.2) 29 | 30 | PLATFORMS 31 | java 32 | ruby 33 | 34 | DEPENDENCIES 35 | bcrypt! 36 | rake-compiler (~> 0.9.2) 37 | rdoc (~> 3.12) 38 | rspec (>= 3) 39 | -------------------------------------------------------------------------------- /spec/bcrypt/error_spec.rb: -------------------------------------------------------------------------------- 1 | require File.expand_path(File.join(File.dirname(__FILE__), "..", "spec_helper")) 2 | 3 | describe "Errors" do 4 | 5 | shared_examples "descends from StandardError" do 6 | it "can be rescued as a StandardError" do 7 | expect(described_class).to be < StandardError 8 | end 9 | end 10 | 11 | shared_examples "descends from BCrypt::Error" do 12 | it "can be rescued as a BCrypt::Error" do 13 | expect(described_class).to be < BCrypt::Error 14 | end 15 | end 16 | 17 | describe BCrypt::Error do 18 | include_examples "descends from StandardError" 19 | end 20 | 21 | describe BCrypt::Errors::InvalidCost do 22 | include_examples "descends from BCrypt::Error" 23 | end 24 | 25 | describe BCrypt::Errors::InvalidHash do 26 | include_examples "descends from BCrypt::Error" 27 | end 28 | 29 | describe BCrypt::Errors::InvalidSalt do 30 | include_examples "descends from BCrypt::Error" 31 | end 32 | 33 | describe BCrypt::Errors::InvalidSecret do 34 | include_examples "descends from BCrypt::Error" 35 | end 36 | 37 | end 38 | -------------------------------------------------------------------------------- /bcrypt.gemspec: -------------------------------------------------------------------------------- 1 | Gem::Specification.new do |s| 2 | s.name = 'bcrypt' 3 | s.version = '3.1.7' 4 | 5 | s.summary = "OpenBSD's bcrypt() password hashing algorithm." 6 | s.description = <<-EOF 7 | bcrypt() is a sophisticated and secure hash algorithm designed by The OpenBSD project 8 | for hashing passwords. The bcrypt Ruby gem provides a simple wrapper for safely handling 9 | passwords. 10 | EOF 11 | 12 | s.files = `git ls-files`.split("\n") 13 | s.require_path = 'lib' 14 | 15 | s.add_development_dependency 'rake-compiler', '~> 0.9.2' 16 | s.add_development_dependency 'rspec', '>= 3' 17 | s.add_development_dependency 'rdoc', '~> 3.12' 18 | 19 | s.has_rdoc = true 20 | s.rdoc_options += ['--title', 'bcrypt-ruby', '--line-numbers', '--inline-source', '--main', 'README.md'] 21 | s.extra_rdoc_files += ['README.md', 'COPYING', 'CHANGELOG', *Dir['lib/**/*.rb']] 22 | 23 | s.extensions = 'ext/mri/extconf.rb' 24 | 25 | s.authors = ["Coda Hale"] 26 | s.email = "coda.hale@gmail.com" 27 | s.homepage = "https://github.com/codahale/bcrypt-ruby" 28 | s.license = "MIT" 29 | end 30 | -------------------------------------------------------------------------------- /ext/mri/ow-crypt.h: -------------------------------------------------------------------------------- 1 | /* 2 | * Written by Solar Designer and placed in the public domain. 3 | * See crypt_blowfish.c for more information. 4 | */ 5 | 6 | #ifndef _OW_CRYPT_H 7 | #define _OW_CRYPT_H 8 | 9 | #undef __CONST 10 | #if defined __GNUC__ 11 | #define __CONST __const 12 | #elif defined _MSC_VER 13 | #define __CONST const 14 | #else 15 | #endif 16 | 17 | #ifndef __SKIP_GNU 18 | extern char *crypt(__CONST char *key, __CONST char *setting); 19 | extern char *crypt_r(__CONST char *key, __CONST char *setting, void *data); 20 | #endif 21 | 22 | #ifndef __SKIP_OW 23 | extern char *crypt_rn(__CONST char *key, __CONST char *setting, 24 | void *data, int size); 25 | extern char *crypt_ra(__CONST char *key, __CONST char *setting, 26 | void **data, int *size); 27 | extern char *crypt_gensalt(__CONST char *prefix, unsigned long count, 28 | __CONST char *input, int size); 29 | extern char *crypt_gensalt_rn(__CONST char *prefix, unsigned long count, 30 | __CONST char *input, int size, char *output, int output_size); 31 | extern char *crypt_gensalt_ra(__CONST char *prefix, unsigned long count, 32 | __CONST char *input, int size); 33 | #endif 34 | 35 | #endif 36 | -------------------------------------------------------------------------------- /ext/mri/crypt.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | VALUE mCrypt; 5 | 6 | static VALUE crypt_salt(VALUE self, VALUE prefix, VALUE count, VALUE input) 7 | { 8 | char * salt; 9 | VALUE str_salt; 10 | 11 | salt = crypt_gensalt_ra( 12 | StringValuePtr(prefix), 13 | NUM2ULONG(count), 14 | NIL_P(input) ? NULL : StringValuePtr(input), 15 | NIL_P(input) ? 0 : RSTRING_LEN(input)); 16 | 17 | if(!salt) return Qnil; 18 | 19 | str_salt = rb_str_new2(salt); 20 | free(salt); 21 | 22 | return str_salt; 23 | } 24 | 25 | static VALUE ra(VALUE self, VALUE key, VALUE setting) 26 | { 27 | char * value; 28 | void * data; 29 | int size; 30 | VALUE out; 31 | 32 | data = NULL; 33 | size = 0xDEADBEEF; 34 | 35 | if(NIL_P(key) || NIL_P(setting)) return Qnil; 36 | 37 | value = crypt_ra( 38 | NIL_P(key) ? NULL : StringValuePtr(key), 39 | NIL_P(setting) ? NULL : StringValuePtr(setting), 40 | &data, 41 | &size); 42 | 43 | if(!value) return Qnil; 44 | 45 | out = rb_str_new(data, size - 1); 46 | 47 | free(data); 48 | 49 | return out; 50 | } 51 | 52 | void Init_crypt() 53 | { 54 | mCrypt = rb_define_module("Crypt"); 55 | rb_define_singleton_method(mCrypt, "salt", crypt_salt, 3); 56 | rb_define_singleton_method(mCrypt, "crypt", ra, 2); 57 | } 58 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | (The MIT License) 2 | 3 | Copyright 2007-2011: 4 | 5 | * Coda Hale 6 | 7 | C implementation of the BCrypt algorithm by Solar Designer and placed in the 8 | public domain. 9 | jBCrypt is Copyright (c) 2006 Damien Miller . 10 | 11 | Permission is hereby granted, free of charge, to any person obtaining 12 | a copy of this software and associated documentation files (the 13 | 'Software'), to deal in the Software without restriction, including 14 | without limitation the rights to use, copy, modify, merge, publish, 15 | distribute, sublicense, and/or sell copies of the Software, and to 16 | permit persons to whom the Software is furnished to do so, subject to 17 | the following conditions: 18 | 19 | The above copyright notice and this permission notice shall be 20 | included in all copies or substantial portions of the Software. 21 | 22 | THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, 23 | EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 24 | MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. 25 | IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY 26 | CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, 27 | TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE 28 | SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 29 | -------------------------------------------------------------------------------- /ext/mri/bcrypt_ext.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | 4 | static VALUE mBCrypt; 5 | static VALUE cBCryptEngine; 6 | 7 | /* Given a logarithmic cost parameter, generates a salt for use with +bc_crypt+. 8 | */ 9 | static VALUE bc_salt(VALUE self, VALUE prefix, VALUE count, VALUE input) { 10 | char * salt; 11 | VALUE str_salt; 12 | 13 | salt = crypt_gensalt_ra( 14 | StringValuePtr(prefix), 15 | NUM2ULONG(count), 16 | NIL_P(input) ? NULL : StringValuePtr(input), 17 | NIL_P(input) ? 0 : RSTRING_LEN(input)); 18 | 19 | if(!salt) return Qnil; 20 | 21 | str_salt = rb_str_new2(salt); 22 | xfree(salt); 23 | 24 | return str_salt; 25 | } 26 | 27 | /* Given a secret and a salt, generates a salted hash (which you can then store safely). 28 | */ 29 | static VALUE bc_crypt(VALUE self, VALUE key, VALUE setting) { 30 | char * value; 31 | void * data; 32 | int size; 33 | VALUE out; 34 | 35 | data = NULL; 36 | size = 0xDEADBEEF; 37 | 38 | if(NIL_P(key) || NIL_P(setting)) return Qnil; 39 | 40 | value = crypt_ra( 41 | NIL_P(key) ? NULL : StringValuePtr(key), 42 | NIL_P(setting) ? NULL : StringValuePtr(setting), 43 | &data, 44 | &size); 45 | 46 | if(!value) return Qnil; 47 | 48 | out = rb_str_new(data, size - 1); 49 | 50 | xfree(data); 51 | 52 | return out; 53 | } 54 | 55 | /* Create the BCrypt and BCrypt::Engine modules, and populate them with methods. */ 56 | void Init_bcrypt_ext(){ 57 | mBCrypt = rb_define_module("BCrypt"); 58 | cBCryptEngine = rb_define_class_under(mBCrypt, "Engine", rb_cObject); 59 | 60 | rb_define_singleton_method(cBCryptEngine, "__bc_salt", bc_salt, 3); 61 | rb_define_singleton_method(cBCryptEngine, "__bc_crypt", bc_crypt, 2); 62 | } 63 | 64 | /* vim: set noet sws=4 sw=4: */ 65 | -------------------------------------------------------------------------------- /Rakefile: -------------------------------------------------------------------------------- 1 | require 'rspec/core/rake_task' 2 | require 'rubygems/package_task' 3 | require 'rake/extensiontask' 4 | require 'rake/javaextensiontask' 5 | require 'rake/clean' 6 | require 'rdoc/task' 7 | require 'benchmark' 8 | 9 | CLEAN.include( 10 | "ext/mri/*.o", 11 | "ext/mri/*.bundle", 12 | "ext/mri/*.so", 13 | "ext/jruby/bcrypt_jruby/*.class" 14 | ) 15 | CLOBBER.include( 16 | "ext/mri/Makefile", 17 | "doc/coverage", 18 | "pkg" 19 | ) 20 | GEMSPEC = Gem::Specification.load("bcrypt.gemspec") 21 | 22 | task :default => [:compile, :spec] 23 | 24 | desc "Run all specs" 25 | RSpec::Core::RakeTask.new do |t| 26 | t.pattern = 'spec/**/*_spec.rb' 27 | t.ruby_opts = '-w' 28 | end 29 | 30 | desc "Run all specs, with coverage testing" 31 | RSpec::Core::RakeTask.new(:rcov) do |t| 32 | t.pattern = 'spec/**/*_spec.rb' 33 | t.rcov = true 34 | t.rcov_path = 'doc/coverage' 35 | t.rcov_opts = ['--exclude', 'rspec,diff-lcs,rcov,_spec,_helper'] 36 | end 37 | 38 | desc 'Generate RDoc' 39 | RDoc::Task.new do |rdoc| 40 | rdoc.rdoc_dir = 'doc/rdoc' 41 | rdoc.options += GEMSPEC.rdoc_options 42 | rdoc.template = ENV['TEMPLATE'] if ENV['TEMPLATE'] 43 | rdoc.rdoc_files.include(*GEMSPEC.extra_rdoc_files) 44 | end 45 | 46 | Gem::PackageTask.new(GEMSPEC) do |pkg| 47 | pkg.need_zip = true 48 | pkg.need_tar = true 49 | end 50 | 51 | if RUBY_PLATFORM =~ /java/ 52 | Rake::JavaExtensionTask.new('bcrypt_ext', GEMSPEC) do |ext| 53 | ext.ext_dir = 'ext/jruby' 54 | end 55 | else 56 | Rake::ExtensionTask.new("bcrypt_ext", GEMSPEC) do |ext| 57 | ext.ext_dir = 'ext/mri' 58 | ext.cross_compile = true 59 | ext.cross_platform = ['x86-mingw32', 'x64-mingw32'] 60 | end 61 | end 62 | 63 | desc "Run a set of benchmarks on the compiled extension." 64 | task :benchmark do 65 | TESTS = 100 66 | TEST_PWD = "this is a test" 67 | require File.expand_path(File.join(File.dirname(__FILE__), "lib", "bcrypt")) 68 | Benchmark.bmbm do |results| 69 | 4.upto(10) do |n| 70 | results.report("cost #{n}:") { TESTS.times { BCrypt::Password.create(TEST_PWD, :cost => n) } } 71 | end 72 | end 73 | end 74 | -------------------------------------------------------------------------------- /CHANGELOG: -------------------------------------------------------------------------------- 1 | 1.0.0 Feb 27 2007 2 | - Initial release. 3 | 4 | 2.0.0 Mar 07 2007 5 | - Removed BCrypt::Password#exactly_equals -- use BCrypt::Password#eql? instead. 6 | - Added BCrypt::Password#is_password?. 7 | - Refactored out BCrypt::Internals into more useful BCrypt::Engine. 8 | - Added validation of secrets -- nil is not healthy. 9 | 10 | 2.0.1 Mar 09 2007 11 | - Fixed load path issues 12 | - Fixed crashes when hashing weird values (e.g., false, etc.) 13 | 14 | 2.0.2 Jun 06 2007 15 | - Fixed example code in the README [Winson] 16 | - Fixed Solaris compatibility [Jeremy LaTrasse, Twitter crew] 17 | 18 | 2.0.3 May 07 2008 19 | - Made exception classes descend from StandardError, not Exception [Dan42] 20 | - Changed BCrypt::Engine.hash to BCrypt::Engine.hash_secret to avoid Merb 21 | sorting issues. [Lee Pope] 22 | 23 | 2.0.4 Mar 09 2009 24 | - Added Ruby 1.9 compatibility. [Genki Takiuchi] 25 | - Fixed segfaults on some different types of empty strings. [Mike Pomraning] 26 | 27 | 2.0.5 Mar 11 2009 28 | - Fixed Ruby 1.8.5 compatibility. [Mike Pomraning] 29 | 30 | 2.1.0 Aug 12 2009 31 | - Improved code coverage, unit tests, and build chain. [Hongli Lai] 32 | - Ruby 1.9 compatibility fixes. [Hongli Lai] 33 | - JRuby support, using Damien Miller's jBCrypt. [Hongli Lai] 34 | - Ruby 1.9 GIL releasing for high-cost hashes. [Hongli Lai] 35 | 36 | 2.1.1 Aug 14 2009 37 | - JVM 1.4/1.5 compatibility [Hongli Lai] 38 | 39 | 2.1.2 Sep 16 2009 40 | - Fixed support for Solaris, OpenSolaris. 41 | 42 | 3.0.0 Aug 24 2011 43 | - Bcrypt C implementation replaced with a public domain implementation. 44 | - License changed to MIT 45 | 46 | 3.0.1 Sep 12 2011 47 | - create raises an exception if the cost is higher than 31. GH #27 48 | 49 | 3.1.0 May 07 2013 50 | - Add BCrypt::Password.valid_hash?(str) to check if a string is a valid bcrypt password hash 51 | - BCrypt::Password cost should be set to DEFAULT_COST if nil 52 | - Add BCrypt::Engine.cost attribute for getting/setting a default cost externally 53 | 54 | 3.1.1 Jul 10 2013 55 | - Remove support for Ruby 1.8 in compiled win32 binaries 56 | 57 | 3.1.2 Aug 26 2013 58 | - Add support for Ruby 1.8 and 2.0 (in addition to 1.9) in compiled Windows binaries 59 | - Add support for 64-bit Windows 60 | 61 | 3.1.3 Feb 21 2014 62 | - Add support for Ruby 2.1 in compiled Windows binaries 63 | - Rename gem from "bcrypt-ruby" to just "bcrypt". [GH #86 by @sferik] 64 | 65 | 3.1.6 Feb 21 2014 66 | - Dummy version of "bcrypt-ruby" needed a couple version bumps to fix some 67 | bugs. It felt wrong to have that at a higher version than the real gem, so 68 | the real gem is getting bumped to 3.1.6. 69 | 70 | 3.1.7 Feb 24 2014 71 | - Rebuild corrupt Java binary version of gem [GH #90] 72 | - The 2.1 support for Windows binaries alleged in 3.1.3 was a lie -- documentation removed 73 | -------------------------------------------------------------------------------- /lib/bcrypt/password.rb: -------------------------------------------------------------------------------- 1 | module BCrypt 2 | # A password management class which allows you to safely store users' passwords and compare them. 3 | # 4 | # Example usage: 5 | # 6 | # include BCrypt 7 | # 8 | # # hash a user's password 9 | # @password = Password.create("my grand secret") 10 | # @password #=> "$2a$10$GtKs1Kbsig8ULHZzO1h2TetZfhO4Fmlxphp8bVKnUlZCBYYClPohG" 11 | # 12 | # # store it safely 13 | # @user.update_attribute(:password, @password) 14 | # 15 | # # read it back 16 | # @user.reload! 17 | # @db_password = Password.new(@user.password) 18 | # 19 | # # compare it after retrieval 20 | # @db_password == "my grand secret" #=> true 21 | # @db_password == "a paltry guess" #=> false 22 | # 23 | class Password < String 24 | # The hash portion of the stored password hash. 25 | attr_reader :checksum 26 | # The salt of the store password hash (including version and cost). 27 | attr_reader :salt 28 | # The version of the bcrypt() algorithm used to create the hash. 29 | attr_reader :version 30 | # The cost factor used to create the hash. 31 | attr_reader :cost 32 | 33 | class << self 34 | # Hashes a secret, returning a BCrypt::Password instance. Takes an optional :cost option, which is a 35 | # logarithmic variable which determines how computational expensive the hash is to calculate (a :cost of 36 | # 4 is twice as much work as a :cost of 3). The higher the :cost the harder it becomes for 37 | # attackers to try to guess passwords (even if a copy of your database is stolen), but the slower it is to check 38 | # users' passwords. 39 | # 40 | # Example: 41 | # 42 | # @password = BCrypt::Password.create("my secret", :cost => 13) 43 | def create(secret, options = {}) 44 | cost = options[:cost] || BCrypt::Engine.cost 45 | raise ArgumentError if cost > 31 46 | Password.new(BCrypt::Engine.hash_secret(secret, BCrypt::Engine.generate_salt(cost))) 47 | end 48 | 49 | def valid_hash?(h) 50 | h =~ /^\$[0-9a-z]{2}\$[0-9]{2}\$[A-Za-z0-9\.\/]{53}$/ 51 | end 52 | end 53 | 54 | # Initializes a BCrypt::Password instance with the data from a stored hash. 55 | def initialize(raw_hash) 56 | if valid_hash?(raw_hash) 57 | self.replace(raw_hash) 58 | @version, @cost, @salt, @checksum = split_hash(self) 59 | else 60 | raise Errors::InvalidHash.new("invalid hash") 61 | end 62 | end 63 | 64 | # Compares a potential secret against the hash. Returns true if the secret is the original secret, false otherwise. 65 | def ==(secret) 66 | super(BCrypt::Engine.hash_secret(secret, @salt)) 67 | end 68 | alias_method :is_password?, :== 69 | 70 | private 71 | 72 | # Returns true if +h+ is a valid hash. 73 | def valid_hash?(h) 74 | self.class.valid_hash?(h) 75 | end 76 | 77 | # call-seq: 78 | # split_hash(raw_hash) -> version, cost, salt, hash 79 | # 80 | # Splits +h+ into version, cost, salt, and hash and returns them in that order. 81 | def split_hash(h) 82 | _, v, c, mash = h.split('$') 83 | return v, c.to_i, h[0, 29].to_str, mash[-31, 31].to_str 84 | end 85 | end 86 | 87 | end 88 | -------------------------------------------------------------------------------- /spec/bcrypt/engine_spec.rb: -------------------------------------------------------------------------------- 1 | require File.expand_path(File.join(File.dirname(__FILE__), "..", "spec_helper")) 2 | 3 | describe "The BCrypt engine" do 4 | specify "should calculate the optimal cost factor to fit in a specific time" do 5 | first = BCrypt::Engine.calibrate(100) 6 | second = BCrypt::Engine.calibrate(400) 7 | expect(second).to be > first 8 | end 9 | end 10 | 11 | describe "Generating BCrypt salts" do 12 | 13 | specify "should produce strings" do 14 | expect(BCrypt::Engine.generate_salt).to be_an_instance_of(String) 15 | end 16 | 17 | specify "should produce random data" do 18 | expect(BCrypt::Engine.generate_salt).to_not equal(BCrypt::Engine.generate_salt) 19 | end 20 | 21 | specify "should raise a InvalidCostError if the cost parameter isn't numeric" do 22 | expect { BCrypt::Engine.generate_salt('woo') }.to raise_error(BCrypt::Errors::InvalidCost) 23 | end 24 | 25 | specify "should raise a InvalidCostError if the cost parameter isn't greater than 0" do 26 | expect { BCrypt::Engine.generate_salt(-1) }.to raise_error(BCrypt::Errors::InvalidCost) 27 | end 28 | end 29 | 30 | describe "Autodetecting of salt cost" do 31 | 32 | specify "should work" do 33 | expect(BCrypt::Engine.autodetect_cost("$2a$08$hRx2IVeHNsTSYYtUWn61Ou")).to eq 8 34 | expect(BCrypt::Engine.autodetect_cost("$2a$05$XKd1bMnLgUnc87qvbAaCUu")).to eq 5 35 | expect(BCrypt::Engine.autodetect_cost("$2a$13$Lni.CZ6z5A7344POTFBBV.")).to eq 13 36 | end 37 | 38 | end 39 | 40 | describe "Generating BCrypt hashes" do 41 | 42 | class MyInvalidSecret 43 | undef to_s 44 | end 45 | 46 | before :each do 47 | @salt = BCrypt::Engine.generate_salt(4) 48 | @password = "woo" 49 | end 50 | 51 | specify "should produce a string" do 52 | expect(BCrypt::Engine.hash_secret(@password, @salt)).to be_an_instance_of(String) 53 | end 54 | 55 | specify "should raise an InvalidSalt error if the salt is invalid" do 56 | expect { BCrypt::Engine.hash_secret(@password, 'nino') }.to raise_error(BCrypt::Errors::InvalidSalt) 57 | end 58 | 59 | specify "should raise an InvalidSecret error if the secret is invalid" do 60 | expect { BCrypt::Engine.hash_secret(MyInvalidSecret.new, @salt) }.to raise_error(BCrypt::Errors::InvalidSecret) 61 | expect { BCrypt::Engine.hash_secret(nil, @salt) }.not_to raise_error 62 | expect { BCrypt::Engine.hash_secret(false, @salt) }.not_to raise_error 63 | end 64 | 65 | specify "should call #to_s on the secret and use the return value as the actual secret data" do 66 | expect(BCrypt::Engine.hash_secret(false, @salt)).to eq BCrypt::Engine.hash_secret("false", @salt) 67 | end 68 | 69 | specify "should be interoperable with other implementations" do 70 | # test vectors from the OpenWall implementation 71 | test_vectors = [ 72 | ["U*U", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.E5YPO9kmyuRGyh0XouQYb4YMJKvyOeW"], 73 | ["U*U*", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.VGOzA784oUp/Z0DY336zx7pLYAy0lwK"], 74 | ["U*U*U", "$2a$05$XXXXXXXXXXXXXXXXXXXXXO", "$2a$05$XXXXXXXXXXXXXXXXXXXXXOAcXxm9kjPGEMsLznoKqmqw7tc8WCx4a"], 75 | ["", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.", "$2a$05$CCCCCCCCCCCCCCCCCCCCC.7uG0VCzI2bS7j6ymqJi9CdcdxiRTWNy"], 76 | ["0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789", "$2a$05$abcdefghijklmnopqrstuu", "$2a$05$abcdefghijklmnopqrstuu5s2v8.iXieOjg/.AySBTTZIIVFJeBui"] 77 | ] 78 | for secret, salt, test_vector in test_vectors 79 | expect(BCrypt::Engine.hash_secret(secret, salt)).to eql(test_vector) 80 | end 81 | end 82 | end 83 | -------------------------------------------------------------------------------- /ext/mri/crypt_gensalt.c: -------------------------------------------------------------------------------- 1 | /* 2 | * Written by Solar Designer and placed in the public domain. 3 | * See crypt_blowfish.c for more information. 4 | * 5 | * This file contains salt generation functions for the traditional and 6 | * other common crypt(3) algorithms, except for bcrypt which is defined 7 | * entirely in crypt_blowfish.c. 8 | */ 9 | 10 | #include 11 | 12 | #include 13 | #ifndef __set_errno 14 | #define __set_errno(val) errno = (val) 15 | #endif 16 | 17 | #undef __CONST 18 | #ifdef __GNUC__ 19 | #define __CONST __const 20 | #else 21 | #define __CONST 22 | #endif 23 | 24 | unsigned char _crypt_itoa64[64 + 1] = 25 | "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"; 26 | 27 | char *_crypt_gensalt_traditional_rn(unsigned long count, 28 | __CONST char *input, int size, char *output, int output_size) 29 | { 30 | if (size < 2 || output_size < 2 + 1 || (count && count != 25)) { 31 | if (output_size > 0) output[0] = '\0'; 32 | __set_errno((output_size < 2 + 1) ? ERANGE : EINVAL); 33 | return NULL; 34 | } 35 | 36 | output[0] = _crypt_itoa64[(unsigned int)input[0] & 0x3f]; 37 | output[1] = _crypt_itoa64[(unsigned int)input[1] & 0x3f]; 38 | output[2] = '\0'; 39 | 40 | return output; 41 | } 42 | 43 | char *_crypt_gensalt_extended_rn(unsigned long count, 44 | __CONST char *input, int size, char *output, int output_size) 45 | { 46 | unsigned long value; 47 | 48 | /* Even iteration counts make it easier to detect weak DES keys from a look 49 | * at the hash, so they should be avoided */ 50 | if (size < 3 || output_size < 1 + 4 + 4 + 1 || 51 | (count && (count > 0xffffff || !(count & 1)))) { 52 | if (output_size > 0) output[0] = '\0'; 53 | __set_errno((output_size < 1 + 4 + 4 + 1) ? ERANGE : EINVAL); 54 | return NULL; 55 | } 56 | 57 | if (!count) count = 725; 58 | 59 | output[0] = '_'; 60 | output[1] = _crypt_itoa64[count & 0x3f]; 61 | output[2] = _crypt_itoa64[(count >> 6) & 0x3f]; 62 | output[3] = _crypt_itoa64[(count >> 12) & 0x3f]; 63 | output[4] = _crypt_itoa64[(count >> 18) & 0x3f]; 64 | value = (unsigned long)(unsigned char)input[0] | 65 | ((unsigned long)(unsigned char)input[1] << 8) | 66 | ((unsigned long)(unsigned char)input[2] << 16); 67 | output[5] = _crypt_itoa64[value & 0x3f]; 68 | output[6] = _crypt_itoa64[(value >> 6) & 0x3f]; 69 | output[7] = _crypt_itoa64[(value >> 12) & 0x3f]; 70 | output[8] = _crypt_itoa64[(value >> 18) & 0x3f]; 71 | output[9] = '\0'; 72 | 73 | return output; 74 | } 75 | 76 | char *_crypt_gensalt_md5_rn(unsigned long count, 77 | __CONST char *input, int size, char *output, int output_size) 78 | { 79 | unsigned long value; 80 | 81 | if (size < 3 || output_size < 3 + 4 + 1 || (count && count != 1000)) { 82 | if (output_size > 0) output[0] = '\0'; 83 | __set_errno((output_size < 3 + 4 + 1) ? ERANGE : EINVAL); 84 | return NULL; 85 | } 86 | 87 | output[0] = '$'; 88 | output[1] = '1'; 89 | output[2] = '$'; 90 | value = (unsigned long)(unsigned char)input[0] | 91 | ((unsigned long)(unsigned char)input[1] << 8) | 92 | ((unsigned long)(unsigned char)input[2] << 16); 93 | output[3] = _crypt_itoa64[value & 0x3f]; 94 | output[4] = _crypt_itoa64[(value >> 6) & 0x3f]; 95 | output[5] = _crypt_itoa64[(value >> 12) & 0x3f]; 96 | output[6] = _crypt_itoa64[(value >> 18) & 0x3f]; 97 | output[7] = '\0'; 98 | 99 | if (size >= 6 && output_size >= 3 + 4 + 4 + 1) { 100 | value = (unsigned long)(unsigned char)input[3] | 101 | ((unsigned long)(unsigned char)input[4] << 8) | 102 | ((unsigned long)(unsigned char)input[5] << 16); 103 | output[7] = _crypt_itoa64[value & 0x3f]; 104 | output[8] = _crypt_itoa64[(value >> 6) & 0x3f]; 105 | output[9] = _crypt_itoa64[(value >> 12) & 0x3f]; 106 | output[10] = _crypt_itoa64[(value >> 18) & 0x3f]; 107 | output[11] = '\0'; 108 | } 109 | 110 | return output; 111 | } 112 | -------------------------------------------------------------------------------- /lib/bcrypt/engine.rb: -------------------------------------------------------------------------------- 1 | module BCrypt 2 | # A Ruby wrapper for the bcrypt() C extension calls and the Java calls. 3 | class Engine 4 | # The default computational expense parameter. 5 | DEFAULT_COST = 10 6 | # The minimum cost supported by the algorithm. 7 | MIN_COST = 4 8 | # Maximum possible size of bcrypt() salts. 9 | MAX_SALT_LENGTH = 16 10 | 11 | if RUBY_PLATFORM != "java" 12 | # C-level routines which, if they don't get the right input, will crash the 13 | # hell out of the Ruby process. 14 | private_class_method :__bc_salt 15 | private_class_method :__bc_crypt 16 | end 17 | 18 | @cost = nil 19 | 20 | # Returns the cost factor that will be used if one is not specified when 21 | # creating a password hash. Defaults to DEFAULT_COST if not set. 22 | def self.cost 23 | @cost || DEFAULT_COST 24 | end 25 | 26 | # Set a default cost factor that will be used if one is not specified when 27 | # creating a password hash. 28 | # 29 | # Example: 30 | # 31 | # BCrypt::Engine::DEFAULT_COST #=> 10 32 | # BCrypt::Password.create('secret').cost #=> 10 33 | # 34 | # BCrypt::Engine.cost = 8 35 | # BCrypt::Password.create('secret').cost #=> 8 36 | # 37 | # # cost can still be overridden as needed 38 | # BCrypt::Password.create('secret', :cost => 6).cost #=> 6 39 | def self.cost=(cost) 40 | @cost = cost 41 | end 42 | 43 | # Given a secret and a valid salt (see BCrypt::Engine.generate_salt) calculates 44 | # a bcrypt() password hash. 45 | def self.hash_secret(secret, salt, _ = nil) 46 | if valid_secret?(secret) 47 | if valid_salt?(salt) 48 | if RUBY_PLATFORM == "java" 49 | Java.bcrypt_jruby.BCrypt.hashpw(secret.to_s, salt.to_s) 50 | else 51 | __bc_crypt(secret.to_s, salt) 52 | end 53 | else 54 | raise Errors::InvalidSalt.new("invalid salt") 55 | end 56 | else 57 | raise Errors::InvalidSecret.new("invalid secret") 58 | end 59 | end 60 | 61 | # Generates a random salt with a given computational cost. 62 | def self.generate_salt(cost = self.cost) 63 | cost = cost.to_i 64 | if cost > 0 65 | if cost < MIN_COST 66 | cost = MIN_COST 67 | end 68 | if RUBY_PLATFORM == "java" 69 | Java.bcrypt_jruby.BCrypt.gensalt(cost) 70 | else 71 | prefix = "$2a$05$CCCCCCCCCCCCCCCCCCCCC.E5YPO9kmyuRGyh0XouQYb4YMJKvyOeW" 72 | __bc_salt(prefix, cost, OpenSSL::Random.random_bytes(MAX_SALT_LENGTH)) 73 | end 74 | else 75 | raise Errors::InvalidCost.new("cost must be numeric and > 0") 76 | end 77 | end 78 | 79 | # Returns true if +salt+ is a valid bcrypt() salt, false if not. 80 | def self.valid_salt?(salt) 81 | !!(salt =~ /^\$[0-9a-z]{2,}\$[0-9]{2,}\$[A-Za-z0-9\.\/]{22,}$/) 82 | end 83 | 84 | # Returns true if +secret+ is a valid bcrypt() secret, false if not. 85 | def self.valid_secret?(secret) 86 | secret.respond_to?(:to_s) 87 | end 88 | 89 | # Returns the cost factor which will result in computation times less than +upper_time_limit_in_ms+. 90 | # 91 | # Example: 92 | # 93 | # BCrypt::Engine.calibrate(200) #=> 10 94 | # BCrypt::Engine.calibrate(1000) #=> 12 95 | # 96 | # # should take less than 200ms 97 | # BCrypt::Password.create("woo", :cost => 10) 98 | # 99 | # # should take less than 1000ms 100 | # BCrypt::Password.create("woo", :cost => 12) 101 | def self.calibrate(upper_time_limit_in_ms) 102 | 40.times do |i| 103 | start_time = Time.now 104 | Password.create("testing testing", :cost => i+1) 105 | end_time = Time.now - start_time 106 | return i if end_time * 1_000 > upper_time_limit_in_ms 107 | end 108 | end 109 | 110 | # Autodetects the cost from the salt string. 111 | def self.autodetect_cost(salt) 112 | salt[4..5].to_i 113 | end 114 | end 115 | 116 | end 117 | -------------------------------------------------------------------------------- /spec/bcrypt/password_spec.rb: -------------------------------------------------------------------------------- 1 | require File.expand_path(File.join(File.dirname(__FILE__), "..", "spec_helper")) 2 | 3 | describe "Creating a hashed password" do 4 | 5 | before :each do 6 | @secret = "wheedle" 7 | @password = BCrypt::Password.create(@secret, :cost => 4) 8 | end 9 | 10 | specify "should return a BCrypt::Password" do 11 | expect(@password).to be_an_instance_of(BCrypt::Password) 12 | end 13 | 14 | specify "should return a valid bcrypt password" do 15 | expect { BCrypt::Password.new(@password) }.not_to raise_error 16 | end 17 | 18 | specify "should behave normally if the secret is not a string" do 19 | expect { BCrypt::Password.create(nil) }.not_to raise_error 20 | expect { BCrypt::Password.create({:woo => "yeah"}) }.not_to raise_error 21 | expect { BCrypt::Password.create(false) }.not_to raise_error 22 | end 23 | 24 | specify "should tolerate empty string secrets" do 25 | expect { BCrypt::Password.create( "\n".chop ) }.not_to raise_error 26 | expect { BCrypt::Password.create( "" ) }.not_to raise_error 27 | expect { BCrypt::Password.create( String.new ) }.not_to raise_error 28 | end 29 | end 30 | 31 | describe "Reading a hashed password" do 32 | before :each do 33 | @secret = "U*U" 34 | @hash = "$2a$05$CCCCCCCCCCCCCCCCCCCCC.E5YPO9kmyuRGyh0XouQYb4YMJKvyOeW" 35 | end 36 | 37 | specify "the cost is too damn high" do 38 | expect { 39 | BCrypt::Password.create("hello", :cost => 32) 40 | }.to raise_error(ArgumentError) 41 | end 42 | 43 | specify "the cost should be set to the default if nil" do 44 | expect(BCrypt::Password.create("hello", :cost => nil).cost).to equal(BCrypt::Engine::DEFAULT_COST) 45 | end 46 | 47 | specify "the cost should be set to the default if empty hash" do 48 | expect(BCrypt::Password.create("hello", {}).cost).to equal(BCrypt::Engine::DEFAULT_COST) 49 | end 50 | 51 | specify "the cost should be set to the passed value if provided" do 52 | expect(BCrypt::Password.create("hello", :cost => 5).cost).to equal(5) 53 | end 54 | 55 | specify "the cost should be set to the global value if set" do 56 | BCrypt::Engine.cost = 5 57 | expect(BCrypt::Password.create("hello").cost).to equal(5) 58 | # unset the global value to not affect other tests 59 | BCrypt::Engine.cost = nil 60 | end 61 | 62 | specify "the cost should be set to an overridden constant for backwards compatibility" do 63 | # suppress "already initialized constant" warning 64 | old_verbose, $VERBOSE = $VERBOSE, nil 65 | old_default_cost = BCrypt::Engine::DEFAULT_COST 66 | 67 | BCrypt::Engine::DEFAULT_COST = 5 68 | expect(BCrypt::Password.create("hello").cost).to equal(5) 69 | 70 | # reset default to not affect other tests 71 | BCrypt::Engine::DEFAULT_COST = old_default_cost 72 | $VERBOSE = old_verbose 73 | end 74 | 75 | specify "should read the version, cost, salt, and hash" do 76 | password = BCrypt::Password.new(@hash) 77 | expect(password.version).to eql("2a") 78 | expect(password.cost).to equal(5) 79 | expect(password.salt).to eql("$2a$05$CCCCCCCCCCCCCCCCCCCCC.") 80 | expect(password.salt.class).to eq String 81 | expect(password.checksum).to eq("E5YPO9kmyuRGyh0XouQYb4YMJKvyOeW") 82 | expect(password.checksum.class).to eq String 83 | expect(password.to_s).to eql(@hash) 84 | end 85 | 86 | specify "should raise an InvalidHashError when given an invalid hash" do 87 | expect { BCrypt::Password.new('weedle') }.to raise_error(BCrypt::Errors::InvalidHash) 88 | end 89 | end 90 | 91 | describe "Comparing a hashed password with a secret" do 92 | before :each do 93 | @secret = "U*U" 94 | @hash = "$2a$05$CCCCCCCCCCCCCCCCCCCCC.E5YPO9kmyuRGyh0XouQYb4YMJKvyOeW" 95 | @password = BCrypt::Password.create(@secret) 96 | end 97 | 98 | specify "should compare successfully to the original secret" do 99 | expect((@password == @secret)).to be(true) 100 | end 101 | 102 | specify "should compare unsuccessfully to anything besides original secret" do 103 | expect((@password == "@secret")).to be(false) 104 | end 105 | end 106 | 107 | describe "Validating a generated salt" do 108 | specify "should not accept an invalid salt" do 109 | expect(BCrypt::Engine.valid_salt?("invalid")).to eq(false) 110 | end 111 | specify "should accept a valid salt" do 112 | expect(BCrypt::Engine.valid_salt?(BCrypt::Engine.generate_salt)).to eq(true) 113 | end 114 | end 115 | 116 | describe "Validating a password hash" do 117 | specify "should not accept an invalid password" do 118 | expect(BCrypt::Password.valid_hash?("i_am_so_not_valid")).to be_falsey 119 | end 120 | specify "should accept a valid password" do 121 | expect(BCrypt::Password.valid_hash?(BCrypt::Password.create "i_am_so_valid")).to be_truthy 122 | end 123 | end 124 | -------------------------------------------------------------------------------- /spec/TestBCrypt.java: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2006 Damien Miller 2 | // 3 | // Permission to use, copy, modify, and distribute this software for any 4 | // purpose with or without fee is hereby granted, provided that the above 5 | // copyright notice and this permission notice appear in all copies. 6 | // 7 | // THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES 8 | // WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF 9 | // MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR 10 | // ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 11 | // WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN 12 | // ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF 13 | // OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. 14 | 15 | import junit.framework.TestCase; 16 | 17 | /** 18 | * JUnit unit tests for BCrypt routines 19 | * @author Damien Miller 20 | * @version 0.2 21 | */ 22 | public class TestBCrypt extends TestCase { 23 | String test_vectors[][] = { 24 | { "", 25 | "$2a$06$DCq7YPn5Rq63x1Lad4cll.", 26 | "$2a$06$DCq7YPn5Rq63x1Lad4cll.TV4S6ytwfsfvkgY8jIucDrjc8deX1s." }, 27 | { "", 28 | "$2a$08$HqWuK6/Ng6sg9gQzbLrgb.", 29 | "$2a$08$HqWuK6/Ng6sg9gQzbLrgb.Tl.ZHfXLhvt/SgVyWhQqgqcZ7ZuUtye" }, 30 | { "", 31 | "$2a$10$k1wbIrmNyFAPwPVPSVa/ze", 32 | "$2a$10$k1wbIrmNyFAPwPVPSVa/zecw2BCEnBwVS2GbrmgzxFUOqW9dk4TCW" }, 33 | { "", 34 | "$2a$12$k42ZFHFWqBp3vWli.nIn8u", 35 | "$2a$12$k42ZFHFWqBp3vWli.nIn8uYyIkbvYRvodzbfbK18SSsY.CsIQPlxO" }, 36 | { "a", 37 | "$2a$06$m0CrhHm10qJ3lXRY.5zDGO", 38 | "$2a$06$m0CrhHm10qJ3lXRY.5zDGO3rS2KdeeWLuGmsfGlMfOxih58VYVfxe" }, 39 | { "a", 40 | "$2a$08$cfcvVd2aQ8CMvoMpP2EBfe", 41 | "$2a$08$cfcvVd2aQ8CMvoMpP2EBfeodLEkkFJ9umNEfPD18.hUF62qqlC/V." }, 42 | { "a", 43 | "$2a$10$k87L/MF28Q673VKh8/cPi.", 44 | "$2a$10$k87L/MF28Q673VKh8/cPi.SUl7MU/rWuSiIDDFayrKk/1tBsSQu4u" }, 45 | { "a", 46 | "$2a$12$8NJH3LsPrANStV6XtBakCe", 47 | "$2a$12$8NJH3LsPrANStV6XtBakCez0cKHXVxmvxIlcz785vxAIZrihHZpeS" }, 48 | { "abc", 49 | "$2a$06$If6bvum7DFjUnE9p2uDeDu", 50 | "$2a$06$If6bvum7DFjUnE9p2uDeDu0YHzrHM6tf.iqN8.yx.jNN1ILEf7h0i" }, 51 | { "abc", 52 | "$2a$08$Ro0CUfOqk6cXEKf3dyaM7O", 53 | "$2a$08$Ro0CUfOqk6cXEKf3dyaM7OhSCvnwM9s4wIX9JeLapehKK5YdLxKcm" }, 54 | { "abc", 55 | "$2a$10$WvvTPHKwdBJ3uk0Z37EMR.", 56 | "$2a$10$WvvTPHKwdBJ3uk0Z37EMR.hLA2W6N9AEBhEgrAOljy2Ae5MtaSIUi" }, 57 | { "abc", 58 | "$2a$12$EXRkfkdmXn2gzds2SSitu.", 59 | "$2a$12$EXRkfkdmXn2gzds2SSitu.MW9.gAVqa9eLS1//RYtYCmB1eLHg.9q" }, 60 | { "abcdefghijklmnopqrstuvwxyz", 61 | "$2a$06$.rCVZVOThsIa97pEDOxvGu", 62 | "$2a$06$.rCVZVOThsIa97pEDOxvGuRRgzG64bvtJ0938xuqzv18d3ZpQhstC" }, 63 | { "abcdefghijklmnopqrstuvwxyz", 64 | "$2a$08$aTsUwsyowQuzRrDqFflhge", 65 | "$2a$08$aTsUwsyowQuzRrDqFflhgekJ8d9/7Z3GV3UcgvzQW3J5zMyrTvlz." }, 66 | { "abcdefghijklmnopqrstuvwxyz", 67 | "$2a$10$fVH8e28OQRj9tqiDXs1e1u", 68 | "$2a$10$fVH8e28OQRj9tqiDXs1e1uxpsjN0c7II7YPKXua2NAKYvM6iQk7dq" }, 69 | { "abcdefghijklmnopqrstuvwxyz", 70 | "$2a$12$D4G5f18o7aMMfwasBL7Gpu", 71 | "$2a$12$D4G5f18o7aMMfwasBL7GpuQWuP3pkrZrOAnqP.bmezbMng.QwJ/pG" }, 72 | { "~!@#$%^&*() ~!@#$%^&*()PNBFRD", 73 | "$2a$06$fPIsBO8qRqkjj273rfaOI.", 74 | "$2a$06$fPIsBO8qRqkjj273rfaOI.HtSV9jLDpTbZn782DC6/t7qT67P6FfO" }, 75 | { "~!@#$%^&*() ~!@#$%^&*()PNBFRD", 76 | "$2a$08$Eq2r4G/76Wv39MzSX262hu", 77 | "$2a$08$Eq2r4G/76Wv39MzSX262huzPz612MZiYHVUJe/OcOql2jo4.9UxTW" }, 78 | { "~!@#$%^&*() ~!@#$%^&*()PNBFRD", 79 | "$2a$10$LgfYWkbzEvQ4JakH7rOvHe", 80 | "$2a$10$LgfYWkbzEvQ4JakH7rOvHe0y8pHKF9OaFgwUZ2q7W2FFZmZzJYlfS" }, 81 | { "~!@#$%^&*() ~!@#$%^&*()PNBFRD", 82 | "$2a$12$WApznUOJfkEGSmYRfnkrPO", 83 | "$2a$12$WApznUOJfkEGSmYRfnkrPOr466oFDCaj4b6HY3EXGvfxm43seyhgC" }, 84 | }; 85 | 86 | /** 87 | * Entry point for unit tests 88 | * @param args unused 89 | */ 90 | public static void main(String[] args) { 91 | junit.textui.TestRunner.run(TestBCrypt.class); 92 | } 93 | 94 | /** 95 | * Test method for 'BCrypt.hashpw(String, String)' 96 | */ 97 | public void testHashpw() { 98 | System.out.print("BCrypt.hashpw(): "); 99 | for (int i = 0; i < test_vectors.length; i++) { 100 | String plain = test_vectors[i][0]; 101 | String salt = test_vectors[i][1]; 102 | String expected = test_vectors[i][2]; 103 | String hashed = BCrypt.hashpw(plain, salt); 104 | assertEquals(hashed, expected); 105 | System.out.print("."); 106 | } 107 | System.out.println(""); 108 | } 109 | 110 | /** 111 | * Test method for 'BCrypt.gensalt(int)' 112 | */ 113 | public void testGensaltInt() { 114 | System.out.print("BCrypt.gensalt(log_rounds):"); 115 | for (int i = 4; i <= 12; i++) { 116 | System.out.print(" " + Integer.toString(i) + ":"); 117 | for (int j = 0; j < test_vectors.length; j += 4) { 118 | String plain = test_vectors[j][0]; 119 | String salt = BCrypt.gensalt(i); 120 | String hashed1 = BCrypt.hashpw(plain, salt); 121 | String hashed2 = BCrypt.hashpw(plain, hashed1); 122 | assertEquals(hashed1, hashed2); 123 | System.out.print("."); 124 | } 125 | } 126 | System.out.println(""); 127 | } 128 | 129 | /** 130 | * Test method for 'BCrypt.gensalt()' 131 | */ 132 | public void testGensalt() { 133 | System.out.print("BCrypt.gensalt(): "); 134 | for (int i = 0; i < test_vectors.length; i += 4) { 135 | String plain = test_vectors[i][0]; 136 | String salt = BCrypt.gensalt(); 137 | String hashed1 = BCrypt.hashpw(plain, salt); 138 | String hashed2 = BCrypt.hashpw(plain, hashed1); 139 | assertEquals(hashed1, hashed2); 140 | System.out.print("."); 141 | } 142 | System.out.println(""); 143 | } 144 | 145 | /** 146 | * Test method for 'BCrypt.checkpw(String, String)' 147 | * expecting success 148 | */ 149 | public void testCheckpw_success() { 150 | System.out.print("BCrypt.checkpw w/ good passwords: "); 151 | for (int i = 0; i < test_vectors.length; i++) { 152 | String plain = test_vectors[i][0]; 153 | String expected = test_vectors[i][2]; 154 | assertTrue(BCrypt.checkpw(plain, expected)); 155 | System.out.print("."); 156 | } 157 | System.out.println(""); 158 | } 159 | 160 | /** 161 | * Test method for 'BCrypt.checkpw(String, String)' 162 | * expecting failure 163 | */ 164 | public void testCheckpw_failure() { 165 | System.out.print("BCrypt.checkpw w/ bad passwords: "); 166 | for (int i = 0; i < test_vectors.length; i++) { 167 | int broken_index = (i + 4) % test_vectors.length; 168 | String plain = test_vectors[i][0]; 169 | String expected = test_vectors[broken_index][2]; 170 | assertFalse(BCrypt.checkpw(plain, expected)); 171 | System.out.print("."); 172 | } 173 | System.out.println(""); 174 | } 175 | 176 | /** 177 | * Test for correct hashing of non-US-ASCII passwords 178 | */ 179 | public void testInternationalChars() { 180 | System.out.print("BCrypt.hashpw w/ international chars: "); 181 | String pw1 = "ππππππππ"; 182 | String pw2 = "????????"; 183 | 184 | String h1 = BCrypt.hashpw(pw1, BCrypt.gensalt()); 185 | assertFalse(BCrypt.checkpw(pw2, h1)); 186 | System.out.print("."); 187 | 188 | String h2 = BCrypt.hashpw(pw2, BCrypt.gensalt()); 189 | assertFalse(BCrypt.checkpw(pw1, h2)); 190 | System.out.print("."); 191 | System.out.println(""); 192 | } 193 | 194 | } 195 | -------------------------------------------------------------------------------- /ext/mri/wrapper.c: -------------------------------------------------------------------------------- 1 | /* 2 | * Written by Solar Designer and placed in the public domain. 3 | * See crypt_blowfish.c for more information. 4 | */ 5 | 6 | #include 7 | #include 8 | 9 | #include 10 | #ifndef __set_errno 11 | #define __set_errno(val) errno = (val) 12 | #endif 13 | 14 | #ifdef TEST 15 | #include 16 | #include 17 | #include 18 | #include 19 | #include 20 | #include 21 | #ifdef TEST_THREADS 22 | #include 23 | #endif 24 | #endif 25 | 26 | #include 27 | #ifdef HAVE_RUBY_UTIL_H 28 | #include 29 | #else 30 | #include 31 | #endif 32 | 33 | #define CRYPT_OUTPUT_SIZE (7 + 22 + 31 + 1) 34 | #define CRYPT_GENSALT_OUTPUT_SIZE (7 + 22 + 1) 35 | 36 | #if defined(__GLIBC__) && defined(_LIBC) 37 | #define __SKIP_GNU 38 | #endif 39 | #include "ow-crypt.h" 40 | 41 | extern char *_crypt_blowfish_rn(__CONST char *key, __CONST char *setting, 42 | char *output, int size); 43 | extern char *_crypt_gensalt_blowfish_rn(unsigned long count, 44 | __CONST char *input, int size, char *output, int output_size); 45 | 46 | extern unsigned char _crypt_itoa64[]; 47 | extern char *_crypt_gensalt_traditional_rn(unsigned long count, 48 | __CONST char *input, int size, char *output, int output_size); 49 | extern char *_crypt_gensalt_extended_rn(unsigned long count, 50 | __CONST char *input, int size, char *output, int output_size); 51 | extern char *_crypt_gensalt_md5_rn(unsigned long count, 52 | __CONST char *input, int size, char *output, int output_size); 53 | 54 | #if defined(__GLIBC__) && defined(_LIBC) 55 | /* crypt.h from glibc-crypt-2.1 will define struct crypt_data for us */ 56 | #include "crypt.h" 57 | extern char *__md5_crypt_r(const char *key, const char *salt, 58 | char *buffer, int buflen); 59 | /* crypt-entry.c needs to be patched to define __des_crypt_r rather than 60 | * __crypt_r, and not define crypt_r and crypt at all */ 61 | extern char *__des_crypt_r(const char *key, const char *salt, 62 | struct crypt_data *data); 63 | extern struct crypt_data _ufc_foobar; 64 | #endif 65 | 66 | static int _crypt_data_alloc(void **data, int *size, int need) 67 | { 68 | void *updated; 69 | 70 | if (*data && *size >= need) return 0; 71 | 72 | updated = realloc(*data, need); 73 | 74 | if (!updated) { 75 | #ifndef __GLIBC__ 76 | /* realloc(3) on glibc sets errno, so we don't need to bother */ 77 | __set_errno(ENOMEM); 78 | #endif 79 | return -1; 80 | } 81 | 82 | #if defined(__GLIBC__) && defined(_LIBC) 83 | if (need >= sizeof(struct crypt_data)) 84 | ((struct crypt_data *)updated)->initialized = 0; 85 | #endif 86 | 87 | *data = updated; 88 | *size = need; 89 | 90 | return 0; 91 | } 92 | 93 | static char *_crypt_retval_magic(char *retval, __CONST char *setting, 94 | char *output) 95 | { 96 | if (retval) return retval; 97 | 98 | output[0] = '*'; 99 | output[1] = '0'; 100 | output[2] = '\0'; 101 | 102 | if (setting[0] == '*' && setting[1] == '0') 103 | output[1] = '1'; 104 | 105 | return output; 106 | } 107 | 108 | #if defined(__GLIBC__) && defined(_LIBC) 109 | /* 110 | * Applications may re-use the same instance of struct crypt_data without 111 | * resetting the initialized field in order to let crypt_r() skip some of 112 | * its initialization code. Thus, it is important that our multiple hashing 113 | * algorithms either don't conflict with each other in their use of the 114 | * data area or reset the initialized field themselves whenever required. 115 | * Currently, the hashing algorithms simply have no conflicts: the first 116 | * field of struct crypt_data is the 128-byte large DES key schedule which 117 | * __des_crypt_r() calculates each time it is called while the two other 118 | * hashing algorithms use less than 128 bytes of the data area. 119 | */ 120 | 121 | char *__crypt_rn(__const char *key, __const char *setting, 122 | void *data, int size) 123 | { 124 | if (setting[0] == '$' && setting[1] == '2') 125 | return _crypt_blowfish_rn(key, setting, (char *)data, size); 126 | if (setting[0] == '$' && setting[1] == '1') 127 | return __md5_crypt_r(key, setting, (char *)data, size); 128 | if (setting[0] == '$' || setting[0] == '_') { 129 | __set_errno(EINVAL); 130 | return NULL; 131 | } 132 | if (size >= sizeof(struct crypt_data)) 133 | return __des_crypt_r(key, setting, (struct crypt_data *)data); 134 | __set_errno(ERANGE); 135 | return NULL; 136 | } 137 | 138 | char *__crypt_ra(__const char *key, __const char *setting, 139 | void **data, int *size) 140 | { 141 | if (setting[0] == '$' && setting[1] == '2') { 142 | if (_crypt_data_alloc(data, size, CRYPT_OUTPUT_SIZE)) 143 | return NULL; 144 | return _crypt_blowfish_rn(key, setting, (char *)*data, *size); 145 | } 146 | if (setting[0] == '$' && setting[1] == '1') { 147 | if (_crypt_data_alloc(data, size, CRYPT_OUTPUT_SIZE)) 148 | return NULL; 149 | return __md5_crypt_r(key, setting, (char *)*data, *size); 150 | } 151 | if (setting[0] == '$' || setting[0] == '_') { 152 | __set_errno(EINVAL); 153 | return NULL; 154 | } 155 | if (_crypt_data_alloc(data, size, sizeof(struct crypt_data))) 156 | return NULL; 157 | return __des_crypt_r(key, setting, (struct crypt_data *)*data); 158 | } 159 | 160 | char *__crypt_r(__const char *key, __const char *setting, 161 | struct crypt_data *data) 162 | { 163 | return _crypt_retval_magic( 164 | __crypt_rn(key, setting, data, sizeof(*data)), 165 | setting, (char *)data); 166 | } 167 | 168 | char *__crypt(__const char *key, __const char *setting) 169 | { 170 | return _crypt_retval_magic( 171 | __crypt_rn(key, setting, &_ufc_foobar, sizeof(_ufc_foobar)), 172 | setting, (char *)&_ufc_foobar); 173 | } 174 | #else 175 | char *crypt_rn(__CONST char *key, __CONST char *setting, void *data, int size) 176 | { 177 | return _crypt_blowfish_rn(key, setting, (char *)data, size); 178 | } 179 | 180 | char *crypt_ra(__CONST char *key, __CONST char *setting, 181 | void **data, int *size) 182 | { 183 | if (_crypt_data_alloc(data, size, CRYPT_OUTPUT_SIZE)) 184 | return NULL; 185 | return _crypt_blowfish_rn(key, setting, (char *)*data, *size); 186 | } 187 | 188 | char *crypt_r(__CONST char *key, __CONST char *setting, void *data) 189 | { 190 | return _crypt_retval_magic( 191 | crypt_rn(key, setting, data, CRYPT_OUTPUT_SIZE), 192 | setting, (char *)data); 193 | } 194 | 195 | #define __crypt_gensalt_rn crypt_gensalt_rn 196 | #define __crypt_gensalt_ra crypt_gensalt_ra 197 | #define __crypt_gensalt crypt_gensalt 198 | #endif 199 | 200 | char *__crypt_gensalt_rn(__CONST char *prefix, unsigned long count, 201 | __CONST char *input, int size, char *output, int output_size) 202 | { 203 | char *(*use)(unsigned long count, 204 | __CONST char *input, int size, char *output, int output_size); 205 | 206 | /* This may be supported on some platforms in the future */ 207 | if (!input) { 208 | __set_errno(EINVAL); 209 | return NULL; 210 | } 211 | 212 | if (!strncmp(prefix, "$2a$", 4)) 213 | use = _crypt_gensalt_blowfish_rn; 214 | else 215 | if (!strncmp(prefix, "$1$", 3)) 216 | use = _crypt_gensalt_md5_rn; 217 | else 218 | if (prefix[0] == '_') 219 | use = _crypt_gensalt_extended_rn; 220 | else 221 | if (!prefix[0] || 222 | (prefix[0] && prefix[1] && 223 | memchr(_crypt_itoa64, prefix[0], 64) && 224 | memchr(_crypt_itoa64, prefix[1], 64))) 225 | use = _crypt_gensalt_traditional_rn; 226 | else { 227 | __set_errno(EINVAL); 228 | return NULL; 229 | } 230 | 231 | return use(count, input, size, output, output_size); 232 | } 233 | 234 | char *__crypt_gensalt_ra(__CONST char *prefix, unsigned long count, 235 | __CONST char *input, int size) 236 | { 237 | char output[CRYPT_GENSALT_OUTPUT_SIZE]; 238 | char *retval; 239 | 240 | retval = __crypt_gensalt_rn(prefix, count, 241 | input, size, output, sizeof(output)); 242 | 243 | if (retval) { 244 | retval = ruby_strdup(retval); 245 | #ifndef __GLIBC__ 246 | /* strdup(3) on glibc sets errno, so we don't need to bother */ 247 | if (!retval) 248 | __set_errno(ENOMEM); 249 | #endif 250 | } 251 | 252 | return retval; 253 | } 254 | 255 | char *__crypt_gensalt(__CONST char *prefix, unsigned long count, 256 | __CONST char *input, int size) 257 | { 258 | static char output[CRYPT_GENSALT_OUTPUT_SIZE]; 259 | 260 | return __crypt_gensalt_rn(prefix, count, 261 | input, size, output, sizeof(output)); 262 | } 263 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # bcrypt-ruby 2 | 3 | An easy way to keep your users' passwords secure. 4 | 5 | * http://github.com/codahale/bcrypt-ruby/tree/master 6 | 7 | [![Build Status](https://travis-ci.org/codahale/bcrypt-ruby.png?branch=master)](https://travis-ci.org/codahale/bcrypt-ruby) 8 | 9 | ## Why you should use `bcrypt()` 10 | 11 | If you store user passwords in the clear, then an attacker who steals a copy of your database has a giant list of emails 12 | and passwords. Some of your users will only have one password -- for their email account, for their banking account, for 13 | your application. A simple hack could escalate into massive identity theft. 14 | 15 | It's your responsibility as a web developer to make your web application secure -- blaming your users for not being 16 | security experts is not a professional response to risk. 17 | 18 | `bcrypt()` allows you to easily harden your application against these kinds of attacks. 19 | 20 | *Note*: JRuby versions of the bcrypt gem `<= 2.1.3` had a [security 21 | vulnerability](http://www.mindrot.org/files/jBCrypt/internat.adv) that 22 | was fixed in `>= 2.1.4`. If you used a vulnerable version to hash 23 | passwords with international characters in them, you will need to 24 | re-hash those passwords. This vulnerability only affected the JRuby gem. 25 | 26 | ## How to install bcrypt 27 | 28 | gem install bcrypt 29 | 30 | The bcrypt gem is available on the following ruby platforms: 31 | 32 | * JRuby 33 | * RubyInstaller 1.8, 1.9, and 2.0 builds on win32 34 | * Any 1.8, 1.9, 2.0, or 2.1 ruby on a BSD/OSX/Linux system with a compiler 35 | 36 | ## How to use `bcrypt()` in your Rails application 37 | 38 | *Note*: Rails versions >= 3 ship with `ActiveModel::SecurePassword` which uses bcrypt-ruby. 39 | `has_secure_password` [docs](http://api.rubyonrails.org/classes/ActiveModel/SecurePassword/ClassMethods.html#method-i-has_secure_password) 40 | implements a similar authentication strategy to the code below. 41 | 42 | ### The _User_ model 43 | 44 | require 'bcrypt' 45 | 46 | class User < ActiveRecord::Base 47 | # users.password_hash in the database is a :string 48 | include BCrypt 49 | 50 | def password 51 | @password ||= Password.new(password_hash) 52 | end 53 | 54 | def password=(new_password) 55 | @password = Password.create(new_password) 56 | self.password_hash = @password 57 | end 58 | end 59 | 60 | ### Creating an account 61 | 62 | def create 63 | @user = User.new(params[:user]) 64 | @user.password = params[:password] 65 | @user.save! 66 | end 67 | 68 | ### Authenticating a user 69 | 70 | def login 71 | @user = User.find_by_email(params[:email]) 72 | if @user.password == params[:password] 73 | give_token 74 | else 75 | redirect_to home_url 76 | end 77 | end 78 | 79 | ### If a user forgets their password? 80 | 81 | # assign them a random one and mail it to them, asking them to change it 82 | def forgot_password 83 | @user = User.find_by_email(params[:email]) 84 | random_password = Array.new(10).map { (65 + rand(58)).chr }.join 85 | @user.password = random_password 86 | @user.save! 87 | Mailer.create_and_deliver_password_change(@user, random_password) 88 | end 89 | 90 | ## How to use bcrypt-ruby in general 91 | 92 | require 'bcrypt' 93 | 94 | my_password = BCrypt::Password.create("my password") 95 | #=> "$2a$10$vI8aWBnW3fID.ZQ4/zo1G.q1lRps.9cGLcZEiGDMVr5yUP1KUOYTa" 96 | 97 | my_password.version #=> "2a" 98 | my_password.cost #=> 10 99 | my_password == "my password" #=> true 100 | my_password == "not my password" #=> false 101 | 102 | my_password = BCrypt::Password.new("$2a$10$vI8aWBnW3fID.ZQ4/zo1G.q1lRps.9cGLcZEiGDMVr5yUP1KUOYTa") 103 | my_password == "my password" #=> true 104 | my_password == "not my password" #=> false 105 | 106 | Check the rdocs for more details -- BCrypt, BCrypt::Password. 107 | 108 | ## How `bcrypt()` works 109 | 110 | `bcrypt()` is a hashing algorithm designed by Niels Provos and David Mazières of the OpenBSD Project. 111 | 112 | ### Background 113 | 114 | Hash algorithms take a chunk of data (e.g., your user's password) and create a "digital fingerprint," or hash, of it. 115 | Because this process is not reversible, there's no way to go from the hash back to the password. 116 | 117 | In other words: 118 | 119 | hash(p) #=> 120 | 121 | You can store the hash and check it against a hash made of a potentially valid password: 122 | 123 | =? hash(just_entered_password) 124 | 125 | ### Rainbow Tables 126 | 127 | But even this has weaknesses -- attackers can just run lists of possible passwords through the same algorithm, store the 128 | results in a big database, and then look up the passwords by their hash: 129 | 130 | PrecomputedPassword.find_by_hash().password #=> "secret1" 131 | 132 | ### Salts 133 | 134 | The solution to this is to add a small chunk of random data -- called a salt -- to the password before it's hashed: 135 | 136 | hash(salt + p) #=> 137 | 138 | The salt is then stored along with the hash in the database, and used to check potentially valid passwords: 139 | 140 | =? hash(salt + just_entered_password) 141 | 142 | bcrypt-ruby automatically handles the storage and generation of these salts for you. 143 | 144 | Adding a salt means that an attacker has to have a gigantic database for each unique salt -- for a salt made of 4 145 | letters, that's 456,976 different databases. Pretty much no one has that much storage space, so attackers try a 146 | different, slower method -- throw a list of potential passwords at each individual password: 147 | 148 | hash(salt + "aadvark") =? 149 | hash(salt + "abacus") =? 150 | etc. 151 | 152 | This is much slower than the big database approach, but most hash algorithms are pretty quick -- and therein lies the 153 | problem. Hash algorithms aren't usually designed to be slow, they're designed to turn gigabytes of data into secure 154 | fingerprints as quickly as possible. `bcrypt()`, though, is designed to be computationally expensive: 155 | 156 | Ten thousand iterations: 157 | user system total real 158 | md5 0.070000 0.000000 0.070000 ( 0.070415) 159 | bcrypt 22.230000 0.080000 22.310000 ( 22.493822) 160 | 161 | If an attacker was using Ruby to check each password, they could check ~140,000 passwords a second with MD5 but only 162 | ~450 passwords a second with `bcrypt()`. 163 | 164 | ### Cost Factors 165 | 166 | In addition, `bcrypt()` allows you to increase the amount of work required to hash a password as computers get faster. Old 167 | passwords will still work fine, but new passwords can keep up with the times. 168 | 169 | The default cost factor used by bcrypt-ruby is 10, which is fine for session-based authentication. If you are using a 170 | stateless authentication architecture (e.g., HTTP Basic Auth), you will want to lower the cost factor to reduce your 171 | server load and keep your request times down. This will lower the security provided you, but there are few alternatives. 172 | 173 | To change the default cost factor used by bcrypt-ruby, use `BCrypt::Engine.cost = new_value`: 174 | 175 | BCrypt::Password.create('secret').cost 176 | #=> 10, the default provided by bcrypt-ruby 177 | 178 | # set a new default cost 179 | BCrypt::Engine.cost = 8 180 | BCrypt::Password.create('secret').cost 181 | #=> 8 182 | 183 | The default cost can be overridden as needed by passing an options hash with a different cost: 184 | 185 | BCrypt::Password.create('secret', :cost => 6).cost #=> 6 186 | 187 | ## More Information 188 | 189 | `bcrypt()` is currently used as the default password storage hash in OpenBSD, widely regarded as the most secure operating 190 | system available. 191 | 192 | For a more technical explanation of the algorithm and its design criteria, please read Niels Provos and David Mazières' 193 | Usenix99 paper: 194 | http://www.usenix.org/events/usenix99/provos.html 195 | 196 | If you'd like more down-to-earth advice regarding cryptography, I suggest reading Practical Cryptography by Niels 197 | Ferguson and Bruce Schneier: 198 | http://www.schneier.com/book-practical.html 199 | 200 | # Etc 201 | 202 | * Author :: Coda Hale 203 | * Website :: http://blog.codahale.com 204 | -------------------------------------------------------------------------------- /ext/mri/crypt_blowfish.c: -------------------------------------------------------------------------------- 1 | /* 2 | * This code comes from John the Ripper password cracker, with reentrant 3 | * and crypt(3) interfaces added, but optimizations specific to password 4 | * cracking removed. 5 | * 6 | * Written by Solar Designer in 1998-2002 and 7 | * placed in the public domain. Quick self-test added in 2011 and also 8 | * placed in the public domain. 9 | * 10 | * There's absolutely no warranty. 11 | * 12 | * It is my intent that you should be able to use this on your system, 13 | * as a part of a software package, or anywhere else to improve security, 14 | * ensure compatibility, or for any other purpose. I would appreciate 15 | * it if you give credit where it is due and keep your modifications in 16 | * the public domain as well, but I don't require that in order to let 17 | * you place this code and any modifications you make under a license 18 | * of your choice. 19 | * 20 | * This implementation is compatible with OpenBSD bcrypt.c (version 2a) 21 | * by Niels Provos , and uses some of his 22 | * ideas. The password hashing algorithm was designed by David Mazieres 23 | * . 24 | * 25 | * There's a paper on the algorithm that explains its design decisions: 26 | * 27 | * http://www.usenix.org/events/usenix99/provos.html 28 | * 29 | * Some of the tricks in BF_ROUND might be inspired by Eric Young's 30 | * Blowfish library (I can't be sure if I would think of something if I 31 | * hadn't seen his code). 32 | */ 33 | 34 | #include 35 | 36 | #include 37 | #ifndef __set_errno 38 | #define __set_errno(val) errno = (val) 39 | #endif 40 | 41 | #undef __CONST 42 | #ifdef __GNUC__ 43 | #define __CONST __const 44 | #else 45 | #define __CONST 46 | #endif 47 | 48 | /* 49 | * Please keep this enabled. We really don't want incompatible hashes to be 50 | * produced. The performance cost of this quick self-test is around 0.6% at 51 | * the "$2a$08" setting. 52 | */ 53 | #define BF_SELF_TEST 54 | 55 | #if defined(__x86_64__) || defined(__alpha__) || defined(__hppa__) 56 | #define BF_ASM 0 57 | #define BF_SCALE 1 58 | #else 59 | #define BF_ASM 0 60 | #define BF_SCALE 0 61 | #endif 62 | 63 | typedef unsigned int BF_word; 64 | typedef signed int BF_word_signed; 65 | 66 | /* Number of Blowfish rounds, this is also hardcoded into a few places */ 67 | #define BF_N 16 68 | 69 | typedef BF_word BF_key[BF_N + 2]; 70 | 71 | typedef struct { 72 | BF_word S[4][0x100]; 73 | BF_key P; 74 | } BF_ctx; 75 | 76 | /* 77 | * Magic IV for 64 Blowfish encryptions that we do at the end. 78 | * The string is "OrpheanBeholderScryDoubt" on big-endian. 79 | */ 80 | static BF_word BF_magic_w[6] = { 81 | 0x4F727068, 0x65616E42, 0x65686F6C, 82 | 0x64657253, 0x63727944, 0x6F756274 83 | }; 84 | 85 | /* 86 | * P-box and S-box tables initialized with digits of Pi. 87 | */ 88 | static BF_ctx BF_init_state = { 89 | { 90 | { 91 | 0xd1310ba6, 0x98dfb5ac, 0x2ffd72db, 0xd01adfb7, 92 | 0xb8e1afed, 0x6a267e96, 0xba7c9045, 0xf12c7f99, 93 | 0x24a19947, 0xb3916cf7, 0x0801f2e2, 0x858efc16, 94 | 0x636920d8, 0x71574e69, 0xa458fea3, 0xf4933d7e, 95 | 0x0d95748f, 0x728eb658, 0x718bcd58, 0x82154aee, 96 | 0x7b54a41d, 0xc25a59b5, 0x9c30d539, 0x2af26013, 97 | 0xc5d1b023, 0x286085f0, 0xca417918, 0xb8db38ef, 98 | 0x8e79dcb0, 0x603a180e, 0x6c9e0e8b, 0xb01e8a3e, 99 | 0xd71577c1, 0xbd314b27, 0x78af2fda, 0x55605c60, 100 | 0xe65525f3, 0xaa55ab94, 0x57489862, 0x63e81440, 101 | 0x55ca396a, 0x2aab10b6, 0xb4cc5c34, 0x1141e8ce, 102 | 0xa15486af, 0x7c72e993, 0xb3ee1411, 0x636fbc2a, 103 | 0x2ba9c55d, 0x741831f6, 0xce5c3e16, 0x9b87931e, 104 | 0xafd6ba33, 0x6c24cf5c, 0x7a325381, 0x28958677, 105 | 0x3b8f4898, 0x6b4bb9af, 0xc4bfe81b, 0x66282193, 106 | 0x61d809cc, 0xfb21a991, 0x487cac60, 0x5dec8032, 107 | 0xef845d5d, 0xe98575b1, 0xdc262302, 0xeb651b88, 108 | 0x23893e81, 0xd396acc5, 0x0f6d6ff3, 0x83f44239, 109 | 0x2e0b4482, 0xa4842004, 0x69c8f04a, 0x9e1f9b5e, 110 | 0x21c66842, 0xf6e96c9a, 0x670c9c61, 0xabd388f0, 111 | 0x6a51a0d2, 0xd8542f68, 0x960fa728, 0xab5133a3, 112 | 0x6eef0b6c, 0x137a3be4, 0xba3bf050, 0x7efb2a98, 113 | 0xa1f1651d, 0x39af0176, 0x66ca593e, 0x82430e88, 114 | 0x8cee8619, 0x456f9fb4, 0x7d84a5c3, 0x3b8b5ebe, 115 | 0xe06f75d8, 0x85c12073, 0x401a449f, 0x56c16aa6, 116 | 0x4ed3aa62, 0x363f7706, 0x1bfedf72, 0x429b023d, 117 | 0x37d0d724, 0xd00a1248, 0xdb0fead3, 0x49f1c09b, 118 | 0x075372c9, 0x80991b7b, 0x25d479d8, 0xf6e8def7, 119 | 0xe3fe501a, 0xb6794c3b, 0x976ce0bd, 0x04c006ba, 120 | 0xc1a94fb6, 0x409f60c4, 0x5e5c9ec2, 0x196a2463, 121 | 0x68fb6faf, 0x3e6c53b5, 0x1339b2eb, 0x3b52ec6f, 122 | 0x6dfc511f, 0x9b30952c, 0xcc814544, 0xaf5ebd09, 123 | 0xbee3d004, 0xde334afd, 0x660f2807, 0x192e4bb3, 124 | 0xc0cba857, 0x45c8740f, 0xd20b5f39, 0xb9d3fbdb, 125 | 0x5579c0bd, 0x1a60320a, 0xd6a100c6, 0x402c7279, 126 | 0x679f25fe, 0xfb1fa3cc, 0x8ea5e9f8, 0xdb3222f8, 127 | 0x3c7516df, 0xfd616b15, 0x2f501ec8, 0xad0552ab, 128 | 0x323db5fa, 0xfd238760, 0x53317b48, 0x3e00df82, 129 | 0x9e5c57bb, 0xca6f8ca0, 0x1a87562e, 0xdf1769db, 130 | 0xd542a8f6, 0x287effc3, 0xac6732c6, 0x8c4f5573, 131 | 0x695b27b0, 0xbbca58c8, 0xe1ffa35d, 0xb8f011a0, 132 | 0x10fa3d98, 0xfd2183b8, 0x4afcb56c, 0x2dd1d35b, 133 | 0x9a53e479, 0xb6f84565, 0xd28e49bc, 0x4bfb9790, 134 | 0xe1ddf2da, 0xa4cb7e33, 0x62fb1341, 0xcee4c6e8, 135 | 0xef20cada, 0x36774c01, 0xd07e9efe, 0x2bf11fb4, 136 | 0x95dbda4d, 0xae909198, 0xeaad8e71, 0x6b93d5a0, 137 | 0xd08ed1d0, 0xafc725e0, 0x8e3c5b2f, 0x8e7594b7, 138 | 0x8ff6e2fb, 0xf2122b64, 0x8888b812, 0x900df01c, 139 | 0x4fad5ea0, 0x688fc31c, 0xd1cff191, 0xb3a8c1ad, 140 | 0x2f2f2218, 0xbe0e1777, 0xea752dfe, 0x8b021fa1, 141 | 0xe5a0cc0f, 0xb56f74e8, 0x18acf3d6, 0xce89e299, 142 | 0xb4a84fe0, 0xfd13e0b7, 0x7cc43b81, 0xd2ada8d9, 143 | 0x165fa266, 0x80957705, 0x93cc7314, 0x211a1477, 144 | 0xe6ad2065, 0x77b5fa86, 0xc75442f5, 0xfb9d35cf, 145 | 0xebcdaf0c, 0x7b3e89a0, 0xd6411bd3, 0xae1e7e49, 146 | 0x00250e2d, 0x2071b35e, 0x226800bb, 0x57b8e0af, 147 | 0x2464369b, 0xf009b91e, 0x5563911d, 0x59dfa6aa, 148 | 0x78c14389, 0xd95a537f, 0x207d5ba2, 0x02e5b9c5, 149 | 0x83260376, 0x6295cfa9, 0x11c81968, 0x4e734a41, 150 | 0xb3472dca, 0x7b14a94a, 0x1b510052, 0x9a532915, 151 | 0xd60f573f, 0xbc9bc6e4, 0x2b60a476, 0x81e67400, 152 | 0x08ba6fb5, 0x571be91f, 0xf296ec6b, 0x2a0dd915, 153 | 0xb6636521, 0xe7b9f9b6, 0xff34052e, 0xc5855664, 154 | 0x53b02d5d, 0xa99f8fa1, 0x08ba4799, 0x6e85076a 155 | }, { 156 | 0x4b7a70e9, 0xb5b32944, 0xdb75092e, 0xc4192623, 157 | 0xad6ea6b0, 0x49a7df7d, 0x9cee60b8, 0x8fedb266, 158 | 0xecaa8c71, 0x699a17ff, 0x5664526c, 0xc2b19ee1, 159 | 0x193602a5, 0x75094c29, 0xa0591340, 0xe4183a3e, 160 | 0x3f54989a, 0x5b429d65, 0x6b8fe4d6, 0x99f73fd6, 161 | 0xa1d29c07, 0xefe830f5, 0x4d2d38e6, 0xf0255dc1, 162 | 0x4cdd2086, 0x8470eb26, 0x6382e9c6, 0x021ecc5e, 163 | 0x09686b3f, 0x3ebaefc9, 0x3c971814, 0x6b6a70a1, 164 | 0x687f3584, 0x52a0e286, 0xb79c5305, 0xaa500737, 165 | 0x3e07841c, 0x7fdeae5c, 0x8e7d44ec, 0x5716f2b8, 166 | 0xb03ada37, 0xf0500c0d, 0xf01c1f04, 0x0200b3ff, 167 | 0xae0cf51a, 0x3cb574b2, 0x25837a58, 0xdc0921bd, 168 | 0xd19113f9, 0x7ca92ff6, 0x94324773, 0x22f54701, 169 | 0x3ae5e581, 0x37c2dadc, 0xc8b57634, 0x9af3dda7, 170 | 0xa9446146, 0x0fd0030e, 0xecc8c73e, 0xa4751e41, 171 | 0xe238cd99, 0x3bea0e2f, 0x3280bba1, 0x183eb331, 172 | 0x4e548b38, 0x4f6db908, 0x6f420d03, 0xf60a04bf, 173 | 0x2cb81290, 0x24977c79, 0x5679b072, 0xbcaf89af, 174 | 0xde9a771f, 0xd9930810, 0xb38bae12, 0xdccf3f2e, 175 | 0x5512721f, 0x2e6b7124, 0x501adde6, 0x9f84cd87, 176 | 0x7a584718, 0x7408da17, 0xbc9f9abc, 0xe94b7d8c, 177 | 0xec7aec3a, 0xdb851dfa, 0x63094366, 0xc464c3d2, 178 | 0xef1c1847, 0x3215d908, 0xdd433b37, 0x24c2ba16, 179 | 0x12a14d43, 0x2a65c451, 0x50940002, 0x133ae4dd, 180 | 0x71dff89e, 0x10314e55, 0x81ac77d6, 0x5f11199b, 181 | 0x043556f1, 0xd7a3c76b, 0x3c11183b, 0x5924a509, 182 | 0xf28fe6ed, 0x97f1fbfa, 0x9ebabf2c, 0x1e153c6e, 183 | 0x86e34570, 0xeae96fb1, 0x860e5e0a, 0x5a3e2ab3, 184 | 0x771fe71c, 0x4e3d06fa, 0x2965dcb9, 0x99e71d0f, 185 | 0x803e89d6, 0x5266c825, 0x2e4cc978, 0x9c10b36a, 186 | 0xc6150eba, 0x94e2ea78, 0xa5fc3c53, 0x1e0a2df4, 187 | 0xf2f74ea7, 0x361d2b3d, 0x1939260f, 0x19c27960, 188 | 0x5223a708, 0xf71312b6, 0xebadfe6e, 0xeac31f66, 189 | 0xe3bc4595, 0xa67bc883, 0xb17f37d1, 0x018cff28, 190 | 0xc332ddef, 0xbe6c5aa5, 0x65582185, 0x68ab9802, 191 | 0xeecea50f, 0xdb2f953b, 0x2aef7dad, 0x5b6e2f84, 192 | 0x1521b628, 0x29076170, 0xecdd4775, 0x619f1510, 193 | 0x13cca830, 0xeb61bd96, 0x0334fe1e, 0xaa0363cf, 194 | 0xb5735c90, 0x4c70a239, 0xd59e9e0b, 0xcbaade14, 195 | 0xeecc86bc, 0x60622ca7, 0x9cab5cab, 0xb2f3846e, 196 | 0x648b1eaf, 0x19bdf0ca, 0xa02369b9, 0x655abb50, 197 | 0x40685a32, 0x3c2ab4b3, 0x319ee9d5, 0xc021b8f7, 198 | 0x9b540b19, 0x875fa099, 0x95f7997e, 0x623d7da8, 199 | 0xf837889a, 0x97e32d77, 0x11ed935f, 0x16681281, 200 | 0x0e358829, 0xc7e61fd6, 0x96dedfa1, 0x7858ba99, 201 | 0x57f584a5, 0x1b227263, 0x9b83c3ff, 0x1ac24696, 202 | 0xcdb30aeb, 0x532e3054, 0x8fd948e4, 0x6dbc3128, 203 | 0x58ebf2ef, 0x34c6ffea, 0xfe28ed61, 0xee7c3c73, 204 | 0x5d4a14d9, 0xe864b7e3, 0x42105d14, 0x203e13e0, 205 | 0x45eee2b6, 0xa3aaabea, 0xdb6c4f15, 0xfacb4fd0, 206 | 0xc742f442, 0xef6abbb5, 0x654f3b1d, 0x41cd2105, 207 | 0xd81e799e, 0x86854dc7, 0xe44b476a, 0x3d816250, 208 | 0xcf62a1f2, 0x5b8d2646, 0xfc8883a0, 0xc1c7b6a3, 209 | 0x7f1524c3, 0x69cb7492, 0x47848a0b, 0x5692b285, 210 | 0x095bbf00, 0xad19489d, 0x1462b174, 0x23820e00, 211 | 0x58428d2a, 0x0c55f5ea, 0x1dadf43e, 0x233f7061, 212 | 0x3372f092, 0x8d937e41, 0xd65fecf1, 0x6c223bdb, 213 | 0x7cde3759, 0xcbee7460, 0x4085f2a7, 0xce77326e, 214 | 0xa6078084, 0x19f8509e, 0xe8efd855, 0x61d99735, 215 | 0xa969a7aa, 0xc50c06c2, 0x5a04abfc, 0x800bcadc, 216 | 0x9e447a2e, 0xc3453484, 0xfdd56705, 0x0e1e9ec9, 217 | 0xdb73dbd3, 0x105588cd, 0x675fda79, 0xe3674340, 218 | 0xc5c43465, 0x713e38d8, 0x3d28f89e, 0xf16dff20, 219 | 0x153e21e7, 0x8fb03d4a, 0xe6e39f2b, 0xdb83adf7 220 | }, { 221 | 0xe93d5a68, 0x948140f7, 0xf64c261c, 0x94692934, 222 | 0x411520f7, 0x7602d4f7, 0xbcf46b2e, 0xd4a20068, 223 | 0xd4082471, 0x3320f46a, 0x43b7d4b7, 0x500061af, 224 | 0x1e39f62e, 0x97244546, 0x14214f74, 0xbf8b8840, 225 | 0x4d95fc1d, 0x96b591af, 0x70f4ddd3, 0x66a02f45, 226 | 0xbfbc09ec, 0x03bd9785, 0x7fac6dd0, 0x31cb8504, 227 | 0x96eb27b3, 0x55fd3941, 0xda2547e6, 0xabca0a9a, 228 | 0x28507825, 0x530429f4, 0x0a2c86da, 0xe9b66dfb, 229 | 0x68dc1462, 0xd7486900, 0x680ec0a4, 0x27a18dee, 230 | 0x4f3ffea2, 0xe887ad8c, 0xb58ce006, 0x7af4d6b6, 231 | 0xaace1e7c, 0xd3375fec, 0xce78a399, 0x406b2a42, 232 | 0x20fe9e35, 0xd9f385b9, 0xee39d7ab, 0x3b124e8b, 233 | 0x1dc9faf7, 0x4b6d1856, 0x26a36631, 0xeae397b2, 234 | 0x3a6efa74, 0xdd5b4332, 0x6841e7f7, 0xca7820fb, 235 | 0xfb0af54e, 0xd8feb397, 0x454056ac, 0xba489527, 236 | 0x55533a3a, 0x20838d87, 0xfe6ba9b7, 0xd096954b, 237 | 0x55a867bc, 0xa1159a58, 0xcca92963, 0x99e1db33, 238 | 0xa62a4a56, 0x3f3125f9, 0x5ef47e1c, 0x9029317c, 239 | 0xfdf8e802, 0x04272f70, 0x80bb155c, 0x05282ce3, 240 | 0x95c11548, 0xe4c66d22, 0x48c1133f, 0xc70f86dc, 241 | 0x07f9c9ee, 0x41041f0f, 0x404779a4, 0x5d886e17, 242 | 0x325f51eb, 0xd59bc0d1, 0xf2bcc18f, 0x41113564, 243 | 0x257b7834, 0x602a9c60, 0xdff8e8a3, 0x1f636c1b, 244 | 0x0e12b4c2, 0x02e1329e, 0xaf664fd1, 0xcad18115, 245 | 0x6b2395e0, 0x333e92e1, 0x3b240b62, 0xeebeb922, 246 | 0x85b2a20e, 0xe6ba0d99, 0xde720c8c, 0x2da2f728, 247 | 0xd0127845, 0x95b794fd, 0x647d0862, 0xe7ccf5f0, 248 | 0x5449a36f, 0x877d48fa, 0xc39dfd27, 0xf33e8d1e, 249 | 0x0a476341, 0x992eff74, 0x3a6f6eab, 0xf4f8fd37, 250 | 0xa812dc60, 0xa1ebddf8, 0x991be14c, 0xdb6e6b0d, 251 | 0xc67b5510, 0x6d672c37, 0x2765d43b, 0xdcd0e804, 252 | 0xf1290dc7, 0xcc00ffa3, 0xb5390f92, 0x690fed0b, 253 | 0x667b9ffb, 0xcedb7d9c, 0xa091cf0b, 0xd9155ea3, 254 | 0xbb132f88, 0x515bad24, 0x7b9479bf, 0x763bd6eb, 255 | 0x37392eb3, 0xcc115979, 0x8026e297, 0xf42e312d, 256 | 0x6842ada7, 0xc66a2b3b, 0x12754ccc, 0x782ef11c, 257 | 0x6a124237, 0xb79251e7, 0x06a1bbe6, 0x4bfb6350, 258 | 0x1a6b1018, 0x11caedfa, 0x3d25bdd8, 0xe2e1c3c9, 259 | 0x44421659, 0x0a121386, 0xd90cec6e, 0xd5abea2a, 260 | 0x64af674e, 0xda86a85f, 0xbebfe988, 0x64e4c3fe, 261 | 0x9dbc8057, 0xf0f7c086, 0x60787bf8, 0x6003604d, 262 | 0xd1fd8346, 0xf6381fb0, 0x7745ae04, 0xd736fccc, 263 | 0x83426b33, 0xf01eab71, 0xb0804187, 0x3c005e5f, 264 | 0x77a057be, 0xbde8ae24, 0x55464299, 0xbf582e61, 265 | 0x4e58f48f, 0xf2ddfda2, 0xf474ef38, 0x8789bdc2, 266 | 0x5366f9c3, 0xc8b38e74, 0xb475f255, 0x46fcd9b9, 267 | 0x7aeb2661, 0x8b1ddf84, 0x846a0e79, 0x915f95e2, 268 | 0x466e598e, 0x20b45770, 0x8cd55591, 0xc902de4c, 269 | 0xb90bace1, 0xbb8205d0, 0x11a86248, 0x7574a99e, 270 | 0xb77f19b6, 0xe0a9dc09, 0x662d09a1, 0xc4324633, 271 | 0xe85a1f02, 0x09f0be8c, 0x4a99a025, 0x1d6efe10, 272 | 0x1ab93d1d, 0x0ba5a4df, 0xa186f20f, 0x2868f169, 273 | 0xdcb7da83, 0x573906fe, 0xa1e2ce9b, 0x4fcd7f52, 274 | 0x50115e01, 0xa70683fa, 0xa002b5c4, 0x0de6d027, 275 | 0x9af88c27, 0x773f8641, 0xc3604c06, 0x61a806b5, 276 | 0xf0177a28, 0xc0f586e0, 0x006058aa, 0x30dc7d62, 277 | 0x11e69ed7, 0x2338ea63, 0x53c2dd94, 0xc2c21634, 278 | 0xbbcbee56, 0x90bcb6de, 0xebfc7da1, 0xce591d76, 279 | 0x6f05e409, 0x4b7c0188, 0x39720a3d, 0x7c927c24, 280 | 0x86e3725f, 0x724d9db9, 0x1ac15bb4, 0xd39eb8fc, 281 | 0xed545578, 0x08fca5b5, 0xd83d7cd3, 0x4dad0fc4, 282 | 0x1e50ef5e, 0xb161e6f8, 0xa28514d9, 0x6c51133c, 283 | 0x6fd5c7e7, 0x56e14ec4, 0x362abfce, 0xddc6c837, 284 | 0xd79a3234, 0x92638212, 0x670efa8e, 0x406000e0 285 | }, { 286 | 0x3a39ce37, 0xd3faf5cf, 0xabc27737, 0x5ac52d1b, 287 | 0x5cb0679e, 0x4fa33742, 0xd3822740, 0x99bc9bbe, 288 | 0xd5118e9d, 0xbf0f7315, 0xd62d1c7e, 0xc700c47b, 289 | 0xb78c1b6b, 0x21a19045, 0xb26eb1be, 0x6a366eb4, 290 | 0x5748ab2f, 0xbc946e79, 0xc6a376d2, 0x6549c2c8, 291 | 0x530ff8ee, 0x468dde7d, 0xd5730a1d, 0x4cd04dc6, 292 | 0x2939bbdb, 0xa9ba4650, 0xac9526e8, 0xbe5ee304, 293 | 0xa1fad5f0, 0x6a2d519a, 0x63ef8ce2, 0x9a86ee22, 294 | 0xc089c2b8, 0x43242ef6, 0xa51e03aa, 0x9cf2d0a4, 295 | 0x83c061ba, 0x9be96a4d, 0x8fe51550, 0xba645bd6, 296 | 0x2826a2f9, 0xa73a3ae1, 0x4ba99586, 0xef5562e9, 297 | 0xc72fefd3, 0xf752f7da, 0x3f046f69, 0x77fa0a59, 298 | 0x80e4a915, 0x87b08601, 0x9b09e6ad, 0x3b3ee593, 299 | 0xe990fd5a, 0x9e34d797, 0x2cf0b7d9, 0x022b8b51, 300 | 0x96d5ac3a, 0x017da67d, 0xd1cf3ed6, 0x7c7d2d28, 301 | 0x1f9f25cf, 0xadf2b89b, 0x5ad6b472, 0x5a88f54c, 302 | 0xe029ac71, 0xe019a5e6, 0x47b0acfd, 0xed93fa9b, 303 | 0xe8d3c48d, 0x283b57cc, 0xf8d56629, 0x79132e28, 304 | 0x785f0191, 0xed756055, 0xf7960e44, 0xe3d35e8c, 305 | 0x15056dd4, 0x88f46dba, 0x03a16125, 0x0564f0bd, 306 | 0xc3eb9e15, 0x3c9057a2, 0x97271aec, 0xa93a072a, 307 | 0x1b3f6d9b, 0x1e6321f5, 0xf59c66fb, 0x26dcf319, 308 | 0x7533d928, 0xb155fdf5, 0x03563482, 0x8aba3cbb, 309 | 0x28517711, 0xc20ad9f8, 0xabcc5167, 0xccad925f, 310 | 0x4de81751, 0x3830dc8e, 0x379d5862, 0x9320f991, 311 | 0xea7a90c2, 0xfb3e7bce, 0x5121ce64, 0x774fbe32, 312 | 0xa8b6e37e, 0xc3293d46, 0x48de5369, 0x6413e680, 313 | 0xa2ae0810, 0xdd6db224, 0x69852dfd, 0x09072166, 314 | 0xb39a460a, 0x6445c0dd, 0x586cdecf, 0x1c20c8ae, 315 | 0x5bbef7dd, 0x1b588d40, 0xccd2017f, 0x6bb4e3bb, 316 | 0xdda26a7e, 0x3a59ff45, 0x3e350a44, 0xbcb4cdd5, 317 | 0x72eacea8, 0xfa6484bb, 0x8d6612ae, 0xbf3c6f47, 318 | 0xd29be463, 0x542f5d9e, 0xaec2771b, 0xf64e6370, 319 | 0x740e0d8d, 0xe75b1357, 0xf8721671, 0xaf537d5d, 320 | 0x4040cb08, 0x4eb4e2cc, 0x34d2466a, 0x0115af84, 321 | 0xe1b00428, 0x95983a1d, 0x06b89fb4, 0xce6ea048, 322 | 0x6f3f3b82, 0x3520ab82, 0x011a1d4b, 0x277227f8, 323 | 0x611560b1, 0xe7933fdc, 0xbb3a792b, 0x344525bd, 324 | 0xa08839e1, 0x51ce794b, 0x2f32c9b7, 0xa01fbac9, 325 | 0xe01cc87e, 0xbcc7d1f6, 0xcf0111c3, 0xa1e8aac7, 326 | 0x1a908749, 0xd44fbd9a, 0xd0dadecb, 0xd50ada38, 327 | 0x0339c32a, 0xc6913667, 0x8df9317c, 0xe0b12b4f, 328 | 0xf79e59b7, 0x43f5bb3a, 0xf2d519ff, 0x27d9459c, 329 | 0xbf97222c, 0x15e6fc2a, 0x0f91fc71, 0x9b941525, 330 | 0xfae59361, 0xceb69ceb, 0xc2a86459, 0x12baa8d1, 331 | 0xb6c1075e, 0xe3056a0c, 0x10d25065, 0xcb03a442, 332 | 0xe0ec6e0e, 0x1698db3b, 0x4c98a0be, 0x3278e964, 333 | 0x9f1f9532, 0xe0d392df, 0xd3a0342b, 0x8971f21e, 334 | 0x1b0a7441, 0x4ba3348c, 0xc5be7120, 0xc37632d8, 335 | 0xdf359f8d, 0x9b992f2e, 0xe60b6f47, 0x0fe3f11d, 336 | 0xe54cda54, 0x1edad891, 0xce6279cf, 0xcd3e7e6f, 337 | 0x1618b166, 0xfd2c1d05, 0x848fd2c5, 0xf6fb2299, 338 | 0xf523f357, 0xa6327623, 0x93a83531, 0x56cccd02, 339 | 0xacf08162, 0x5a75ebb5, 0x6e163697, 0x88d273cc, 340 | 0xde966292, 0x81b949d0, 0x4c50901b, 0x71c65614, 341 | 0xe6c6c7bd, 0x327a140a, 0x45e1d006, 0xc3f27b9a, 342 | 0xc9aa53fd, 0x62a80f00, 0xbb25bfe2, 0x35bdd2f6, 343 | 0x71126905, 0xb2040222, 0xb6cbcf7c, 0xcd769c2b, 344 | 0x53113ec0, 0x1640e3d3, 0x38abbd60, 0x2547adf0, 345 | 0xba38209c, 0xf746ce76, 0x77afa1c5, 0x20756060, 346 | 0x85cbfe4e, 0x8ae88dd8, 0x7aaaf9b0, 0x4cf9aa7e, 347 | 0x1948c25c, 0x02fb8a8c, 0x01c36ae4, 0xd6ebe1f9, 348 | 0x90d4f869, 0xa65cdea0, 0x3f09252d, 0xc208e69f, 349 | 0xb74e6132, 0xce77e25b, 0x578fdfe3, 0x3ac372e6 350 | } 351 | }, { 352 | 0x243f6a88, 0x85a308d3, 0x13198a2e, 0x03707344, 353 | 0xa4093822, 0x299f31d0, 0x082efa98, 0xec4e6c89, 354 | 0x452821e6, 0x38d01377, 0xbe5466cf, 0x34e90c6c, 355 | 0xc0ac29b7, 0xc97c50dd, 0x3f84d5b5, 0xb5470917, 356 | 0x9216d5d9, 0x8979fb1b 357 | } 358 | }; 359 | 360 | static unsigned char BF_itoa64[64 + 1] = 361 | "./ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789"; 362 | 363 | static unsigned char BF_atoi64[0x60] = { 364 | 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 0, 1, 365 | 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 64, 64, 64, 64, 64, 366 | 64, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 367 | 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 64, 64, 64, 64, 64, 368 | 64, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 369 | 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 64, 64, 64, 64, 64 370 | }; 371 | 372 | /* 373 | * This may be optimized out if built with function inlining and no BF_ASM. 374 | */ 375 | static void clean(void *data, int size) 376 | { 377 | memset(data, 0, size); 378 | } 379 | 380 | #define BF_safe_atoi64(dst, src) \ 381 | { \ 382 | tmp = (unsigned char)(src); \ 383 | if ((unsigned int)(tmp -= 0x20) >= 0x60) return -1; \ 384 | tmp = BF_atoi64[tmp]; \ 385 | if (tmp > 63) return -1; \ 386 | (dst) = tmp; \ 387 | } 388 | 389 | static int BF_decode(BF_word *dst, __CONST char *src, int size) 390 | { 391 | unsigned char *dptr = (unsigned char *)dst; 392 | unsigned char *end = dptr + size; 393 | unsigned char *sptr = (unsigned char *)src; 394 | unsigned int tmp, c1, c2, c3, c4; 395 | 396 | do { 397 | BF_safe_atoi64(c1, *sptr++); 398 | BF_safe_atoi64(c2, *sptr++); 399 | *dptr++ = (c1 << 2) | ((c2 & 0x30) >> 4); 400 | if (dptr >= end) break; 401 | 402 | BF_safe_atoi64(c3, *sptr++); 403 | *dptr++ = ((c2 & 0x0F) << 4) | ((c3 & 0x3C) >> 2); 404 | if (dptr >= end) break; 405 | 406 | BF_safe_atoi64(c4, *sptr++); 407 | *dptr++ = ((c3 & 0x03) << 6) | c4; 408 | } while (dptr < end); 409 | 410 | return 0; 411 | } 412 | 413 | static void BF_encode(char *dst, __CONST BF_word *src, int size) 414 | { 415 | unsigned char *sptr = (unsigned char *)src; 416 | unsigned char *end = sptr + size; 417 | unsigned char *dptr = (unsigned char *)dst; 418 | unsigned int c1, c2; 419 | 420 | do { 421 | c1 = *sptr++; 422 | *dptr++ = BF_itoa64[c1 >> 2]; 423 | c1 = (c1 & 0x03) << 4; 424 | if (sptr >= end) { 425 | *dptr++ = BF_itoa64[c1]; 426 | break; 427 | } 428 | 429 | c2 = *sptr++; 430 | c1 |= c2 >> 4; 431 | *dptr++ = BF_itoa64[c1]; 432 | c1 = (c2 & 0x0f) << 2; 433 | if (sptr >= end) { 434 | *dptr++ = BF_itoa64[c1]; 435 | break; 436 | } 437 | 438 | c2 = *sptr++; 439 | c1 |= c2 >> 6; 440 | *dptr++ = BF_itoa64[c1]; 441 | *dptr++ = BF_itoa64[c2 & 0x3f]; 442 | } while (sptr < end); 443 | } 444 | 445 | static void BF_swap(BF_word *x, int count) 446 | { 447 | static int endianness_check = 1; 448 | char *is_little_endian = (char *)&endianness_check; 449 | BF_word tmp; 450 | 451 | if (*is_little_endian) 452 | do { 453 | tmp = *x; 454 | tmp = (tmp << 16) | (tmp >> 16); 455 | *x++ = ((tmp & 0x00FF00FF) << 8) | ((tmp >> 8) & 0x00FF00FF); 456 | } while (--count); 457 | } 458 | 459 | #if BF_SCALE 460 | /* Architectures which can shift addresses left by 2 bits with no extra cost */ 461 | #define BF_ROUND(L, R, N) \ 462 | tmp1 = L & 0xFF; \ 463 | tmp2 = L >> 8; \ 464 | tmp2 &= 0xFF; \ 465 | tmp3 = L >> 16; \ 466 | tmp3 &= 0xFF; \ 467 | tmp4 = L >> 24; \ 468 | tmp1 = data.ctx.S[3][tmp1]; \ 469 | tmp2 = data.ctx.S[2][tmp2]; \ 470 | tmp3 = data.ctx.S[1][tmp3]; \ 471 | tmp3 += data.ctx.S[0][tmp4]; \ 472 | tmp3 ^= tmp2; \ 473 | R ^= data.ctx.P[N + 1]; \ 474 | tmp3 += tmp1; \ 475 | R ^= tmp3; 476 | #else 477 | /* Architectures with no complicated addressing modes supported */ 478 | #define BF_INDEX(S, i) \ 479 | (*((BF_word *)(((unsigned char *)S) + (i)))) 480 | #define BF_ROUND(L, R, N) \ 481 | tmp1 = L & 0xFF; \ 482 | tmp1 <<= 2; \ 483 | tmp2 = L >> 6; \ 484 | tmp2 &= 0x3FC; \ 485 | tmp3 = L >> 14; \ 486 | tmp3 &= 0x3FC; \ 487 | tmp4 = L >> 22; \ 488 | tmp4 &= 0x3FC; \ 489 | tmp1 = BF_INDEX(data.ctx.S[3], tmp1); \ 490 | tmp2 = BF_INDEX(data.ctx.S[2], tmp2); \ 491 | tmp3 = BF_INDEX(data.ctx.S[1], tmp3); \ 492 | tmp3 += BF_INDEX(data.ctx.S[0], tmp4); \ 493 | tmp3 ^= tmp2; \ 494 | R ^= data.ctx.P[N + 1]; \ 495 | tmp3 += tmp1; \ 496 | R ^= tmp3; 497 | #endif 498 | 499 | /* 500 | * Encrypt one block, BF_N is hardcoded here. 501 | */ 502 | #define BF_ENCRYPT \ 503 | L ^= data.ctx.P[0]; \ 504 | BF_ROUND(L, R, 0); \ 505 | BF_ROUND(R, L, 1); \ 506 | BF_ROUND(L, R, 2); \ 507 | BF_ROUND(R, L, 3); \ 508 | BF_ROUND(L, R, 4); \ 509 | BF_ROUND(R, L, 5); \ 510 | BF_ROUND(L, R, 6); \ 511 | BF_ROUND(R, L, 7); \ 512 | BF_ROUND(L, R, 8); \ 513 | BF_ROUND(R, L, 9); \ 514 | BF_ROUND(L, R, 10); \ 515 | BF_ROUND(R, L, 11); \ 516 | BF_ROUND(L, R, 12); \ 517 | BF_ROUND(R, L, 13); \ 518 | BF_ROUND(L, R, 14); \ 519 | BF_ROUND(R, L, 15); \ 520 | tmp4 = R; \ 521 | R = L; \ 522 | L = tmp4 ^ data.ctx.P[BF_N + 1]; 523 | 524 | #define BF_body() \ 525 | L = R = 0; \ 526 | ptr = data.ctx.P; \ 527 | do { \ 528 | ptr += 2; \ 529 | BF_ENCRYPT; \ 530 | *(ptr - 2) = L; \ 531 | *(ptr - 1) = R; \ 532 | } while (ptr < &data.ctx.P[BF_N + 2]); \ 533 | \ 534 | ptr = data.ctx.S[0]; \ 535 | do { \ 536 | ptr += 2; \ 537 | BF_ENCRYPT; \ 538 | *(ptr - 2) = L; \ 539 | *(ptr - 1) = R; \ 540 | } while (ptr < &data.ctx.S[3][0xFF]); 541 | 542 | static void BF_set_key(__CONST char *key, BF_key expanded, BF_key initial, 543 | int sign_extension_bug) 544 | { 545 | __CONST char *ptr = key; 546 | int i, j; 547 | BF_word tmp; 548 | 549 | for (i = 0; i < BF_N + 2; i++) { 550 | tmp = 0; 551 | for (j = 0; j < 4; j++) { 552 | tmp <<= 8; 553 | if (sign_extension_bug) 554 | tmp |= (BF_word_signed)(signed char)*ptr; 555 | else 556 | tmp |= (unsigned char)*ptr; 557 | 558 | if (!*ptr) ptr = key; else ptr++; 559 | } 560 | 561 | expanded[i] = tmp; 562 | initial[i] = BF_init_state.P[i] ^ tmp; 563 | } 564 | } 565 | 566 | static char *BF_crypt(__CONST char *key, __CONST char *setting, 567 | char *output, int size, 568 | BF_word min) 569 | { 570 | struct { 571 | BF_ctx ctx; 572 | BF_key expanded_key; 573 | union { 574 | BF_word salt[4]; 575 | BF_word output[6]; 576 | } binary; 577 | } data; 578 | BF_word L, R; 579 | BF_word tmp1, tmp2, tmp3, tmp4; 580 | BF_word *ptr; 581 | BF_word count; 582 | int i; 583 | 584 | if (size < 7 + 22 + 31 + 1) { 585 | __set_errno(ERANGE); 586 | return NULL; 587 | } 588 | 589 | if (setting[0] != '$' || 590 | setting[1] != '2' || 591 | (setting[2] != 'a' && setting[2] != 'x') || 592 | setting[3] != '$' || 593 | setting[4] < '0' || setting[4] > '3' || 594 | setting[5] < '0' || setting[5] > '9' || 595 | (setting[4] == '3' && setting[5] > '1') || 596 | setting[6] != '$') { 597 | __set_errno(EINVAL); 598 | return NULL; 599 | } 600 | 601 | count = (BF_word)1 << ((setting[4] - '0') * 10 + (setting[5] - '0')); 602 | if (count < min || BF_decode(data.binary.salt, &setting[7], 16)) { 603 | clean(data.binary.salt, sizeof(data.binary.salt)); 604 | __set_errno(EINVAL); 605 | return NULL; 606 | } 607 | BF_swap(data.binary.salt, 4); 608 | 609 | BF_set_key(key, data.expanded_key, data.ctx.P, setting[2] == 'x'); 610 | 611 | memcpy(data.ctx.S, BF_init_state.S, sizeof(data.ctx.S)); 612 | 613 | L = R = 0; 614 | for (i = 0; i < BF_N + 2; i += 2) { 615 | L ^= data.binary.salt[i & 2]; 616 | R ^= data.binary.salt[(i & 2) + 1]; 617 | BF_ENCRYPT; 618 | data.ctx.P[i] = L; 619 | data.ctx.P[i + 1] = R; 620 | } 621 | 622 | ptr = data.ctx.S[0]; 623 | do { 624 | ptr += 4; 625 | L ^= data.binary.salt[(BF_N + 2) & 3]; 626 | R ^= data.binary.salt[(BF_N + 3) & 3]; 627 | BF_ENCRYPT; 628 | *(ptr - 4) = L; 629 | *(ptr - 3) = R; 630 | 631 | L ^= data.binary.salt[(BF_N + 4) & 3]; 632 | R ^= data.binary.salt[(BF_N + 5) & 3]; 633 | BF_ENCRYPT; 634 | *(ptr - 2) = L; 635 | *(ptr - 1) = R; 636 | } while (ptr < &data.ctx.S[3][0xFF]); 637 | 638 | do { 639 | data.ctx.P[0] ^= data.expanded_key[0]; 640 | data.ctx.P[1] ^= data.expanded_key[1]; 641 | data.ctx.P[2] ^= data.expanded_key[2]; 642 | data.ctx.P[3] ^= data.expanded_key[3]; 643 | data.ctx.P[4] ^= data.expanded_key[4]; 644 | data.ctx.P[5] ^= data.expanded_key[5]; 645 | data.ctx.P[6] ^= data.expanded_key[6]; 646 | data.ctx.P[7] ^= data.expanded_key[7]; 647 | data.ctx.P[8] ^= data.expanded_key[8]; 648 | data.ctx.P[9] ^= data.expanded_key[9]; 649 | data.ctx.P[10] ^= data.expanded_key[10]; 650 | data.ctx.P[11] ^= data.expanded_key[11]; 651 | data.ctx.P[12] ^= data.expanded_key[12]; 652 | data.ctx.P[13] ^= data.expanded_key[13]; 653 | data.ctx.P[14] ^= data.expanded_key[14]; 654 | data.ctx.P[15] ^= data.expanded_key[15]; 655 | data.ctx.P[16] ^= data.expanded_key[16]; 656 | data.ctx.P[17] ^= data.expanded_key[17]; 657 | 658 | BF_body(); 659 | 660 | tmp1 = data.binary.salt[0]; 661 | tmp2 = data.binary.salt[1]; 662 | tmp3 = data.binary.salt[2]; 663 | tmp4 = data.binary.salt[3]; 664 | data.ctx.P[0] ^= tmp1; 665 | data.ctx.P[1] ^= tmp2; 666 | data.ctx.P[2] ^= tmp3; 667 | data.ctx.P[3] ^= tmp4; 668 | data.ctx.P[4] ^= tmp1; 669 | data.ctx.P[5] ^= tmp2; 670 | data.ctx.P[6] ^= tmp3; 671 | data.ctx.P[7] ^= tmp4; 672 | data.ctx.P[8] ^= tmp1; 673 | data.ctx.P[9] ^= tmp2; 674 | data.ctx.P[10] ^= tmp3; 675 | data.ctx.P[11] ^= tmp4; 676 | data.ctx.P[12] ^= tmp1; 677 | data.ctx.P[13] ^= tmp2; 678 | data.ctx.P[14] ^= tmp3; 679 | data.ctx.P[15] ^= tmp4; 680 | data.ctx.P[16] ^= tmp1; 681 | data.ctx.P[17] ^= tmp2; 682 | 683 | BF_body(); 684 | } while (--count); 685 | 686 | for (i = 0; i < 6; i += 2) { 687 | L = BF_magic_w[i]; 688 | R = BF_magic_w[i + 1]; 689 | 690 | count = 64; 691 | do { 692 | BF_ENCRYPT; 693 | } while (--count); 694 | 695 | data.binary.output[i] = L; 696 | data.binary.output[i + 1] = R; 697 | } 698 | 699 | memcpy(output, setting, 7 + 22 - 1); 700 | output[7 + 22 - 1] = BF_itoa64[(int) 701 | BF_atoi64[(int)setting[7 + 22 - 1] - 0x20] & 0x30]; 702 | 703 | /* This has to be bug-compatible with the original implementation, so 704 | * only encode 23 of the 24 bytes. :-) */ 705 | BF_swap(data.binary.output, 6); 706 | BF_encode(&output[7 + 22], data.binary.output, 23); 707 | output[7 + 22 + 31] = '\0'; 708 | 709 | #ifndef BF_SELF_TEST 710 | /* Overwrite the most obvious sensitive data we have on the stack. Note 711 | * that this does not guarantee there's no sensitive data left on the 712 | * stack and/or in registers; I'm not aware of portable code that does. */ 713 | clean(&data, sizeof(data)); 714 | #endif 715 | 716 | return output; 717 | } 718 | 719 | char *_crypt_blowfish_rn(__CONST char *key, __CONST char *setting, 720 | char *output, int size) 721 | { 722 | #ifdef BF_SELF_TEST 723 | __CONST char *test_key = "8b \xd0\xc1\xd2\xcf\xcc\xd8"; 724 | __CONST char *test_2a = 725 | "$2a$00$abcdefghijklmnopqrstuui1D709vfamulimlGcq0qq3UvuUasvEa" 726 | "\0" 727 | "canary"; 728 | __CONST char *test_2x = 729 | "$2x$00$abcdefghijklmnopqrstuuVUrPmXD6q/nVSSp7pNDhCR9071IfIRe" 730 | "\0" 731 | "canary"; 732 | __CONST char *test_hash, *p; 733 | int ok; 734 | char buf[7 + 22 + 31 + 1 + 6 + 1]; 735 | 736 | output = BF_crypt(key, setting, output, size, 16); 737 | 738 | /* Do a quick self-test. This also happens to overwrite BF_crypt()'s data. */ 739 | test_hash = (setting[2] == 'x') ? test_2x : test_2a; 740 | memcpy(buf, test_hash, sizeof(buf)); 741 | memset(buf, -1, sizeof(buf) - (6 + 1)); /* keep "canary" only */ 742 | p = BF_crypt(test_key, test_hash, buf, sizeof(buf) - 6, 1); 743 | 744 | ok = (p == buf && !memcmp(p, test_hash, sizeof(buf))); 745 | 746 | /* This could reveal what hash type we were using last. Unfortunately, we 747 | * can't reliably clean the test_hash pointer. */ 748 | clean(&buf, sizeof(buf)); 749 | 750 | if (ok) 751 | return output; 752 | 753 | /* Should not happen */ 754 | __set_errno(EINVAL); /* pretend we don't support this hash type */ 755 | return NULL; 756 | #else 757 | #warning Self-test is disabled, please enable 758 | return BF_crypt(key, setting, output, size, 16); 759 | #endif 760 | } 761 | 762 | char *_crypt_gensalt_blowfish_rn(unsigned long count, 763 | __CONST char *input, int size, char *output, int output_size) 764 | { 765 | if (size < 16 || output_size < 7 + 22 + 1 || 766 | (count && (count < 4 || count > 31))) { 767 | if (output_size > 0) output[0] = '\0'; 768 | __set_errno((output_size < 7 + 22 + 1) ? ERANGE : EINVAL); 769 | return NULL; 770 | } 771 | 772 | if (!count) count = 5; 773 | 774 | output[0] = '$'; 775 | output[1] = '2'; 776 | output[2] = 'a'; 777 | output[3] = '$'; 778 | output[4] = '0' + count / 10; 779 | output[5] = '0' + count % 10; 780 | output[6] = '$'; 781 | 782 | BF_encode(&output[7], (BF_word *)input, 16); 783 | output[7 + 22] = '\0'; 784 | 785 | return output; 786 | } 787 | -------------------------------------------------------------------------------- /ext/jruby/bcrypt_jruby/BCrypt.java: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2006 Damien Miller 2 | // 3 | // Permission to use, copy, modify, and distribute this software for any 4 | // purpose with or without fee is hereby granted, provided that the above 5 | // copyright notice and this permission notice appear in all copies. 6 | // 7 | // THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES 8 | // WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF 9 | // MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR 10 | // ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES 11 | // WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN 12 | // ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF 13 | // OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. 14 | 15 | package bcrypt_jruby; 16 | 17 | import java.io.UnsupportedEncodingException; 18 | 19 | import java.security.SecureRandom; 20 | 21 | /** 22 | * BCrypt implements OpenBSD-style Blowfish password hashing using 23 | * the scheme described in "A Future-Adaptable Password Scheme" by 24 | * Niels Provos and David Mazieres. 25 | *

26 | * This password hashing system tries to thwart off-line password 27 | * cracking using a computationally-intensive hashing algorithm, 28 | * based on Bruce Schneier's Blowfish cipher. The work factor of 29 | * the algorithm is parameterised, so it can be increased as 30 | * computers get faster. 31 | *

32 | * Usage is really simple. To hash a password for the first time, 33 | * call the hashpw method with a random salt, like this: 34 | *

35 | * 36 | * String pw_hash = BCrypt.hashpw(plain_password, BCrypt.gensalt());
37 | * 38 | *

39 | * To check whether a plaintext password matches one that has been 40 | * hashed previously, use the checkpw method: 41 | *

42 | * 43 | * if (BCrypt.checkpw(candidate_password, stored_hash))
44 | *     System.out.println("It matches");
45 | * else
46 | *     System.out.println("It does not match");
47 | * 48 | *

49 | * The gensalt() method takes an optional parameter (log_rounds) 50 | * that determines the computational complexity of the hashing: 51 | *

52 | * 53 | * String strong_salt = BCrypt.gensalt(10)
54 | * String stronger_salt = BCrypt.gensalt(12)
55 | * 56 | *

57 | * The amount of work increases exponentially (2**log_rounds), so 58 | * each increment is twice as much work. The default log_rounds is 59 | * 10, and the valid range is 4 to 31. 60 | * 61 | * @author Damien Miller 62 | * @version 0.2 63 | */ 64 | public class BCrypt { 65 | // BCrypt parameters 66 | private static final int GENSALT_DEFAULT_LOG2_ROUNDS = 10; 67 | private static final int BCRYPT_SALT_LEN = 16; 68 | 69 | // Blowfish parameters 70 | private static final int BLOWFISH_NUM_ROUNDS = 16; 71 | 72 | // Initial contents of key schedule 73 | private static final int P_orig[] = { 74 | 0x243f6a88, 0x85a308d3, 0x13198a2e, 0x03707344, 75 | 0xa4093822, 0x299f31d0, 0x082efa98, 0xec4e6c89, 76 | 0x452821e6, 0x38d01377, 0xbe5466cf, 0x34e90c6c, 77 | 0xc0ac29b7, 0xc97c50dd, 0x3f84d5b5, 0xb5470917, 78 | 0x9216d5d9, 0x8979fb1b 79 | }; 80 | private static final int S_orig[] = { 81 | 0xd1310ba6, 0x98dfb5ac, 0x2ffd72db, 0xd01adfb7, 82 | 0xb8e1afed, 0x6a267e96, 0xba7c9045, 0xf12c7f99, 83 | 0x24a19947, 0xb3916cf7, 0x0801f2e2, 0x858efc16, 84 | 0x636920d8, 0x71574e69, 0xa458fea3, 0xf4933d7e, 85 | 0x0d95748f, 0x728eb658, 0x718bcd58, 0x82154aee, 86 | 0x7b54a41d, 0xc25a59b5, 0x9c30d539, 0x2af26013, 87 | 0xc5d1b023, 0x286085f0, 0xca417918, 0xb8db38ef, 88 | 0x8e79dcb0, 0x603a180e, 0x6c9e0e8b, 0xb01e8a3e, 89 | 0xd71577c1, 0xbd314b27, 0x78af2fda, 0x55605c60, 90 | 0xe65525f3, 0xaa55ab94, 0x57489862, 0x63e81440, 91 | 0x55ca396a, 0x2aab10b6, 0xb4cc5c34, 0x1141e8ce, 92 | 0xa15486af, 0x7c72e993, 0xb3ee1411, 0x636fbc2a, 93 | 0x2ba9c55d, 0x741831f6, 0xce5c3e16, 0x9b87931e, 94 | 0xafd6ba33, 0x6c24cf5c, 0x7a325381, 0x28958677, 95 | 0x3b8f4898, 0x6b4bb9af, 0xc4bfe81b, 0x66282193, 96 | 0x61d809cc, 0xfb21a991, 0x487cac60, 0x5dec8032, 97 | 0xef845d5d, 0xe98575b1, 0xdc262302, 0xeb651b88, 98 | 0x23893e81, 0xd396acc5, 0x0f6d6ff3, 0x83f44239, 99 | 0x2e0b4482, 0xa4842004, 0x69c8f04a, 0x9e1f9b5e, 100 | 0x21c66842, 0xf6e96c9a, 0x670c9c61, 0xabd388f0, 101 | 0x6a51a0d2, 0xd8542f68, 0x960fa728, 0xab5133a3, 102 | 0x6eef0b6c, 0x137a3be4, 0xba3bf050, 0x7efb2a98, 103 | 0xa1f1651d, 0x39af0176, 0x66ca593e, 0x82430e88, 104 | 0x8cee8619, 0x456f9fb4, 0x7d84a5c3, 0x3b8b5ebe, 105 | 0xe06f75d8, 0x85c12073, 0x401a449f, 0x56c16aa6, 106 | 0x4ed3aa62, 0x363f7706, 0x1bfedf72, 0x429b023d, 107 | 0x37d0d724, 0xd00a1248, 0xdb0fead3, 0x49f1c09b, 108 | 0x075372c9, 0x80991b7b, 0x25d479d8, 0xf6e8def7, 109 | 0xe3fe501a, 0xb6794c3b, 0x976ce0bd, 0x04c006ba, 110 | 0xc1a94fb6, 0x409f60c4, 0x5e5c9ec2, 0x196a2463, 111 | 0x68fb6faf, 0x3e6c53b5, 0x1339b2eb, 0x3b52ec6f, 112 | 0x6dfc511f, 0x9b30952c, 0xcc814544, 0xaf5ebd09, 113 | 0xbee3d004, 0xde334afd, 0x660f2807, 0x192e4bb3, 114 | 0xc0cba857, 0x45c8740f, 0xd20b5f39, 0xb9d3fbdb, 115 | 0x5579c0bd, 0x1a60320a, 0xd6a100c6, 0x402c7279, 116 | 0x679f25fe, 0xfb1fa3cc, 0x8ea5e9f8, 0xdb3222f8, 117 | 0x3c7516df, 0xfd616b15, 0x2f501ec8, 0xad0552ab, 118 | 0x323db5fa, 0xfd238760, 0x53317b48, 0x3e00df82, 119 | 0x9e5c57bb, 0xca6f8ca0, 0x1a87562e, 0xdf1769db, 120 | 0xd542a8f6, 0x287effc3, 0xac6732c6, 0x8c4f5573, 121 | 0x695b27b0, 0xbbca58c8, 0xe1ffa35d, 0xb8f011a0, 122 | 0x10fa3d98, 0xfd2183b8, 0x4afcb56c, 0x2dd1d35b, 123 | 0x9a53e479, 0xb6f84565, 0xd28e49bc, 0x4bfb9790, 124 | 0xe1ddf2da, 0xa4cb7e33, 0x62fb1341, 0xcee4c6e8, 125 | 0xef20cada, 0x36774c01, 0xd07e9efe, 0x2bf11fb4, 126 | 0x95dbda4d, 0xae909198, 0xeaad8e71, 0x6b93d5a0, 127 | 0xd08ed1d0, 0xafc725e0, 0x8e3c5b2f, 0x8e7594b7, 128 | 0x8ff6e2fb, 0xf2122b64, 0x8888b812, 0x900df01c, 129 | 0x4fad5ea0, 0x688fc31c, 0xd1cff191, 0xb3a8c1ad, 130 | 0x2f2f2218, 0xbe0e1777, 0xea752dfe, 0x8b021fa1, 131 | 0xe5a0cc0f, 0xb56f74e8, 0x18acf3d6, 0xce89e299, 132 | 0xb4a84fe0, 0xfd13e0b7, 0x7cc43b81, 0xd2ada8d9, 133 | 0x165fa266, 0x80957705, 0x93cc7314, 0x211a1477, 134 | 0xe6ad2065, 0x77b5fa86, 0xc75442f5, 0xfb9d35cf, 135 | 0xebcdaf0c, 0x7b3e89a0, 0xd6411bd3, 0xae1e7e49, 136 | 0x00250e2d, 0x2071b35e, 0x226800bb, 0x57b8e0af, 137 | 0x2464369b, 0xf009b91e, 0x5563911d, 0x59dfa6aa, 138 | 0x78c14389, 0xd95a537f, 0x207d5ba2, 0x02e5b9c5, 139 | 0x83260376, 0x6295cfa9, 0x11c81968, 0x4e734a41, 140 | 0xb3472dca, 0x7b14a94a, 0x1b510052, 0x9a532915, 141 | 0xd60f573f, 0xbc9bc6e4, 0x2b60a476, 0x81e67400, 142 | 0x08ba6fb5, 0x571be91f, 0xf296ec6b, 0x2a0dd915, 143 | 0xb6636521, 0xe7b9f9b6, 0xff34052e, 0xc5855664, 144 | 0x53b02d5d, 0xa99f8fa1, 0x08ba4799, 0x6e85076a, 145 | 0x4b7a70e9, 0xb5b32944, 0xdb75092e, 0xc4192623, 146 | 0xad6ea6b0, 0x49a7df7d, 0x9cee60b8, 0x8fedb266, 147 | 0xecaa8c71, 0x699a17ff, 0x5664526c, 0xc2b19ee1, 148 | 0x193602a5, 0x75094c29, 0xa0591340, 0xe4183a3e, 149 | 0x3f54989a, 0x5b429d65, 0x6b8fe4d6, 0x99f73fd6, 150 | 0xa1d29c07, 0xefe830f5, 0x4d2d38e6, 0xf0255dc1, 151 | 0x4cdd2086, 0x8470eb26, 0x6382e9c6, 0x021ecc5e, 152 | 0x09686b3f, 0x3ebaefc9, 0x3c971814, 0x6b6a70a1, 153 | 0x687f3584, 0x52a0e286, 0xb79c5305, 0xaa500737, 154 | 0x3e07841c, 0x7fdeae5c, 0x8e7d44ec, 0x5716f2b8, 155 | 0xb03ada37, 0xf0500c0d, 0xf01c1f04, 0x0200b3ff, 156 | 0xae0cf51a, 0x3cb574b2, 0x25837a58, 0xdc0921bd, 157 | 0xd19113f9, 0x7ca92ff6, 0x94324773, 0x22f54701, 158 | 0x3ae5e581, 0x37c2dadc, 0xc8b57634, 0x9af3dda7, 159 | 0xa9446146, 0x0fd0030e, 0xecc8c73e, 0xa4751e41, 160 | 0xe238cd99, 0x3bea0e2f, 0x3280bba1, 0x183eb331, 161 | 0x4e548b38, 0x4f6db908, 0x6f420d03, 0xf60a04bf, 162 | 0x2cb81290, 0x24977c79, 0x5679b072, 0xbcaf89af, 163 | 0xde9a771f, 0xd9930810, 0xb38bae12, 0xdccf3f2e, 164 | 0x5512721f, 0x2e6b7124, 0x501adde6, 0x9f84cd87, 165 | 0x7a584718, 0x7408da17, 0xbc9f9abc, 0xe94b7d8c, 166 | 0xec7aec3a, 0xdb851dfa, 0x63094366, 0xc464c3d2, 167 | 0xef1c1847, 0x3215d908, 0xdd433b37, 0x24c2ba16, 168 | 0x12a14d43, 0x2a65c451, 0x50940002, 0x133ae4dd, 169 | 0x71dff89e, 0x10314e55, 0x81ac77d6, 0x5f11199b, 170 | 0x043556f1, 0xd7a3c76b, 0x3c11183b, 0x5924a509, 171 | 0xf28fe6ed, 0x97f1fbfa, 0x9ebabf2c, 0x1e153c6e, 172 | 0x86e34570, 0xeae96fb1, 0x860e5e0a, 0x5a3e2ab3, 173 | 0x771fe71c, 0x4e3d06fa, 0x2965dcb9, 0x99e71d0f, 174 | 0x803e89d6, 0x5266c825, 0x2e4cc978, 0x9c10b36a, 175 | 0xc6150eba, 0x94e2ea78, 0xa5fc3c53, 0x1e0a2df4, 176 | 0xf2f74ea7, 0x361d2b3d, 0x1939260f, 0x19c27960, 177 | 0x5223a708, 0xf71312b6, 0xebadfe6e, 0xeac31f66, 178 | 0xe3bc4595, 0xa67bc883, 0xb17f37d1, 0x018cff28, 179 | 0xc332ddef, 0xbe6c5aa5, 0x65582185, 0x68ab9802, 180 | 0xeecea50f, 0xdb2f953b, 0x2aef7dad, 0x5b6e2f84, 181 | 0x1521b628, 0x29076170, 0xecdd4775, 0x619f1510, 182 | 0x13cca830, 0xeb61bd96, 0x0334fe1e, 0xaa0363cf, 183 | 0xb5735c90, 0x4c70a239, 0xd59e9e0b, 0xcbaade14, 184 | 0xeecc86bc, 0x60622ca7, 0x9cab5cab, 0xb2f3846e, 185 | 0x648b1eaf, 0x19bdf0ca, 0xa02369b9, 0x655abb50, 186 | 0x40685a32, 0x3c2ab4b3, 0x319ee9d5, 0xc021b8f7, 187 | 0x9b540b19, 0x875fa099, 0x95f7997e, 0x623d7da8, 188 | 0xf837889a, 0x97e32d77, 0x11ed935f, 0x16681281, 189 | 0x0e358829, 0xc7e61fd6, 0x96dedfa1, 0x7858ba99, 190 | 0x57f584a5, 0x1b227263, 0x9b83c3ff, 0x1ac24696, 191 | 0xcdb30aeb, 0x532e3054, 0x8fd948e4, 0x6dbc3128, 192 | 0x58ebf2ef, 0x34c6ffea, 0xfe28ed61, 0xee7c3c73, 193 | 0x5d4a14d9, 0xe864b7e3, 0x42105d14, 0x203e13e0, 194 | 0x45eee2b6, 0xa3aaabea, 0xdb6c4f15, 0xfacb4fd0, 195 | 0xc742f442, 0xef6abbb5, 0x654f3b1d, 0x41cd2105, 196 | 0xd81e799e, 0x86854dc7, 0xe44b476a, 0x3d816250, 197 | 0xcf62a1f2, 0x5b8d2646, 0xfc8883a0, 0xc1c7b6a3, 198 | 0x7f1524c3, 0x69cb7492, 0x47848a0b, 0x5692b285, 199 | 0x095bbf00, 0xad19489d, 0x1462b174, 0x23820e00, 200 | 0x58428d2a, 0x0c55f5ea, 0x1dadf43e, 0x233f7061, 201 | 0x3372f092, 0x8d937e41, 0xd65fecf1, 0x6c223bdb, 202 | 0x7cde3759, 0xcbee7460, 0x4085f2a7, 0xce77326e, 203 | 0xa6078084, 0x19f8509e, 0xe8efd855, 0x61d99735, 204 | 0xa969a7aa, 0xc50c06c2, 0x5a04abfc, 0x800bcadc, 205 | 0x9e447a2e, 0xc3453484, 0xfdd56705, 0x0e1e9ec9, 206 | 0xdb73dbd3, 0x105588cd, 0x675fda79, 0xe3674340, 207 | 0xc5c43465, 0x713e38d8, 0x3d28f89e, 0xf16dff20, 208 | 0x153e21e7, 0x8fb03d4a, 0xe6e39f2b, 0xdb83adf7, 209 | 0xe93d5a68, 0x948140f7, 0xf64c261c, 0x94692934, 210 | 0x411520f7, 0x7602d4f7, 0xbcf46b2e, 0xd4a20068, 211 | 0xd4082471, 0x3320f46a, 0x43b7d4b7, 0x500061af, 212 | 0x1e39f62e, 0x97244546, 0x14214f74, 0xbf8b8840, 213 | 0x4d95fc1d, 0x96b591af, 0x70f4ddd3, 0x66a02f45, 214 | 0xbfbc09ec, 0x03bd9785, 0x7fac6dd0, 0x31cb8504, 215 | 0x96eb27b3, 0x55fd3941, 0xda2547e6, 0xabca0a9a, 216 | 0x28507825, 0x530429f4, 0x0a2c86da, 0xe9b66dfb, 217 | 0x68dc1462, 0xd7486900, 0x680ec0a4, 0x27a18dee, 218 | 0x4f3ffea2, 0xe887ad8c, 0xb58ce006, 0x7af4d6b6, 219 | 0xaace1e7c, 0xd3375fec, 0xce78a399, 0x406b2a42, 220 | 0x20fe9e35, 0xd9f385b9, 0xee39d7ab, 0x3b124e8b, 221 | 0x1dc9faf7, 0x4b6d1856, 0x26a36631, 0xeae397b2, 222 | 0x3a6efa74, 0xdd5b4332, 0x6841e7f7, 0xca7820fb, 223 | 0xfb0af54e, 0xd8feb397, 0x454056ac, 0xba489527, 224 | 0x55533a3a, 0x20838d87, 0xfe6ba9b7, 0xd096954b, 225 | 0x55a867bc, 0xa1159a58, 0xcca92963, 0x99e1db33, 226 | 0xa62a4a56, 0x3f3125f9, 0x5ef47e1c, 0x9029317c, 227 | 0xfdf8e802, 0x04272f70, 0x80bb155c, 0x05282ce3, 228 | 0x95c11548, 0xe4c66d22, 0x48c1133f, 0xc70f86dc, 229 | 0x07f9c9ee, 0x41041f0f, 0x404779a4, 0x5d886e17, 230 | 0x325f51eb, 0xd59bc0d1, 0xf2bcc18f, 0x41113564, 231 | 0x257b7834, 0x602a9c60, 0xdff8e8a3, 0x1f636c1b, 232 | 0x0e12b4c2, 0x02e1329e, 0xaf664fd1, 0xcad18115, 233 | 0x6b2395e0, 0x333e92e1, 0x3b240b62, 0xeebeb922, 234 | 0x85b2a20e, 0xe6ba0d99, 0xde720c8c, 0x2da2f728, 235 | 0xd0127845, 0x95b794fd, 0x647d0862, 0xe7ccf5f0, 236 | 0x5449a36f, 0x877d48fa, 0xc39dfd27, 0xf33e8d1e, 237 | 0x0a476341, 0x992eff74, 0x3a6f6eab, 0xf4f8fd37, 238 | 0xa812dc60, 0xa1ebddf8, 0x991be14c, 0xdb6e6b0d, 239 | 0xc67b5510, 0x6d672c37, 0x2765d43b, 0xdcd0e804, 240 | 0xf1290dc7, 0xcc00ffa3, 0xb5390f92, 0x690fed0b, 241 | 0x667b9ffb, 0xcedb7d9c, 0xa091cf0b, 0xd9155ea3, 242 | 0xbb132f88, 0x515bad24, 0x7b9479bf, 0x763bd6eb, 243 | 0x37392eb3, 0xcc115979, 0x8026e297, 0xf42e312d, 244 | 0x6842ada7, 0xc66a2b3b, 0x12754ccc, 0x782ef11c, 245 | 0x6a124237, 0xb79251e7, 0x06a1bbe6, 0x4bfb6350, 246 | 0x1a6b1018, 0x11caedfa, 0x3d25bdd8, 0xe2e1c3c9, 247 | 0x44421659, 0x0a121386, 0xd90cec6e, 0xd5abea2a, 248 | 0x64af674e, 0xda86a85f, 0xbebfe988, 0x64e4c3fe, 249 | 0x9dbc8057, 0xf0f7c086, 0x60787bf8, 0x6003604d, 250 | 0xd1fd8346, 0xf6381fb0, 0x7745ae04, 0xd736fccc, 251 | 0x83426b33, 0xf01eab71, 0xb0804187, 0x3c005e5f, 252 | 0x77a057be, 0xbde8ae24, 0x55464299, 0xbf582e61, 253 | 0x4e58f48f, 0xf2ddfda2, 0xf474ef38, 0x8789bdc2, 254 | 0x5366f9c3, 0xc8b38e74, 0xb475f255, 0x46fcd9b9, 255 | 0x7aeb2661, 0x8b1ddf84, 0x846a0e79, 0x915f95e2, 256 | 0x466e598e, 0x20b45770, 0x8cd55591, 0xc902de4c, 257 | 0xb90bace1, 0xbb8205d0, 0x11a86248, 0x7574a99e, 258 | 0xb77f19b6, 0xe0a9dc09, 0x662d09a1, 0xc4324633, 259 | 0xe85a1f02, 0x09f0be8c, 0x4a99a025, 0x1d6efe10, 260 | 0x1ab93d1d, 0x0ba5a4df, 0xa186f20f, 0x2868f169, 261 | 0xdcb7da83, 0x573906fe, 0xa1e2ce9b, 0x4fcd7f52, 262 | 0x50115e01, 0xa70683fa, 0xa002b5c4, 0x0de6d027, 263 | 0x9af88c27, 0x773f8641, 0xc3604c06, 0x61a806b5, 264 | 0xf0177a28, 0xc0f586e0, 0x006058aa, 0x30dc7d62, 265 | 0x11e69ed7, 0x2338ea63, 0x53c2dd94, 0xc2c21634, 266 | 0xbbcbee56, 0x90bcb6de, 0xebfc7da1, 0xce591d76, 267 | 0x6f05e409, 0x4b7c0188, 0x39720a3d, 0x7c927c24, 268 | 0x86e3725f, 0x724d9db9, 0x1ac15bb4, 0xd39eb8fc, 269 | 0xed545578, 0x08fca5b5, 0xd83d7cd3, 0x4dad0fc4, 270 | 0x1e50ef5e, 0xb161e6f8, 0xa28514d9, 0x6c51133c, 271 | 0x6fd5c7e7, 0x56e14ec4, 0x362abfce, 0xddc6c837, 272 | 0xd79a3234, 0x92638212, 0x670efa8e, 0x406000e0, 273 | 0x3a39ce37, 0xd3faf5cf, 0xabc27737, 0x5ac52d1b, 274 | 0x5cb0679e, 0x4fa33742, 0xd3822740, 0x99bc9bbe, 275 | 0xd5118e9d, 0xbf0f7315, 0xd62d1c7e, 0xc700c47b, 276 | 0xb78c1b6b, 0x21a19045, 0xb26eb1be, 0x6a366eb4, 277 | 0x5748ab2f, 0xbc946e79, 0xc6a376d2, 0x6549c2c8, 278 | 0x530ff8ee, 0x468dde7d, 0xd5730a1d, 0x4cd04dc6, 279 | 0x2939bbdb, 0xa9ba4650, 0xac9526e8, 0xbe5ee304, 280 | 0xa1fad5f0, 0x6a2d519a, 0x63ef8ce2, 0x9a86ee22, 281 | 0xc089c2b8, 0x43242ef6, 0xa51e03aa, 0x9cf2d0a4, 282 | 0x83c061ba, 0x9be96a4d, 0x8fe51550, 0xba645bd6, 283 | 0x2826a2f9, 0xa73a3ae1, 0x4ba99586, 0xef5562e9, 284 | 0xc72fefd3, 0xf752f7da, 0x3f046f69, 0x77fa0a59, 285 | 0x80e4a915, 0x87b08601, 0x9b09e6ad, 0x3b3ee593, 286 | 0xe990fd5a, 0x9e34d797, 0x2cf0b7d9, 0x022b8b51, 287 | 0x96d5ac3a, 0x017da67d, 0xd1cf3ed6, 0x7c7d2d28, 288 | 0x1f9f25cf, 0xadf2b89b, 0x5ad6b472, 0x5a88f54c, 289 | 0xe029ac71, 0xe019a5e6, 0x47b0acfd, 0xed93fa9b, 290 | 0xe8d3c48d, 0x283b57cc, 0xf8d56629, 0x79132e28, 291 | 0x785f0191, 0xed756055, 0xf7960e44, 0xe3d35e8c, 292 | 0x15056dd4, 0x88f46dba, 0x03a16125, 0x0564f0bd, 293 | 0xc3eb9e15, 0x3c9057a2, 0x97271aec, 0xa93a072a, 294 | 0x1b3f6d9b, 0x1e6321f5, 0xf59c66fb, 0x26dcf319, 295 | 0x7533d928, 0xb155fdf5, 0x03563482, 0x8aba3cbb, 296 | 0x28517711, 0xc20ad9f8, 0xabcc5167, 0xccad925f, 297 | 0x4de81751, 0x3830dc8e, 0x379d5862, 0x9320f991, 298 | 0xea7a90c2, 0xfb3e7bce, 0x5121ce64, 0x774fbe32, 299 | 0xa8b6e37e, 0xc3293d46, 0x48de5369, 0x6413e680, 300 | 0xa2ae0810, 0xdd6db224, 0x69852dfd, 0x09072166, 301 | 0xb39a460a, 0x6445c0dd, 0x586cdecf, 0x1c20c8ae, 302 | 0x5bbef7dd, 0x1b588d40, 0xccd2017f, 0x6bb4e3bb, 303 | 0xdda26a7e, 0x3a59ff45, 0x3e350a44, 0xbcb4cdd5, 304 | 0x72eacea8, 0xfa6484bb, 0x8d6612ae, 0xbf3c6f47, 305 | 0xd29be463, 0x542f5d9e, 0xaec2771b, 0xf64e6370, 306 | 0x740e0d8d, 0xe75b1357, 0xf8721671, 0xaf537d5d, 307 | 0x4040cb08, 0x4eb4e2cc, 0x34d2466a, 0x0115af84, 308 | 0xe1b00428, 0x95983a1d, 0x06b89fb4, 0xce6ea048, 309 | 0x6f3f3b82, 0x3520ab82, 0x011a1d4b, 0x277227f8, 310 | 0x611560b1, 0xe7933fdc, 0xbb3a792b, 0x344525bd, 311 | 0xa08839e1, 0x51ce794b, 0x2f32c9b7, 0xa01fbac9, 312 | 0xe01cc87e, 0xbcc7d1f6, 0xcf0111c3, 0xa1e8aac7, 313 | 0x1a908749, 0xd44fbd9a, 0xd0dadecb, 0xd50ada38, 314 | 0x0339c32a, 0xc6913667, 0x8df9317c, 0xe0b12b4f, 315 | 0xf79e59b7, 0x43f5bb3a, 0xf2d519ff, 0x27d9459c, 316 | 0xbf97222c, 0x15e6fc2a, 0x0f91fc71, 0x9b941525, 317 | 0xfae59361, 0xceb69ceb, 0xc2a86459, 0x12baa8d1, 318 | 0xb6c1075e, 0xe3056a0c, 0x10d25065, 0xcb03a442, 319 | 0xe0ec6e0e, 0x1698db3b, 0x4c98a0be, 0x3278e964, 320 | 0x9f1f9532, 0xe0d392df, 0xd3a0342b, 0x8971f21e, 321 | 0x1b0a7441, 0x4ba3348c, 0xc5be7120, 0xc37632d8, 322 | 0xdf359f8d, 0x9b992f2e, 0xe60b6f47, 0x0fe3f11d, 323 | 0xe54cda54, 0x1edad891, 0xce6279cf, 0xcd3e7e6f, 324 | 0x1618b166, 0xfd2c1d05, 0x848fd2c5, 0xf6fb2299, 325 | 0xf523f357, 0xa6327623, 0x93a83531, 0x56cccd02, 326 | 0xacf08162, 0x5a75ebb5, 0x6e163697, 0x88d273cc, 327 | 0xde966292, 0x81b949d0, 0x4c50901b, 0x71c65614, 328 | 0xe6c6c7bd, 0x327a140a, 0x45e1d006, 0xc3f27b9a, 329 | 0xc9aa53fd, 0x62a80f00, 0xbb25bfe2, 0x35bdd2f6, 330 | 0x71126905, 0xb2040222, 0xb6cbcf7c, 0xcd769c2b, 331 | 0x53113ec0, 0x1640e3d3, 0x38abbd60, 0x2547adf0, 332 | 0xba38209c, 0xf746ce76, 0x77afa1c5, 0x20756060, 333 | 0x85cbfe4e, 0x8ae88dd8, 0x7aaaf9b0, 0x4cf9aa7e, 334 | 0x1948c25c, 0x02fb8a8c, 0x01c36ae4, 0xd6ebe1f9, 335 | 0x90d4f869, 0xa65cdea0, 0x3f09252d, 0xc208e69f, 336 | 0xb74e6132, 0xce77e25b, 0x578fdfe3, 0x3ac372e6 337 | }; 338 | 339 | // bcrypt IV: "OrpheanBeholderScryDoubt" 340 | static private final int bf_crypt_ciphertext[] = { 341 | 0x4f727068, 0x65616e42, 0x65686f6c, 342 | 0x64657253, 0x63727944, 0x6f756274 343 | }; 344 | 345 | // Table for Base64 encoding 346 | static private final char base64_code[] = { 347 | '.', '/', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 348 | 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 349 | 'W', 'X', 'Y', 'Z', 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 350 | 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 351 | 'u', 'v', 'w', 'x', 'y', 'z', '0', '1', '2', '3', '4', '5', 352 | '6', '7', '8', '9' 353 | }; 354 | 355 | // Table for Base64 decoding 356 | static private final byte index_64[] = { 357 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 358 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 359 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 360 | -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 361 | -1, -1, -1, -1, -1, -1, 0, 1, 54, 55, 362 | 56, 57, 58, 59, 60, 61, 62, 63, -1, -1, 363 | -1, -1, -1, -1, -1, 2, 3, 4, 5, 6, 364 | 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 365 | 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 366 | -1, -1, -1, -1, -1, -1, 28, 29, 30, 367 | 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 368 | 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 369 | 51, 52, 53, -1, -1, -1, -1, -1 370 | }; 371 | 372 | // Expanded Blowfish key 373 | private int P[]; 374 | private int S[]; 375 | 376 | /** 377 | * Encode a byte array using bcrypt's slightly-modified base64 378 | * encoding scheme. Note that this is *not* compatible with 379 | * the standard MIME-base64 encoding. 380 | * 381 | * @param d the byte array to encode 382 | * @param len the number of bytes to encode 383 | * @return base64-encoded string 384 | * @exception IllegalArgumentException if the length is invalid 385 | */ 386 | private static String encode_base64(byte d[], int len) 387 | throws IllegalArgumentException { 388 | int off = 0; 389 | StringBuilder rs = new StringBuilder(); 390 | int c1, c2; 391 | 392 | if (len <= 0 || len > d.length) 393 | throw new IllegalArgumentException ("Invalid len"); 394 | 395 | while (off < len) { 396 | c1 = d[off++] & 0xff; 397 | rs.append(base64_code[(c1 >> 2) & 0x3f]); 398 | c1 = (c1 & 0x03) << 4; 399 | if (off >= len) { 400 | rs.append(base64_code[c1 & 0x3f]); 401 | break; 402 | } 403 | c2 = d[off++] & 0xff; 404 | c1 |= (c2 >> 4) & 0x0f; 405 | rs.append(base64_code[c1 & 0x3f]); 406 | c1 = (c2 & 0x0f) << 2; 407 | if (off >= len) { 408 | rs.append(base64_code[c1 & 0x3f]); 409 | break; 410 | } 411 | c2 = d[off++] & 0xff; 412 | c1 |= (c2 >> 6) & 0x03; 413 | rs.append(base64_code[c1 & 0x3f]); 414 | rs.append(base64_code[c2 & 0x3f]); 415 | } 416 | return rs.toString(); 417 | } 418 | 419 | /** 420 | * Look up the 3 bits base64-encoded by the specified character, 421 | * range-checking againt conversion table 422 | * @param x the base64-encoded value 423 | * @return the decoded value of x 424 | */ 425 | private static byte char64(char x) { 426 | if ((int)x < 0 || (int)x > index_64.length) 427 | return -1; 428 | return index_64[(int)x]; 429 | } 430 | 431 | /** 432 | * Decode a string encoded using bcrypt's base64 scheme to a 433 | * byte array. Note that this is *not* compatible with 434 | * the standard MIME-base64 encoding. 435 | * @param s the string to decode 436 | * @param maxolen the maximum number of bytes to decode 437 | * @return an array containing the decoded bytes 438 | * @throws IllegalArgumentException if maxolen is invalid 439 | */ 440 | private static byte[] decode_base64(String s, int maxolen) 441 | throws IllegalArgumentException { 442 | StringBuilder rs = new StringBuilder(); 443 | int off = 0, slen = s.length(), olen = 0; 444 | byte ret[]; 445 | byte c1, c2, c3, c4, o; 446 | 447 | if (maxolen <= 0) 448 | throw new IllegalArgumentException ("Invalid maxolen"); 449 | 450 | while (off < slen - 1 && olen < maxolen) { 451 | c1 = char64(s.charAt(off++)); 452 | c2 = char64(s.charAt(off++)); 453 | if (c1 == -1 || c2 == -1) 454 | break; 455 | o = (byte)(c1 << 2); 456 | o |= (c2 & 0x30) >> 4; 457 | rs.append((char)o); 458 | if (++olen >= maxolen || off >= slen) 459 | break; 460 | c3 = char64(s.charAt(off++)); 461 | if (c3 == -1) 462 | break; 463 | o = (byte)((c2 & 0x0f) << 4); 464 | o |= (c3 & 0x3c) >> 2; 465 | rs.append((char)o); 466 | if (++olen >= maxolen || off >= slen) 467 | break; 468 | c4 = char64(s.charAt(off++)); 469 | o = (byte)((c3 & 0x03) << 6); 470 | o |= c4; 471 | rs.append((char)o); 472 | ++olen; 473 | } 474 | 475 | ret = new byte[olen]; 476 | for (off = 0; off < olen; off++) 477 | ret[off] = (byte)rs.charAt(off); 478 | return ret; 479 | } 480 | 481 | /** 482 | * Blowfish encipher a single 64-bit block encoded as 483 | * two 32-bit halves 484 | * @param lr an array containing the two 32-bit half blocks 485 | * @param off the position in the array of the blocks 486 | */ 487 | private final void encipher(int lr[], int off) { 488 | int i, n, l = lr[off], r = lr[off + 1]; 489 | 490 | l ^= P[0]; 491 | for (i = 0; i <= BLOWFISH_NUM_ROUNDS - 2;) { 492 | // Feistel substitution on left word 493 | n = S[(l >> 24) & 0xff]; 494 | n += S[0x100 | ((l >> 16) & 0xff)]; 495 | n ^= S[0x200 | ((l >> 8) & 0xff)]; 496 | n += S[0x300 | (l & 0xff)]; 497 | r ^= n ^ P[++i]; 498 | 499 | // Feistel substitution on right word 500 | n = S[(r >> 24) & 0xff]; 501 | n += S[0x100 | ((r >> 16) & 0xff)]; 502 | n ^= S[0x200 | ((r >> 8) & 0xff)]; 503 | n += S[0x300 | (r & 0xff)]; 504 | l ^= n ^ P[++i]; 505 | } 506 | lr[off] = r ^ P[BLOWFISH_NUM_ROUNDS + 1]; 507 | lr[off + 1] = l; 508 | } 509 | 510 | /** 511 | * Cycically extract a word of key material 512 | * @param data the string to extract the data from 513 | * @param offp a "pointer" (as a one-entry array) to the 514 | * current offset into data 515 | * @return the next word of material from data 516 | */ 517 | private static int streamtoword(byte data[], int offp[]) { 518 | int i; 519 | int word = 0; 520 | int off = offp[0]; 521 | 522 | for (i = 0; i < 4; i++) { 523 | word = (word << 8) | (data[off] & 0xff); 524 | off = (off + 1) % data.length; 525 | } 526 | 527 | offp[0] = off; 528 | return word; 529 | } 530 | 531 | /** 532 | * Initialise the Blowfish key schedule 533 | */ 534 | private void init_key() { 535 | P = (int[])P_orig.clone(); 536 | S = (int[])S_orig.clone(); 537 | } 538 | 539 | /** 540 | * Key the Blowfish cipher 541 | * @param key an array containing the key 542 | */ 543 | private void key(byte key[]) { 544 | int i; 545 | int koffp[] = { 0 }; 546 | int lr[] = { 0, 0 }; 547 | int plen = P.length, slen = S.length; 548 | 549 | for (i = 0; i < plen; i++) 550 | P[i] = P[i] ^ streamtoword(key, koffp); 551 | 552 | for (i = 0; i < plen; i += 2) { 553 | encipher(lr, 0); 554 | P[i] = lr[0]; 555 | P[i + 1] = lr[1]; 556 | } 557 | 558 | for (i = 0; i < slen; i += 2) { 559 | encipher(lr, 0); 560 | S[i] = lr[0]; 561 | S[i + 1] = lr[1]; 562 | } 563 | } 564 | 565 | /** 566 | * Perform the "enhanced key schedule" step described by 567 | * Provos and Mazieres in "A Future-Adaptable Password Scheme" 568 | * http://www.openbsd.org/papers/bcrypt-paper.ps 569 | * @param data salt information 570 | * @param key password information 571 | */ 572 | private void ekskey(byte data[], byte key[]) { 573 | int i; 574 | int koffp[] = { 0 }, doffp[] = { 0 }; 575 | int lr[] = { 0, 0 }; 576 | int plen = P.length, slen = S.length; 577 | 578 | for (i = 0; i < plen; i++) 579 | P[i] = P[i] ^ streamtoword(key, koffp); 580 | 581 | for (i = 0; i < plen; i += 2) { 582 | lr[0] ^= streamtoword(data, doffp); 583 | lr[1] ^= streamtoword(data, doffp); 584 | encipher(lr, 0); 585 | P[i] = lr[0]; 586 | P[i + 1] = lr[1]; 587 | } 588 | 589 | for (i = 0; i < slen; i += 2) { 590 | lr[0] ^= streamtoword(data, doffp); 591 | lr[1] ^= streamtoword(data, doffp); 592 | encipher(lr, 0); 593 | S[i] = lr[0]; 594 | S[i + 1] = lr[1]; 595 | } 596 | } 597 | 598 | /** 599 | * Perform the central password hashing step in the 600 | * bcrypt scheme 601 | * @param password the password to hash 602 | * @param salt the binary salt to hash with the password 603 | * @param log_rounds the binary logarithm of the number 604 | * of rounds of hashing to apply 605 | * @return an array containing the binary hashed password 606 | */ 607 | private byte[] crypt_raw(byte password[], byte salt[], int log_rounds) { 608 | int rounds, i, j; 609 | int cdata[] = (int[])bf_crypt_ciphertext.clone(); 610 | int clen = cdata.length; 611 | byte ret[]; 612 | 613 | if (log_rounds < 4 || log_rounds > 31) 614 | throw new IllegalArgumentException ("Bad number of rounds"); 615 | rounds = 1 << log_rounds; 616 | if (salt.length != BCRYPT_SALT_LEN) 617 | throw new IllegalArgumentException ("Bad salt length"); 618 | 619 | init_key(); 620 | ekskey(salt, password); 621 | for (i = 0; i < rounds; i++) { 622 | key(password); 623 | key(salt); 624 | } 625 | 626 | for (i = 0; i < 64; i++) { 627 | for (j = 0; j < (clen >> 1); j++) 628 | encipher(cdata, j << 1); 629 | } 630 | 631 | ret = new byte[clen * 4]; 632 | for (i = 0, j = 0; i < clen; i++) { 633 | ret[j++] = (byte)((cdata[i] >> 24) & 0xff); 634 | ret[j++] = (byte)((cdata[i] >> 16) & 0xff); 635 | ret[j++] = (byte)((cdata[i] >> 8) & 0xff); 636 | ret[j++] = (byte)(cdata[i] & 0xff); 637 | } 638 | return ret; 639 | } 640 | 641 | /** 642 | * Hash a password using the OpenBSD bcrypt scheme 643 | * @param password the password to hash 644 | * @param salt the salt to hash with (perhaps generated 645 | * using BCrypt.gensalt) 646 | * @return the hashed password 647 | */ 648 | public static String hashpw(String password, String salt) { 649 | BCrypt B; 650 | String real_salt; 651 | byte passwordb[], saltb[], hashed[]; 652 | char minor = (char)0; 653 | int rounds, off = 0; 654 | StringBuilder rs = new StringBuilder(); 655 | 656 | if (salt.charAt(0) != '$' || salt.charAt(1) != '2') 657 | throw new IllegalArgumentException ("Invalid salt version"); 658 | if (salt.charAt(2) == '$') 659 | off = 3; 660 | else { 661 | minor = salt.charAt(2); 662 | if (minor != 'a' || salt.charAt(3) != '$') 663 | throw new IllegalArgumentException ("Invalid salt revision"); 664 | off = 4; 665 | } 666 | 667 | // Extract number of rounds 668 | if (salt.charAt(off + 2) > '$') 669 | throw new IllegalArgumentException ("Missing salt rounds"); 670 | rounds = Integer.parseInt(salt.substring(off, off + 2)); 671 | 672 | real_salt = salt.substring(off + 3, off + 25); 673 | try { 674 | passwordb = (password + (minor >= 'a' ? "\000" : "")).getBytes("UTF-8"); 675 | } catch (UnsupportedEncodingException uee) { 676 | throw new AssertionError("UTF-8 is not supported"); 677 | } 678 | 679 | saltb = decode_base64(real_salt, BCRYPT_SALT_LEN); 680 | 681 | B = new BCrypt(); 682 | hashed = B.crypt_raw(passwordb, saltb, rounds); 683 | 684 | rs.append("$2"); 685 | if (minor >= 'a') 686 | rs.append(minor); 687 | rs.append("$"); 688 | if (rounds < 10) 689 | rs.append("0"); 690 | rs.append(Integer.toString(rounds)); 691 | rs.append("$"); 692 | rs.append(encode_base64(saltb, saltb.length)); 693 | rs.append(encode_base64(hashed, 694 | bf_crypt_ciphertext.length * 4 - 1)); 695 | return rs.toString(); 696 | } 697 | 698 | /** 699 | * Generate a salt for use with the BCrypt.hashpw() method 700 | * @param log_rounds the log2 of the number of rounds of 701 | * hashing to apply - the work factor therefore increases as 702 | * 2**log_rounds. 703 | * @param random an instance of SecureRandom to use 704 | * @return an encoded salt value 705 | */ 706 | public static String gensalt(int log_rounds, SecureRandom random) { 707 | StringBuilder rs = new StringBuilder(); 708 | byte rnd[] = new byte[BCRYPT_SALT_LEN]; 709 | 710 | random.nextBytes(rnd); 711 | 712 | rs.append("$2a$"); 713 | if (log_rounds < 10) 714 | rs.append("0"); 715 | rs.append(Integer.toString(log_rounds)); 716 | rs.append("$"); 717 | rs.append(encode_base64(rnd, rnd.length)); 718 | return rs.toString(); 719 | } 720 | 721 | /** 722 | * Generate a salt for use with the BCrypt.hashpw() method 723 | * @param log_rounds the log2 of the number of rounds of 724 | * hashing to apply - the work factor therefore increases as 725 | * 2**log_rounds. 726 | * @return an encoded salt value 727 | */ 728 | public static String gensalt(int log_rounds) { 729 | return gensalt(log_rounds, new SecureRandom()); 730 | } 731 | 732 | /** 733 | * Generate a salt for use with the BCrypt.hashpw() method, 734 | * selecting a reasonable default for the number of hashing 735 | * rounds to apply 736 | * @return an encoded salt value 737 | */ 738 | public static String gensalt() { 739 | return gensalt(GENSALT_DEFAULT_LOG2_ROUNDS); 740 | } 741 | 742 | /** 743 | * Check that a plaintext password matches a previously hashed 744 | * one 745 | * @param plaintext the plaintext password to verify 746 | * @param hashed the previously-hashed password 747 | * @return true if the passwords match, false otherwise 748 | */ 749 | public static boolean checkpw(String plaintext, String hashed) { 750 | return (hashed.compareTo(hashpw(plaintext, hashed)) == 0); 751 | } 752 | } 753 | --------------------------------------------------------------------------------