From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
DesignersNiels Provos, David Mazières
First published1999
Derived fromBlowfish (cipher)
Digest sizes184 bit
Roundsvariable via cost parameter

bcrypt is a password-hashing function designed by Niels Provos and David Mazières, based on the Blowfish cipher and presented at USENIX in 1999.[1] Besides incorporating a salt to protect against rainbow table attacks, bcrypt is an adaptive function: over time, the iteration count can be increased to make it slower, so it remains resistant to brute-force search attacks even with increasing computation power.

The bcrypt function is the default password hash algorithm for OpenBSD[2] and was the default for some Linux distributions such as SUSE Linux.[3]

There are implementations of bcrypt for C, C++, C#, Embarcadero Delphi, Elixir,[4] Go,[5] Java,[6][7] JavaScript,[8] Perl, PHP, Python,[9] Ruby, and other languages.


Blowfish is notable among block ciphers for its expensive key setup phase. It starts off with subkeys in a standard state, then uses this state to perform a block encryption using part of the key, and uses the result of that encryption (which is more accurate at hashing) to replace some of the subkeys. Then it uses this modified state to encrypt another part of the key, and uses the result to replace more of the subkeys. It proceeds in this fashion, using a progressively modified state to hash the key and replace bits of state, until all subkeys have been set.

Provos and Mazières took advantage of this, and took it further. They developed a new key setup algorithm for Blowfish, dubbing the resulting cipher "Eksblowfish" ("expensive key schedule Blowfish"). The key setup begins with a modified form of the standard Blowfish key setup, in which both the salt and password are used to set all subkeys. There are then a number of rounds in which the standard Blowfish keying algorithm is applied, using alternatively the salt and the password as the key, each round starting with the subkey state from the previous round. In theory, this is no stronger than the standard Blowfish key schedule, but the number of rekeying rounds is configurable; this process can therefore be made arbitrarily slow, which helps deter brute-force attacks upon the hash or salt.


A bcrypt hash string is of the form:

$2<a/b/x/y>$[cost]$[22 character salt][31 character hash]

For example:

\__/\/ \____________________/\_____________________________/
Alg Cost      Salt                        Hash


  • $2a$: The hash algorithm identifier (bcrypt)
  • 10: Cost factor (210 i.e. 1,024 rounds)
  • N9qo8uLOickgx2ZMRZoMye: 16-byte (128-bit) salt, Radix-64 encoded as 22 characters
  • IjZAgcfl7p92ldGxad68LJZdL17lhWy: 24-byte (192-bit) hash, Radix-64 encoded as 31 characters

The prefix $2a$ or $2b$ (or in case the PHP package crypt_blowfish in particular: $2x$ and $2y$[10]) in a hash string in a shadow password file indicates that hash string is a bcrypt hash in modular crypt format.[11] The rest of the hash string includes the cost parameter, a 128-bit salt, and 192 bits of the resulting hash value.[12] The Radix-64 encoding uses the unix/crypt alphabet, and is not 'standard' Base-64.[13][14] The cost parameter specifies a key expansion iteration count as a power of two, which is an input to the crypt algorithm.

For example, the shadow password record $2a$10$N9qo8uLOickgx2ZMRZoMyeIjZAgcfl7p92ldGxad68LJZdL17lhWy specifies a cost parameter of 10, indicating 210 key expansion rounds. The salt is N9qo8uLOickgx2ZMRZoMye and the resulting hash is IjZAgcfl7p92ldGxad68LJZdL17lhWy. Per standard practice, the user's password itself is not stored.

In most programming languages it's possible to verify if a text represents an encoded bcrypt password using a regular expression. This feature can be used to validate if a password is encoded correctly. Below, is an example in Python of a regular expression that works on most programming languages:

import re

# Simplified version of a regex to match bcrypt passwords
regular_expression = "^[$]2[abxy]?[$](?:0[4-9]|[12][0-9]|3[01])[$][./0-9a-zA-Z]{53}$"

# A bcrypt password encoded with version "2y" and cost 12
encoded_password = "$2y$12$PEmxrth.vjPDazPWQcLs6u9GRFLJvneUkcf/vcXn8L.bzaBUKeX4W"

matches = re.search(regular_expression, encoded_password)

