Created
March 7, 2011 05:59
-
-
Save donpark/858134 to your computer and use it in GitHub Desktop.
async PBKDF2 with optional progress callback
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// original, synch version, is at: | |
// http://code.google.com/p/crypto-js/source/browse/branches/2.0.x/src/PBKDF2.js | |
(function(){ | |
// Shortcuts | |
var C = Crypto, | |
util = C.util, | |
charenc = C.charenc, | |
UTF8 = charenc.UTF8, | |
Binary = charenc.Binary; | |
if (!C.nextTick) { | |
// node.js has setTime out but prefer process.nextTick | |
if (typeof process != 'undefined' && typeof process.nextTick !== 'undefined') { | |
C.nextTick = process.nextTick; | |
} else if (typeof setTimeout !== 'undefined') { | |
C.nextTick = function (callback) { | |
setTimeout(callback, 0); | |
}; | |
} | |
} | |
C.PBKDF2Async = function (password, salt, keylen, options, callback, progress) { | |
// Convert to byte arrays | |
if (password.constructor == String) password = UTF8.stringToBytes(password); | |
if (salt.constructor == String) salt = UTF8.stringToBytes(salt); | |
/* else, assume byte arrays already */ | |
// Defaults | |
var hasher = options && options.hasher || C.SHA1, | |
iterations = options && options.iterations || 1; | |
// Pseudo-random function | |
function PRF(password, salt) { | |
return C.HMAC(hasher, salt, password, { asBytes: true }); | |
} | |
var nextTick = C.nextTick; | |
// Generate key | |
var derivedKeyBytes = [], | |
blockindex = 1; | |
var outer, inner, percent; | |
nextTick(outer = function () { | |
if (derivedKeyBytes.length < keylen) { | |
if (progress) { | |
progress(derivedKeyBytes.length / keylen * 100 | 0); | |
} | |
var block = PRF(password, salt.concat(util.wordsToBytes([blockindex]))); | |
var u = block, i = 1; | |
nextTick(inner = function () { | |
if (i < iterations) { | |
u = PRF(password, u); | |
for (var j = 0; j < block.length; j++) block[j] ^= u[j]; | |
i++; | |
nextTick(inner); | |
} else { | |
derivedKeyBytes = derivedKeyBytes.concat(block); | |
blockindex++; | |
nextTick(outer); | |
} | |
}); | |
} else { | |
if (progress) { | |
progress(100); | |
} | |
// Truncate excess bytes | |
derivedKeyBytes.length = keylen; | |
callback( | |
options && options.asBytes ? derivedKeyBytes : | |
options && options.asString ? Binary.bytesToString(derivedKeyBytes) : | |
util.bytesToHex(derivedKeyBytes)); | |
} | |
}); | |
}; | |
})(); |
Sample output:
$ node test-PBKDF2Async.js
percent complete: 0%
percent complete: 7%
percent complete: 15%
percent complete: 23%
percent complete: 31%
percent complete: 39%
percent complete: 46%
percent complete: 54%
percent complete: 62%
percent complete: 70%
percent complete: 78%
percent complete: 85%
percent complete: 93%
percent complete: 100%
process.nextTick - PBKDF2 and PBKDF2Async result match
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Sample code:
var Crypto = require('../lib/crypto').Crypto;