-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathpasshash.js
172 lines (167 loc) · 7.44 KB
/
passhash.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Password Hasher
*
* The Initial Developer of the Original Code is Steve Cooper.
* Portions created by the Initial Developer are Copyright (C) 2006
* the Initial Developer. All Rights Reserved.
*
* Contributor(s): (none)
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
// Modification by Torne: functions not used by PawHash have been removed.
var PassHashCommon =
{
// IMPORTANT: This function should be changed carefully. It must be
// completely deterministic and consistent between releases. Otherwise
// users would be forced to update their passwords. In other words, the
// algorithm must always be backward-compatible. It's only acceptable to
// violate backward compatibility when new options are used.
// SECURITY: The optional adjustments are positioned and calculated based
// on the sum of all character codes in the raw hash string. So it becomes
// far more difficult to guess the injected special characters without
// knowing the master key.
// TODO: Is it ok to assume ASCII is ok for adjustments?
generateHashWord: function(
siteTag,
masterKey,
hashWordSize,
requireDigit,
requirePunctuation,
requireMixedCase,
restrictSpecial,
restrictDigits)
{
// Start with the SHA1-encrypted master key/site tag.
var s = b64_hmac_sha1(masterKey, siteTag);
// Use the checksum of all characters as a pseudo-randomizing seed to
// avoid making the injected characters easy to guess. Note that it
// isn't random in the sense of not being deterministic (i.e.
// repeatable). Must share the same seed between all injected
// characters so that they are guaranteed unique positions based on
// their offsets.
var sum = 0;
for (var i = 0; i < s.length; i++)
sum += s.charCodeAt(i);
// Restrict digits just does a mod 10 of all the characters
if (restrictDigits)
s = PassHashCommon.convertToDigits(s, sum, hashWordSize);
else
{
// Inject digit, punctuation, and mixed case as needed.
if (requireDigit)
s = PassHashCommon.injectSpecialCharacter(s, 0, 4, sum, hashWordSize, 48, 10);
if (requirePunctuation && !restrictSpecial)
s = PassHashCommon.injectSpecialCharacter(s, 1, 4, sum, hashWordSize, 33, 15);
if (requireMixedCase)
{
s = PassHashCommon.injectSpecialCharacter(s, 2, 4, sum, hashWordSize, 65, 26);
s = PassHashCommon.injectSpecialCharacter(s, 3, 4, sum, hashWordSize, 97, 26);
}
// Strip out special characters as needed.
if (restrictSpecial)
s = PassHashCommon.removeSpecialCharacters(s, sum, hashWordSize);
}
// Trim it to size.
return s.substr(0, hashWordSize);
},
// This is a very specialized method to inject a character chosen from a
// range of character codes into a block at the front of a string if one of
// those characters is not already present.
// Parameters:
// sInput = input string
// offset = offset for position of injected character
// reserved = # of offsets reserved for special characters
// seed = seed for pseudo-randomizing the position and injected character
// lenOut = length of head of string that will eventually survive truncation.
// cStart = character code for first valid injected character.
// cNum = number of valid character codes starting from cStart.
injectSpecialCharacter: function(sInput, offset, reserved, seed, lenOut, cStart, cNum)
{
var pos0 = seed % lenOut;
var pos = (pos0 + offset) % lenOut;
// Check if a qualified character is already present
// Write the loop so that the reserved block is ignored.
for (var i = 0; i < lenOut - reserved; i++)
{
var i2 = (pos0 + reserved + i) % lenOut
var c = sInput.charCodeAt(i2);
if (c >= cStart && c < cStart + cNum)
return sInput; // Already present - nothing to do
}
var sHead = (pos > 0 ? sInput.substring(0, pos) : "");
var sInject = String.fromCharCode(((seed + sInput.charCodeAt(pos)) % cNum) + cStart);
var sTail = (pos + 1 < sInput.length ? sInput.substring(pos+1, sInput.length) : "");
return (sHead + sInject + sTail);
},
// Another specialized method to replace a class of character, e.g.
// punctuation, with plain letters and numbers.
// Parameters:
// sInput = input string
// seed = seed for pseudo-randomizing the position and injected character
// lenOut = length of head of string that will eventually survive truncation.
removeSpecialCharacters: function(sInput, seed, lenOut)
{
var s = '';
var i = 0;
while (i < lenOut)
{
var j = sInput.substring(i).search(/[^a-z0-9]/i);
if (j < 0)
break;
if (j > 0)
s += sInput.substring(i, i + j);
s += String.fromCharCode((seed + i) % 26 + 65);
i += (j + 1);
}
if (i < sInput.length)
s += sInput.substring(i);
return s;
},
// Convert input string to digits-only.
// Parameters:
// sInput = input string
// seed = seed for pseudo-randomizing the position and injected character
// lenOut = length of head of string that will eventually survive truncation.
convertToDigits: function(sInput, seed, lenOut)
{
var s = '';
var i = 0;
while (i < lenOut)
{
var j = sInput.substring(i).search(/[^0-9]/i);
if (j < 0)
break;
if (j > 0)
s += sInput.substring(i, i + j);
s += String.fromCharCode((seed + sInput.charCodeAt(i)) % 10 + 48);
i += (j + 1);
}
if (i < sInput.length)
s += sInput.substring(i);
return s;
}
}