if matches:
  print("YES! We have a match!")
  print("No match")

When executed, this program gives the following output:

YES! We have a match!

Besides identifying if the given text is a valid bcrypt password, the regular expression can be used to extract information from it, such as its version, cost, salt and hash. Below, is an example in Python of a more advanced regular expression that extracts information from the encoded password. It can be tweaked to work on most programming languages:

# This example requires python 3.6+
import re

# Advanced version of a regex to match bcrypt passwords and extract its information
regular_expression = "^[$](?P<version>2[abxy]?)[$](?P<strength>(?P<cost>(0[4-9]|[12][0-9]|3[01])))[$](?P<password>((?P<salt>[./0-9a-zA-Z]{22})(?P<hash>[./0-9a-zA-Z]{31})))$"

# Below, the same regular expression for use in other languages
# Note that the letter "P" was removed from the names
# ^[$](?<version>2[abxy]?)[$](?<strength>(?<cost>(0[4-9]|[12][0-9]|3[01])))[$](?<password>((?<salt>[./0-9a-zA-Z]{22})(?<hash>[./0-9a-zA-Z]{31})))$

pattern = re.compile(regular_expression)

# A bcrypt password encoded with version "2y" and cost 12
encoded_password = "$2y$12$PEmxrth.vjPDazPWQcLs6u9GRFLJvneUkcf/vcXn8L.bzaBUKeX4W"

match = pattern.match(encoded_password)

if match:
  print("YES! We have a match!")
  print(f"Version: {match.group('version')}")
  print(f"Cost: {match.group('cost')}")
  print(f"Strength (another name for cost): {match.group('strength')}")
  print(f"Password: {match.group('password')}")
  print(f"Salt: {match.group('salt')}")
  print(f"Hash: {match.group('hash')}")
  print("No match")

When executed, this program gives the following output:

YES! We have a match!

Version: 2y
Cost: 12
Strength (another name for cost): 12
Password: PEmxrth.vjPDazPWQcLs6u9GRFLJvneUkcf/vcXn8L.bzaBUKeX4W
Salt: PEmxrth.vjPDazPWQcLs6u
Hash: 9GRFLJvneUkcf/vcXn8L.bzaBUKeX4W

Versioning history[edit]

$2$ (1999)

The original bcrypt specification defined a prefix of $2$. This follows the Modular Crypt Format[15] format used when storing passwords in the OpenBSD password file:

  • $1$: MD5-based crypt ('md5crypt')
  • $2$: Blowfish-based crypt ('bcrypt')
  • $sha1$: SHA-1-based crypt ('sha1crypt')
  • $5$: SHA-256-based crypt ('sha256crypt')
  • $6$: SHA-512-based crypt ('sha512crypt')


The original specification did not define how to handle non-ASCII character, nor how to handle a null terminator. The specification was revised to specify that when hashing strings:

  • the string must be UTF-8 encoded
  • the null terminator must be included

With this change, the version was changed to $2a$[16]

$2x$, $2y$ (June 2011)

In June 2011, a bug was discovered in crypt_blowfish, a PHP implementation of bcrypt. It was mis-handling characters with the 8th bit set.[17] They suggested that system administrators update their existing password database, replacing $2a$ with $2x$, to indicate that those hashes are bad (and need to use the old broken algorithm). They also suggested the idea of having crypt_blowfish emit $2y$ for hashes generated by the fixed algorithm.

Nobody else, including canonical OpenBSD, adopted the idea of 2x/2y. This version marker change was limited to crypt_blowfish.

$2b$ (February 2014)

A bug was discovered in the OpenBSD implementation of bcrypt. They were storing the length of their strings in an unsigned char (i.e. 8-bit Byte).[16] If a password was longer than 255 characters, it would overflow and wrap at 255.[18]

bcrypt was created for OpenBSD. When they had a bug in their library, they decided to bump the version number.


The bcrypt algorithm is the result of encrypting the text "OrpheanBeholderScryDoubt" 64 times using Blowfish. In bcrypt the usual Blowfish key setup function is replaced with an expensive key setup (EksBlowfishSetup) function:

