basic functionality migrated to webextension (thanks to GWuk)

CONTRIBUTORS

@@ -0,0 +1,15 @@
+Author
+------
+Collin Jackson
+
+Others
+------
+Blake Ross
+Nick Miyake
+Dan Boneh
+John Mitchell
+
+Futher maintenance
+------------------
+Philipp Nebert
+GWuk

LICENSE

@@ -0,0 +1,29 @@
+Software License Agreement (BSD License)
+
+Copyright (c) 2005-2008 Stanford University
+
+Redistribution and use of this software in source and binary forms, with or without modification, are
+permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above
+  copyright notice, this list of conditions and the
+  following disclaimer.
+
+* Redistributions in binary form must reproduce the above
+  copyright notice, this list of conditions and the
+  following disclaimer in the documentation and/or other
+  materials provided with the distribution.
+
+* Neither the name of Stanford University nor the names of its
+  contributors may be used to endorse or promote products
+  derived from this software without specific prior
+  written permission of Stanford University.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED
+WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR
+TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

README.md

@@ -1 +1,18 @@
-# pwdhash-webextension
+# pwdhash-webextension
+
+PwdHash webextension for firefox
+
+## description
+
+Automatically generates per-site passwords if you prefix your password with @@ or press F2 beforehand.
+Prevents JavaScript from reading your password as it is typed.
+The same password will be generated at each subdomain: a.example.com matches b.example.com, a.example.co.uk
+matches b.example.co.uk, but a.co.uk and b.co.uk are different.
+
+Hashed passwords can also be generated at https://www.pwdhash.com/
+
+## roadmap
+
+* add option to highlight password field
+* add PBKDF2-SHA512 as alternative to MD5
+* add user salt option

_locales/en/messages.json

@@ -0,0 +1,26 @@
+{
+  "pwdkeywarn": {
+    "message": "PwdHash could not find a password field on this page.\nIt is possible, though unlikely, that the site trying to steal your password.\nDo not enter your PwdHash password into this page.",
+	"description": "Warning text if no password field was found"
+  },
+
+  "pwdprefixwarn": {
+	"message": "You typed the PwdHash password prefix, but you are not currently in a password field that starts with the password prefix.\nIt is possible, though unlikely, that the site trying to steal your password.\nDo not enter your PwdHash password into this page.",
+	"description": "Warning text if no focus on password field"
+  },
+
+  "trustedeventwarn": {
+	"message": "JavaScript on this page may be interfering with your ability to enter a password.\nAs a precaution, the password field has been cleared.\nIf the problem persists, you might not be able to use PwdHash on this page.",
+	"description": "Warning text if webpage cannot be trusted"
+  },
+
+  "longpasswordwarn": {
+	"message": "Your password is too long to protect.",
+	"description": "Warning text if entered password is too long"
+  },
+
+  "shortpasswordwarn": {
+    "message": "Your password is too short to protect.",
+	"description": "Warning text of entered password is too short"
+  }
+}

content/domain-extractor.js

