1. Sunday, October 07, 2007 9:49:58 AM by Adi
    Trackback from
  2. Thursday, November 29, 2007 5:30:34 PM by Paul Houle
    Thanks a million!
  3. Tuesday, January 27, 2009 8:14:58 AM by Svish
    Why do GenerateSalt(30) take for ever, but GenerateSalt(31) seems to take no time at all?
  4. Tuesday, March 17, 2009 5:11:18 PM by Sire
    Note that the salt is actually included in the hash, so there is no need to store the salt separately.
  5. Monday, February 08, 2010 3:37:42 PM by David
    To fix the GenerateSalt(31) bug change line 641 to: uint rounds = 1U << logRounds; For an explanation of this bug visit the site in my link.
  6. Thursday, March 25, 2010 1:06:06 PM by Thomas
    Thanks a lot.
  7. Monday, December 13, 2010 12:45:17 PM by Bob
    You will probably be about to receive quite a few hits after the Gawker mishap!:)
  8. Saturday, February 12, 2011 7:04:44 PM by Kamran
    You should add this to GitHub. :)
  9. Wednesday, March 23, 2011 3:38:22 PM by Simon
    It looks like an implementation of this is available at - seems to have fixed the work factor 31 bug.
  10. Tuesday, September 20, 2011 5:06:55 AM by Barsham
    Good Job.
  11. Wednesday, December 12, 2012 4:57:10 PM by Keith
    Is there a way to prove that this implementation is "$2y"-worthy? Use of "$2a" is discouraged because of a flawed implementation for Unix platforms, but I can't find many details on the exact issue (including, ideally, passwords and resulting hashes proving an implementation does not have the vulnerability)
  12. Monday, June 03, 2013 11:48:50 PM by Saurabh Bansal
    Can you please help me porting jaspyt to .net
  13. Tuesday, July 30, 2013 3:54:34 AM by A
    CryptSharp includes the $2y$ implementation of BCrypt, just as an fyi -
  14. Wednesday, August 13, 2014 12:41:52 PM by Hannes
    Very helpful, thanks!
Add Comment