Function bcrypt
      cost:     Number (4..31)                      log2(Iterations). e.g. 12 ==> 212 = 4,096 iterations
      salt:     array of Bytes (16 bytes)           random salt
      password: array of Bytes (1..72 bytes)        UTF-8 encoded password
      hash:     array of Bytes (24 bytes)

   //Initialize Blowfish state with expensive key setup algorithm
   //P: array of 18 subkeys (UInt32[18])
   //S: Four substitution boxes (S-boxes), S0...S3. Each S-box is 1,024 bytes (UInt32[256])
   P, S ← EksBlowfishSetup(cost, salt, password)   

   //Repeatedly encrypt the text "OrpheanBeholderScryDoubt" 64 times
   ctext"OrpheanBeholderScryDoubt"  //24 bytes ==> three 64-bit blocks
   repeat (64)
      ctext ← EncryptECB(P, S, ctext) //encrypt using standard Blowfish in ECB mode

   //24-byte ctext is resulting password hash
   return Concatenate(cost, salt, ctext)

Expensive key setup[edit]

The bcrypt algorithm depends heavily on its "Eksblowfish" key setup algorithm, which runs as follows:

Function EksBlowfishSetup
      password: array of Bytes (1..72 bytes)   UTF-8 encoded password
      salt:     array of Bytes (16 bytes)      random salt
      cost:     Number (4..31)                 log2(Iterations). e.g. 12 ==> 212 = 4,096 iterations
      P:        array of UInt32                array of 18 per-round subkeys
      S1..S4:   array of UInt32                array of four SBoxes; each SBox is 256 UInt32 (i.e. each SBox is 1 KiB)

   //Initialize P (Subkeys), and S (Substitution boxes) with the hex digits of pi 
   P, S ← InitialState() 
   //Permutate P and S based on the password and salt     
   P, S ← ExpandKey(P, S, salt, password)

   //This is the "Expensive" part of the "Expensive Key Setup".
   //Otherwise the key setup is identical to Blowfish.
   repeat (2cost)
      P, S ← ExpandKey(P, S, 0, password)
      P, S ← ExpandKey(P, S, 0, salt)

   return P, S

InitialState works as in the original Blowfish algorithm, populating the P-array and S-box entries with the fractional part of in hexadecimal.

Expand key[edit]

The ExpandKey function does the following:

Function ExpandKey
      password: array of Bytes (1..72 bytes)  UTF-8 encoded password
      salt:     Byte[16]                      random salt
      P:        array of UInt32               Array of 18 subkeys
      S1..S4:   UInt32[1024]                  Four 1 KB SBoxes
      P:        array of UInt32               Array of 18 per-round subkeys
      S1..S4:   UInt32[1024]                  Four 1 KB SBoxes       
   //Mix password into the P subkeys array
   for n ← 1 to 18 do
      Pn ← Pn xor password[32(n-1)..32n-1] //treat the password as cyclic
   //Treat the 128-bit salt as two 64-bit halves (the Blowfish block size).
   saltHalf[0] ← salt[0..63]  //Lower 64-bits of salt
   saltHalf[1] ← salt[64..127]  //Upper 64-bits of salt

   //Initialize an 8-byte (64-bit) buffer with all zeros.
   block ← 0

   //Mix internal state into P-boxes   
   for n ← 1 to 9 do
      //xor 64-bit block with a 64-bit salt half
      blockblock xor saltHalf[(n-1) mod 2] //each iteration alternating between saltHalf[0], and saltHalf[1]

      //encrypt block using current key schedule
      block ← Encrypt(P, S, block) 
      P2nblock[0..31]      //lower 32-bits of block
      P2n+1block[32..63]  //upper 32-bits block

   //Mix encrypted state into the internal S-boxes of state
   for i ← 1 to 4 do
      for n ← 0 to 127 do
         block ← Encrypt(state, block xor salt[64(n-1)..64n-1]) //as above
         Si[2n]   ← block[0..31]  //lower 32-bits
         Si[2n+1] ← block[32..63]  //upper 32-bits
    return state

Hence, ExpandKey(state, 0, key) is the same as regular Blowfish key schedule since all XORs with the all-zero salt value are ineffectual. ExpandKey(state, 0, salt) is similar, but uses the salt as a 128-bit key.

User input[edit]

Many implementations of bcrypt truncate the password to the first 72 bytes, following the OpenBSD implementation.