@@ -0,0 +1,51 @@
+/*
+Copyright 2005 Collin Jackson
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+    * Neither the name of Stanford University nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+/*
+ * Domain name extractor. Turns host names into domain names
+ * Adapted from Chris Zarate's public domain genpass tool:
+ *  http://labs.zarate.org/passwd/
+ */
+
+function SPH_DomainExtractor() { }
+
+SPH_DomainExtractor.prototype = {
+
+  extractDomain: function(host) {
+
+    var s;  // the final result
+
+    // Begin Chris Zarate's code
+    host=host.replace('http:\/\/','');
+    host=host.replace('https:\/\/','');
+    re=new RegExp("([^/]+)");
+    host=host.match(re)[1];
+    host=host.split('.');
+
+    if(host[2]!=null) {
+      s=host[host.length-2]+'.'+host[host.length-1];
+      domains='ab.ca|ac.ac|ac.at|ac.be|ac.cn|ac.il|ac.in|ac.jp|ac.kr|ac.nz|ac.th|ac.uk|ac.za|adm.br|adv.br|agro.pl|ah.cn|aid.pl|alt.za|am.br|arq.br|art.br|arts.ro|asn.au|asso.fr|asso.mc|atm.pl|auto.pl|bbs.tr|bc.ca|bio.br|biz.pl|bj.cn|br.com|cn.com|cng.br|cnt.br|co.ac|co.at|co.il|co.in|co.jp|co.kr|co.nz|co.th|co.uk|co.za|com.au|com.br|com.cn|com.ec|com.fr|com.hk|com.mm|com.mx|com.pl|com.ro|com.ru|com.sg|com.tr|com.tw|cq.cn|cri.nz|de.com|ecn.br|edu.au|edu.cn|edu.hk|edu.mm|edu.mx|edu.pl|edu.tr|edu.za|eng.br|ernet.in|esp.br|etc.br|eti.br|eu.com|eu.lv|fin.ec|firm.ro|fm.br|fot.br|fst.br|g12.br|gb.com|gb.net|gd.cn|gen.nz|gmina.pl|go.jp|go.kr|go.th|gob.mx|gov.br|gov.cn|gov.ec|gov.il|gov.in|gov.mm|gov.mx|gov.sg|gov.tr|gov.za|govt.nz|gs.cn|gsm.pl|gv.ac|gv.at|gx.cn|gz.cn|hb.cn|he.cn|hi.cn|hk.cn|hl.cn|hn.cn|hu.com|idv.tw|ind.br|inf.br|info.pl|info.ro|iwi.nz|jl.cn|jor.br|jpn.com|js.cn|k12.il|k12.tr|lel.br|ln.cn|ltd.uk|mail.pl|maori.nz|mb.ca|me.uk|med.br|med.ec|media.pl|mi.th|miasta.pl|mil.br|mil.ec|mil.nz|mil.pl|mil.tr|mil.za|mo.cn|muni.il|nb.ca|ne.jp|ne.kr|net.au|net.br|net.cn|net.ec|net.hk|net.il|net.in|net.mm|net.mx|net.nz|net.pl|net.ru|net.sg|net.th|net.tr|net.tw|net.za|nf.ca|ngo.za|nm.cn|nm.kr|no.com|nom.br|nom.pl|nom.ro|nom.za|ns.ca|nt.ca|nt.ro|ntr.br|nx.cn|odo.br|on.ca|or.ac|or.at|or.jp|or.kr|or.th|org.au|org.br|org.cn|org.ec|org.hk|org.il|org.mm|org.mx|org.nz|org.pl|org.ro|org.ru|org.sg|org.tr|org.tw|org.uk|org.za|pc.pl|pe.ca|plc.uk|ppg.br|presse.fr|priv.pl|pro.br|psc.br|psi.br|qc.ca|qc.com|qh.cn|re.kr|realestate.pl|rec.br|rec.ro|rel.pl|res.in|ru.com|sa.com|sc.cn|school.nz|school.za|se.com|se.net|sh.cn|shop.pl|sk.ca|sklep.pl|slg.br|sn.cn|sos.pl|store.ro|targi.pl|tj.cn|tm.fr|tm.mc|tm.pl|tm.ro|tm.za|tmp.br|tourism.pl|travel.pl|tur.br|turystyka.pl|tv.br|tw.cn|uk.co|uk.com|uk.net|us.com|uy.com|vet.br|web.za|web.com|www.ro|xj.cn|xz.cn|yk.ca|yn.cn|za.com';
+      domains=domains.split('|');
+      for(var i=0;i<domains.length;i++) {
+        if(s==domains[i]) {
+          s=host[host.length-3]+'.'+s;
+          break;
+        }
+      }
+    } else {
+      s=host.join('.');
+    }
+    // End Chris Zarate's code
+    return s;
+  }
+}

content/hashed-password.js

@@ -0,0 +1,74 @@
+/*
+Copyright 2005 Collin Jackson
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+    * Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+    * Neither the name of Stanford University nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+*/
+
+/**
+ * Hashed Password
+ * Combination of page URI and plaintext password.
+ * Treated as a string, it is the hashed password.
+ */
+
+function SPH_HashedPassword(password, realm) {
+  var hashedPassword = this._getHashedPassword(password, realm);
+  this.toString = function() { return hashedPassword; }
+}
+
+SPH_HashedPassword.prototype = {
+
+  /**
+   * Determine the hashed password from the salt and the master password
+   */
+  _getHashedPassword: function(password, realm) {
+    var hash = b64_hmac_md5(password, realm);
+    var size = password.length + SPH_kPasswordPrefix.length;
+    var nonalphanumeric = password.match(/\W/) != null;
+    var result = this._applyConstraints(hash, size, nonalphanumeric);
+    return result;
+  },
+
+  /**
+   * Fiddle with the password a bit after hashing it so that it will get through
+   * most website filters. We require one upper and lower case, one digit, and
+   * we look at the user's password to determine if there should be at least one 
+   * alphanumeric or not.
+   */
+  _applyConstraints: function(hash, size, nonalphanumeric) {
+    var startingSize = size - 4;  // Leave room for some extra characters
+    var result = hash.substring(0, startingSize);
+    var extras = hash.substring(startingSize).split('');
+
+    // Some utility functions to keep things tidy
+    function nextExtra() { return extras.length ? extras.shift().charCodeAt(0) : 0; }
+    function nextExtraChar() { return String.fromCharCode(nextExtra()); }
+    function rotate(arr, amount) { while(amount--) arr.push(arr.shift()) }
+    function between(min, interval, offset) { return min + offset % interval; }
+    function nextBetween(base, interval) { 
+      return String.fromCharCode(between(base.charCodeAt(0), interval, nextExtra()));
+    }
+    function contains(regex) { return result.match(regex); }
+
+    // Add the extra characters
+    result += (contains(/[A-Z]/) ? nextExtraChar() : nextBetween('A', 26));
+    result += (contains(/[a-z]/) ? nextExtraChar() : nextBetween('a', 26));
+    result += (contains(/[0-9]/) ? nextExtraChar() : nextBetween('0', 10));
+    result += (contains(/\W/) && nonalphanumeric ? nextExtraChar() : '+');
+    while (contains(/\W/) && !nonalphanumeric) {
+      result = result.replace(/\W/, nextBetween('A', 26));
+    }
+
+    // Rotate the result to make it harder to guess the inserted locations
+    result = result.split('');
+    rotate(result, nextExtra());
+    return result.join('');
+  }
+}
+