The mathematical algorithm itself requires initialization with 18 32-bit subkeys (equivalent to 72 octets/bytes). The original specification of bcrypt does not mandate any one particular method for mapping text-based passwords from userland into numeric values for the algorithm. One brief comment in the text mentions, but does not mandate, the possibility of simply using the ASCII encoded value of a character string: "Finally, the key argument is a secret encryption key, which can be a user-chosen password of up to 56 bytes (including a terminating zero byte when the key is an ASCII string)."[1]

Note that the quote above mentions passwords "up to 56 bytes" even though the algorithm itself makes use of a 72 byte initial value. Although Provos and Mazières do not state the reason for the shorter restriction, they may have been motivated by the following statement from Bruce Schneier's original specification of Blowfish, "The 448 [bit] limit on the key size ensures that the [sic] every bit of every subkey depends on every bit of the key."[19]

Implementations have varied in their approach of converting passwords into initial numeric values, including sometimes reducing the strength of passwords containing non-ASCII characters.[20]


Maximum password length[edit]

bcrypt has a maximum password length of 72 bytes. This maximum comes from the first operation of the ExpandKey function that xor's the 18 4-byte subkeys (P) with the password:

P1..P18 ← P1..P18 xor passwordBytes

The password (which is UTF-8 encoded), is repeated until it is 72-bytes long. For example, a password of:

correct horse battery staple␀ (29 bytes)

Is repeated until it matches the 72-bytes of the 18 P per-round subkeys:

correct horse battery staple␀correct horse battery staple␀correct horse (72 bytes)

This also means that if a password were longer than 72-bytes UTF-8 encoded: the password would be truncated. Some characters can require 4-bytes when UTF-8 encoded. This means that in the worst case, this can limit a password to 18 characters:

𐑜𐑝𐑟𐑥𐑷𐑻𐑽𐑾𐑿𐑿𐑰𐑩𐑛𐑙𐑘𐑙𐑒𐑔 (18 characters, 72 bytes)

This limit of 72-byte passwords (18 subkeys * 4-bytes each) could have been addressed in a number of ways:

Solution 1 - Increase number of subkeys[edit]

You can increase the number of P subkeys used, and therefore increase the maximum password length available. Bruce Schneier, the original author of Blowfish, noted that people could play with adding more rounds,[21] which requires more subkeys, which for bcrypt would increase the maximum password length. A downside of this is that there is still a maximum password length - rather than no maximum length.

Solution 2 - Continue to xor mix the key bytes into the P subkeys array[edit]

Password mixing only continues as long as P1...P18. Once you've reached P18 and you still have password bytes unprocessed, continue the xor process on P1. A downside of this approach is that the computation time leaks the password length (side-channel information leak).

Solution 3 - Pre-hash password[edit]

The long password can be pre-hashed with another cryptographic hashing function. This function always outputs a digest of a fixed size. As long as the resulting digest is less than 72 bytes: it can be fed into bcrypt without being cut off. This is the approach taken by Dropbox[22] and others. For example, consider the password:

ਤੇਜ਼ ਭੂਰੇ ਲੂੰਬੜ ਨੇ ਆਲਸੀ ਕੁੱਤੇ ਉੱਤੇ ਛਾਲ ਮਾਰ ਦਿੱਤੀ (32 characters, 126 bytes)

Hashing this password using SHA-256 yields a 256-bit (32-byte) digest:

A7 B2 AA 86 CB 57 D3 08 EA 54 9F 34 E5 91 7E 8C 06 9B D0 0D 34 28 B1 CA 8D 71 B2 2E 84 DA C0 F8

Base64 encoding the digest gives a string that is consistently 44 characters:

p7KqhstX0wjqVJ805ZF+jAab0A00KLHKjXGyLoTawPg= (44 characters, 44 bytes)

and will always fit in the 72-byte bcrypt limit.

This is similar to an approach used by Pufferfish2, a cache-hard evolution of bcrypt, that uses HMACSHA-512 to convert the password into a fixed length 64-byte (512-bit) key.

Password hash truncation[edit]

The bcrypt algorithm involves repeatedly encrypting the 24-byte text:

OrpheanBeholderScryDoubt (24-bytes)

This generates 24-bytes of ciphertext, e.g.:

85 20 af 9f 03 3d b3 8c 08 5f d2 5e 2d aa 5e 84 a2 b9 61 d2 f1 29 c9 a4 (24-bytes)

Which then should get radix-64 encoded to 32-characters:

hSCvnwM9s4wIX9JeLapehKK5YdLxKcmk (32-characters)

But the canonical OpenBSD implementation truncates password hash to 23 bytes:

85 20 af 9f 03 3d b3 8c 08 5f d2 5e 2d aa 5e 84 a2 b9 61 d2 f1 29 c9 a4 (23-bytes)

and the resulting base-64 encoded text, which normally would be:


has the trailing = removed, leaving a hash of:


It is unclear why the canonical implementation deletes 8-bits from the resulting password hash.

Usage of non-standard base64 encoding[edit]

The Base64 encoding used by the canonical OpenBSD implementation uses an encoding dictionary that is different from those available in nearly every language and platform. The encoding is compatible with crypt. This means the encoding is not compatible with RFC 4648.[citation needed]

See also[edit]


  1. ^ a b Provos, Niels; Mazières, David; Talan Jason Sutton 2012 (1999). "A Future-Adaptable Password Scheme". Proceedings of 1999 USENIX Annual Technical Conference: 81–92.
  2. ^ "Commit of first work to repo". 13 Feb 1997.
  3. ^ "SUSE Security Announcement: (SUSE-SA:2011:035)". 23 August 2011. Archived from the original on 4 March 2016. Retrieved 20 August 2015. SUSE's crypt() implementation supports the blowfish password hashing function (id $2a) and system logins by default also use this method.
  4. ^ Whitlock, David (21 September 2021). "Bcrypt Elixir: bcrypt password hashing algorithm for Elixir". GitHub. riverrun.
  5. ^ "Package bcrypt". godoc.org.
  6. ^ "jBCrypt - strong password hashing for Java". www.mindrot.org. Retrieved 2017-03-11.
  7. ^ "bcrypt - A Java standalone implementation of the bcrypt password hash function". github.com. Retrieved 2018-07-19.
  8. ^ "bcryptjs". npm.
  9. ^ Stufft, Donald (14 October 2021). "bcrypt: Modern password hashing for your software and your servers" – via PyPI.
  10. ^ "Re: CVE request: crypt_blowfish 8-bit character mishandling". Post on oss-sec which was the origin of 2x and 2y, see following posts as well. Retrieved 2021-08-04.
  11. ^ "Modular Crypt Format". Passlib v1.7.4 Documentation. Retrieved 2021-07-04.
  12. ^ "passlib.hash.bcrypt - BCrypt". Passlib v1.7.4 Documentation. Retrieved 2021-07-04.
  13. ^ "Modern(-ish) password hashing for your software and your servers: pyca/bcrypt". November 18, 2019 – via GitHub.
  14. ^ "GitHub - bcgit/bc-java: Bouncy Castle Java Distribution (Mirror)". November 18, 2019 – via GitHub.
  15. ^ "Modular Crypt Format — Passlib v1.7.1 Documentation". passlib.readthedocs.io.
  16. ^ a b "bcrypt password hash bugs fixed, version changes and consequences". undeadly.org.
  17. ^ Designer, Solar. "oss-sec: CVE request: crypt_blowfish 8-bit character mishandling". seclists.org.
  18. ^ "'bcrypt version changes' - MARC". marc.info.
  19. ^ Schneier, Bruce (1994). "Fast Software Encryption, Description of a New Variable-Length Key, 64-Bit Block Cipher (Blowfish)". Cambridge Security Workshop Proceedings (December 1993). Springer-Verlag: 191–204.
  20. ^ "jBCrypt security advisory". 1 February 2010. And "Changes in CRYPT_BLOWFISH in PHP 5.3.7". php.net.
  21. ^ "Schneier on Security: The Blowfish Encryption Algorithm".
  22. ^ "How Dropbox securely stores your passwords".
  23. ^ http://bcrypt.sourceforge.net bcrypt file encryption program homepage
  24. ^ "bcrypt APK for Android - free download on Droid Informer". droidinformer.org.
  25. ^ "T2 package - trunk - bcrypt - A utility to encrypt files". t2sde.org.
  26. ^ "Oracle GoldenGateのライセンス". docs.oracle.com.

External links[edit]