diff --git a/README b/README
index b33a120..e7651a7 100644
--- a/README
+++ b/README
@@ -3,27 +3,66 @@ If you're on already at https://github.com/cantonbecker/bitcoinpaperwallet
 Then just look for the button that says "Download ZIP". Look to your right -->
 *******************************************************************************
 
-
 *** bitcoinpaperwallet ***
 
-is a fork of bitaddress.org, the JavaScript Client-Side Bitcoin Wallet Generator
+This project is a fork of bitaddress.org, the original trustworthy
+JavaScript powered offline bitcoin address generator.
 
-This removes much of the (albeit excellent) functionality from
-bitaddress.org to create a streamined step-by-step 2 sided tri-fold
-paper wallet printer for novices. (Tamper-resistant features abound.)
-Includes a tool to help users "calibrate" their printer
-for more consistent output between different browsers. Renamed main
-.html file to avoid confusion with bitaddress.org. Moved images into
-their own directory since they are quite large and might not do
-well encoded into the JS anymore.
+Here's how this project differs:
 
+1) This generator is ONLY for printing paper wallets. Use bitaddress.org if
+you need to bulk-generate addresses, etc.
 
+2) This attractive paper wallet design is two-sided and folds up to
+hide the private key. Optional tamper-evident hologram tape can be purchased
+to provide extra security against snooping.
+
+3) A tool is included to help calibrate the printer output for proper
+sizing and two-sided alignment.
+
+4) Images and resources have been moved out of the .html file (where they were
+base-64 encoded) and into an images directory to make the code easier to review.
+
+All cryptographic functions are verifiably identical to those in bitaddress.org.
+(Run a "diff" between this project and bitaddress.org if you want to be sure.)
+
+You can also bypass the random key generator and supply your own keys or so-called
+"vanity addresses".
+
+*** HOW TO USE THIS GENERATOR ***
+
+1) Extract the ZIP file
+2) Open up the 'generate-wallet.html' file with your web browser. 
+
+Rendering and printing seems to work best using: 
+
+   OS X:     Safari or Chrome or Firefox
+   Windows:  Chrome or Firefox
+   Linux:    Firefox
+
+*** HOW TO VERIFY THE AUTHENTICITY OF THIS DOWNLOAD ***
+
+After downloading the ZIP package for this generator, you should find a file 
+named generate-wallet.html.sig which you can use to:
+
+* Verify that generate-wallet.html hasn't been tampered with, and
+* Get proof that it really was authored by Canton Becker (canton@gmail.com) 
+  whose GPG public key and fingerprint can be confirmed at http://cantonbecker.com
+  
+For example, if you have GPG installed, you can type:
+gpg --verify --with-fingerprint generate-wallet.html.sig generate-wallet.html 
+
+And then verify the signature's fingerprint against Canton Becker's published signatures.
 
 - Canton Becker
 http://cantonbecker.com
 canton@gmail.com
 
---- original bitaddress.org README continues below ---
+
+
+----------------------------------------------------------
+--- The original bitaddress.org README continues below ---
+----------------------------------------------------------
 
 Now Bitcoin addresses and their corresponding private key can be conveniently 
 generated in a web browser.
diff --git a/generate-wallet.html b/generate-wallet.html
index d2ff7b2..7bd0200 100644
--- a/generate-wallet.html
+++ b/generate-wallet.html
@@ -9,7 +9,9 @@
     Contact: Canton Becker / canton@gmail.com
     
     generate-wallet.html is always distributed with a PGP signature "generate-wallet.html.sig" which you
-    can use to validate the integrity and authorship of this file.
+    can use to validate the integrity and authorship of this file like so:
+    
+    gpg --verify --with-fingerprint generate-wallet.html.sig generate-wallet.html
     
     Wallet design and portions of this code are ©Copyright 2013 Canton Becker and bitaddress.org
     Other portions of this code are copyrighted by their respective authors - see below.
@@ -42,10 +44,11 @@
 	Array.prototype.map		Public Domain
 	window.Crypto			BSD License
 	window.SecureRandom		BSD License
-	window.EllipticCurve	BSD License
+	window.EllipticCurve		BSD License
 	window.BigInteger		BSD License
 	window.QRCode			MIT License
 	window.Bitcoin			MIT License
+	window.Crypto_scrypt		MIT License
 	ninja.(*)				MIT License			// lots of code from bitaddress.org
 	parser.setUA			GPLv2 & MIT			// UAParser.js
     
@@ -71,236 +74,235 @@
 
 	<title>Bitcoin Paper Wallet Generator</title>
 
+
 	<script type="text/javascript">
-	// Array.prototype.map function is in the public domain.
-	// Production steps of ECMA-262, Edition 5, 15.4.4.19  
-	// Reference: http://es5.github.com/#x15.4.4.19  
-	if (!Array.prototype.map) {
-		Array.prototype.map = function (callback, thisArg) {
-			var T, A, k;
-			if (this == null) {
-				throw new TypeError(" this is null or not defined");
+// Array.prototype.map function is in the public domain.
+// Production steps of ECMA-262, Edition 5, 15.4.4.19  
+// Reference: http://es5.github.com/#x15.4.4.19  
+if (!Array.prototype.map) {
+	Array.prototype.map = function (callback, thisArg) {
+		var T, A, k;
+		if (this == null) {
+			throw new TypeError(" this is null or not defined");
+		}
+		// 1. Let O be the result of calling ToObject passing the |this| value as the argument.  
+		var O = Object(this);
+		// 2. Let lenValue be the result of calling the Get internal method of O with the argument "length".  
+		// 3. Let len be ToUint32(lenValue).  
+		var len = O.length >>> 0;
+		// 4. If IsCallable(callback) is false, throw a TypeError exception.  
+		// See: http://es5.github.com/#x9.11  
+		if ({}.toString.call(callback) != "[object Function]") {
+			throw new TypeError(callback + " is not a function");
+		}
+		// 5. If thisArg was supplied, let T be thisArg; else let T be undefined.  
+		if (thisArg) {
+			T = thisArg;
+		}
+		// 6. Let A be a new array created as if by the expression new Array(len) where Array is  
+		// the standard built-in constructor with that name and len is the value of len.  
+		A = new Array(len);
+		// 7. Let k be 0  
+		k = 0;
+		// 8. Repeat, while k < len  
+		while (k < len) {
+			var kValue, mappedValue;
+			// a. Let Pk be ToString(k).  
+			//   This is implicit for LHS operands of the in operator  
+			// b. Let kPresent be the result of calling the HasProperty internal method of O with argument Pk.  
+			//   This step can be combined with c  
+			// c. If kPresent is true, then  
+			if (k in O) {
+				// i. Let kValue be the result of calling the Get internal method of O with argument Pk.  
+				kValue = O[k];
+				// ii. Let mappedValue be the result of calling the Call internal method of callback  
+				// with T as the this value and argument list containing kValue, k, and O.  
+				mappedValue = callback.call(T, kValue, k, O);
+				// iii. Call the DefineOwnProperty internal method of A with arguments  
+				// Pk, Property Descriptor {Value: mappedValue, Writable: true, Enumerable: true, Configurable: true},  
+				// and false.  
+				// In browsers that support Object.defineProperty, use the following:  
+				// Object.defineProperty(A, Pk, { value: mappedValue, writable: true, enumerable: true, configurable: true });  
+				// For best browser support, use the following:  
+				A[k] = mappedValue;
 			}
-			// 1. Let O be the result of calling ToObject passing the |this| value as the argument.  
-			var O = Object(this);
-			// 2. Let lenValue be the result of calling the Get internal method of O with the argument "length".  
-			// 3. Let len be ToUint32(lenValue).  
-			var len = O.length >>> 0;
-			// 4. If IsCallable(callback) is false, throw a TypeError exception.  
-			// See: http://es5.github.com/#x9.11  
-			if ({}.toString.call(callback) != "[object Function]") {
-				throw new TypeError(callback + " is not a function");
-			}
-			// 5. If thisArg was supplied, let T be thisArg; else let T be undefined.  
-			if (thisArg) {
-				T = thisArg;
-			}
-			// 6. Let A be a new array created as if by the expression new Array(len) where Array is  
-			// the standard built-in constructor with that name and len is the value of len.  
-			A = new Array(len);
-			// 7. Let k be 0  
-			k = 0;
-			// 8. Repeat, while k < len  
-			while (k < len) {
-				var kValue, mappedValue;
-				// a. Let Pk be ToString(k).  
-				//   This is implicit for LHS operands of the in operator  
-				// b. Let kPresent be the result of calling the HasProperty internal method of O with argument Pk.  
-				//   This step can be combined with c  
-				// c. If kPresent is true, then  
-				if (k in O) {
-					// i. Let kValue be the result of calling the Get internal method of O with argument Pk.  
-					kValue = O[k];
-					// ii. Let mappedValue be the result of calling the Call internal method of callback  
-					// with T as the this value and argument list containing kValue, k, and O.  
-					mappedValue = callback.call(T, kValue, k, O);
-					// iii. Call the DefineOwnProperty internal method of A with arguments  
-					// Pk, Property Descriptor {Value: mappedValue, Writable: true, Enumerable: true, Configurable: true},  
-					// and false.  
-					// In browsers that support Object.defineProperty, use the following:  
-					// Object.defineProperty(A, Pk, { value: mappedValue, writable: true, enumerable: true, configurable: true });  
-					// For best browser support, use the following:  
-					A[k] = mappedValue;
-				}
-				// d. Increase k by 1.  
-				k++;
-			}
-			// 9. return A  
-			return A;
-		};
-	}  
+			// d. Increase k by 1.  
+			k++;
+		}
+		// 9. return A  
+		return A;
+	};
+}
 	</script>
-	
 	<script type="text/javascript">
-	/*!
-	* Crypto-JS v2.5.4	Crypto.js
-	* http://code.google.com/p/crypto-js/
-	* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
-	* http://code.google.com/p/crypto-js/wiki/License
-	*/
-	if (typeof Crypto == "undefined" || !Crypto.util) {
-		(function () {
-
-			var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-
-			// Global Crypto object
-			var Crypto = window.Crypto = {};
-
-			// Crypto utilities
-			var util = Crypto.util = {
-
-				// Bit-wise rotate left
-				rotl: function (n, b) {
-					return (n << b) | (n >>> (32 - b));
-				},
-
-				// Bit-wise rotate right
-				rotr: function (n, b) {
-					return (n << (32 - b)) | (n >>> b);
-				},
-
-				// Swap big-endian to little-endian and vice versa
-				endian: function (n) {
-
-					// If number given, swap endian
-					if (n.constructor == Number) {
-						return util.rotl(n, 8) & 0x00FF00FF |
-			    util.rotl(n, 24) & 0xFF00FF00;
-					}
-
-					// Else, assume array and swap all items
-					for (var i = 0; i < n.length; i++)
-						n[i] = util.endian(n[i]);
-					return n;
-
-				},
-
-				// Generate an array of any length of random bytes
-				randomBytes: function (n) {
-					for (var bytes = []; n > 0; n--)
-						bytes.push(Math.floor(Math.random() * 256));
-					return bytes;
-				},
-
-				// Convert a byte array to big-endian 32-bit words
-				bytesToWords: function (bytes) {
-					for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
-						words[b >>> 5] |= (bytes[i] & 0xFF) << (24 - b % 32);
-					return words;
-				},
-
-				// Convert big-endian 32-bit words to a byte array
-				wordsToBytes: function (words) {
-					for (var bytes = [], b = 0; b < words.length * 32; b += 8)
-						bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
-					return bytes;
-				},
-
-				// Convert a byte array to a hex string
-				bytesToHex: function (bytes) {
-					for (var hex = [], i = 0; i < bytes.length; i++) {
-						hex.push((bytes[i] >>> 4).toString(16));
-						hex.push((bytes[i] & 0xF).toString(16));
-					}
-					return hex.join("");
-				},
-
-				// Convert a hex string to a byte array
-				hexToBytes: function (hex) {
-					for (var bytes = [], c = 0; c < hex.length; c += 2)
-						bytes.push(parseInt(hex.substr(c, 2), 16));
-					return bytes;
-				},
-
-				// Convert a byte array to a base-64 string
-				bytesToBase64: function (bytes) {
-					for (var base64 = [], i = 0; i < bytes.length; i += 3) {
-						var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
-						for (var j = 0; j < 4; j++) {
-							if (i * 8 + j * 6 <= bytes.length * 8)
-								base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
-							else base64.push("=");
-						}
-					}
-
-					return base64.join("");
-				},
-
-				// Convert a base-64 string to a byte array
-				base64ToBytes: function (base64) {
-					// Remove non-base-64 characters
-					base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
-
-					for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
-						if (imod4 == 0) continue;
-						bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 + 8) - 1)) << (imod4 * 2)) |
-			        (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
-					}
-
-					return bytes;
-				}
-
-			};
-
-			// Crypto character encodings
-			var charenc = Crypto.charenc = {};
-
-			// UTF-8 encoding
-			var UTF8 = charenc.UTF8 = {
-
-				// Convert a string to a byte array
-				stringToBytes: function (str) {
-					return Binary.stringToBytes(unescape(encodeURIComponent(str)));
-				},
-
-				// Convert a byte array to a string
-				bytesToString: function (bytes) {
-					return decodeURIComponent(escape(Binary.bytesToString(bytes)));
-				}
-
-			};
-
-			// Binary encoding
-			var Binary = charenc.Binary = {
-
-				// Convert a string to a byte array
-				stringToBytes: function (str) {
-					for (var bytes = [], i = 0; i < str.length; i++)
-						bytes.push(str.charCodeAt(i) & 0xFF);
-					return bytes;
-				},
-
-				// Convert a byte array to a string
-				bytesToString: function (bytes) {
-					for (var str = [], i = 0; i < bytes.length; i++)
-						str.push(String.fromCharCode(bytes[i]));
-					return str.join("");
-				}
-
-			};
-
-		})();
-	}
-	</script>
-	
-	<script type="text/javascript">
-	/*!
-	* Crypto-JS v2.5.4	SHA256.js
-	* http://code.google.com/p/crypto-js/
-	* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
-	* http://code.google.com/p/crypto-js/wiki/License
-	*/
+/*!
+* Crypto-JS v2.5.4	Crypto.js
+* http://code.google.com/p/crypto-js/
+* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
+* http://code.google.com/p/crypto-js/wiki/License
+*/
+if (typeof Crypto == "undefined" || !Crypto.util) {
 	(function () {
 
-		// Shortcuts
-		var C = Crypto,
+		var base64map = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+
+		// Global Crypto object
+		var Crypto = window.Crypto = {};
+
+		// Crypto utilities
+		var util = Crypto.util = {
+
+			// Bit-wise rotate left
+			rotl: function (n, b) {
+				return (n << b) | (n >>> (32 - b));
+			},
+
+			// Bit-wise rotate right
+			rotr: function (n, b) {
+				return (n << (32 - b)) | (n >>> b);
+			},
+
+			// Swap big-endian to little-endian and vice versa
+			endian: function (n) {
+
+				// If number given, swap endian
+				if (n.constructor == Number) {
+					return util.rotl(n, 8) & 0x00FF00FF |
+			    util.rotl(n, 24) & 0xFF00FF00;
+				}
+
+				// Else, assume array and swap all items
+				for (var i = 0; i < n.length; i++)
+					n[i] = util.endian(n[i]);
+				return n;
+
+			},
+
+			// Generate an array of any length of random bytes
+			randomBytes: function (n) {
+				for (var bytes = []; n > 0; n--)
+					bytes.push(Math.floor(Math.random() * 256));
+				return bytes;
+			},
+
+			// Convert a byte array to big-endian 32-bit words
+			bytesToWords: function (bytes) {
+				for (var words = [], i = 0, b = 0; i < bytes.length; i++, b += 8)
+					words[b >>> 5] |= (bytes[i] & 0xFF) << (24 - b % 32);
+				return words;
+			},
+
+			// Convert big-endian 32-bit words to a byte array
+			wordsToBytes: function (words) {
+				for (var bytes = [], b = 0; b < words.length * 32; b += 8)
+					bytes.push((words[b >>> 5] >>> (24 - b % 32)) & 0xFF);
+				return bytes;
+			},
+
+			// Convert a byte array to a hex string
+			bytesToHex: function (bytes) {
+				for (var hex = [], i = 0; i < bytes.length; i++) {
+					hex.push((bytes[i] >>> 4).toString(16));
+					hex.push((bytes[i] & 0xF).toString(16));
+				}
+				return hex.join("");
+			},
+
+			// Convert a hex string to a byte array
+			hexToBytes: function (hex) {
+				for (var bytes = [], c = 0; c < hex.length; c += 2)
+					bytes.push(parseInt(hex.substr(c, 2), 16));
+				return bytes;
+			},
+
+			// Convert a byte array to a base-64 string
+			bytesToBase64: function (bytes) {
+				for (var base64 = [], i = 0; i < bytes.length; i += 3) {
+					var triplet = (bytes[i] << 16) | (bytes[i + 1] << 8) | bytes[i + 2];
+					for (var j = 0; j < 4; j++) {
+						if (i * 8 + j * 6 <= bytes.length * 8)
+							base64.push(base64map.charAt((triplet >>> 6 * (3 - j)) & 0x3F));
+						else base64.push("=");
+					}
+				}
+
+				return base64.join("");
+			},
+
+			// Convert a base-64 string to a byte array
+			base64ToBytes: function (base64) {
+				// Remove non-base-64 characters
+				base64 = base64.replace(/[^A-Z0-9+\/]/ig, "");
+
+				for (var bytes = [], i = 0, imod4 = 0; i < base64.length; imod4 = ++i % 4) {
+					if (imod4 == 0) continue;
+					bytes.push(((base64map.indexOf(base64.charAt(i - 1)) & (Math.pow(2, -2 * imod4 + 8) - 1)) << (imod4 * 2)) |
+			        (base64map.indexOf(base64.charAt(i)) >>> (6 - imod4 * 2)));
+				}
+
+				return bytes;
+			}
+
+		};
+
+		// Crypto character encodings
+		var charenc = Crypto.charenc = {};
+
+		// UTF-8 encoding
+		var UTF8 = charenc.UTF8 = {
+
+			// Convert a string to a byte array
+			stringToBytes: function (str) {
+				return Binary.stringToBytes(unescape(encodeURIComponent(str)));
+			},
+
+			// Convert a byte array to a string
+			bytesToString: function (bytes) {
+				return decodeURIComponent(escape(Binary.bytesToString(bytes)));
+			}
+
+		};
+
+		// Binary encoding
+		var Binary = charenc.Binary = {
+
+			// Convert a string to a byte array
+			stringToBytes: function (str) {
+				for (var bytes = [], i = 0; i < str.length; i++)
+					bytes.push(str.charCodeAt(i) & 0xFF);
+				return bytes;
+			},
+
+			// Convert a byte array to a string
+			bytesToString: function (bytes) {
+				for (var str = [], i = 0; i < bytes.length; i++)
+					str.push(String.fromCharCode(bytes[i]));
+				return str.join("");
+			}
+
+		};
+
+	})();
+}	
+	</script>
+	<script type="text/javascript">
+/*!
+* Crypto-JS v2.5.4	SHA256.js
+* http://code.google.com/p/crypto-js/
+* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
+* http://code.google.com/p/crypto-js/wiki/License
+*/
+(function () {
+
+	// Shortcuts
+	var C = Crypto,
 		util = C.util,
 		charenc = C.charenc,
 		UTF8 = charenc.UTF8,
 		Binary = charenc.Binary;
 
-		// Constants
-		var K = [0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
+	// Constants
+	var K = [0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
         0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
         0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
         0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
@@ -317,22 +319,22 @@
         0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
         0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2];
 
-		// Public API
-		var SHA256 = C.SHA256 = function (message, options) {
-			var digestbytes = util.wordsToBytes(SHA256._sha256(message));
-			return options && options.asBytes ? digestbytes :
+	// Public API
+	var SHA256 = C.SHA256 = function (message, options) {
+		var digestbytes = util.wordsToBytes(SHA256._sha256(message));
+		return options && options.asBytes ? digestbytes :
 	    options && options.asString ? Binary.bytesToString(digestbytes) :
 	    util.bytesToHex(digestbytes);
-		};
+	};
 
-		// The core
-		SHA256._sha256 = function (message) {
+	// The core
+	SHA256._sha256 = function (message) {
 
-			// Convert to byte array
-			if (message.constructor == String) message = UTF8.stringToBytes(message);
-			/* else, assume byte array already */
+		// Convert to byte array
+		if (message.constructor == String) message = UTF8.stringToBytes(message);
+		/* else, assume byte array already */
 
-			var m = util.bytesToWords(message),
+		var m = util.bytesToWords(message),
 		l = message.length * 8,
 		H = [0x6A09E667, 0xBB67AE85, 0x3C6EF372, 0xA54FF53A,
 				0x510E527F, 0x9B05688C, 0x1F83D9AB, 0x5BE0CD19],
@@ -340,27 +342,27 @@
 		a, b, c, d, e, f, g, h, i, j,
 		t1, t2;
 
-			// Padding
-			m[l >> 5] |= 0x80 << (24 - l % 32);
-			m[((l + 64 >> 9) << 4) + 15] = l;
+		// Padding
+		m[l >> 5] |= 0x80 << (24 - l % 32);
+		m[((l + 64 >> 9) << 4) + 15] = l;
 
-			for (var i = 0; i < m.length; i += 16) {
+		for (var i = 0; i < m.length; i += 16) {
 
-				a = H[0];
-				b = H[1];
-				c = H[2];
-				d = H[3];
-				e = H[4];
-				f = H[5];
-				g = H[6];
-				h = H[7];
+			a = H[0];
+			b = H[1];
+			c = H[2];
+			d = H[3];
+			e = H[4];
+			f = H[5];
+			g = H[6];
+			h = H[7];
 
-				for (var j = 0; j < 64; j++) {
+			for (var j = 0; j < 64; j++) {
 
-					if (j < 16) w[j] = m[j + i];
-					else {
+				if (j < 16) w[j] = m[j + i];
+				else {
 
-						var gamma0x = w[j - 15],
+					var gamma0x = w[j - 15],
 				gamma1x = w[j - 2],
 				gamma0 = ((gamma0x << 25) | (gamma0x >>> 7)) ^
 				            ((gamma0x << 14) | (gamma0x >>> 18)) ^
@@ -369,12 +371,12 @@
 				            ((gamma1x << 13) | (gamma1x >>> 19)) ^
 				            (gamma1x >>> 10);
 
-						w[j] = gamma0 + (w[j - 7] >>> 0) +
+					w[j] = gamma0 + (w[j - 7] >>> 0) +
 				    gamma1 + (w[j - 16] >>> 0);
 
-					}
+				}
 
-					var ch = e & f ^ ~e & g,
+				var ch = e & f ^ ~e & g,
 			maj = a & b ^ a & c ^ b & c,
 			sigma0 = ((a << 30) | (a >>> 2)) ^
 			            ((a << 19) | (a >>> 13)) ^
@@ -384,163 +386,160 @@
 			            ((e << 7) | (e >>> 25));
 
 
-					t1 = (h >>> 0) + sigma1 + ch + (K[j]) + (w[j] >>> 0);
-					t2 = sigma0 + maj;
+				t1 = (h >>> 0) + sigma1 + ch + (K[j]) + (w[j] >>> 0);
+				t2 = sigma0 + maj;
 
-					h = g;
-					g = f;
-					f = e;
-					e = (d + t1) >>> 0;
-					d = c;
-					c = b;
-					b = a;
-					a = (t1 + t2) >>> 0;
-
-				}
-
-				H[0] += a;
-				H[1] += b;
-				H[2] += c;
-				H[3] += d;
-				H[4] += e;
-				H[5] += f;
-				H[6] += g;
-				H[7] += h;
+				h = g;
+				g = f;
+				f = e;
+				e = (d + t1) >>> 0;
+				d = c;
+				c = b;
+				b = a;
+				a = (t1 + t2) >>> 0;
 
 			}
 
-			return H;
+			H[0] += a;
+			H[1] += b;
+			H[2] += c;
+			H[3] += d;
+			H[4] += e;
+			H[5] += f;
+			H[6] += g;
+			H[7] += h;
 
-		};
+		}
 
-		// Package private blocksize
-		SHA256._blocksize = 16;
+		return H;
 
-		SHA256._digestsize = 32;
+	};
 
-	})();
+	// Package private blocksize
+	SHA256._blocksize = 16;
+
+	SHA256._digestsize = 32;
+
+})();	
 	</script>
-
 	<script type="text/javascript">
-	/*!
-	* Crypto-JS v2.5.4	PBKDF2.js
-	* http://code.google.com/p/crypto-js/
-	* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
-	* http://code.google.com/p/crypto-js/wiki/License
-	*/
-	(function () {
+/*!
+* Crypto-JS v2.5.4	PBKDF2.js
+* http://code.google.com/p/crypto-js/
+* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
+* http://code.google.com/p/crypto-js/wiki/License
+*/
+(function () {
 
-		// Shortcuts
-		var C = Crypto,
+	// Shortcuts
+	var C = Crypto,
 		util = C.util,
 		charenc = C.charenc,
 		UTF8 = charenc.UTF8,
 		Binary = charenc.Binary;
 
-		C.PBKDF2 = function (password, salt, keylen, options) {
+	C.PBKDF2 = function (password, salt, keylen, options) {
 
-			// 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 */
+		// 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,
+		// 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 });
-			}
+		// Pseudo-random function
+		function PRF(password, salt) {
+			return C.HMAC(hasher, salt, password, { asBytes: true });
+		}
 
-			// Generate key
-			var derivedKeyBytes = [],
+		// Generate key
+		var derivedKeyBytes = [],
 			blockindex = 1;
-			while (derivedKeyBytes.length < keylen) {
-				var block = PRF(password, salt.concat(util.wordsToBytes([blockindex])));
-				for (var u = block, i = 1; i < iterations; i++) {
-					u = PRF(password, u);
-					for (var j = 0; j < block.length; j++) block[j] ^= u[j];
-				}
-				derivedKeyBytes = derivedKeyBytes.concat(block);
-				blockindex++;
+		while (derivedKeyBytes.length < keylen) {
+			var block = PRF(password, salt.concat(util.wordsToBytes([blockindex])));
+			for (var u = block, i = 1; i < iterations; i++) {
+				u = PRF(password, u);
+				for (var j = 0; j < block.length; j++) block[j] ^= u[j];
 			}
+			derivedKeyBytes = derivedKeyBytes.concat(block);
+			blockindex++;
+		}
 
-			// Truncate excess bytes
-			derivedKeyBytes.length = keylen;
+		// Truncate excess bytes
+		derivedKeyBytes.length = keylen;
 
-			return options && options.asBytes ? derivedKeyBytes :
-	    options && options.asString ? Binary.bytesToString(derivedKeyBytes) :
-	    util.bytesToHex(derivedKeyBytes);
+		return options && options.asBytes ? derivedKeyBytes :
+		options && options.asString ? Binary.bytesToString(derivedKeyBytes) :
+		util.bytesToHex(derivedKeyBytes);
 
-		};
+	};
 
-	})();
+})(); 
 	</script>
-
 	<script type="text/javascript">
-	/*!
-	* Crypto-JS v2.5.4	HMAC.js
-	* http://code.google.com/p/crypto-js/
-	* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
-	* http://code.google.com/p/crypto-js/wiki/License
-	*/
-	(function () {
+/*!
+* Crypto-JS v2.5.4	HMAC.js
+* http://code.google.com/p/crypto-js/
+* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
+* http://code.google.com/p/crypto-js/wiki/License
+*/
+(function () {
 
-		// Shortcuts
-		var C = Crypto,
+	// Shortcuts
+	var C = Crypto,
 		util = C.util,
 		charenc = C.charenc,
 		UTF8 = charenc.UTF8,
 		Binary = charenc.Binary;
 
-		C.HMAC = function (hasher, message, key, options) {
+	C.HMAC = function (hasher, message, key, options) {
 
-			// Convert to byte arrays
-			if (message.constructor == String) message = UTF8.stringToBytes(message);
-			if (key.constructor == String) key = UTF8.stringToBytes(key);
-			/* else, assume byte arrays already */
+		// Convert to byte arrays
+		if (message.constructor == String) message = UTF8.stringToBytes(message);
+		if (key.constructor == String) key = UTF8.stringToBytes(key);
+		/* else, assume byte arrays already */
 
-			// Allow arbitrary length keys
-			if (key.length > hasher._blocksize * 4)
-				key = hasher(key, { asBytes: true });
+		// Allow arbitrary length keys
+		if (key.length > hasher._blocksize * 4)
+			key = hasher(key, { asBytes: true });
 
-			// XOR keys with pad constants
-			var okey = key.slice(0),
+		// XOR keys with pad constants
+		var okey = key.slice(0),
 			ikey = key.slice(0);
-			for (var i = 0; i < hasher._blocksize * 4; i++) {
-				okey[i] ^= 0x5C;
-				ikey[i] ^= 0x36;
-			}
+		for (var i = 0; i < hasher._blocksize * 4; i++) {
+			okey[i] ^= 0x5C;
+			ikey[i] ^= 0x36;
+		}
 
-			var hmacbytes = hasher(okey.concat(hasher(ikey.concat(message), { asBytes: true })), { asBytes: true });
+		var hmacbytes = hasher(okey.concat(hasher(ikey.concat(message), { asBytes: true })), { asBytes: true });
 
-			return options && options.asBytes ? hmacbytes :
-	    options && options.asString ? Binary.bytesToString(hmacbytes) :
-	    util.bytesToHex(hmacbytes);
+		return options && options.asBytes ? hmacbytes :
+		options && options.asString ? Binary.bytesToString(hmacbytes) :
+		util.bytesToHex(hmacbytes);
 
-		};
+	};
 
-	})();
+})();
 	</script>
-
 	<script type="text/javascript">
-	/*!
-	* Crypto-JS v2.5.4	AES.js
-	* http://code.google.com/p/crypto-js/
-	* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
-	* http://code.google.com/p/crypto-js/wiki/License
-	*/
-	(function () {
+/*!
+* Crypto-JS v2.5.4	AES.js
+* http://code.google.com/p/crypto-js/
+* Copyright (c) 2009-2013, Jeff Mott. All rights reserved.
+* http://code.google.com/p/crypto-js/wiki/License
+*/
+(function () {
 
-		// Shortcuts
-		var C = Crypto,
+	// Shortcuts
+	var C = Crypto,
 		util = C.util,
 		charenc = C.charenc,
 		UTF8 = charenc.UTF8;
 
-		// Precomputed SBOX
-		var SBOX = [0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
+	// Precomputed SBOX
+	var SBOX = [0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5,
             0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76,
             0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0,
             0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0,
@@ -573,190 +572,155 @@
             0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68,
             0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16];
 
-		// Compute inverse SBOX lookup table
-		for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;
+	// Compute inverse SBOX lookup table
+	for (var INVSBOX = [], i = 0; i < 256; i++) INVSBOX[SBOX[i]] = i;
 
-		// Compute multiplication in GF(2^8) lookup tables
-		var MULT2 = [],
+	// Compute multiplication in GF(2^8) lookup tables
+	var MULT2 = [],
 		MULT3 = [],
 		MULT9 = [],
 		MULTB = [],
 		MULTD = [],
 		MULTE = [];
 
-		function xtime(a, b) {
-			for (var result = 0, i = 0; i < 8; i++) {
-				if (b & 1) result ^= a;
-				var hiBitSet = a & 0x80;
-				a = (a << 1) & 0xFF;
-				if (hiBitSet) a ^= 0x1b;
-				b >>>= 1;
-			}
-			return result;
+	function xtime(a, b) {
+		for (var result = 0, i = 0; i < 8; i++) {
+			if (b & 1) result ^= a;
+			var hiBitSet = a & 0x80;
+			a = (a << 1) & 0xFF;
+			if (hiBitSet) a ^= 0x1b;
+			b >>>= 1;
 		}
+		return result;
+	}
 
-		for (var i = 0; i < 256; i++) {
-			MULT2[i] = xtime(i, 2);
-			MULT3[i] = xtime(i, 3);
-			MULT9[i] = xtime(i, 9);
-			MULTB[i] = xtime(i, 0xB);
-			MULTD[i] = xtime(i, 0xD);
-			MULTE[i] = xtime(i, 0xE);
-		}
+	for (var i = 0; i < 256; i++) {
+		MULT2[i] = xtime(i, 2);
+		MULT3[i] = xtime(i, 3);
+		MULT9[i] = xtime(i, 9);
+		MULTB[i] = xtime(i, 0xB);
+		MULTD[i] = xtime(i, 0xD);
+		MULTE[i] = xtime(i, 0xE);
+	}
 
-		// Precomputed RCon lookup
-		var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
+	// Precomputed RCon lookup
+	var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36];
 
-		// Inner state
-		var state = [[], [], [], []],
+	// Inner state
+	var state = [[], [], [], []],
 		keylength,
 		nrounds,
 		keyschedule;
 
-		var AES = C.AES = {
+	var AES = C.AES = {
 
-			/**
-			* Public API
-			*/
+		/**
+		* Public API
+		*/
 
-			encrypt: function (message, password, options) {
+		encrypt: function (message, password, options) {
 
-				options = options || {};
+			options = options || {};
 
-				// Determine mode
-				var mode = options.mode || new C.mode.OFB;
+			// Determine mode
+			var mode = options.mode || new C.mode.OFB;
 
-				// Allow mode to override options
-				if (mode.fixOptions) mode.fixOptions(options);
+			// Allow mode to override options
+			if (mode.fixOptions) mode.fixOptions(options);
 
-				var 
+			var 
 
-				// Convert to bytes if message is a string
+			// Convert to bytes if message is a string
 		m = (
 			message.constructor == String ?
 			UTF8.stringToBytes(message) :
 			message
 		),
 
-				// Generate random IV
+			// Generate random IV
 		iv = options.iv || util.randomBytes(AES._blocksize * 4),
 
-				// Generate key
+			// Generate key
 		k = (
 			password.constructor == String ?
-				// Derive key from pass-phrase
+			// Derive key from pass-phrase
 			C.PBKDF2(password, iv, 32, { asBytes: true }) :
-				// else, assume byte array representing cryptographic key
+			// else, assume byte array representing cryptographic key
 			password
 		);
 
-				// Encrypt
-				AES._init(k);
-				mode.encrypt(AES, m, iv);
+			// Encrypt
+			AES._init(k);
+			mode.encrypt(AES, m, iv);
 
-				// Return ciphertext
-				m = options.iv ? m : iv.concat(m);
-				return (options && options.asBytes) ? m : util.bytesToBase64(m);
+			// Return ciphertext
+			m = options.iv ? m : iv.concat(m);
+			return (options && options.asBytes) ? m : util.bytesToBase64(m);
 
-			},
+		},
 
-			decrypt: function (ciphertext, password, options) {
+		decrypt: function (ciphertext, password, options) {
 
-				options = options || {};
+			options = options || {};
 
-				// Determine mode
-				var mode = options.mode || new C.mode.OFB;
+			// Determine mode
+			var mode = options.mode || new C.mode.OFB;
 
-				// Allow mode to override options
-				if (mode.fixOptions) mode.fixOptions(options);
+			// Allow mode to override options
+			if (mode.fixOptions) mode.fixOptions(options);
 
-				var 
+			var 
 
-				// Convert to bytes if ciphertext is a string
+			// Convert to bytes if ciphertext is a string
 		c = (
 			ciphertext.constructor == String ?
 			util.base64ToBytes(ciphertext) :
 			ciphertext
 		),
 
-				// Separate IV and message
+			// Separate IV and message
 		iv = options.iv || c.splice(0, AES._blocksize * 4),
 
-				// Generate key
+			// Generate key
 		k = (
 			password.constructor == String ?
-				// Derive key from pass-phrase
+			// Derive key from pass-phrase
 			C.PBKDF2(password, iv, 32, { asBytes: true }) :
-				// else, assume byte array representing cryptographic key
+			// else, assume byte array representing cryptographic key
 			password
 		);
 
-				// Decrypt
-				AES._init(k);
-				mode.decrypt(AES, c, iv);
+			// Decrypt
+			AES._init(k);
+			mode.decrypt(AES, c, iv);
 
-				// Return plaintext
-				return (options && options.asBytes) ? c : UTF8.bytesToString(c);
+			// Return plaintext
+			return (options && options.asBytes) ? c : UTF8.bytesToString(c);
 
-			},
+		},
 
 
-			/**
-			* Package private methods and properties
-			*/
+		/**
+		* Package private methods and properties
+		*/
 
-			_blocksize: 4,
+		_blocksize: 4,
 
-			_encryptblock: function (m, offset) {
+		_encryptblock: function (m, offset) {
 
-				// Set input
-				for (var row = 0; row < AES._blocksize; row++) {
-					for (var col = 0; col < 4; col++)
-						state[row][col] = m[offset + col * 4 + row];
-				}
+			// Set input
+			for (var row = 0; row < AES._blocksize; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = m[offset + col * 4 + row];
+			}
 
-				// Add round key
-				for (var row = 0; row < 4; row++) {
-					for (var col = 0; col < 4; col++)
-						state[row][col] ^= keyschedule[col][row];
-				}
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[col][row];
+			}
 
-				for (var round = 1; round < nrounds; round++) {
-
-					// Sub bytes
-					for (var row = 0; row < 4; row++) {
-						for (var col = 0; col < 4; col++)
-							state[row][col] = SBOX[state[row][col]];
-					}
-
-					// Shift rows
-					state[1].push(state[1].shift());
-					state[2].push(state[2].shift());
-					state[2].push(state[2].shift());
-					state[3].unshift(state[3].pop());
-
-					// Mix columns
-					for (var col = 0; col < 4; col++) {
-
-						var s0 = state[0][col],
-				s1 = state[1][col],
-				s2 = state[2][col],
-				s3 = state[3][col];
-
-						state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
-						state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
-						state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
-						state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
-
-					}
-
-					// Add round key
-					for (var row = 0; row < 4; row++) {
-						for (var col = 0; col < 4; col++)
-							state[row][col] ^= keyschedule[round * 4 + col][row];
-					}
-
-				}
+			for (var round = 1; round < nrounds; round++) {
 
 				// Sub bytes
 				for (var row = 0; row < 4; row++) {
@@ -770,71 +734,71 @@
 				state[2].push(state[2].shift());
 				state[3].unshift(state[3].pop());
 
-				// Add round key
-				for (var row = 0; row < 4; row++) {
-					for (var col = 0; col < 4; col++)
-						state[row][col] ^= keyschedule[nrounds * 4 + col][row];
-				}
+				// Mix columns
+				for (var col = 0; col < 4; col++) {
 
-				// Set output
-				for (var row = 0; row < AES._blocksize; row++) {
-					for (var col = 0; col < 4; col++)
-						m[offset + col * 4 + row] = state[row][col];
-				}
-
-			},
-
-			_decryptblock: function (c, offset) {
-
-				// Set input
-				for (var row = 0; row < AES._blocksize; row++) {
-					for (var col = 0; col < 4; col++)
-						state[row][col] = c[offset + col * 4 + row];
-				}
-
-				// Add round key
-				for (var row = 0; row < 4; row++) {
-					for (var col = 0; col < 4; col++)
-						state[row][col] ^= keyschedule[nrounds * 4 + col][row];
-				}
-
-				for (var round = 1; round < nrounds; round++) {
-
-					// Inv shift rows
-					state[1].unshift(state[1].pop());
-					state[2].push(state[2].shift());
-					state[2].push(state[2].shift());
-					state[3].push(state[3].shift());
-
-					// Inv sub bytes
-					for (var row = 0; row < 4; row++) {
-						for (var col = 0; col < 4; col++)
-							state[row][col] = INVSBOX[state[row][col]];
-					}
-
-					// Add round key
-					for (var row = 0; row < 4; row++) {
-						for (var col = 0; col < 4; col++)
-							state[row][col] ^= keyschedule[(nrounds - round) * 4 + col][row];
-					}
-
-					// Inv mix columns
-					for (var col = 0; col < 4; col++) {
-
-						var s0 = state[0][col],
+					var s0 = state[0][col],
 				s1 = state[1][col],
 				s2 = state[2][col],
 				s3 = state[3][col];
 
-						state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
-						state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
-						state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
-						state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
-
-					}
+					state[0][col] = MULT2[s0] ^ MULT3[s1] ^ s2 ^ s3;
+					state[1][col] = s0 ^ MULT2[s1] ^ MULT3[s2] ^ s3;
+					state[2][col] = s0 ^ s1 ^ MULT2[s2] ^ MULT3[s3];
+					state[3][col] = MULT3[s0] ^ s1 ^ s2 ^ MULT2[s3];
 
 				}
 
+				// Add round key
+				for (var row = 0; row < 4; row++) {
+					for (var col = 0; col < 4; col++)
+						state[row][col] ^= keyschedule[round * 4 + col][row];
+				}
+
+			}
+
+			// Sub bytes
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = SBOX[state[row][col]];
+			}
+
+			// Shift rows
+			state[1].push(state[1].shift());
+			state[2].push(state[2].shift());
+			state[2].push(state[2].shift());
+			state[3].unshift(state[3].pop());
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[nrounds * 4 + col][row];
+			}
+
+			// Set output
+			for (var row = 0; row < AES._blocksize; row++) {
+				for (var col = 0; col < 4; col++)
+					m[offset + col * 4 + row] = state[row][col];
+			}
+
+		},
+
+		_decryptblock: function (c, offset) {
+
+			// Set input
+			for (var row = 0; row < AES._blocksize; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = c[offset + col * 4 + row];
+			}
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[nrounds * 4 + col][row];
+			}
+
+			for (var round = 1; round < nrounds; round++) {
+
 				// Inv shift rows
 				state[1].unshift(state[1].pop());
 				state[2].push(state[2].shift());
@@ -850,644 +814,677 @@
 				// Add round key
 				for (var row = 0; row < 4; row++) {
 					for (var col = 0; col < 4; col++)
-						state[row][col] ^= keyschedule[col][row];
+						state[row][col] ^= keyschedule[(nrounds - round) * 4 + col][row];
 				}
 
-				// Set output
-				for (var row = 0; row < AES._blocksize; row++) {
-					for (var col = 0; col < 4; col++)
-						c[offset + col * 4 + row] = state[row][col];
+				// Inv mix columns
+				for (var col = 0; col < 4; col++) {
+
+					var s0 = state[0][col],
+				s1 = state[1][col],
+				s2 = state[2][col],
+				s3 = state[3][col];
+
+					state[0][col] = MULTE[s0] ^ MULTB[s1] ^ MULTD[s2] ^ MULT9[s3];
+					state[1][col] = MULT9[s0] ^ MULTE[s1] ^ MULTB[s2] ^ MULTD[s3];
+					state[2][col] = MULTD[s0] ^ MULT9[s1] ^ MULTE[s2] ^ MULTB[s3];
+					state[3][col] = MULTB[s0] ^ MULTD[s1] ^ MULT9[s2] ^ MULTE[s3];
+
 				}
 
-			},
+			}
+
+			// Inv shift rows
+			state[1].unshift(state[1].pop());
+			state[2].push(state[2].shift());
+			state[2].push(state[2].shift());
+			state[3].push(state[3].shift());
+
+			// Inv sub bytes
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] = INVSBOX[state[row][col]];
+			}
+
+			// Add round key
+			for (var row = 0; row < 4; row++) {
+				for (var col = 0; col < 4; col++)
+					state[row][col] ^= keyschedule[col][row];
+			}
+
+			// Set output
+			for (var row = 0; row < AES._blocksize; row++) {
+				for (var col = 0; col < 4; col++)
+					c[offset + col * 4 + row] = state[row][col];
+			}
+
+		},
 
 
-			/**
-			* Private methods
-			*/
+		/**
+		* Private methods
+		*/
 
-			_init: function (k) {
-				keylength = k.length / 4;
-				nrounds = keylength + 6;
-				AES._keyexpansion(k);
-			},
+		_init: function (k) {
+			keylength = k.length / 4;
+			nrounds = keylength + 6;
+			AES._keyexpansion(k);
+		},
 
-			// Generate a key schedule
-			_keyexpansion: function (k) {
+		// Generate a key schedule
+		_keyexpansion: function (k) {
 
-				keyschedule = [];
+			keyschedule = [];
 
-				for (var row = 0; row < keylength; row++) {
-					keyschedule[row] = [
+			for (var row = 0; row < keylength; row++) {
+				keyschedule[row] = [
 			k[row * 4],
 			k[row * 4 + 1],
 			k[row * 4 + 2],
 			k[row * 4 + 3]
 		];
-				}
+			}
 
-				for (var row = keylength; row < AES._blocksize * (nrounds + 1); row++) {
+			for (var row = keylength; row < AES._blocksize * (nrounds + 1); row++) {
 
-					var temp = [
+				var temp = [
 			keyschedule[row - 1][0],
 			keyschedule[row - 1][1],
 			keyschedule[row - 1][2],
 			keyschedule[row - 1][3]
 		];
 
-					if (row % keylength == 0) {
+				if (row % keylength == 0) {
 
-						// Rot word
-						temp.push(temp.shift());
+					// Rot word
+					temp.push(temp.shift());
 
-						// Sub word
-						temp[0] = SBOX[temp[0]];
-						temp[1] = SBOX[temp[1]];
-						temp[2] = SBOX[temp[2]];
-						temp[3] = SBOX[temp[3]];
+					// Sub word
+					temp[0] = SBOX[temp[0]];
+					temp[1] = SBOX[temp[1]];
+					temp[2] = SBOX[temp[2]];
+					temp[3] = SBOX[temp[3]];
 
-						temp[0] ^= RCON[row / keylength];
+					temp[0] ^= RCON[row / keylength];
 
-					} else if (keylength > 6 && row % keylength == 4) {
+				} else if (keylength > 6 && row % keylength == 4) {
 
-						// Sub word
-						temp[0] = SBOX[temp[0]];
-						temp[1] = SBOX[temp[1]];
-						temp[2] = SBOX[temp[2]];
-						temp[3] = SBOX[temp[3]];
+					// Sub word
+					temp[0] = SBOX[temp[0]];
+					temp[1] = SBOX[temp[1]];
+					temp[2] = SBOX[temp[2]];
+					temp[3] = SBOX[temp[3]];
 
-					}
+				}
 
-					keyschedule[row] = [
+				keyschedule[row] = [
 			keyschedule[row - keylength][0] ^ temp[0],
 			keyschedule[row - keylength][1] ^ temp[1],
 			keyschedule[row - keylength][2] ^ temp[2],
 			keyschedule[row - keylength][3] ^ temp[3]
 		];
 
-				}
-
 			}
 
-		};
-
-	})();
-	</script>
-
-	<script type="text/javascript">
-	/*!
-	* Crypto-JS 2.5.4 BlockModes.js
-	* contribution from Simon Greatrix
-	*/
-
-	(function (C) {
-
-		// Create pad namespace
-		var C_pad = C.pad = {};
-
-		// Calculate the number of padding bytes required.
-		function _requiredPadding(cipher, message) {
-			var blockSizeInBytes = cipher._blocksize * 4;
-			var reqd = blockSizeInBytes - message.length % blockSizeInBytes;
-			return reqd;
 		}
 
-		// Remove padding when the final byte gives the number of padding bytes.
-		var _unpadLength = function (cipher, message, alg, padding) {
-			var pad = message.pop();
-			if (pad == 0) {
-				throw new Error("Invalid zero-length padding specified for " + alg
+	};
+
+})();
+	</script>
+	<script type="text/javascript">
+/*!
+* Crypto-JS 2.5.4 BlockModes.js
+* contribution from Simon Greatrix
+*/
+
+(function (C) {
+
+	// Create pad namespace
+	var C_pad = C.pad = {};
+
+	// Calculate the number of padding bytes required.
+	function _requiredPadding(cipher, message) {
+		var blockSizeInBytes = cipher._blocksize * 4;
+		var reqd = blockSizeInBytes - message.length % blockSizeInBytes;
+		return reqd;
+	}
+
+	// Remove padding when the final byte gives the number of padding bytes.
+	var _unpadLength = function (cipher, message, alg, padding) {
+		var pad = message.pop();
+		if (pad == 0) {
+			throw new Error("Invalid zero-length padding specified for " + alg
 			+ ". Wrong cipher specification or key used?");
-			}
-			var maxPad = cipher._blocksize * 4;
-			if (pad > maxPad) {
-				throw new Error("Invalid padding length of " + pad
+		}
+		var maxPad = cipher._blocksize * 4;
+		if (pad > maxPad) {
+			throw new Error("Invalid padding length of " + pad
 			+ " specified for " + alg
 			+ ". Wrong cipher specification or key used?");
-			}
-			for (var i = 1; i < pad; i++) {
-				var b = message.pop();
-				if (padding != undefined && padding != b) {
-					throw new Error("Invalid padding byte of 0x" + b.toString(16)
+		}
+		for (var i = 1; i < pad; i++) {
+			var b = message.pop();
+			if (padding != undefined && padding != b) {
+				throw new Error("Invalid padding byte of 0x" + b.toString(16)
 				+ " specified for " + alg
 				+ ". Wrong cipher specification or key used?");
-				}
 			}
-		};
+		}
+	};
 
-		// No-operation padding, used for stream ciphers
-		C_pad.NoPadding = {
-			pad: function (cipher, message) { },
-			unpad: function (cipher, message) { }
-		};
+	// No-operation padding, used for stream ciphers
+	C_pad.NoPadding = {
+		pad: function (cipher, message) { },
+		unpad: function (cipher, message) { }
+	};
 
-		// Zero Padding.
-		//
-		// If the message is not an exact number of blocks, the final block is
-		// completed with 0x00 bytes. There is no unpadding.
-		C_pad.ZeroPadding = {
-			pad: function (cipher, message) {
-				var blockSizeInBytes = cipher._blocksize * 4;
-				var reqd = message.length % blockSizeInBytes;
-				if (reqd != 0) {
-					for (reqd = blockSizeInBytes - reqd; reqd > 0; reqd--) {
-						message.push(0x00);
-					}
-				}
-			},
-
-			unpad: function (cipher, message) {
-				while (message[message.length - 1] == 0) {
-					message.pop();
-				}
-			}
-		};
-
-		// ISO/IEC 7816-4 padding.
-		//
-		// Pads the plain text with an 0x80 byte followed by as many 0x00
-		// bytes are required to complete the block.
-		C_pad.iso7816 = {
-			pad: function (cipher, message) {
-				var reqd = _requiredPadding(cipher, message);
-				message.push(0x80);
-				for (; reqd > 1; reqd--) {
+	// Zero Padding.
+	//
+	// If the message is not an exact number of blocks, the final block is
+	// completed with 0x00 bytes. There is no unpadding.
+	C_pad.ZeroPadding = {
+		pad: function (cipher, message) {
+			var blockSizeInBytes = cipher._blocksize * 4;
+			var reqd = message.length % blockSizeInBytes;
+			if (reqd != 0) {
+				for (reqd = blockSizeInBytes - reqd; reqd > 0; reqd--) {
 					message.push(0x00);
 				}
-			},
-
-			unpad: function (cipher, message) {
-				var padLength;
-				for (padLength = cipher._blocksize * 4; padLength > 0; padLength--) {
-					var b = message.pop();
-					if (b == 0x80) return;
-					if (b != 0x00) {
-						throw new Error("ISO-7816 padding byte must be 0, not 0x" + b.toString(16) + ". Wrong cipher specification or key used?");
-					}
-				}
-				throw new Error("ISO-7816 padded beyond cipher block size. Wrong cipher specification or key used?");
 			}
-		};
+		},
 
-		// ANSI X.923 padding
-		//
-		// The final block is padded with zeros except for the last byte of the
-		// last block which contains the number of padding bytes.
-		C_pad.ansix923 = {
-			pad: function (cipher, message) {
-				var reqd = _requiredPadding(cipher, message);
-				for (var i = 1; i < reqd; i++) {
-					message.push(0x00);
+		unpad: function (cipher, message) {
+			while (message[message.length - 1] == 0) {
+				message.pop();
+			}
+		}
+	};
+
+	// ISO/IEC 7816-4 padding.
+	//
+	// Pads the plain text with an 0x80 byte followed by as many 0x00
+	// bytes are required to complete the block.
+	C_pad.iso7816 = {
+		pad: function (cipher, message) {
+			var reqd = _requiredPadding(cipher, message);
+			message.push(0x80);
+			for (; reqd > 1; reqd--) {
+				message.push(0x00);
+			}
+		},
+
+		unpad: function (cipher, message) {
+			var padLength;
+			for (padLength = cipher._blocksize * 4; padLength > 0; padLength--) {
+				var b = message.pop();
+				if (b == 0x80) return;
+				if (b != 0x00) {
+					throw new Error("ISO-7816 padding byte must be 0, not 0x" + b.toString(16) + ". Wrong cipher specification or key used?");
 				}
+			}
+			throw new Error("ISO-7816 padded beyond cipher block size. Wrong cipher specification or key used?");
+		}
+	};
+
+	// ANSI X.923 padding
+	//
+	// The final block is padded with zeros except for the last byte of the
+	// last block which contains the number of padding bytes.
+	C_pad.ansix923 = {
+		pad: function (cipher, message) {
+			var reqd = _requiredPadding(cipher, message);
+			for (var i = 1; i < reqd; i++) {
+				message.push(0x00);
+			}
+			message.push(reqd);
+		},
+
+		unpad: function (cipher, message) {
+			_unpadLength(cipher, message, "ANSI X.923", 0);
+		}
+	};
+
+	// ISO 10126
+	//
+	// The final block is padded with random bytes except for the last
+	// byte of the last block which contains the number of padding bytes.
+	C_pad.iso10126 = {
+		pad: function (cipher, message) {
+			var reqd = _requiredPadding(cipher, message);
+			for (var i = 1; i < reqd; i++) {
+				message.push(Math.floor(Math.random() * 256));
+			}
+			message.push(reqd);
+		},
+
+		unpad: function (cipher, message) {
+			_unpadLength(cipher, message, "ISO 10126", undefined);
+		}
+	};
+
+	// PKCS7 padding
+	//
+	// PKCS7 is described in RFC 5652. Padding is in whole bytes. The
+	// value of each added byte is the number of bytes that are added,
+	// i.e. N bytes, each of value N are added.
+	C_pad.pkcs7 = {
+		pad: function (cipher, message) {
+			var reqd = _requiredPadding(cipher, message);
+			for (var i = 0; i < reqd; i++) {
 				message.push(reqd);
-			},
-
-			unpad: function (cipher, message) {
-				_unpadLength(cipher, message, "ANSI X.923", 0);
 			}
-		};
+		},
 
-		// ISO 10126
-		//
-		// The final block is padded with random bytes except for the last
-		// byte of the last block which contains the number of padding bytes.
-		C_pad.iso10126 = {
-			pad: function (cipher, message) {
-				var reqd = _requiredPadding(cipher, message);
-				for (var i = 1; i < reqd; i++) {
-					message.push(Math.floor(Math.random() * 256));
-				}
-				message.push(reqd);
-			},
+		unpad: function (cipher, message) {
+			_unpadLength(cipher, message, "PKCS 7", message[message.length - 1]);
+		}
+	};
 
-			unpad: function (cipher, message) {
-				_unpadLength(cipher, message, "ISO 10126", undefined);
+	// Create mode namespace
+	var C_mode = C.mode = {};
+
+	/**
+	* Mode base "class".
+	*/
+	var Mode = C_mode.Mode = function (padding) {
+		if (padding) {
+			this._padding = padding;
+		}
+	};
+
+	Mode.prototype = {
+		encrypt: function (cipher, m, iv) {
+			this._padding.pad(cipher, m);
+			this._doEncrypt(cipher, m, iv);
+		},
+
+		decrypt: function (cipher, m, iv) {
+			this._doDecrypt(cipher, m, iv);
+			this._padding.unpad(cipher, m);
+		},
+
+		// Default padding
+		_padding: C_pad.iso7816
+	};
+
+
+	/**
+	* Electronic Code Book mode.
+	* 
+	* ECB applies the cipher directly against each block of the input.
+	* 
+	* ECB does not require an initialization vector.
+	*/
+	var ECB = C_mode.ECB = function () {
+		// Call parent constructor
+		Mode.apply(this, arguments);
+	};
+
+	// Inherit from Mode
+	var ECB_prototype = ECB.prototype = new Mode;
+
+	// Concrete steps for Mode template
+	ECB_prototype._doEncrypt = function (cipher, m, iv) {
+		var blockSizeInBytes = cipher._blocksize * 4;
+		// Encrypt each block
+		for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
+			cipher._encryptblock(m, offset);
+		}
+	};
+	ECB_prototype._doDecrypt = function (cipher, c, iv) {
+		var blockSizeInBytes = cipher._blocksize * 4;
+		// Decrypt each block
+		for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
+			cipher._decryptblock(c, offset);
+		}
+	};
+
+	// ECB never uses an IV
+	ECB_prototype.fixOptions = function (options) {
+		options.iv = [];
+	};
+
+
+	/**
+	* Cipher block chaining
+	* 
+	* The first block is XORed with the IV. Subsequent blocks are XOR with the
+	* previous cipher output.
+	*/
+	var CBC = C_mode.CBC = function () {
+		// Call parent constructor
+		Mode.apply(this, arguments);
+	};
+
+	// Inherit from Mode
+	var CBC_prototype = CBC.prototype = new Mode;
+
+	// Concrete steps for Mode template
+	CBC_prototype._doEncrypt = function (cipher, m, iv) {
+		var blockSizeInBytes = cipher._blocksize * 4;
+
+		// Encrypt each block
+		for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
+			if (offset == 0) {
+				// XOR first block using IV
+				for (var i = 0; i < blockSizeInBytes; i++)
+					m[i] ^= iv[i];
+			} else {
+				// XOR this block using previous crypted block
+				for (var i = 0; i < blockSizeInBytes; i++)
+					m[offset + i] ^= m[offset + i - blockSizeInBytes];
 			}
-		};
+			// Encrypt block
+			cipher._encryptblock(m, offset);
+		}
+	};
+	CBC_prototype._doDecrypt = function (cipher, c, iv) {
+		var blockSizeInBytes = cipher._blocksize * 4;
 
-		// PKCS7 padding
-		//
-		// PKCS7 is described in RFC 5652. Padding is in whole bytes. The
-		// value of each added byte is the number of bytes that are added,
-		// i.e. N bytes, each of value N are added.
-		C_pad.pkcs7 = {
-			pad: function (cipher, message) {
-				var reqd = _requiredPadding(cipher, message);
-				for (var i = 0; i < reqd; i++) {
-					message.push(reqd);
-				}
-			},
+		// At the start, the previously crypted block is the IV
+		var prevCryptedBlock = iv;
 
-			unpad: function (cipher, message) {
-				_unpadLength(cipher, message, "PKCS 7", message[message.length - 1]);
+		// Decrypt each block
+		for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
+			// Save this crypted block
+			var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
+			// Decrypt block
+			cipher._decryptblock(c, offset);
+			// XOR decrypted block using previous crypted block
+			for (var i = 0; i < blockSizeInBytes; i++) {
+				c[offset + i] ^= prevCryptedBlock[i];
 			}
-		};
-
-		// Create mode namespace
-		var C_mode = C.mode = {};
-
-		/**
-		* Mode base "class".
-		*/
-		var Mode = C_mode.Mode = function (padding) {
-			if (padding) {
-				this._padding = padding;
-			}
-		};
-
-		Mode.prototype = {
-			encrypt: function (cipher, m, iv) {
-				this._padding.pad(cipher, m);
-				this._doEncrypt(cipher, m, iv);
-			},
-
-			decrypt: function (cipher, m, iv) {
-				this._doDecrypt(cipher, m, iv);
-				this._padding.unpad(cipher, m);
-			},
-
-			// Default padding
-			_padding: C_pad.iso7816
-		};
+			prevCryptedBlock = thisCryptedBlock;
+		}
+	};
 
 
-		/**
-		* Electronic Code Book mode.
-		* 
-		* ECB applies the cipher directly against each block of the input.
-		* 
-		* ECB does not require an initialization vector.
-		*/
-		var ECB = C_mode.ECB = function () {
-			// Call parent constructor
-			Mode.apply(this, arguments);
-		};
+	/**
+	* Cipher feed back
+	* 
+	* The cipher output is XORed with the plain text to produce the cipher output,
+	* which is then fed back into the cipher to produce a bit pattern to XOR the
+	* next block with.
+	* 
+	* This is a stream cipher mode and does not require padding.
+	*/
+	var CFB = C_mode.CFB = function () {
+		// Call parent constructor
+		Mode.apply(this, arguments);
+	};
 
-		// Inherit from Mode
-		var ECB_prototype = ECB.prototype = new Mode;
+	// Inherit from Mode
+	var CFB_prototype = CFB.prototype = new Mode;
 
-		// Concrete steps for Mode template
-		ECB_prototype._doEncrypt = function (cipher, m, iv) {
-			var blockSizeInBytes = cipher._blocksize * 4;
-			// Encrypt each block
-			for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
-				cipher._encryptblock(m, offset);
-			}
-		};
-		ECB_prototype._doDecrypt = function (cipher, c, iv) {
-			var blockSizeInBytes = cipher._blocksize * 4;
-			// Decrypt each block
-			for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
-				cipher._decryptblock(c, offset);
-			}
-		};
+	// Override padding
+	CFB_prototype._padding = C_pad.NoPadding;
 
-		// ECB never uses an IV
-		ECB_prototype.fixOptions = function (options) {
-			options.iv = [];
-		};
-
-
-		/**
-		* Cipher block chaining
-		* 
-		* The first block is XORed with the IV. Subsequent blocks are XOR with the
-		* previous cipher output.
-		*/
-		var CBC = C_mode.CBC = function () {
-			// Call parent constructor
-			Mode.apply(this, arguments);
-		};
-
-		// Inherit from Mode
-		var CBC_prototype = CBC.prototype = new Mode;
-
-		// Concrete steps for Mode template
-		CBC_prototype._doEncrypt = function (cipher, m, iv) {
-			var blockSizeInBytes = cipher._blocksize * 4;
-
-			// Encrypt each block
-			for (var offset = 0; offset < m.length; offset += blockSizeInBytes) {
-				if (offset == 0) {
-					// XOR first block using IV
-					for (var i = 0; i < blockSizeInBytes; i++)
-						m[i] ^= iv[i];
-				} else {
-					// XOR this block using previous crypted block
-					for (var i = 0; i < blockSizeInBytes; i++)
-						m[offset + i] ^= m[offset + i - blockSizeInBytes];
-				}
-				// Encrypt block
-				cipher._encryptblock(m, offset);
-			}
-		};
-		CBC_prototype._doDecrypt = function (cipher, c, iv) {
-			var blockSizeInBytes = cipher._blocksize * 4;
-
-			// At the start, the previously crypted block is the IV
-			var prevCryptedBlock = iv;
-
-			// Decrypt each block
-			for (var offset = 0; offset < c.length; offset += blockSizeInBytes) {
-				// Save this crypted block
-				var thisCryptedBlock = c.slice(offset, offset + blockSizeInBytes);
-				// Decrypt block
-				cipher._decryptblock(c, offset);
-				// XOR decrypted block using previous crypted block
-				for (var i = 0; i < blockSizeInBytes; i++) {
-					c[offset + i] ^= prevCryptedBlock[i];
-				}
-				prevCryptedBlock = thisCryptedBlock;
-			}
-		};
-
-
-		/**
-		* Cipher feed back
-		* 
-		* The cipher output is XORed with the plain text to produce the cipher output,
-		* which is then fed back into the cipher to produce a bit pattern to XOR the
-		* next block with.
-		* 
-		* This is a stream cipher mode and does not require padding.
-		*/
-		var CFB = C_mode.CFB = function () {
-			// Call parent constructor
-			Mode.apply(this, arguments);
-		};
-
-		// Inherit from Mode
-		var CFB_prototype = CFB.prototype = new Mode;
-
-		// Override padding
-		CFB_prototype._padding = C_pad.NoPadding;
-
-		// Concrete steps for Mode template
-		CFB_prototype._doEncrypt = function (cipher, m, iv) {
-			var blockSizeInBytes = cipher._blocksize * 4,
+	// Concrete steps for Mode template
+	CFB_prototype._doEncrypt = function (cipher, m, iv) {
+		var blockSizeInBytes = cipher._blocksize * 4,
     keystream = iv.slice(0);
 
-			// Encrypt each byte
-			for (var i = 0; i < m.length; i++) {
+		// Encrypt each byte
+		for (var i = 0; i < m.length; i++) {
 
-				var j = i % blockSizeInBytes;
-				if (j == 0) cipher._encryptblock(keystream, 0);
+			var j = i % blockSizeInBytes;
+			if (j == 0) cipher._encryptblock(keystream, 0);
 
-				m[i] ^= keystream[j];
-				keystream[j] = m[i];
-			}
-		};
-		CFB_prototype._doDecrypt = function (cipher, c, iv) {
-			var blockSizeInBytes = cipher._blocksize * 4,
+			m[i] ^= keystream[j];
+			keystream[j] = m[i];
+		}
+	};
+	CFB_prototype._doDecrypt = function (cipher, c, iv) {
+		var blockSizeInBytes = cipher._blocksize * 4,
 			keystream = iv.slice(0);
 
-			// Encrypt each byte
-			for (var i = 0; i < c.length; i++) {
+		// Encrypt each byte
+		for (var i = 0; i < c.length; i++) {
 
-				var j = i % blockSizeInBytes;
-				if (j == 0) cipher._encryptblock(keystream, 0);
+			var j = i % blockSizeInBytes;
+			if (j == 0) cipher._encryptblock(keystream, 0);
 
-				var b = c[i];
-				c[i] ^= keystream[j];
-				keystream[j] = b;
-			}
-		};
+			var b = c[i];
+			c[i] ^= keystream[j];
+			keystream[j] = b;
+		}
+	};
 
 
-		/**
-		* Output feed back
-		* 
-		* The cipher repeatedly encrypts its own output. The output is XORed with the
-		* plain text to produce the cipher text.
-		* 
-		* This is a stream cipher mode and does not require padding.
-		*/
-		var OFB = C_mode.OFB = function () {
-			// Call parent constructor
-			Mode.apply(this, arguments);
-		};
+	/**
+	* Output feed back
+	* 
+	* The cipher repeatedly encrypts its own output. The output is XORed with the
+	* plain text to produce the cipher text.
+	* 
+	* This is a stream cipher mode and does not require padding.
+	*/
+	var OFB = C_mode.OFB = function () {
+		// Call parent constructor
+		Mode.apply(this, arguments);
+	};
 
-		// Inherit from Mode
-		var OFB_prototype = OFB.prototype = new Mode;
+	// Inherit from Mode
+	var OFB_prototype = OFB.prototype = new Mode;
 
-		// Override padding
-		OFB_prototype._padding = C_pad.NoPadding;
+	// Override padding
+	OFB_prototype._padding = C_pad.NoPadding;
 
-		// Concrete steps for Mode template
-		OFB_prototype._doEncrypt = function (cipher, m, iv) {
+	// Concrete steps for Mode template
+	OFB_prototype._doEncrypt = function (cipher, m, iv) {
 
-			var blockSizeInBytes = cipher._blocksize * 4,
+		var blockSizeInBytes = cipher._blocksize * 4,
 			keystream = iv.slice(0);
 
-			// Encrypt each byte
-			for (var i = 0; i < m.length; i++) {
+		// Encrypt each byte
+		for (var i = 0; i < m.length; i++) {
 
-				// Generate keystream
-				if (i % blockSizeInBytes == 0)
-					cipher._encryptblock(keystream, 0);
-
-				// Encrypt byte
-				m[i] ^= keystream[i % blockSizeInBytes];
-
-			}
-		};
-		OFB_prototype._doDecrypt = OFB_prototype._doEncrypt;
-
-		/**
-		* Counter
-		* @author Gergely Risko
-		*
-		* After every block the last 4 bytes of the IV is increased by one
-		* with carry and that IV is used for the next block.
-		*
-		* This is a stream cipher mode and does not require padding.
-		*/
-		var CTR = C_mode.CTR = function () {
-			// Call parent constructor
-			Mode.apply(this, arguments);
-		};
-
-		// Inherit from Mode
-		var CTR_prototype = CTR.prototype = new Mode;
-
-		// Override padding
-		CTR_prototype._padding = C_pad.NoPadding;
-
-		CTR_prototype._doEncrypt = function (cipher, m, iv) {
-			var blockSizeInBytes = cipher._blocksize * 4;
-			var counter = iv.slice(0);
-
-			for (var i = 0; i < m.length; ) {
-				// do not lose iv
-				var keystream = counter.slice(0);
-
-				// Generate keystream for next block
+			// Generate keystream
+			if (i % blockSizeInBytes == 0)
 				cipher._encryptblock(keystream, 0);
 
-				// XOR keystream with block
-				for (var j = 0; i < m.length && j < blockSizeInBytes; j++, i++) {
-					m[i] ^= keystream[j];
-				}
+			// Encrypt byte
+			m[i] ^= keystream[i % blockSizeInBytes];
 
-				// Increase counter
-				if (++(counter[blockSizeInBytes - 1]) == 256) {
-					counter[blockSizeInBytes - 1] = 0;
-					if (++(counter[blockSizeInBytes - 2]) == 256) {
-						counter[blockSizeInBytes - 2] = 0;
-						if (++(counter[blockSizeInBytes - 3]) == 256) {
-							counter[blockSizeInBytes - 3] = 0;
-							++(counter[blockSizeInBytes - 4]);
-						}
+		}
+	};
+	OFB_prototype._doDecrypt = OFB_prototype._doEncrypt;
+
+	/**
+	* Counter
+	* @author Gergely Risko
+	*
+	* After every block the last 4 bytes of the IV is increased by one
+	* with carry and that IV is used for the next block.
+	*
+	* This is a stream cipher mode and does not require padding.
+	*/
+	var CTR = C_mode.CTR = function () {
+		// Call parent constructor
+		Mode.apply(this, arguments);
+	};
+
+	// Inherit from Mode
+	var CTR_prototype = CTR.prototype = new Mode;
+
+	// Override padding
+	CTR_prototype._padding = C_pad.NoPadding;
+
+	CTR_prototype._doEncrypt = function (cipher, m, iv) {
+		var blockSizeInBytes = cipher._blocksize * 4;
+		var counter = iv.slice(0);
+
+		for (var i = 0; i < m.length; ) {
+			// do not lose iv
+			var keystream = counter.slice(0);
+
+			// Generate keystream for next block
+			cipher._encryptblock(keystream, 0);
+
+			// XOR keystream with block
+			for (var j = 0; i < m.length && j < blockSizeInBytes; j++, i++) {
+				m[i] ^= keystream[j];
+			}
+
+			// Increase counter
+			if (++(counter[blockSizeInBytes - 1]) == 256) {
+				counter[blockSizeInBytes - 1] = 0;
+				if (++(counter[blockSizeInBytes - 2]) == 256) {
+					counter[blockSizeInBytes - 2] = 0;
+					if (++(counter[blockSizeInBytes - 3]) == 256) {
+						counter[blockSizeInBytes - 3] = 0;
+						++(counter[blockSizeInBytes - 4]);
 					}
 				}
 			}
-		};
-		CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
+		}
+	};
+	CTR_prototype._doDecrypt = CTR_prototype._doEncrypt;
 
-	})(Crypto);
+})(Crypto);
 	</script>
-
 	<script type="text/javascript">
-		/*!
-		* Crypto-JS v2.0.0  RIPEMD-160
-		* http://code.google.com/p/crypto-js/
-		* Copyright (c) 2009, Jeff Mott. All rights reserved.
-		* http://code.google.com/p/crypto-js/wiki/License
-		*
-		* A JavaScript implementation of the RIPEMD-160 Algorithm
-		* Version 2.2 Copyright Jeremy Lin, Paul Johnston 2000 - 2009.
-		* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
-		* Distributed under the BSD License
-		* See http://pajhome.org.uk/crypt/md5 for details.
-		* Also http://www.ocf.berkeley.edu/~jjlin/jsotp/
-		* Ported to Crypto-JS by Stefan Thomas.
-		*/
+/*!
+* Crypto-JS v2.0.0  RIPEMD-160
+* http://code.google.com/p/crypto-js/
+* Copyright (c) 2009, Jeff Mott. All rights reserved.
+* http://code.google.com/p/crypto-js/wiki/License
+*
+* A JavaScript implementation of the RIPEMD-160 Algorithm
+* Version 2.2 Copyright Jeremy Lin, Paul Johnston 2000 - 2009.
+* Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
+* Distributed under the BSD License
+* See http://pajhome.org.uk/crypt/md5 for details.
+* Also http://www.ocf.berkeley.edu/~jjlin/jsotp/
+* Ported to Crypto-JS by Stefan Thomas.
+*/
 
-		(function () {
-			// Shortcuts
-			var C = Crypto,
+(function () {
+	// Shortcuts
+	var C = Crypto,
 	util = C.util,
 	charenc = C.charenc,
 	UTF8 = charenc.UTF8,
 	Binary = charenc.Binary;
 
-			// Convert a byte array to little-endian 32-bit words
-			util.bytesToLWords = function (bytes) {
+	// Convert a byte array to little-endian 32-bit words
+	util.bytesToLWords = function (bytes) {
 
-				var output = Array(bytes.length >> 2);
-				for (var i = 0; i < output.length; i++)
-					output[i] = 0;
-				for (var i = 0; i < bytes.length * 8; i += 8)
-					output[i >> 5] |= (bytes[i / 8] & 0xFF) << (i % 32);
-				return output;
-			};
+		var output = Array(bytes.length >> 2);
+		for (var i = 0; i < output.length; i++)
+			output[i] = 0;
+		for (var i = 0; i < bytes.length * 8; i += 8)
+			output[i >> 5] |= (bytes[i / 8] & 0xFF) << (i % 32);
+		return output;
+	};
 
-			// Convert little-endian 32-bit words to a byte array
-			util.lWordsToBytes = function (words) {
-				var output = [];
-				for (var i = 0; i < words.length * 32; i += 8)
-					output.push((words[i >> 5] >>> (i % 32)) & 0xff);
-				return output;
-			};
+	// Convert little-endian 32-bit words to a byte array
+	util.lWordsToBytes = function (words) {
+		var output = [];
+		for (var i = 0; i < words.length * 32; i += 8)
+			output.push((words[i >> 5] >>> (i % 32)) & 0xff);
+		return output;
+	};
 
-			// Public API
-			var RIPEMD160 = C.RIPEMD160 = function (message, options) {
-				var digestbytes = util.lWordsToBytes(RIPEMD160._rmd160(message));
-				return options && options.asBytes ? digestbytes :
+	// Public API
+	var RIPEMD160 = C.RIPEMD160 = function (message, options) {
+		var digestbytes = util.lWordsToBytes(RIPEMD160._rmd160(message));
+		return options && options.asBytes ? digestbytes :
 			options && options.asString ? Binary.bytesToString(digestbytes) :
 			util.bytesToHex(digestbytes);
-			};
+	};
 
-			// The core
-			RIPEMD160._rmd160 = function (message) {
-				// Convert to byte array
-				if (message.constructor == String) message = UTF8.stringToBytes(message);
+	// The core
+	RIPEMD160._rmd160 = function (message) {
+		// Convert to byte array
+		if (message.constructor == String) message = UTF8.stringToBytes(message);
 
-				var x = util.bytesToLWords(message),
+		var x = util.bytesToLWords(message),
 			len = message.length * 8;
 
-				/* append padding */
-				x[len >> 5] |= 0x80 << (len % 32);
-				x[(((len + 64) >>> 9) << 4) + 14] = len;
+		/* append padding */
+		x[len >> 5] |= 0x80 << (len % 32);
+		x[(((len + 64) >>> 9) << 4) + 14] = len;
 
-				var h0 = 0x67452301;
-				var h1 = 0xefcdab89;
-				var h2 = 0x98badcfe;
-				var h3 = 0x10325476;
-				var h4 = 0xc3d2e1f0;
+		var h0 = 0x67452301;
+		var h1 = 0xefcdab89;
+		var h2 = 0x98badcfe;
+		var h3 = 0x10325476;
+		var h4 = 0xc3d2e1f0;
 
-				for (var i = 0; i < x.length; i += 16) {
-					var T;
-					var A1 = h0, B1 = h1, C1 = h2, D1 = h3, E1 = h4;
-					var A2 = h0, B2 = h1, C2 = h2, D2 = h3, E2 = h4;
-					for (var j = 0; j <= 79; ++j) {
-						T = safe_add(A1, rmd160_f(j, B1, C1, D1));
-						T = safe_add(T, x[i + rmd160_r1[j]]);
-						T = safe_add(T, rmd160_K1(j));
-						T = safe_add(bit_rol(T, rmd160_s1[j]), E1);
-						A1 = E1; E1 = D1; D1 = bit_rol(C1, 10); C1 = B1; B1 = T;
-						T = safe_add(A2, rmd160_f(79 - j, B2, C2, D2));
-						T = safe_add(T, x[i + rmd160_r2[j]]);
-						T = safe_add(T, rmd160_K2(j));
-						T = safe_add(bit_rol(T, rmd160_s2[j]), E2);
-						A2 = E2; E2 = D2; D2 = bit_rol(C2, 10); C2 = B2; B2 = T;
-					}
-					T = safe_add(h1, safe_add(C1, D2));
-					h1 = safe_add(h2, safe_add(D1, E2));
-					h2 = safe_add(h3, safe_add(E1, A2));
-					h3 = safe_add(h4, safe_add(A1, B2));
-					h4 = safe_add(h0, safe_add(B1, C2));
-					h0 = T;
-				}
-				return [h0, h1, h2, h3, h4];
+		for (var i = 0; i < x.length; i += 16) {
+			var T;
+			var A1 = h0, B1 = h1, C1 = h2, D1 = h3, E1 = h4;
+			var A2 = h0, B2 = h1, C2 = h2, D2 = h3, E2 = h4;
+			for (var j = 0; j <= 79; ++j) {
+				T = safe_add(A1, rmd160_f(j, B1, C1, D1));
+				T = safe_add(T, x[i + rmd160_r1[j]]);
+				T = safe_add(T, rmd160_K1(j));
+				T = safe_add(bit_rol(T, rmd160_s1[j]), E1);
+				A1 = E1; E1 = D1; D1 = bit_rol(C1, 10); C1 = B1; B1 = T;
+				T = safe_add(A2, rmd160_f(79 - j, B2, C2, D2));
+				T = safe_add(T, x[i + rmd160_r2[j]]);
+				T = safe_add(T, rmd160_K2(j));
+				T = safe_add(bit_rol(T, rmd160_s2[j]), E2);
+				A2 = E2; E2 = D2; D2 = bit_rol(C2, 10); C2 = B2; B2 = T;
 			}
+			T = safe_add(h1, safe_add(C1, D2));
+			h1 = safe_add(h2, safe_add(D1, E2));
+			h2 = safe_add(h3, safe_add(E1, A2));
+			h3 = safe_add(h4, safe_add(A1, B2));
+			h4 = safe_add(h0, safe_add(B1, C2));
+			h0 = T;
+		}
+		return [h0, h1, h2, h3, h4];
+	}
 
-			function rmd160_f(j, x, y, z) {
-				return (0 <= j && j <= 15) ? (x ^ y ^ z) :
+	function rmd160_f(j, x, y, z) {
+		return (0 <= j && j <= 15) ? (x ^ y ^ z) :
 			(16 <= j && j <= 31) ? (x & y) | (~x & z) :
 			(32 <= j && j <= 47) ? (x | ~y) ^ z :
 			(48 <= j && j <= 63) ? (x & z) | (y & ~z) :
 			(64 <= j && j <= 79) ? x ^ (y | ~z) :
 			"rmd160_f: j out of range";
-			}
-			function rmd160_K1(j) {
-				return (0 <= j && j <= 15) ? 0x00000000 :
+	}
+	function rmd160_K1(j) {
+		return (0 <= j && j <= 15) ? 0x00000000 :
 			(16 <= j && j <= 31) ? 0x5a827999 :
 			(32 <= j && j <= 47) ? 0x6ed9eba1 :
 			(48 <= j && j <= 63) ? 0x8f1bbcdc :
 			(64 <= j && j <= 79) ? 0xa953fd4e :
 			"rmd160_K1: j out of range";
-			}
-			function rmd160_K2(j) {
-				return (0 <= j && j <= 15) ? 0x50a28be6 :
+	}
+	function rmd160_K2(j) {
+		return (0 <= j && j <= 15) ? 0x50a28be6 :
 			(16 <= j && j <= 31) ? 0x5c4dd124 :
 			(32 <= j && j <= 47) ? 0x6d703ef3 :
 			(48 <= j && j <= 63) ? 0x7a6d76e9 :
 			(64 <= j && j <= 79) ? 0x00000000 :
 			"rmd160_K2: j out of range";
-			}
-			var rmd160_r1 = [
+	}
+	var rmd160_r1 = [
 		0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
 		7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
 		3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,
 		1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,
 		4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13
 	];
-			var rmd160_r2 = [
+	var rmd160_r2 = [
 		5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,
 		6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,
 		15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,
 		8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,
 		12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11
 	];
-			var rmd160_s1 = [
+	var rmd160_s1 = [
 		11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,
 		7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,
 		11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,
 		11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,
 		9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6
 	];
-			var rmd160_s2 = [
+	var rmd160_s2 = [
 		8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,
 		9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,
 		9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,
@@ -1495,2583 +1492,2579 @@
 		8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11
 	];
 
-			/*
-			* Add integers, wrapping at 2^32. This uses 16-bit operations internally
-			* to work around bugs in some JS interpreters.
-			*/
-			function safe_add(x, y) {
-				var lsw = (x & 0xFFFF) + (y & 0xFFFF);
-				var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
-				return (msw << 16) | (lsw & 0xFFFF);
-			}
-
-			/*
-			* Bitwise rotate a 32-bit number to the left.
-			*/
-			function bit_rol(num, cnt) {
-				return (num << cnt) | (num >>> (32 - cnt));
-			}
-		})();
-	</script>
-	
-	<script type="text/javascript">
-	/*!
-	* Random number generator with ArcFour PRNG
-	* 
-	* NOTE: For best results, put code like
-	* <body onclick='SecureRandom.seedTime();' onkeypress='SecureRandom.seedTime();'>
-	* in your main HTML document.
-	* 
-	* Copyright Tom Wu, bitaddress.org  BSD License.
-	* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
+	/*
+	* Add integers, wrapping at 2^32. This uses 16-bit operations internally
+	* to work around bugs in some JS interpreters.
 	*/
-	(function () {
+	function safe_add(x, y) {
+		var lsw = (x & 0xFFFF) + (y & 0xFFFF);
+		var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
+		return (msw << 16) | (lsw & 0xFFFF);
+	}
 
-		// Constructor function of Global SecureRandom object
-		var sr = window.SecureRandom = function () { };
+	/*
+	* Bitwise rotate a 32-bit number to the left.
+	*/
+	function bit_rol(num, cnt) {
+		return (num << cnt) | (num >>> (32 - cnt));
+	}
+})();
+	</script>
+	<script type="text/javascript">
+/*!
+* Random number generator with ArcFour PRNG
+* 
+* NOTE: For best results, put code like
+* <body onclick='SecureRandom.seedTime();' onkeypress='SecureRandom.seedTime();'>
+* in your main HTML document.
+* 
+* Copyright Tom Wu, bitaddress.org  BSD License.
+* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
+*/
+(function () {
 
-		// Properties
-		sr.state;
-		sr.pool;
-		sr.pptr;
+	// Constructor function of Global SecureRandom object
+	var sr = window.SecureRandom = function () { };
 
-		// Pool size must be a multiple of 4 and greater than 32.
-		// An array of bytes the size of the pool will be passed to init()
-		sr.poolSize = 256;
+	// Properties
+	sr.state;
+	sr.pool;
+	sr.pptr;
+
+	// Pool size must be a multiple of 4 and greater than 32.
+	// An array of bytes the size of the pool will be passed to init()
+	sr.poolSize = 256;
 
 
-		// --- object methods ---
+	// --- object methods ---
 
-		// public method
-		// ba: byte array
-		sr.prototype.nextBytes = function (ba) {
-			var i;
-			for (i = 0; i < ba.length; ++i) ba[i] = sr.getByte();
-		};
+	// public method
+	// ba: byte array
+	sr.prototype.nextBytes = function (ba) {
+		var i;
+		for (i = 0; i < ba.length; ++i) ba[i] = sr.getByte();
+	};
 
 
-		// --- static methods ---
+	// --- static methods ---
 
-		// Mix in the current time (w/milliseconds) into the pool
-		// NOTE: this method should be called from body click/keypress event handlers to increase entropy
-		sr.seedTime = function () {
-			sr.seedInt(new Date().getTime());
-		}
+	// Mix in the current time (w/milliseconds) into the pool
+	// NOTE: this method should be called from body click/keypress event handlers to increase entropy
+	sr.seedTime = function () {
+		sr.seedInt(new Date().getTime());
+	}
 
-		sr.getByte = function () {
-			if (sr.state == null) {
-				sr.seedTime();
-				sr.state = sr.ArcFour(); // Plug in your RNG constructor here
-				sr.state.init(sr.pool);
-				for (sr.pptr = 0; sr.pptr < sr.pool.length; ++sr.pptr)
-					sr.pool[sr.pptr] = 0;
-				sr.pptr = 0;
-			}
-			// TODO: allow reseeding after first request
-			return sr.state.next();
-		}
-
-		// Mix in a 32-bit integer into the pool
-		sr.seedInt = function (x) {
-			sr.pool[sr.pptr++] ^= x & 255;
-			sr.pool[sr.pptr++] ^= (x >> 8) & 255;
-			sr.pool[sr.pptr++] ^= (x >> 16) & 255;
-			sr.pool[sr.pptr++] ^= (x >> 24) & 255;
-			if (sr.pptr >= sr.poolSize) sr.pptr -= sr.poolSize;
-		}
-
-
-		// Arcfour is a PRNG
-		sr.ArcFour = function () {
-			function Arcfour() {
-				this.i = 0;
-				this.j = 0;
-				this.S = new Array();
-			}
-
-			// Initialize arcfour context from key, an array of ints, each from [0..255]
-			function ARC4init(key) {
-				var i, j, t;
-				for (i = 0; i < 256; ++i)
-					this.S[i] = i;
-				j = 0;
-				for (i = 0; i < 256; ++i) {
-					j = (j + this.S[i] + key[i % key.length]) & 255;
-					t = this.S[i];
-					this.S[i] = this.S[j];
-					this.S[j] = t;
-				}
-				this.i = 0;
-				this.j = 0;
-			}
-
-			function ARC4next() {
-				var t;
-				this.i = (this.i + 1) & 255;
-				this.j = (this.j + this.S[this.i]) & 255;
-				t = this.S[this.i];
-				this.S[this.i] = this.S[this.j];
-				this.S[this.j] = t;
-				return this.S[(t + this.S[this.i]) & 255];
-			}
-
-			Arcfour.prototype.init = ARC4init;
-			Arcfour.prototype.next = ARC4next;
-
-			return new Arcfour();
-		};
-
-
-		// Initialize the pool with junk if needed.
-		if (sr.pool == null) {
-			sr.pool = new Array();
-			sr.pptr = 0;
-			var t;
-			// Use webcrypto if available;
-			// see http://www.w3.org/2012/webcrypto/WebCryptoAPI/#Crypto-method-getRandomValues
-			if (window.crypto && window.crypto.getRandomValues) {
-				sr.pool = new Uint8Array(sr.poolSize);
-				window.crypto.getRandomValues(sr.pool);
-				sr.pptr = sr.poolSize;
-			}
-			else if (navigator.appName == "Netscape" && navigator.appVersion < "5" && window.crypto) {
-				// Extract entropy (256 bits) from NS4 RNG if available
-				var z = window.crypto.random(32);
-				for (t = 0; t < z.length; ++t)
-					sr.pool[sr.pptr++] = z.charCodeAt(t) & 255;
-			}
-			while (sr.pptr < sr.poolSize) {  // extract some randomness from Math.random()
-				t = Math.floor(65536 * Math.random());
-				sr.pool[sr.pptr++] = t >>> 8;
-				sr.pool[sr.pptr++] = t & 255;
-			}
-			sr.pptr = 0;
+	sr.getByte = function () {
+		if (sr.state == null) {
 			sr.seedTime();
-			// entropy
-			sr.seedInt(window.screenX);
-			sr.seedInt(window.screenY);
+			sr.state = sr.ArcFour(); // Plug in your RNG constructor here
+			sr.state.init(sr.pool);
+			for (sr.pptr = 0; sr.pptr < sr.pool.length; ++sr.pptr)
+				sr.pool[sr.pptr] = 0;
+			sr.pptr = 0;
 		}
-	})();
+		// TODO: allow reseeding after first request
+		return sr.state.next();
+	}
+
+	// Mix in a 32-bit integer into the pool
+	sr.seedInt = function (x) {
+		sr.pool[sr.pptr++] ^= x & 255;
+		sr.pool[sr.pptr++] ^= (x >> 8) & 255;
+		sr.pool[sr.pptr++] ^= (x >> 16) & 255;
+		sr.pool[sr.pptr++] ^= (x >> 24) & 255;
+		if (sr.pptr >= sr.poolSize) sr.pptr -= sr.poolSize;
+	}
+
+
+	// Arcfour is a PRNG
+	sr.ArcFour = function () {
+		function Arcfour() {
+			this.i = 0;
+			this.j = 0;
+			this.S = new Array();
+		}
+
+		// Initialize arcfour context from key, an array of ints, each from [0..255]
+		function ARC4init(key) {
+			var i, j, t;
+			for (i = 0; i < 256; ++i)
+				this.S[i] = i;
+			j = 0;
+			for (i = 0; i < 256; ++i) {
+				j = (j + this.S[i] + key[i % key.length]) & 255;
+				t = this.S[i];
+				this.S[i] = this.S[j];
+				this.S[j] = t;
+			}
+			this.i = 0;
+			this.j = 0;
+		}
+
+		function ARC4next() {
+			var t;
+			this.i = (this.i + 1) & 255;
+			this.j = (this.j + this.S[this.i]) & 255;
+			t = this.S[this.i];
+			this.S[this.i] = this.S[this.j];
+			this.S[this.j] = t;
+			return this.S[(t + this.S[this.i]) & 255];
+		}
+
+		Arcfour.prototype.init = ARC4init;
+		Arcfour.prototype.next = ARC4next;
+
+		return new Arcfour();
+	};
+
+
+	// Initialize the pool with junk if needed.
+	if (sr.pool == null) {
+		sr.pool = new Array();
+		sr.pptr = 0;
+		var t;
+		// Use webcrypto if available; -- Thanks to Gavin Andresen for this contribution
+		// see http://www.w3.org/2012/webcrypto/WebCryptoAPI/#Crypto-method-getRandomValues
+		if (window.crypto && window.crypto.getRandomValues) {
+			sr.pool = new Uint8Array(sr.poolSize);
+			window.crypto.getRandomValues(sr.pool);
+			sr.pptr = sr.poolSize;
+		}
+		else if (navigator.appName == "Netscape" && navigator.appVersion < "5" && window.crypto) {
+			// Extract entropy (256 bits) from NS4 RNG if available
+			var z = window.crypto.random(32);
+			for (t = 0; t < z.length; ++t)
+				sr.pool[sr.pptr++] = z.charCodeAt(t) & 255;
+		}
+		while (sr.pptr < sr.poolSize) {  // extract some randomness from Math.random()
+			t = Math.floor(65536 * Math.random());
+			sr.pool[sr.pptr++] = t >>> 8;
+			sr.pool[sr.pptr++] = t & 255;
+		}
+		sr.pptr = 0;
+		sr.seedTime();
+		// entropy
+		sr.seedInt(window.screenX);
+		sr.seedInt(window.screenY);
+	}
+})();
 	</script>
-
 	<script type="text/javascript">
-	//https://raw.github.com/bitcoinjs/bitcoinjs-lib/faa10f0f6a1fff0b9a99fffb9bc30cee33b17212/src/ecdsa.js
-	/*!
-	* Basic Javascript Elliptic Curve implementation
-	* Ported loosely from BouncyCastle's Java EC code
-	* Only Fp curves implemented for now
+//https://raw.github.com/bitcoinjs/bitcoinjs-lib/faa10f0f6a1fff0b9a99fffb9bc30cee33b17212/src/ecdsa.js
+/*!
+* Basic Javascript Elliptic Curve implementation
+* Ported loosely from BouncyCastle's Java EC code
+* Only Fp curves implemented for now
+* 
+* Copyright Tom Wu, bitaddress.org  BSD License.
+* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
+*/
+(function () {
+
+	// Constructor function of Global EllipticCurve object
+	var ec = window.EllipticCurve = function () { };
+
+
+	// ----------------
+	// ECFieldElementFp constructor
+	// q instanceof BigInteger
+	// x instanceof BigInteger
+	ec.FieldElementFp = function (q, x) {
+		this.x = x;
+		// TODO if(x.compareTo(q) >= 0) error
+		this.q = q;
+	};
+
+	ec.FieldElementFp.prototype.equals = function (other) {
+		if (other == this) return true;
+		return (this.q.equals(other.q) && this.x.equals(other.x));
+	};
+
+	ec.FieldElementFp.prototype.toBigInteger = function () {
+		return this.x;
+	};
+
+	ec.FieldElementFp.prototype.negate = function () {
+		return new ec.FieldElementFp(this.q, this.x.negate().mod(this.q));
+	};
+
+	ec.FieldElementFp.prototype.add = function (b) {
+		return new ec.FieldElementFp(this.q, this.x.add(b.toBigInteger()).mod(this.q));
+	};
+
+	ec.FieldElementFp.prototype.subtract = function (b) {
+		return new ec.FieldElementFp(this.q, this.x.subtract(b.toBigInteger()).mod(this.q));
+	};
+
+	ec.FieldElementFp.prototype.multiply = function (b) {
+		return new ec.FieldElementFp(this.q, this.x.multiply(b.toBigInteger()).mod(this.q));
+	};
+
+	ec.FieldElementFp.prototype.square = function () {
+		return new ec.FieldElementFp(this.q, this.x.square().mod(this.q));
+	};
+
+	ec.FieldElementFp.prototype.divide = function (b) {
+		return new ec.FieldElementFp(this.q, this.x.multiply(b.toBigInteger().modInverse(this.q)).mod(this.q));
+	};
+
+	ec.FieldElementFp.prototype.getByteLength = function () {
+		return Math.floor((this.toBigInteger().bitLength() + 7) / 8);
+	};
+
+	// D.1.4 91
+	/**
+	* return a sqrt root - the routine verifies that the calculation
+	* returns the right value - if none exists it returns null.
 	* 
-	* Copyright Tom Wu, bitaddress.org  BSD License.
-	* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
+	* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
+	* Ported to JavaScript by bitaddress.org
 	*/
-	(function () {
-
-		// Constructor function of Global EllipticCurve object
-		var ec = window.EllipticCurve = function () { };
-
-
-		// ----------------
-		// ECFieldElementFp constructor
-		// q instanceof BigInteger
-		// x instanceof BigInteger
-		ec.FieldElementFp = function (q, x) {
-			this.x = x;
-			// TODO if(x.compareTo(q) >= 0) error
-			this.q = q;
-		};
-
-		ec.FieldElementFp.prototype.equals = function (other) {
-			if (other == this) return true;
-			return (this.q.equals(other.q) && this.x.equals(other.x));
-		};
-
-		ec.FieldElementFp.prototype.toBigInteger = function () {
-			return this.x;
-		};
-
-		ec.FieldElementFp.prototype.negate = function () {
-			return new ec.FieldElementFp(this.q, this.x.negate().mod(this.q));
-		};
-
-		ec.FieldElementFp.prototype.add = function (b) {
-			return new ec.FieldElementFp(this.q, this.x.add(b.toBigInteger()).mod(this.q));
-		};
-
-		ec.FieldElementFp.prototype.subtract = function (b) {
-			return new ec.FieldElementFp(this.q, this.x.subtract(b.toBigInteger()).mod(this.q));
-		};
-
-		ec.FieldElementFp.prototype.multiply = function (b) {
-			return new ec.FieldElementFp(this.q, this.x.multiply(b.toBigInteger()).mod(this.q));
-		};
-
-		ec.FieldElementFp.prototype.square = function () {
-			return new ec.FieldElementFp(this.q, this.x.square().mod(this.q));
-		};
-
-		ec.FieldElementFp.prototype.divide = function (b) {
-			return new ec.FieldElementFp(this.q, this.x.multiply(b.toBigInteger().modInverse(this.q)).mod(this.q));
-		};
-
-		ec.FieldElementFp.prototype.getByteLength = function () {
-			return Math.floor((this.toBigInteger().bitLength() + 7) / 8);
-		};
-
-		// D.1.4 91
-		/**
-		* return a sqrt root - the routine verifies that the calculation
-		* returns the right value - if none exists it returns null.
-		* 
-		* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
-		* Ported to JavaScript by bitaddress.org
-		*/
-		ec.FieldElementFp.prototype.sqrt = function () {
-			if (!this.q.testBit(0)) throw new Error("even value of q");
-
-			// p mod 4 == 3
-			if (this.q.testBit(1)) {
-				// z = g^(u+1) + p, p = 4u + 3
-				var z = new ec.FieldElementFp(this.q, this.x.modPow(this.q.shiftRight(2).add(BigInteger.ONE), this.q));
-				return z.square().equals(this) ? z : null;
-			}
-
-			// p mod 4 == 1
-			var qMinusOne = this.q.subtract(BigInteger.ONE);
-			var legendreExponent = qMinusOne.shiftRight(1);
-			if (!(this.x.modPow(legendreExponent, this.q).equals(BigInteger.ONE))) return null;
-			var u = qMinusOne.shiftRight(2);
-			var k = u.shiftLeft(1).add(BigInteger.ONE);
-			var Q = this.x;
-			var fourQ = Q.shiftLeft(2).mod(this.q);
-			var U, V;
-
-			do {
-				var rand = new SecureRandom();
-				var P;
-				do {
-					P = new BigInteger(this.q.bitLength(), rand);
-				}
-				while (P.compareTo(this.q) >= 0 || !(P.multiply(P).subtract(fourQ).modPow(legendreExponent, this.q).equals(qMinusOne)));
-
-				var result = ec.FieldElementFp.fastLucasSequence(this.q, P, Q, k);
-
-				U = result[0];
-				V = result[1];
-				if (V.multiply(V).mod(this.q).equals(fourQ)) {
-					// Integer division by 2, mod q
-					if (V.testBit(0)) {
-						V = V.add(this.q);
-					}
-					V = V.shiftRight(1);
-					return new ec.FieldElementFp(this.q, V);
-				}
-			}
-			while (U.equals(BigInteger.ONE) || U.equals(qMinusOne));
-
-			return null;
-		};
-
-		/*
-		* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
-		* Ported to JavaScript by bitaddress.org
-		*/
-		ec.FieldElementFp.fastLucasSequence = function (p, P, Q, k) {
-			// TODO Research and apply "common-multiplicand multiplication here"
-
-			var n = k.bitLength();
-			var s = k.getLowestSetBit();
-			var Uh = BigInteger.ONE;
-			var Vl = BigInteger.TWO;
-			var Vh = P;
-			var Ql = BigInteger.ONE;
-			var Qh = BigInteger.ONE;
-
-			for (var j = n - 1; j >= s + 1; --j) {
-				Ql = Ql.multiply(Qh).mod(p);
-				if (k.testBit(j)) {
-					Qh = Ql.multiply(Q).mod(p);
-					Uh = Uh.multiply(Vh).mod(p);
-					Vl = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
-					Vh = Vh.multiply(Vh).subtract(Qh.shiftLeft(1)).mod(p);
-				}
-				else {
-					Qh = Ql;
-					Uh = Uh.multiply(Vl).subtract(Ql).mod(p);
-					Vh = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
-					Vl = Vl.multiply(Vl).subtract(Ql.shiftLeft(1)).mod(p);
-				}
-			}
-
-			Ql = Ql.multiply(Qh).mod(p);
-			Qh = Ql.multiply(Q).mod(p);
-			Uh = Uh.multiply(Vl).subtract(Ql).mod(p);
-			Vl = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
-			Ql = Ql.multiply(Qh).mod(p);
-
-			for (var j = 1; j <= s; ++j) {
-				Uh = Uh.multiply(Vl).mod(p);
-				Vl = Vl.multiply(Vl).subtract(Ql.shiftLeft(1)).mod(p);
-				Ql = Ql.multiply(Ql).mod(p);
-			}
-
-			return [Uh, Vl];
-		};
-
-		// ----------------
-		// ECPointFp constructor
-		ec.PointFp = function (curve, x, y, z, compressed) {
-			this.curve = curve;
-			this.x = x;
-			this.y = y;
-			// Projective coordinates: either zinv == null or z * zinv == 1
-			// z and zinv are just BigIntegers, not fieldElements
-			if (z == null) {
-				this.z = BigInteger.ONE;
-			}
-			else {
-				this.z = z;
-			}
-			this.zinv = null;
-			// compression flag
-			this.compressed = !!compressed;
-		};
-
-		ec.PointFp.prototype.getX = function () {
-			if (this.zinv == null) {
-				this.zinv = this.z.modInverse(this.curve.q);
-			}
-			return this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
-		};
-
-		ec.PointFp.prototype.getY = function () {
-			if (this.zinv == null) {
-				this.zinv = this.z.modInverse(this.curve.q);
-			}
-			return this.curve.fromBigInteger(this.y.toBigInteger().multiply(this.zinv).mod(this.curve.q));
-		};
-
-		ec.PointFp.prototype.equals = function (other) {
-			if (other == this) return true;
-			if (this.isInfinity()) return other.isInfinity();
-			if (other.isInfinity()) return this.isInfinity();
-			var u, v;
-			// u = Y2 * Z1 - Y1 * Z2
-			u = other.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(other.z)).mod(this.curve.q);
-			if (!u.equals(BigInteger.ZERO)) return false;
-			// v = X2 * Z1 - X1 * Z2
-			v = other.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(other.z)).mod(this.curve.q);
-			return v.equals(BigInteger.ZERO);
-		};
-
-		ec.PointFp.prototype.isInfinity = function () {
-			if ((this.x == null) && (this.y == null)) return true;
-			return this.z.equals(BigInteger.ZERO) && !this.y.toBigInteger().equals(BigInteger.ZERO);
-		};
-
-		ec.PointFp.prototype.negate = function () {
-			return new ec.PointFp(this.curve, this.x, this.y.negate(), this.z);
-		};
-
-		ec.PointFp.prototype.add = function (b) {
-			if (this.isInfinity()) return b;
-			if (b.isInfinity()) return this;
-
-			// u = Y2 * Z1 - Y1 * Z2
-			var u = b.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(b.z)).mod(this.curve.q);
-			// v = X2 * Z1 - X1 * Z2
-			var v = b.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(b.z)).mod(this.curve.q);
-
-
-			if (BigInteger.ZERO.equals(v)) {
-				if (BigInteger.ZERO.equals(u)) {
-					return this.twice(); // this == b, so double
-				}
-				return this.curve.getInfinity(); // this = -b, so infinity
-			}
-
-			var THREE = new BigInteger("3");
-			var x1 = this.x.toBigInteger();
-			var y1 = this.y.toBigInteger();
-			var x2 = b.x.toBigInteger();
-			var y2 = b.y.toBigInteger();
-
-			var v2 = v.square();
-			var v3 = v2.multiply(v);
-			var x1v2 = x1.multiply(v2);
-			var zu2 = u.square().multiply(this.z);
-
-			// x3 = v * (z2 * (z1 * u^2 - 2 * x1 * v^2) - v^3)
-			var x3 = zu2.subtract(x1v2.shiftLeft(1)).multiply(b.z).subtract(v3).multiply(v).mod(this.curve.q);
-			// y3 = z2 * (3 * x1 * u * v^2 - y1 * v^3 - z1 * u^3) + u * v^3
-			var y3 = x1v2.multiply(THREE).multiply(u).subtract(y1.multiply(v3)).subtract(zu2.multiply(u)).multiply(b.z).add(u.multiply(v3)).mod(this.curve.q);
-			// z3 = v^3 * z1 * z2
-			var z3 = v3.multiply(this.z).multiply(b.z).mod(this.curve.q);
-
-			return new ec.PointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3), z3);
-		};
-
-		ec.PointFp.prototype.twice = function () {
-			if (this.isInfinity()) return this;
-			if (this.y.toBigInteger().signum() == 0) return this.curve.getInfinity();
-
-			// TODO: optimized handling of constants
-			var THREE = new BigInteger("3");
-			var x1 = this.x.toBigInteger();
-			var y1 = this.y.toBigInteger();
-
-			var y1z1 = y1.multiply(this.z);
-			var y1sqz1 = y1z1.multiply(y1).mod(this.curve.q);
-			var a = this.curve.a.toBigInteger();
-
-			// w = 3 * x1^2 + a * z1^2
-			var w = x1.square().multiply(THREE);
-			if (!BigInteger.ZERO.equals(a)) {
-				w = w.add(this.z.square().multiply(a));
-			}
-			w = w.mod(this.curve.q);
-			// x3 = 2 * y1 * z1 * (w^2 - 8 * x1 * y1^2 * z1)
-			var x3 = w.square().subtract(x1.shiftLeft(3).multiply(y1sqz1)).shiftLeft(1).multiply(y1z1).mod(this.curve.q);
-			// y3 = 4 * y1^2 * z1 * (3 * w * x1 - 2 * y1^2 * z1) - w^3
-			var y3 = w.multiply(THREE).multiply(x1).subtract(y1sqz1.shiftLeft(1)).shiftLeft(2).multiply(y1sqz1).subtract(w.square().multiply(w)).mod(this.curve.q);
-			// z3 = 8 * (y1 * z1)^3
-			var z3 = y1z1.square().multiply(y1z1).shiftLeft(3).mod(this.curve.q);
-
-			return new ec.PointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3), z3);
-		};
-
-		// Simple NAF (Non-Adjacent Form) multiplication algorithm
-		// TODO: modularize the multiplication algorithm
-		ec.PointFp.prototype.multiply = function (k) {
-			if (this.isInfinity()) return this;
-			if (k.signum() == 0) return this.curve.getInfinity();
-
-			var e = k;
-			var h = e.multiply(new BigInteger("3"));
-
-			var neg = this.negate();
-			var R = this;
-
-			var i;
-			for (i = h.bitLength() - 2; i > 0; --i) {
-				R = R.twice();
-
-				var hBit = h.testBit(i);
-				var eBit = e.testBit(i);
-
-				if (hBit != eBit) {
-					R = R.add(hBit ? this : neg);
-				}
-			}
-
-			return R;
-		};
-
-		// Compute this*j + x*k (simultaneous multiplication)
-		ec.PointFp.prototype.multiplyTwo = function (j, x, k) {
-			var i;
-			if (j.bitLength() > k.bitLength())
-				i = j.bitLength() - 1;
-			else
-				i = k.bitLength() - 1;
-
-			var R = this.curve.getInfinity();
-			var both = this.add(x);
-			while (i >= 0) {
-				R = R.twice();
-				if (j.testBit(i)) {
-					if (k.testBit(i)) {
-						R = R.add(both);
-					}
-					else {
-						R = R.add(this);
-					}
-				}
-				else {
-					if (k.testBit(i)) {
-						R = R.add(x);
-					}
-				}
-				--i;
-			}
-
-			return R;
-		};
-
-		// patched by bitaddress.org and Casascius for use with Bitcoin.ECKey
-		// patched by coretechs to support compressed public keys
-		ec.PointFp.prototype.getEncoded = function (compressed) {
-			var x = this.getX().toBigInteger();
-			var y = this.getY().toBigInteger();
-			var len = 32; // integerToBytes will zero pad if integer is less than 32 bytes. 32 bytes length is required by the Bitcoin protocol.
-			var enc = ec.integerToBytes(x, len);
-
-			// when compressed prepend byte depending if y point is even or odd 
-			if (compressed) {
-				if (y.isEven()) {
-					enc.unshift(0x02);
-				}
-				else {
-					enc.unshift(0x03);
-				}
-			}
-			else {
-				enc.unshift(0x04);
-				enc = enc.concat(ec.integerToBytes(y, len)); // uncompressed public key appends the bytes of the y point
-			}
-			return enc;
-		};
-
-		ec.PointFp.decodeFrom = function (curve, enc) {
-			var type = enc[0];
-			var dataLen = enc.length - 1;
-
-			// Extract x and y as byte arrays
-			var xBa = enc.slice(1, 1 + dataLen / 2);
-			var yBa = enc.slice(1 + dataLen / 2, 1 + dataLen);
-
-			// Prepend zero byte to prevent interpretation as negative integer
-			xBa.unshift(0);
-			yBa.unshift(0);
-
-			// Convert to BigIntegers
-			var x = new BigInteger(xBa);
-			var y = new BigInteger(yBa);
-
-			// Return point
-			return new ec.PointFp(curve, curve.fromBigInteger(x), curve.fromBigInteger(y));
-		};
-
-		ec.PointFp.prototype.add2D = function (b) {
-			if (this.isInfinity()) return b;
-			if (b.isInfinity()) return this;
-
-			if (this.x.equals(b.x)) {
-				if (this.y.equals(b.y)) {
-					// this = b, i.e. this must be doubled
-					return this.twice();
-				}
-				// this = -b, i.e. the result is the point at infinity
-				return this.curve.getInfinity();
-			}
-
-			var x_x = b.x.subtract(this.x);
-			var y_y = b.y.subtract(this.y);
-			var gamma = y_y.divide(x_x);
-
-			var x3 = gamma.square().subtract(this.x).subtract(b.x);
-			var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
-
-			return new ec.PointFp(this.curve, x3, y3);
-		};
-
-		ec.PointFp.prototype.twice2D = function () {
-			if (this.isInfinity()) return this;
-			if (this.y.toBigInteger().signum() == 0) {
-				// if y1 == 0, then (x1, y1) == (x1, -y1)
-				// and hence this = -this and thus 2(x1, y1) == infinity
-				return this.curve.getInfinity();
-			}
-
-			var TWO = this.curve.fromBigInteger(BigInteger.valueOf(2));
-			var THREE = this.curve.fromBigInteger(BigInteger.valueOf(3));
-			var gamma = this.x.square().multiply(THREE).add(this.curve.a).divide(this.y.multiply(TWO));
-
-			var x3 = gamma.square().subtract(this.x.multiply(TWO));
-			var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
-
-			return new ec.PointFp(this.curve, x3, y3);
-		};
-
-		ec.PointFp.prototype.multiply2D = function (k) {
-			if (this.isInfinity()) return this;
-			if (k.signum() == 0) return this.curve.getInfinity();
-
-			var e = k;
-			var h = e.multiply(new BigInteger("3"));
-
-			var neg = this.negate();
-			var R = this;
-
-			var i;
-			for (i = h.bitLength() - 2; i > 0; --i) {
-				R = R.twice();
-
-				var hBit = h.testBit(i);
-				var eBit = e.testBit(i);
-
-				if (hBit != eBit) {
-					R = R.add2D(hBit ? this : neg);
-				}
-			}
-
-			return R;
-		};
-
-		ec.PointFp.prototype.isOnCurve = function () {
-			var x = this.getX().toBigInteger();
-			var y = this.getY().toBigInteger();
-			var a = this.curve.getA().toBigInteger();
-			var b = this.curve.getB().toBigInteger();
-			var n = this.curve.getQ();
-			var lhs = y.multiply(y).mod(n);
-			var rhs = x.multiply(x).multiply(x).add(a.multiply(x)).add(b).mod(n);
-			return lhs.equals(rhs);
-		};
-
-		ec.PointFp.prototype.toString = function () {
-			return '(' + this.getX().toBigInteger().toString() + ',' + this.getY().toBigInteger().toString() + ')';
-		};
-
-		/**
-		* Validate an elliptic curve point.
-		*
-		* See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive
-		*/
-		ec.PointFp.prototype.validate = function () {
-			var n = this.curve.getQ();
-
-			// Check Q != O
-			if (this.isInfinity()) {
-				throw new Error("Point is at infinity.");
-			}
-
-			// Check coordinate bounds
-			var x = this.getX().toBigInteger();
-			var y = this.getY().toBigInteger();
-			if (x.compareTo(BigInteger.ONE) < 0 || x.compareTo(n.subtract(BigInteger.ONE)) > 0) {
-				throw new Error('x coordinate out of bounds');
-			}
-			if (y.compareTo(BigInteger.ONE) < 0 || y.compareTo(n.subtract(BigInteger.ONE)) > 0) {
-				throw new Error('y coordinate out of bounds');
-			}
-
-			// Check y^2 = x^3 + ax + b (mod n)
-			if (!this.isOnCurve()) {
-				throw new Error("Point is not on the curve.");
-			}
-
-			// Check nQ = 0 (Q is a scalar multiple of G)
-			if (this.multiply(n).isInfinity()) {
-				// TODO: This check doesn't work - fix.
-				throw new Error("Point is not a scalar multiple of G.");
-			}
-
-			return true;
-		};
-
-
-
-
-		// ----------------
-		// ECCurveFp constructor
-		ec.CurveFp = function (q, a, b) {
-			this.q = q;
-			this.a = this.fromBigInteger(a);
-			this.b = this.fromBigInteger(b);
-			this.infinity = new ec.PointFp(this, null, null);
+	ec.FieldElementFp.prototype.sqrt = function () {
+		if (!this.q.testBit(0)) throw new Error("even value of q");
+
+		// p mod 4 == 3
+		if (this.q.testBit(1)) {
+			// z = g^(u+1) + p, p = 4u + 3
+			var z = new ec.FieldElementFp(this.q, this.x.modPow(this.q.shiftRight(2).add(BigInteger.ONE), this.q));
+			return z.square().equals(this) ? z : null;
 		}
 
-		ec.CurveFp.prototype.getQ = function () {
-			return this.q;
-		};
+		// p mod 4 == 1
+		var qMinusOne = this.q.subtract(BigInteger.ONE);
+		var legendreExponent = qMinusOne.shiftRight(1);
+		if (!(this.x.modPow(legendreExponent, this.q).equals(BigInteger.ONE))) return null;
+		var u = qMinusOne.shiftRight(2);
+		var k = u.shiftLeft(1).add(BigInteger.ONE);
+		var Q = this.x;
+		var fourQ = Q.shiftLeft(2).mod(this.q);
+		var U, V;
 
-		ec.CurveFp.prototype.getA = function () {
-			return this.a;
-		};
+		do {
+			var rand = new SecureRandom();
+			var P;
+			do {
+				P = new BigInteger(this.q.bitLength(), rand);
+			}
+			while (P.compareTo(this.q) >= 0 || !(P.multiply(P).subtract(fourQ).modPow(legendreExponent, this.q).equals(qMinusOne)));
 
-		ec.CurveFp.prototype.getB = function () {
-			return this.b;
-		};
+			var result = ec.FieldElementFp.fastLucasSequence(this.q, P, Q, k);
 
-		ec.CurveFp.prototype.equals = function (other) {
-			if (other == this) return true;
-			return (this.q.equals(other.q) && this.a.equals(other.a) && this.b.equals(other.b));
-		};
+			U = result[0];
+			V = result[1];
+			if (V.multiply(V).mod(this.q).equals(fourQ)) {
+				// Integer division by 2, mod q
+				if (V.testBit(0)) {
+					V = V.add(this.q);
+				}
+				V = V.shiftRight(1);
+				return new ec.FieldElementFp(this.q, V);
+			}
+		}
+		while (U.equals(BigInteger.ONE) || U.equals(qMinusOne));
 
-		ec.CurveFp.prototype.getInfinity = function () {
-			return this.infinity;
-		};
+		return null;
+	};
 
-		ec.CurveFp.prototype.fromBigInteger = function (x) {
-			return new ec.FieldElementFp(this.q, x);
-		};
+	/*
+	* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
+	* Ported to JavaScript by bitaddress.org
+	*/
+	ec.FieldElementFp.fastLucasSequence = function (p, P, Q, k) {
+		// TODO Research and apply "common-multiplicand multiplication here"
 
-		// for now, work with hex strings because they're easier in JS
-		// compressed support added by bitaddress.org
-		ec.CurveFp.prototype.decodePointHex = function (s) {
-			var firstByte = parseInt(s.substr(0, 2), 16);
-			switch (firstByte) { // first byte
-				case 0:
-					return this.infinity;
-				case 2: // compressed
-				case 3: // compressed
-					var yTilde = firstByte & 1;
-					var xHex = s.substr(2, s.length - 2);
-					var X1 = new BigInteger(xHex, 16);
-					return this.decompressPoint(yTilde, X1);
-				case 4: // uncompressed
-				case 6: // hybrid
-				case 7: // hybrid
-					var len = (s.length - 2) / 2;
-					var xHex = s.substr(2, len);
-					var yHex = s.substr(len + 2, len);
+		var n = k.bitLength();
+		var s = k.getLowestSetBit();
+		var Uh = BigInteger.ONE;
+		var Vl = BigInteger.TWO;
+		var Vh = P;
+		var Ql = BigInteger.ONE;
+		var Qh = BigInteger.ONE;
 
-					return new ec.PointFp(this,
+		for (var j = n - 1; j >= s + 1; --j) {
+			Ql = Ql.multiply(Qh).mod(p);
+			if (k.testBit(j)) {
+				Qh = Ql.multiply(Q).mod(p);
+				Uh = Uh.multiply(Vh).mod(p);
+				Vl = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
+				Vh = Vh.multiply(Vh).subtract(Qh.shiftLeft(1)).mod(p);
+			}
+			else {
+				Qh = Ql;
+				Uh = Uh.multiply(Vl).subtract(Ql).mod(p);
+				Vh = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
+				Vl = Vl.multiply(Vl).subtract(Ql.shiftLeft(1)).mod(p);
+			}
+		}
+
+		Ql = Ql.multiply(Qh).mod(p);
+		Qh = Ql.multiply(Q).mod(p);
+		Uh = Uh.multiply(Vl).subtract(Ql).mod(p);
+		Vl = Vh.multiply(Vl).subtract(P.multiply(Ql)).mod(p);
+		Ql = Ql.multiply(Qh).mod(p);
+
+		for (var j = 1; j <= s; ++j) {
+			Uh = Uh.multiply(Vl).mod(p);
+			Vl = Vl.multiply(Vl).subtract(Ql.shiftLeft(1)).mod(p);
+			Ql = Ql.multiply(Ql).mod(p);
+		}
+
+		return [Uh, Vl];
+	};
+
+	// ----------------
+	// ECPointFp constructor
+	ec.PointFp = function (curve, x, y, z, compressed) {
+		this.curve = curve;
+		this.x = x;
+		this.y = y;
+		// Projective coordinates: either zinv == null or z * zinv == 1
+		// z and zinv are just BigIntegers, not fieldElements
+		if (z == null) {
+			this.z = BigInteger.ONE;
+		}
+		else {
+			this.z = z;
+		}
+		this.zinv = null;
+		// compression flag
+		this.compressed = !!compressed;
+	};
+
+	ec.PointFp.prototype.getX = function () {
+		if (this.zinv == null) {
+			this.zinv = this.z.modInverse(this.curve.q);
+		}
+		return this.curve.fromBigInteger(this.x.toBigInteger().multiply(this.zinv).mod(this.curve.q));
+	};
+
+	ec.PointFp.prototype.getY = function () {
+		if (this.zinv == null) {
+			this.zinv = this.z.modInverse(this.curve.q);
+		}
+		return this.curve.fromBigInteger(this.y.toBigInteger().multiply(this.zinv).mod(this.curve.q));
+	};
+
+	ec.PointFp.prototype.equals = function (other) {
+		if (other == this) return true;
+		if (this.isInfinity()) return other.isInfinity();
+		if (other.isInfinity()) return this.isInfinity();
+		var u, v;
+		// u = Y2 * Z1 - Y1 * Z2
+		u = other.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(other.z)).mod(this.curve.q);
+		if (!u.equals(BigInteger.ZERO)) return false;
+		// v = X2 * Z1 - X1 * Z2
+		v = other.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(other.z)).mod(this.curve.q);
+		return v.equals(BigInteger.ZERO);
+	};
+
+	ec.PointFp.prototype.isInfinity = function () {
+		if ((this.x == null) && (this.y == null)) return true;
+		return this.z.equals(BigInteger.ZERO) && !this.y.toBigInteger().equals(BigInteger.ZERO);
+	};
+
+	ec.PointFp.prototype.negate = function () {
+		return new ec.PointFp(this.curve, this.x, this.y.negate(), this.z);
+	};
+
+	ec.PointFp.prototype.add = function (b) {
+		if (this.isInfinity()) return b;
+		if (b.isInfinity()) return this;
+
+		// u = Y2 * Z1 - Y1 * Z2
+		var u = b.y.toBigInteger().multiply(this.z).subtract(this.y.toBigInteger().multiply(b.z)).mod(this.curve.q);
+		// v = X2 * Z1 - X1 * Z2
+		var v = b.x.toBigInteger().multiply(this.z).subtract(this.x.toBigInteger().multiply(b.z)).mod(this.curve.q);
+
+
+		if (BigInteger.ZERO.equals(v)) {
+			if (BigInteger.ZERO.equals(u)) {
+				return this.twice(); // this == b, so double
+			}
+			return this.curve.getInfinity(); // this = -b, so infinity
+		}
+
+		var THREE = new BigInteger("3");
+		var x1 = this.x.toBigInteger();
+		var y1 = this.y.toBigInteger();
+		var x2 = b.x.toBigInteger();
+		var y2 = b.y.toBigInteger();
+
+		var v2 = v.square();
+		var v3 = v2.multiply(v);
+		var x1v2 = x1.multiply(v2);
+		var zu2 = u.square().multiply(this.z);
+
+		// x3 = v * (z2 * (z1 * u^2 - 2 * x1 * v^2) - v^3)
+		var x3 = zu2.subtract(x1v2.shiftLeft(1)).multiply(b.z).subtract(v3).multiply(v).mod(this.curve.q);
+		// y3 = z2 * (3 * x1 * u * v^2 - y1 * v^3 - z1 * u^3) + u * v^3
+		var y3 = x1v2.multiply(THREE).multiply(u).subtract(y1.multiply(v3)).subtract(zu2.multiply(u)).multiply(b.z).add(u.multiply(v3)).mod(this.curve.q);
+		// z3 = v^3 * z1 * z2
+		var z3 = v3.multiply(this.z).multiply(b.z).mod(this.curve.q);
+
+		return new ec.PointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3), z3);
+	};
+
+	ec.PointFp.prototype.twice = function () {
+		if (this.isInfinity()) return this;
+		if (this.y.toBigInteger().signum() == 0) return this.curve.getInfinity();
+
+		// TODO: optimized handling of constants
+		var THREE = new BigInteger("3");
+		var x1 = this.x.toBigInteger();
+		var y1 = this.y.toBigInteger();
+
+		var y1z1 = y1.multiply(this.z);
+		var y1sqz1 = y1z1.multiply(y1).mod(this.curve.q);
+		var a = this.curve.a.toBigInteger();
+
+		// w = 3 * x1^2 + a * z1^2
+		var w = x1.square().multiply(THREE);
+		if (!BigInteger.ZERO.equals(a)) {
+			w = w.add(this.z.square().multiply(a));
+		}
+		w = w.mod(this.curve.q);
+		// x3 = 2 * y1 * z1 * (w^2 - 8 * x1 * y1^2 * z1)
+		var x3 = w.square().subtract(x1.shiftLeft(3).multiply(y1sqz1)).shiftLeft(1).multiply(y1z1).mod(this.curve.q);
+		// y3 = 4 * y1^2 * z1 * (3 * w * x1 - 2 * y1^2 * z1) - w^3
+		var y3 = w.multiply(THREE).multiply(x1).subtract(y1sqz1.shiftLeft(1)).shiftLeft(2).multiply(y1sqz1).subtract(w.square().multiply(w)).mod(this.curve.q);
+		// z3 = 8 * (y1 * z1)^3
+		var z3 = y1z1.square().multiply(y1z1).shiftLeft(3).mod(this.curve.q);
+
+		return new ec.PointFp(this.curve, this.curve.fromBigInteger(x3), this.curve.fromBigInteger(y3), z3);
+	};
+
+	// Simple NAF (Non-Adjacent Form) multiplication algorithm
+	// TODO: modularize the multiplication algorithm
+	ec.PointFp.prototype.multiply = function (k) {
+		if (this.isInfinity()) return this;
+		if (k.signum() == 0) return this.curve.getInfinity();
+
+		var e = k;
+		var h = e.multiply(new BigInteger("3"));
+
+		var neg = this.negate();
+		var R = this;
+
+		var i;
+		for (i = h.bitLength() - 2; i > 0; --i) {
+			R = R.twice();
+
+			var hBit = h.testBit(i);
+			var eBit = e.testBit(i);
+
+			if (hBit != eBit) {
+				R = R.add(hBit ? this : neg);
+			}
+		}
+
+		return R;
+	};
+
+	// Compute this*j + x*k (simultaneous multiplication)
+	ec.PointFp.prototype.multiplyTwo = function (j, x, k) {
+		var i;
+		if (j.bitLength() > k.bitLength())
+			i = j.bitLength() - 1;
+		else
+			i = k.bitLength() - 1;
+
+		var R = this.curve.getInfinity();
+		var both = this.add(x);
+		while (i >= 0) {
+			R = R.twice();
+			if (j.testBit(i)) {
+				if (k.testBit(i)) {
+					R = R.add(both);
+				}
+				else {
+					R = R.add(this);
+				}
+			}
+			else {
+				if (k.testBit(i)) {
+					R = R.add(x);
+				}
+			}
+			--i;
+		}
+
+		return R;
+	};
+
+	// patched by bitaddress.org and Casascius for use with Bitcoin.ECKey
+	// patched by coretechs to support compressed public keys
+	ec.PointFp.prototype.getEncoded = function (compressed) {
+		var x = this.getX().toBigInteger();
+		var y = this.getY().toBigInteger();
+		var len = 32; // integerToBytes will zero pad if integer is less than 32 bytes. 32 bytes length is required by the Bitcoin protocol.
+		var enc = ec.integerToBytes(x, len);
+
+		// when compressed prepend byte depending if y point is even or odd 
+		if (compressed) {
+			if (y.isEven()) {
+				enc.unshift(0x02);
+			}
+			else {
+				enc.unshift(0x03);
+			}
+		}
+		else {
+			enc.unshift(0x04);
+			enc = enc.concat(ec.integerToBytes(y, len)); // uncompressed public key appends the bytes of the y point
+		}
+		return enc;
+	};
+
+	ec.PointFp.decodeFrom = function (curve, enc) {
+		var type = enc[0];
+		var dataLen = enc.length - 1;
+
+		// Extract x and y as byte arrays
+		var xBa = enc.slice(1, 1 + dataLen / 2);
+		var yBa = enc.slice(1 + dataLen / 2, 1 + dataLen);
+
+		// Prepend zero byte to prevent interpretation as negative integer
+		xBa.unshift(0);
+		yBa.unshift(0);
+
+		// Convert to BigIntegers
+		var x = new BigInteger(xBa);
+		var y = new BigInteger(yBa);
+
+		// Return point
+		return new ec.PointFp(curve, curve.fromBigInteger(x), curve.fromBigInteger(y));
+	};
+
+	ec.PointFp.prototype.add2D = function (b) {
+		if (this.isInfinity()) return b;
+		if (b.isInfinity()) return this;
+
+		if (this.x.equals(b.x)) {
+			if (this.y.equals(b.y)) {
+				// this = b, i.e. this must be doubled
+				return this.twice();
+			}
+			// this = -b, i.e. the result is the point at infinity
+			return this.curve.getInfinity();
+		}
+
+		var x_x = b.x.subtract(this.x);
+		var y_y = b.y.subtract(this.y);
+		var gamma = y_y.divide(x_x);
+
+		var x3 = gamma.square().subtract(this.x).subtract(b.x);
+		var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
+
+		return new ec.PointFp(this.curve, x3, y3);
+	};
+
+	ec.PointFp.prototype.twice2D = function () {
+		if (this.isInfinity()) return this;
+		if (this.y.toBigInteger().signum() == 0) {
+			// if y1 == 0, then (x1, y1) == (x1, -y1)
+			// and hence this = -this and thus 2(x1, y1) == infinity
+			return this.curve.getInfinity();
+		}
+
+		var TWO = this.curve.fromBigInteger(BigInteger.valueOf(2));
+		var THREE = this.curve.fromBigInteger(BigInteger.valueOf(3));
+		var gamma = this.x.square().multiply(THREE).add(this.curve.a).divide(this.y.multiply(TWO));
+
+		var x3 = gamma.square().subtract(this.x.multiply(TWO));
+		var y3 = gamma.multiply(this.x.subtract(x3)).subtract(this.y);
+
+		return new ec.PointFp(this.curve, x3, y3);
+	};
+
+	ec.PointFp.prototype.multiply2D = function (k) {
+		if (this.isInfinity()) return this;
+		if (k.signum() == 0) return this.curve.getInfinity();
+
+		var e = k;
+		var h = e.multiply(new BigInteger("3"));
+
+		var neg = this.negate();
+		var R = this;
+
+		var i;
+		for (i = h.bitLength() - 2; i > 0; --i) {
+			R = R.twice();
+
+			var hBit = h.testBit(i);
+			var eBit = e.testBit(i);
+
+			if (hBit != eBit) {
+				R = R.add2D(hBit ? this : neg);
+			}
+		}
+
+		return R;
+	};
+
+	ec.PointFp.prototype.isOnCurve = function () {
+		var x = this.getX().toBigInteger();
+		var y = this.getY().toBigInteger();
+		var a = this.curve.getA().toBigInteger();
+		var b = this.curve.getB().toBigInteger();
+		var n = this.curve.getQ();
+		var lhs = y.multiply(y).mod(n);
+		var rhs = x.multiply(x).multiply(x).add(a.multiply(x)).add(b).mod(n);
+		return lhs.equals(rhs);
+	};
+
+	ec.PointFp.prototype.toString = function () {
+		return '(' + this.getX().toBigInteger().toString() + ',' + this.getY().toBigInteger().toString() + ')';
+	};
+
+	/**
+	* Validate an elliptic curve point.
+	*
+	* See SEC 1, section 3.2.2.1: Elliptic Curve Public Key Validation Primitive
+	*/
+	ec.PointFp.prototype.validate = function () {
+		var n = this.curve.getQ();
+
+		// Check Q != O
+		if (this.isInfinity()) {
+			throw new Error("Point is at infinity.");
+		}
+
+		// Check coordinate bounds
+		var x = this.getX().toBigInteger();
+		var y = this.getY().toBigInteger();
+		if (x.compareTo(BigInteger.ONE) < 0 || x.compareTo(n.subtract(BigInteger.ONE)) > 0) {
+			throw new Error('x coordinate out of bounds');
+		}
+		if (y.compareTo(BigInteger.ONE) < 0 || y.compareTo(n.subtract(BigInteger.ONE)) > 0) {
+			throw new Error('y coordinate out of bounds');
+		}
+
+		// Check y^2 = x^3 + ax + b (mod n)
+		if (!this.isOnCurve()) {
+			throw new Error("Point is not on the curve.");
+		}
+
+		// Check nQ = 0 (Q is a scalar multiple of G)
+		if (this.multiply(n).isInfinity()) {
+			// TODO: This check doesn't work - fix.
+			throw new Error("Point is not a scalar multiple of G.");
+		}
+
+		return true;
+	};
+
+
+
+
+	// ----------------
+	// ECCurveFp constructor
+	ec.CurveFp = function (q, a, b) {
+		this.q = q;
+		this.a = this.fromBigInteger(a);
+		this.b = this.fromBigInteger(b);
+		this.infinity = new ec.PointFp(this, null, null);
+	}
+
+	ec.CurveFp.prototype.getQ = function () {
+		return this.q;
+	};
+
+	ec.CurveFp.prototype.getA = function () {
+		return this.a;
+	};
+
+	ec.CurveFp.prototype.getB = function () {
+		return this.b;
+	};
+
+	ec.CurveFp.prototype.equals = function (other) {
+		if (other == this) return true;
+		return (this.q.equals(other.q) && this.a.equals(other.a) && this.b.equals(other.b));
+	};
+
+	ec.CurveFp.prototype.getInfinity = function () {
+		return this.infinity;
+	};
+
+	ec.CurveFp.prototype.fromBigInteger = function (x) {
+		return new ec.FieldElementFp(this.q, x);
+	};
+
+	// for now, work with hex strings because they're easier in JS
+	// compressed support added by bitaddress.org
+	ec.CurveFp.prototype.decodePointHex = function (s) {
+		var firstByte = parseInt(s.substr(0, 2), 16);
+		switch (firstByte) { // first byte
+			case 0:
+				return this.infinity;
+			case 2: // compressed
+			case 3: // compressed
+				var yTilde = firstByte & 1;
+				var xHex = s.substr(2, s.length - 2);
+				var X1 = new BigInteger(xHex, 16);
+				return this.decompressPoint(yTilde, X1);
+			case 4: // uncompressed
+			case 6: // hybrid
+			case 7: // hybrid
+				var len = (s.length - 2) / 2;
+				var xHex = s.substr(2, len);
+				var yHex = s.substr(len + 2, len);
+
+				return new ec.PointFp(this,
 					this.fromBigInteger(new BigInteger(xHex, 16)),
 					this.fromBigInteger(new BigInteger(yHex, 16)));
 
-				default: // unsupported
-					return null;
-			}
-		};
-
-		/*
-		* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
-		* Ported to JavaScript by bitaddress.org
-		*
-		* Number yTilde
-		* BigInteger X1
-		*/
-		ec.CurveFp.prototype.decompressPoint = function (yTilde, X1) {
-			var x = this.fromBigInteger(X1);
-			var alpha = x.multiply(x.square().add(this.getA())).add(this.getB());
-			var beta = alpha.sqrt();
-			// if we can't find a sqrt we haven't got a point on the curve - run!
-			if (beta == null) throw new Error("Invalid point compression");
-			var betaValue = beta.toBigInteger();
-			var bit0 = betaValue.testBit(0) ? 1 : 0;
-			if (bit0 != yTilde) {
-				// Use the other root
-				beta = this.fromBigInteger(this.getQ().subtract(betaValue));
-			}
-			return new ec.PointFp(this, x, beta, null, true);
-		};
-
-
-		ec.fromHex = function (s) { return new BigInteger(s, 16); };
-
-		ec.integerToBytes = function (i, len) {
-			var bytes = i.toByteArrayUnsigned();
-			if (len < bytes.length) {
-				bytes = bytes.slice(bytes.length - len);
-			} else while (len > bytes.length) {
-				bytes.unshift(0);
-			}
-			return bytes;
-		};
-
-
-		// Named EC curves
-		// ----------------
-		// X9ECParameters constructor
-		ec.X9Parameters = function (curve, g, n, h) {
-			this.curve = curve;
-			this.g = g;
-			this.n = n;
-			this.h = h;
+			default: // unsupported
+				return null;
 		}
-		ec.X9Parameters.prototype.getCurve = function () { return this.curve; };
-		ec.X9Parameters.prototype.getG = function () { return this.g; };
-		ec.X9Parameters.prototype.getN = function () { return this.n; };
-		ec.X9Parameters.prototype.getH = function () { return this.h; };
+	};
 
-		// secp256k1 is the Curve used by Bitcoin
-		ec.secNamedCurves = {
-			// used by Bitcoin
-			"secp256k1": function () {
-				// p = 2^256 - 2^32 - 2^9 - 2^8 - 2^7 - 2^6 - 2^4 - 1
-				var p = ec.fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F");
-				var a = BigInteger.ZERO;
-				var b = ec.fromHex("7");
-				var n = ec.fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
-				var h = BigInteger.ONE;
-				var curve = new ec.CurveFp(p, a, b);
-				var G = curve.decodePointHex("04"
+	/*
+	* Copyright (c) 2000 - 2011 The Legion Of The Bouncy Castle (http://www.bouncycastle.org)
+	* Ported to JavaScript by bitaddress.org
+	*
+	* Number yTilde
+	* BigInteger X1
+	*/
+	ec.CurveFp.prototype.decompressPoint = function (yTilde, X1) {
+		var x = this.fromBigInteger(X1);
+		var alpha = x.multiply(x.square().add(this.getA())).add(this.getB());
+		var beta = alpha.sqrt();
+		// if we can't find a sqrt we haven't got a point on the curve - run!
+		if (beta == null) throw new Error("Invalid point compression");
+		var betaValue = beta.toBigInteger();
+		var bit0 = betaValue.testBit(0) ? 1 : 0;
+		if (bit0 != yTilde) {
+			// Use the other root
+			beta = this.fromBigInteger(this.getQ().subtract(betaValue));
+		}
+		return new ec.PointFp(this, x, beta, null, true);
+	};
+
+
+	ec.fromHex = function (s) { return new BigInteger(s, 16); };
+
+	ec.integerToBytes = function (i, len) {
+		var bytes = i.toByteArrayUnsigned();
+		if (len < bytes.length) {
+			bytes = bytes.slice(bytes.length - len);
+		} else while (len > bytes.length) {
+			bytes.unshift(0);
+		}
+		return bytes;
+	};
+
+
+	// Named EC curves
+	// ----------------
+	// X9ECParameters constructor
+	ec.X9Parameters = function (curve, g, n, h) {
+		this.curve = curve;
+		this.g = g;
+		this.n = n;
+		this.h = h;
+	}
+	ec.X9Parameters.prototype.getCurve = function () { return this.curve; };
+	ec.X9Parameters.prototype.getG = function () { return this.g; };
+	ec.X9Parameters.prototype.getN = function () { return this.n; };
+	ec.X9Parameters.prototype.getH = function () { return this.h; };
+
+	// secp256k1 is the Curve used by Bitcoin
+	ec.secNamedCurves = {
+		// used by Bitcoin
+		"secp256k1": function () {
+			// p = 2^256 - 2^32 - 2^9 - 2^8 - 2^7 - 2^6 - 2^4 - 1
+			var p = ec.fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEFFFFFC2F");
+			var a = BigInteger.ZERO;
+			var b = ec.fromHex("7");
+			var n = ec.fromHex("FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFEBAAEDCE6AF48A03BBFD25E8CD0364141");
+			var h = BigInteger.ONE;
+			var curve = new ec.CurveFp(p, a, b);
+			var G = curve.decodePointHex("04"
 					+ "79BE667EF9DCBBAC55A06295CE870B07029BFCDB2DCE28D959F2815B16F81798"
 					+ "483ADA7726A3C4655DA4FBFC0E1108A8FD17B448A68554199C47D08FFB10D4B8");
-				return new ec.X9Parameters(curve, G, n, h);
-			}
-		};
-
-		// secp256k1 called by Bitcoin's ECKEY
-		ec.getSECCurveByName = function (name) {
-			if (ec.secNamedCurves[name] == undefined) return null;
-			return ec.secNamedCurves[name]();
+			return new ec.X9Parameters(curve, G, n, h);
 		}
-	})();
+	};
+
+	// secp256k1 called by Bitcoin's ECKEY
+	ec.getSECCurveByName = function (name) {
+		if (ec.secNamedCurves[name] == undefined) return null;
+		return ec.secNamedCurves[name]();
+	}
+})();
 	</script>
-
 	<script type="text/javascript">
-		/*!
-		* Basic JavaScript BN library - subset useful for RSA encryption. v1.3
-		* 
-		* Copyright (c) 2005  Tom Wu
-		* All Rights Reserved.
-		* BSD License
-		* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
-		*
-		* Copyright Stephan Thomas
-		* Copyright bitaddress.org
-		*/
+/*!
+* Basic JavaScript BN library - subset useful for RSA encryption. v1.3
+* 
+* Copyright (c) 2005  Tom Wu
+* All Rights Reserved.
+* BSD License
+* http://www-cs-students.stanford.edu/~tjw/jsbn/LICENSE
+*
+* Copyright Stephan Thomas
+* Copyright bitaddress.org
+*/
 
-		(function () {
+(function () {
 
-			// (public) Constructor function of Global BigInteger object
-			var BigInteger = window.BigInteger = function BigInteger(a, b, c) {
-				if (a != null)
-					if ("number" == typeof a) this.fromNumber(a, b, c);
-					else if (b == null && "string" != typeof a) this.fromString(a, 256);
-					else this.fromString(a, b);
-			};
+	// (public) Constructor function of Global BigInteger object
+	var BigInteger = window.BigInteger = function BigInteger(a, b, c) {
+		if (a != null)
+			if ("number" == typeof a) this.fromNumber(a, b, c);
+			else if (b == null && "string" != typeof a) this.fromString(a, 256);
+			else this.fromString(a, b);
+	};
 
-			// Bits per digit
-			var dbits;
+	// Bits per digit
+	var dbits;
 
-			// JavaScript engine analysis
-			var canary = 0xdeadbeefcafe;
-			var j_lm = ((canary & 0xffffff) == 0xefcafe);
+	// JavaScript engine analysis
+	var canary = 0xdeadbeefcafe;
+	var j_lm = ((canary & 0xffffff) == 0xefcafe);
 
-			// return new, unset BigInteger
-			function nbi() { return new BigInteger(null); }
+	// return new, unset BigInteger
+	function nbi() { return new BigInteger(null); }
 
-			// am: Compute w_j += (x*this_i), propagate carries,
-			// c is initial carry, returns final carry.
-			// c < 3*dvalue, x < 2*dvalue, this_i < dvalue
-			// We need to select the fastest one that works in this environment.
+	// am: Compute w_j += (x*this_i), propagate carries,
+	// c is initial carry, returns final carry.
+	// c < 3*dvalue, x < 2*dvalue, this_i < dvalue
+	// We need to select the fastest one that works in this environment.
 
-			// am1: use a single mult and divide to get the high bits,
-			// max digit bits should be 26 because
-			// max internal value = 2*dvalue^2-2*dvalue (< 2^53)
-			function am1(i, x, w, j, c, n) {
-				while (--n >= 0) {
-					var v = x * this[i++] + w[j] + c;
-					c = Math.floor(v / 0x4000000);
-					w[j++] = v & 0x3ffffff;
-				}
-				return c;
+	// am1: use a single mult and divide to get the high bits,
+	// max digit bits should be 26 because
+	// max internal value = 2*dvalue^2-2*dvalue (< 2^53)
+	function am1(i, x, w, j, c, n) {
+		while (--n >= 0) {
+			var v = x * this[i++] + w[j] + c;
+			c = Math.floor(v / 0x4000000);
+			w[j++] = v & 0x3ffffff;
+		}
+		return c;
+	}
+	// am2 avoids a big mult-and-extract completely.
+	// Max digit bits should be <= 30 because we do bitwise ops
+	// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
+	function am2(i, x, w, j, c, n) {
+		var xl = x & 0x7fff, xh = x >> 15;
+		while (--n >= 0) {
+			var l = this[i] & 0x7fff;
+			var h = this[i++] >> 15;
+			var m = xh * l + h * xl;
+			l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);
+			c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);
+			w[j++] = l & 0x3fffffff;
+		}
+		return c;
+	}
+	// Alternately, set max digit bits to 28 since some
+	// browsers slow down when dealing with 32-bit numbers.
+	function am3(i, x, w, j, c, n) {
+		var xl = x & 0x3fff, xh = x >> 14;
+		while (--n >= 0) {
+			var l = this[i] & 0x3fff;
+			var h = this[i++] >> 14;
+			var m = xh * l + h * xl;
+			l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;
+			c = (l >> 28) + (m >> 14) + xh * h;
+			w[j++] = l & 0xfffffff;
+		}
+		return c;
+	}
+	if (j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
+		BigInteger.prototype.am = am2;
+		dbits = 30;
+	}
+	else if (j_lm && (navigator.appName != "Netscape")) {
+		BigInteger.prototype.am = am1;
+		dbits = 26;
+	}
+	else { // Mozilla/Netscape seems to prefer am3
+		BigInteger.prototype.am = am3;
+		dbits = 28;
+	}
+
+	BigInteger.prototype.DB = dbits;
+	BigInteger.prototype.DM = ((1 << dbits) - 1);
+	BigInteger.prototype.DV = (1 << dbits);
+
+	var BI_FP = 52;
+	BigInteger.prototype.FV = Math.pow(2, BI_FP);
+	BigInteger.prototype.F1 = BI_FP - dbits;
+	BigInteger.prototype.F2 = 2 * dbits - BI_FP;
+
+	// Digit conversions
+	var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
+	var BI_RC = new Array();
+	var rr, vv;
+	rr = "0".charCodeAt(0);
+	for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
+	rr = "a".charCodeAt(0);
+	for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
+	rr = "A".charCodeAt(0);
+	for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
+
+	function int2char(n) { return BI_RM.charAt(n); }
+	function intAt(s, i) {
+		var c = BI_RC[s.charCodeAt(i)];
+		return (c == null) ? -1 : c;
+	}
+
+
+
+	// return bigint initialized to value
+	function nbv(i) { var r = nbi(); r.fromInt(i); return r; }
+
+
+	// returns bit length of the integer x
+	function nbits(x) {
+		var r = 1, t;
+		if ((t = x >>> 16) != 0) { x = t; r += 16; }
+		if ((t = x >> 8) != 0) { x = t; r += 8; }
+		if ((t = x >> 4) != 0) { x = t; r += 4; }
+		if ((t = x >> 2) != 0) { x = t; r += 2; }
+		if ((t = x >> 1) != 0) { x = t; r += 1; }
+		return r;
+	}
+
+
+
+
+
+
+
+	// (protected) copy this to r
+	BigInteger.prototype.copyTo = function (r) {
+		for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];
+		r.t = this.t;
+		r.s = this.s;
+	};
+
+
+	// (protected) set from integer value x, -DV <= x < DV
+	BigInteger.prototype.fromInt = function (x) {
+		this.t = 1;
+		this.s = (x < 0) ? -1 : 0;
+		if (x > 0) this[0] = x;
+		else if (x < -1) this[0] = x + DV;
+		else this.t = 0;
+	};
+
+	// (protected) set from string and radix
+	BigInteger.prototype.fromString = function (s, b) {
+		var k;
+		if (b == 16) k = 4;
+		else if (b == 8) k = 3;
+		else if (b == 256) k = 8; // byte array
+		else if (b == 2) k = 1;
+		else if (b == 32) k = 5;
+		else if (b == 4) k = 2;
+		else { this.fromRadix(s, b); return; }
+		this.t = 0;
+		this.s = 0;
+		var i = s.length, mi = false, sh = 0;
+		while (--i >= 0) {
+			var x = (k == 8) ? s[i] & 0xff : intAt(s, i);
+			if (x < 0) {
+				if (s.charAt(i) == "-") mi = true;
+				continue;
 			}
-			// am2 avoids a big mult-and-extract completely.
-			// Max digit bits should be <= 30 because we do bitwise ops
-			// on values up to 2*hdvalue^2-hdvalue-1 (< 2^31)
-			function am2(i, x, w, j, c, n) {
-				var xl = x & 0x7fff, xh = x >> 15;
-				while (--n >= 0) {
-					var l = this[i] & 0x7fff;
-					var h = this[i++] >> 15;
-					var m = xh * l + h * xl;
-					l = xl * l + ((m & 0x7fff) << 15) + w[j] + (c & 0x3fffffff);
-					c = (l >>> 30) + (m >>> 15) + xh * h + (c >>> 30);
-					w[j++] = l & 0x3fffffff;
-				}
-				return c;
+			mi = false;
+			if (sh == 0)
+				this[this.t++] = x;
+			else if (sh + k > this.DB) {
+				this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
+				this[this.t++] = (x >> (this.DB - sh));
 			}
-			// Alternately, set max digit bits to 28 since some
-			// browsers slow down when dealing with 32-bit numbers.
-			function am3(i, x, w, j, c, n) {
-				var xl = x & 0x3fff, xh = x >> 14;
-				while (--n >= 0) {
-					var l = this[i] & 0x3fff;
-					var h = this[i++] >> 14;
-					var m = xh * l + h * xl;
-					l = xl * l + ((m & 0x3fff) << 14) + w[j] + c;
-					c = (l >> 28) + (m >> 14) + xh * h;
-					w[j++] = l & 0xfffffff;
-				}
-				return c;
+			else
+				this[this.t - 1] |= x << sh;
+			sh += k;
+			if (sh >= this.DB) sh -= this.DB;
+		}
+		if (k == 8 && (s[0] & 0x80) != 0) {
+			this.s = -1;
+			if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
+		}
+		this.clamp();
+		if (mi) BigInteger.ZERO.subTo(this, this);
+	};
+
+
+	// (protected) clamp off excess high words
+	BigInteger.prototype.clamp = function () {
+		var c = this.s & this.DM;
+		while (this.t > 0 && this[this.t - 1] == c) --this.t;
+	};
+
+	// (protected) r = this << n*DB
+	BigInteger.prototype.dlShiftTo = function (n, r) {
+		var i;
+		for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i];
+		for (i = n - 1; i >= 0; --i) r[i] = 0;
+		r.t = this.t + n;
+		r.s = this.s;
+	};
+
+	// (protected) r = this >> n*DB
+	BigInteger.prototype.drShiftTo = function (n, r) {
+		for (var i = n; i < this.t; ++i) r[i - n] = this[i];
+		r.t = Math.max(this.t - n, 0);
+		r.s = this.s;
+	};
+
+
+	// (protected) r = this << n
+	BigInteger.prototype.lShiftTo = function (n, r) {
+		var bs = n % this.DB;
+		var cbs = this.DB - bs;
+		var bm = (1 << cbs) - 1;
+		var ds = Math.floor(n / this.DB), c = (this.s << bs) & this.DM, i;
+		for (i = this.t - 1; i >= 0; --i) {
+			r[i + ds + 1] = (this[i] >> cbs) | c;
+			c = (this[i] & bm) << bs;
+		}
+		for (i = ds - 1; i >= 0; --i) r[i] = 0;
+		r[ds] = c;
+		r.t = this.t + ds + 1;
+		r.s = this.s;
+		r.clamp();
+	};
+
+
+	// (protected) r = this >> n
+	BigInteger.prototype.rShiftTo = function (n, r) {
+		r.s = this.s;
+		var ds = Math.floor(n / this.DB);
+		if (ds >= this.t) { r.t = 0; return; }
+		var bs = n % this.DB;
+		var cbs = this.DB - bs;
+		var bm = (1 << bs) - 1;
+		r[0] = this[ds] >> bs;
+		for (var i = ds + 1; i < this.t; ++i) {
+			r[i - ds - 1] |= (this[i] & bm) << cbs;
+			r[i - ds] = this[i] >> bs;
+		}
+		if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;
+		r.t = this.t - ds;
+		r.clamp();
+	};
+
+
+	// (protected) r = this - a
+	BigInteger.prototype.subTo = function (a, r) {
+		var i = 0, c = 0, m = Math.min(a.t, this.t);
+		while (i < m) {
+			c += this[i] - a[i];
+			r[i++] = c & this.DM;
+			c >>= this.DB;
+		}
+		if (a.t < this.t) {
+			c -= a.s;
+			while (i < this.t) {
+				c += this[i];
+				r[i++] = c & this.DM;
+				c >>= this.DB;
 			}
-			if (j_lm && (navigator.appName == "Microsoft Internet Explorer")) {
-				BigInteger.prototype.am = am2;
-				dbits = 30;
+			c += this.s;
+		}
+		else {
+			c += this.s;
+			while (i < a.t) {
+				c -= a[i];
+				r[i++] = c & this.DM;
+				c >>= this.DB;
 			}
-			else if (j_lm && (navigator.appName != "Netscape")) {
-				BigInteger.prototype.am = am1;
-				dbits = 26;
-			}
-			else { // Mozilla/Netscape seems to prefer am3
-				BigInteger.prototype.am = am3;
-				dbits = 28;
-			}
-
-			BigInteger.prototype.DB = dbits;
-			BigInteger.prototype.DM = ((1 << dbits) - 1);
-			BigInteger.prototype.DV = (1 << dbits);
-
-			var BI_FP = 52;
-			BigInteger.prototype.FV = Math.pow(2, BI_FP);
-			BigInteger.prototype.F1 = BI_FP - dbits;
-			BigInteger.prototype.F2 = 2 * dbits - BI_FP;
-
-			// Digit conversions
-			var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
-			var BI_RC = new Array();
-			var rr, vv;
-			rr = "0".charCodeAt(0);
-			for (vv = 0; vv <= 9; ++vv) BI_RC[rr++] = vv;
-			rr = "a".charCodeAt(0);
-			for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
-			rr = "A".charCodeAt(0);
-			for (vv = 10; vv < 36; ++vv) BI_RC[rr++] = vv;
-
-			function int2char(n) { return BI_RM.charAt(n); }
-			function intAt(s, i) {
-				var c = BI_RC[s.charCodeAt(i)];
-				return (c == null) ? -1 : c;
+			c -= a.s;
+		}
+		r.s = (c < 0) ? -1 : 0;
+		if (c < -1) r[i++] = this.DV + c;
+		else if (c > 0) r[i++] = c;
+		r.t = i;
+		r.clamp();
+	};
+
+
+	// (protected) r = this * a, r != this,a (HAC 14.12)
+	// "this" should be the larger one if appropriate.
+	BigInteger.prototype.multiplyTo = function (a, r) {
+		var x = this.abs(), y = a.abs();
+		var i = x.t;
+		r.t = i + y.t;
+		while (--i >= 0) r[i] = 0;
+		for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
+		r.s = 0;
+		r.clamp();
+		if (this.s != a.s) BigInteger.ZERO.subTo(r, r);
+	};
+
+
+	// (protected) r = this^2, r != this (HAC 14.16)
+	BigInteger.prototype.squareTo = function (r) {
+		var x = this.abs();
+		var i = r.t = 2 * x.t;
+		while (--i >= 0) r[i] = 0;
+		for (i = 0; i < x.t - 1; ++i) {
+			var c = x.am(i, x[i], r, 2 * i, 0, 1);
+			if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
+				r[i + x.t] -= x.DV;
+				r[i + x.t + 1] = 1;
 			}
+		}
+		if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
+		r.s = 0;
+		r.clamp();
+	};
 
 
 
-			// return bigint initialized to value
-			function nbv(i) { var r = nbi(); r.fromInt(i); return r; }
-
-
-			// returns bit length of the integer x
-			function nbits(x) {
-				var r = 1, t;
-				if ((t = x >>> 16) != 0) { x = t; r += 16; }
-				if ((t = x >> 8) != 0) { x = t; r += 8; }
-				if ((t = x >> 4) != 0) { x = t; r += 4; }
-				if ((t = x >> 2) != 0) { x = t; r += 2; }
-				if ((t = x >> 1) != 0) { x = t; r += 1; }
-				return r;
-			}
-
-
-
-
-
-
-
-			// (protected) copy this to r
-			BigInteger.prototype.copyTo = function (r) {
-				for (var i = this.t - 1; i >= 0; --i) r[i] = this[i];
-				r.t = this.t;
-				r.s = this.s;
-			};
-
-
-			// (protected) set from integer value x, -DV <= x < DV
-			BigInteger.prototype.fromInt = function (x) {
-				this.t = 1;
-				this.s = (x < 0) ? -1 : 0;
-				if (x > 0) this[0] = x;
-				else if (x < -1) this[0] = x + DV;
-				else this.t = 0;
-			};
-
-			// (protected) set from string and radix
-			BigInteger.prototype.fromString = function (s, b) {
-				var k;
-				if (b == 16) k = 4;
-				else if (b == 8) k = 3;
-				else if (b == 256) k = 8; // byte array
-				else if (b == 2) k = 1;
-				else if (b == 32) k = 5;
-				else if (b == 4) k = 2;
-				else { this.fromRadix(s, b); return; }
-				this.t = 0;
-				this.s = 0;
-				var i = s.length, mi = false, sh = 0;
-				while (--i >= 0) {
-					var x = (k == 8) ? s[i] & 0xff : intAt(s, i);
-					if (x < 0) {
-						if (s.charAt(i) == "-") mi = true;
-						continue;
-					}
-					mi = false;
-					if (sh == 0)
-						this[this.t++] = x;
-					else if (sh + k > this.DB) {
-						this[this.t - 1] |= (x & ((1 << (this.DB - sh)) - 1)) << sh;
-						this[this.t++] = (x >> (this.DB - sh));
-					}
-					else
-						this[this.t - 1] |= x << sh;
-					sh += k;
-					if (sh >= this.DB) sh -= this.DB;
-				}
-				if (k == 8 && (s[0] & 0x80) != 0) {
-					this.s = -1;
-					if (sh > 0) this[this.t - 1] |= ((1 << (this.DB - sh)) - 1) << sh;
-				}
-				this.clamp();
-				if (mi) BigInteger.ZERO.subTo(this, this);
-			};
-
-
-			// (protected) clamp off excess high words
-			BigInteger.prototype.clamp = function () {
-				var c = this.s & this.DM;
-				while (this.t > 0 && this[this.t - 1] == c) --this.t;
-			};
-
-			// (protected) r = this << n*DB
-			BigInteger.prototype.dlShiftTo = function (n, r) {
-				var i;
-				for (i = this.t - 1; i >= 0; --i) r[i + n] = this[i];
-				for (i = n - 1; i >= 0; --i) r[i] = 0;
-				r.t = this.t + n;
-				r.s = this.s;
-			};
-
-			// (protected) r = this >> n*DB
-			BigInteger.prototype.drShiftTo = function (n, r) {
-				for (var i = n; i < this.t; ++i) r[i - n] = this[i];
-				r.t = Math.max(this.t - n, 0);
-				r.s = this.s;
-			};
-
-
-			// (protected) r = this << n
-			BigInteger.prototype.lShiftTo = function (n, r) {
-				var bs = n % this.DB;
-				var cbs = this.DB - bs;
-				var bm = (1 << cbs) - 1;
-				var ds = Math.floor(n / this.DB), c = (this.s << bs) & this.DM, i;
-				for (i = this.t - 1; i >= 0; --i) {
-					r[i + ds + 1] = (this[i] >> cbs) | c;
-					c = (this[i] & bm) << bs;
-				}
-				for (i = ds - 1; i >= 0; --i) r[i] = 0;
-				r[ds] = c;
-				r.t = this.t + ds + 1;
-				r.s = this.s;
-				r.clamp();
-			};
-
-
-			// (protected) r = this >> n
-			BigInteger.prototype.rShiftTo = function (n, r) {
-				r.s = this.s;
-				var ds = Math.floor(n / this.DB);
-				if (ds >= this.t) { r.t = 0; return; }
-				var bs = n % this.DB;
-				var cbs = this.DB - bs;
-				var bm = (1 << bs) - 1;
-				r[0] = this[ds] >> bs;
-				for (var i = ds + 1; i < this.t; ++i) {
-					r[i - ds - 1] |= (this[i] & bm) << cbs;
-					r[i - ds] = this[i] >> bs;
-				}
-				if (bs > 0) r[this.t - ds - 1] |= (this.s & bm) << cbs;
-				r.t = this.t - ds;
-				r.clamp();
-			};
-
-
-			// (protected) r = this - a
-			BigInteger.prototype.subTo = function (a, r) {
-				var i = 0, c = 0, m = Math.min(a.t, this.t);
-				while (i < m) {
-					c += this[i] - a[i];
-					r[i++] = c & this.DM;
-					c >>= this.DB;
-				}
-				if (a.t < this.t) {
-					c -= a.s;
-					while (i < this.t) {
-						c += this[i];
-						r[i++] = c & this.DM;
-						c >>= this.DB;
-					}
-					c += this.s;
-				}
-				else {
-					c += this.s;
-					while (i < a.t) {
-						c -= a[i];
-						r[i++] = c & this.DM;
-						c >>= this.DB;
-					}
-					c -= a.s;
-				}
-				r.s = (c < 0) ? -1 : 0;
-				if (c < -1) r[i++] = this.DV + c;
-				else if (c > 0) r[i++] = c;
-				r.t = i;
-				r.clamp();
-			};
-
-
-			// (protected) r = this * a, r != this,a (HAC 14.12)
-			// "this" should be the larger one if appropriate.
-			BigInteger.prototype.multiplyTo = function (a, r) {
-				var x = this.abs(), y = a.abs();
-				var i = x.t;
-				r.t = i + y.t;
-				while (--i >= 0) r[i] = 0;
-				for (i = 0; i < y.t; ++i) r[i + x.t] = x.am(0, y[i], r, i, 0, x.t);
-				r.s = 0;
-				r.clamp();
-				if (this.s != a.s) BigInteger.ZERO.subTo(r, r);
-			};
-
-
-			// (protected) r = this^2, r != this (HAC 14.16)
-			BigInteger.prototype.squareTo = function (r) {
-				var x = this.abs();
-				var i = r.t = 2 * x.t;
-				while (--i >= 0) r[i] = 0;
-				for (i = 0; i < x.t - 1; ++i) {
-					var c = x.am(i, x[i], r, 2 * i, 0, 1);
-					if ((r[i + x.t] += x.am(i + 1, 2 * x[i], r, 2 * i + 1, c, x.t - i - 1)) >= x.DV) {
-						r[i + x.t] -= x.DV;
-						r[i + x.t + 1] = 1;
-					}
-				}
-				if (r.t > 0) r[r.t - 1] += x.am(i, x[i], r, 2 * i, 0, 1);
-				r.s = 0;
-				r.clamp();
-			};
-
-
-
-			// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
-			// r != q, this != m.  q or r may be null.
-			BigInteger.prototype.divRemTo = function (m, q, r) {
-				var pm = m.abs();
-				if (pm.t <= 0) return;
-				var pt = this.abs();
-				if (pt.t < pm.t) {
-					if (q != null) q.fromInt(0);
-					if (r != null) this.copyTo(r);
-					return;
-				}
-				if (r == null) r = nbi();
-				var y = nbi(), ts = this.s, ms = m.s;
-				var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
-				if (nsh > 0) { pm.lShiftTo(nsh, y); pt.lShiftTo(nsh, r); }
-				else { pm.copyTo(y); pt.copyTo(r); }
-				var ys = y.t;
-				var y0 = y[ys - 1];
-				if (y0 == 0) return;
-				var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);
-				var d1 = this.FV / yt, d2 = (1 << this.F1) / yt, e = 1 << this.F2;
-				var i = r.t, j = i - ys, t = (q == null) ? nbi() : q;
+	// (protected) divide this by m, quotient and remainder to q, r (HAC 14.20)
+	// r != q, this != m.  q or r may be null.
+	BigInteger.prototype.divRemTo = function (m, q, r) {
+		var pm = m.abs();
+		if (pm.t <= 0) return;
+		var pt = this.abs();
+		if (pt.t < pm.t) {
+			if (q != null) q.fromInt(0);
+			if (r != null) this.copyTo(r);
+			return;
+		}
+		if (r == null) r = nbi();
+		var y = nbi(), ts = this.s, ms = m.s;
+		var nsh = this.DB - nbits(pm[pm.t - 1]); // normalize modulus
+		if (nsh > 0) { pm.lShiftTo(nsh, y); pt.lShiftTo(nsh, r); }
+		else { pm.copyTo(y); pt.copyTo(r); }
+		var ys = y.t;
+		var y0 = y[ys - 1];
+		if (y0 == 0) return;
+		var yt = y0 * (1 << this.F1) + ((ys > 1) ? y[ys - 2] >> this.F2 : 0);
+		var d1 = this.FV / yt, d2 = (1 << this.F1) / yt, e = 1 << this.F2;
+		var i = r.t, j = i - ys, t = (q == null) ? nbi() : q;
+		y.dlShiftTo(j, t);
+		if (r.compareTo(t) >= 0) {
+			r[r.t++] = 1;
+			r.subTo(t, r);
+		}
+		BigInteger.ONE.dlShiftTo(ys, t);
+		t.subTo(y, y); // "negative" y so we can replace sub with am later
+		while (y.t < ys) y[y.t++] = 0;
+		while (--j >= 0) {
+			// Estimate quotient digit
+			var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
+			if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) {	// Try it out
 				y.dlShiftTo(j, t);
-				if (r.compareTo(t) >= 0) {
-					r[r.t++] = 1;
-					r.subTo(t, r);
-				}
-				BigInteger.ONE.dlShiftTo(ys, t);
-				t.subTo(y, y); // "negative" y so we can replace sub with am later
-				while (y.t < ys) y[y.t++] = 0;
-				while (--j >= 0) {
-					// Estimate quotient digit
-					var qd = (r[--i] == y0) ? this.DM : Math.floor(r[i] * d1 + (r[i - 1] + e) * d2);
-					if ((r[i] += y.am(0, qd, r, j, 0, ys)) < qd) {	// Try it out
-						y.dlShiftTo(j, t);
-						r.subTo(t, r);
-						while (r[i] < --qd) r.subTo(t, r);
-					}
-				}
-				if (q != null) {
-					r.drShiftTo(ys, q);
-					if (ts != ms) BigInteger.ZERO.subTo(q, q);
-				}
-				r.t = ys;
-				r.clamp();
-				if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder
-				if (ts < 0) BigInteger.ZERO.subTo(r, r);
-			};
-
-
-			// (protected) return "-1/this % 2^DB"; useful for Mont. reduction
-			// justification:
-			//         xy == 1 (mod m)
-			//         xy =  1+km
-			//   xy(2-xy) = (1+km)(1-km)
-			// x[y(2-xy)] = 1-k^2m^2
-			// x[y(2-xy)] == 1 (mod m^2)
-			// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
-			// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
-			// JS multiply "overflows" differently from C/C++, so care is needed here.
-			BigInteger.prototype.invDigit = function () {
-				if (this.t < 1) return 0;
-				var x = this[0];
-				if ((x & 1) == 0) return 0;
-				var y = x & 3; 	// y == 1/x mod 2^2
-				y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4
-				y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8
-				y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16
-				// last step - calculate inverse mod DV directly;
-				// assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
-				y = (y * (2 - x * y % this.DV)) % this.DV; 	// y == 1/x mod 2^dbits
-				// we really want the negative inverse, and -DV < y < DV
-				return (y > 0) ? this.DV - y : -y;
-			};
-
-
-			// (protected) true iff this is even
-			BigInteger.prototype.isEven = function () { return ((this.t > 0) ? (this[0] & 1) : this.s) == 0; };
-
-
-			// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
-			BigInteger.prototype.exp = function (e, z) {
-				if (e > 0xffffffff || e < 1) return BigInteger.ONE;
-				var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e) - 1;
-				g.copyTo(r);
-				while (--i >= 0) {
-					z.sqrTo(r, r2);
-					if ((e & (1 << i)) > 0) z.mulTo(r2, g, r);
-					else { var t = r; r = r2; r2 = t; }
-				}
-				return z.revert(r);
-			};
-
-
-			// (public) return string representation in given radix
-			BigInteger.prototype.toString = function (b) {
-				if (this.s < 0) return "-" + this.negate().toString(b);
-				var k;
-				if (b == 16) k = 4;
-				else if (b == 8) k = 3;
-				else if (b == 2) k = 1;
-				else if (b == 32) k = 5;
-				else if (b == 4) k = 2;
-				else return this.toRadix(b);
-				var km = (1 << k) - 1, d, m = false, r = "", i = this.t;
-				var p = this.DB - (i * this.DB) % k;
-				if (i-- > 0) {
-					if (p < this.DB && (d = this[i] >> p) > 0) { m = true; r = int2char(d); }
-					while (i >= 0) {
-						if (p < k) {
-							d = (this[i] & ((1 << p) - 1)) << (k - p);
-							d |= this[--i] >> (p += this.DB - k);
-						}
-						else {
-							d = (this[i] >> (p -= k)) & km;
-							if (p <= 0) { p += this.DB; --i; }
-						}
-						if (d > 0) m = true;
-						if (m) r += int2char(d);
-					}
-				}
-				return m ? r : "0";
-			};
-
-
-			// (public) -this
-			BigInteger.prototype.negate = function () { var r = nbi(); BigInteger.ZERO.subTo(this, r); return r; };
-
-			// (public) |this|
-			BigInteger.prototype.abs = function () { return (this.s < 0) ? this.negate() : this; };
-
-			// (public) return + if this > a, - if this < a, 0 if equal
-			BigInteger.prototype.compareTo = function (a) {
-				var r = this.s - a.s;
-				if (r != 0) return r;
-				var i = this.t;
-				r = i - a.t;
-				if (r != 0) return (this.s < 0) ? -r : r;
-				while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;
-				return 0;
+				r.subTo(t, r);
+				while (r[i] < --qd) r.subTo(t, r);
 			}
-
-			// (public) return the number of bits in "this"
-			BigInteger.prototype.bitLength = function () {
-				if (this.t <= 0) return 0;
-				return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));
-			};
-
-			// (public) this mod a
-			BigInteger.prototype.mod = function (a) {
-				var r = nbi();
-				this.abs().divRemTo(a, null, r);
-				if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);
-				return r;
-			}
-
-			// (public) this^e % m, 0 <= e < 2^32
-			BigInteger.prototype.modPowInt = function (e, m) {
-				var z;
-				if (e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);
-				return this.exp(e, z);
-			};
-
-			// "constants"
-			BigInteger.ZERO = nbv(0);
-			BigInteger.ONE = nbv(1);
+		}
+		if (q != null) {
+			r.drShiftTo(ys, q);
+			if (ts != ms) BigInteger.ZERO.subTo(q, q);
+		}
+		r.t = ys;
+		r.clamp();
+		if (nsh > 0) r.rShiftTo(nsh, r); // Denormalize remainder
+		if (ts < 0) BigInteger.ZERO.subTo(r, r);
+	};
 
 
+	// (protected) return "-1/this % 2^DB"; useful for Mont. reduction
+	// justification:
+	//         xy == 1 (mod m)
+	//         xy =  1+km
+	//   xy(2-xy) = (1+km)(1-km)
+	// x[y(2-xy)] = 1-k^2m^2
+	// x[y(2-xy)] == 1 (mod m^2)
+	// if y is 1/x mod m, then y(2-xy) is 1/x mod m^2
+	// should reduce x and y(2-xy) by m^2 at each step to keep size bounded.
+	// JS multiply "overflows" differently from C/C++, so care is needed here.
+	BigInteger.prototype.invDigit = function () {
+		if (this.t < 1) return 0;
+		var x = this[0];
+		if ((x & 1) == 0) return 0;
+		var y = x & 3; 	// y == 1/x mod 2^2
+		y = (y * (2 - (x & 0xf) * y)) & 0xf; // y == 1/x mod 2^4
+		y = (y * (2 - (x & 0xff) * y)) & 0xff; // y == 1/x mod 2^8
+		y = (y * (2 - (((x & 0xffff) * y) & 0xffff))) & 0xffff; // y == 1/x mod 2^16
+		// last step - calculate inverse mod DV directly;
+		// assumes 16 < DB <= 32 and assumes ability to handle 48-bit ints
+		y = (y * (2 - x * y % this.DV)) % this.DV; 	// y == 1/x mod 2^dbits
+		// we really want the negative inverse, and -DV < y < DV
+		return (y > 0) ? this.DV - y : -y;
+	};
 
 
+	// (protected) true iff this is even
+	BigInteger.prototype.isEven = function () { return ((this.t > 0) ? (this[0] & 1) : this.s) == 0; };
 
 
-
-			// Copyright (c) 2005-2009  Tom Wu
-			// All Rights Reserved.
-			// See "LICENSE" for details.
-			// Extended JavaScript BN functions, required for RSA private ops.
-			// Version 1.1: new BigInteger("0", 10) returns "proper" zero
-			// Version 1.2: square() API, isProbablePrime fix
+	// (protected) this^e, e < 2^32, doing sqr and mul with "r" (HAC 14.79)
+	BigInteger.prototype.exp = function (e, z) {
+		if (e > 0xffffffff || e < 1) return BigInteger.ONE;
+		var r = nbi(), r2 = nbi(), g = z.convert(this), i = nbits(e) - 1;
+		g.copyTo(r);
+		while (--i >= 0) {
+			z.sqrTo(r, r2);
+			if ((e & (1 << i)) > 0) z.mulTo(r2, g, r);
+			else { var t = r; r = r2; r2 = t; }
+		}
+		return z.revert(r);
+	};
 
 
-			// return index of lowest 1-bit in x, x < 2^31
-			function lbit(x) {
-				if (x == 0) return -1;
-				var r = 0;
-				if ((x & 0xffff) == 0) { x >>= 16; r += 16; }
-				if ((x & 0xff) == 0) { x >>= 8; r += 8; }
-				if ((x & 0xf) == 0) { x >>= 4; r += 4; }
-				if ((x & 3) == 0) { x >>= 2; r += 2; }
-				if ((x & 1) == 0) ++r;
-				return r;
-			}
-
-			// return number of 1 bits in x
-			function cbit(x) {
-				var r = 0;
-				while (x != 0) { x &= x - 1; ++r; }
-				return r;
-			}
-
-			var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];
-			var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];
-
-
-
-			// (protected) return x s.t. r^x < DV
-			BigInteger.prototype.chunkSize = function (r) { return Math.floor(Math.LN2 * this.DB / Math.log(r)); };
-
-			// (protected) convert to radix string
-			BigInteger.prototype.toRadix = function (b) {
-				if (b == null) b = 10;
-				if (this.signum() == 0 || b < 2 || b > 36) return "0";
-				var cs = this.chunkSize(b);
-				var a = Math.pow(b, cs);
-				var d = nbv(a), y = nbi(), z = nbi(), r = "";
-				this.divRemTo(d, y, z);
-				while (y.signum() > 0) {
-					r = (a + z.intValue()).toString(b).substr(1) + r;
-					y.divRemTo(d, y, z);
-				}
-				return z.intValue().toString(b) + r;
-			};
-
-			// (protected) convert from radix string
-			BigInteger.prototype.fromRadix = function (s, b) {
-				this.fromInt(0);
-				if (b == null) b = 10;
-				var cs = this.chunkSize(b);
-				var d = Math.pow(b, cs), mi = false, j = 0, w = 0;
-				for (var i = 0; i < s.length; ++i) {
-					var x = intAt(s, i);
-					if (x < 0) {
-						if (s.charAt(i) == "-" && this.signum() == 0) mi = true;
-						continue;
-					}
-					w = b * w + x;
-					if (++j >= cs) {
-						this.dMultiply(d);
-						this.dAddOffset(w, 0);
-						j = 0;
-						w = 0;
-					}
-				}
-				if (j > 0) {
-					this.dMultiply(Math.pow(b, j));
-					this.dAddOffset(w, 0);
-				}
-				if (mi) BigInteger.ZERO.subTo(this, this);
-			};
-
-			// (protected) alternate constructor
-			BigInteger.prototype.fromNumber = function (a, b, c) {
-				if ("number" == typeof b) {
-					// new BigInteger(int,int,RNG)
-					if (a < 2) this.fromInt(1);
-					else {
-						this.fromNumber(a, c);
-						if (!this.testBit(a - 1))	// force MSB set
-							this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
-						if (this.isEven()) this.dAddOffset(1, 0); // force odd
-						while (!this.isProbablePrime(b)) {
-							this.dAddOffset(2, 0);
-							if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
-						}
-					}
+	// (public) return string representation in given radix
+	BigInteger.prototype.toString = function (b) {
+		if (this.s < 0) return "-" + this.negate().toString(b);
+		var k;
+		if (b == 16) k = 4;
+		else if (b == 8) k = 3;
+		else if (b == 2) k = 1;
+		else if (b == 32) k = 5;
+		else if (b == 4) k = 2;
+		else return this.toRadix(b);
+		var km = (1 << k) - 1, d, m = false, r = "", i = this.t;
+		var p = this.DB - (i * this.DB) % k;
+		if (i-- > 0) {
+			if (p < this.DB && (d = this[i] >> p) > 0) { m = true; r = int2char(d); }
+			while (i >= 0) {
+				if (p < k) {
+					d = (this[i] & ((1 << p) - 1)) << (k - p);
+					d |= this[--i] >> (p += this.DB - k);
 				}
 				else {
-					// new BigInteger(int,RNG)
-					var x = new Array(), t = a & 7;
-					x.length = (a >> 3) + 1;
-					b.nextBytes(x);
-					if (t > 0) x[0] &= ((1 << t) - 1); else x[0] = 0;
-					this.fromString(x, 256);
+					d = (this[i] >> (p -= k)) & km;
+					if (p <= 0) { p += this.DB; --i; }
 				}
-			};
+				if (d > 0) m = true;
+				if (m) r += int2char(d);
+			}
+		}
+		return m ? r : "0";
+	};
 
-			// (protected) r = this op a (bitwise)
-			BigInteger.prototype.bitwiseTo = function (a, op, r) {
-				var i, f, m = Math.min(a.t, this.t);
-				for (i = 0; i < m; ++i) r[i] = op(this[i], a[i]);
-				if (a.t < this.t) {
-					f = a.s & this.DM;
-					for (i = m; i < this.t; ++i) r[i] = op(this[i], f);
-					r.t = this.t;
+
+	// (public) -this
+	BigInteger.prototype.negate = function () { var r = nbi(); BigInteger.ZERO.subTo(this, r); return r; };
+
+	// (public) |this|
+	BigInteger.prototype.abs = function () { return (this.s < 0) ? this.negate() : this; };
+
+	// (public) return + if this > a, - if this < a, 0 if equal
+	BigInteger.prototype.compareTo = function (a) {
+		var r = this.s - a.s;
+		if (r != 0) return r;
+		var i = this.t;
+		r = i - a.t;
+		if (r != 0) return (this.s < 0) ? -r : r;
+		while (--i >= 0) if ((r = this[i] - a[i]) != 0) return r;
+		return 0;
+	}
+
+	// (public) return the number of bits in "this"
+	BigInteger.prototype.bitLength = function () {
+		if (this.t <= 0) return 0;
+		return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ (this.s & this.DM));
+	};
+
+	// (public) this mod a
+	BigInteger.prototype.mod = function (a) {
+		var r = nbi();
+		this.abs().divRemTo(a, null, r);
+		if (this.s < 0 && r.compareTo(BigInteger.ZERO) > 0) a.subTo(r, r);
+		return r;
+	}
+
+	// (public) this^e % m, 0 <= e < 2^32
+	BigInteger.prototype.modPowInt = function (e, m) {
+		var z;
+		if (e < 256 || m.isEven()) z = new Classic(m); else z = new Montgomery(m);
+		return this.exp(e, z);
+	};
+
+	// "constants"
+	BigInteger.ZERO = nbv(0);
+	BigInteger.ONE = nbv(1);
+
+
+
+
+
+
+
+	// Copyright (c) 2005-2009  Tom Wu
+	// All Rights Reserved.
+	// See "LICENSE" for details.
+	// Extended JavaScript BN functions, required for RSA private ops.
+	// Version 1.1: new BigInteger("0", 10) returns "proper" zero
+	// Version 1.2: square() API, isProbablePrime fix
+
+
+	// return index of lowest 1-bit in x, x < 2^31
+	function lbit(x) {
+		if (x == 0) return -1;
+		var r = 0;
+		if ((x & 0xffff) == 0) { x >>= 16; r += 16; }
+		if ((x & 0xff) == 0) { x >>= 8; r += 8; }
+		if ((x & 0xf) == 0) { x >>= 4; r += 4; }
+		if ((x & 3) == 0) { x >>= 2; r += 2; }
+		if ((x & 1) == 0) ++r;
+		return r;
+	}
+
+	// return number of 1 bits in x
+	function cbit(x) {
+		var r = 0;
+		while (x != 0) { x &= x - 1; ++r; }
+		return r;
+	}
+
+	var lowprimes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997];
+	var lplim = (1 << 26) / lowprimes[lowprimes.length - 1];
+
+
+
+	// (protected) return x s.t. r^x < DV
+	BigInteger.prototype.chunkSize = function (r) { return Math.floor(Math.LN2 * this.DB / Math.log(r)); };
+
+	// (protected) convert to radix string
+	BigInteger.prototype.toRadix = function (b) {
+		if (b == null) b = 10;
+		if (this.signum() == 0 || b < 2 || b > 36) return "0";
+		var cs = this.chunkSize(b);
+		var a = Math.pow(b, cs);
+		var d = nbv(a), y = nbi(), z = nbi(), r = "";
+		this.divRemTo(d, y, z);
+		while (y.signum() > 0) {
+			r = (a + z.intValue()).toString(b).substr(1) + r;
+			y.divRemTo(d, y, z);
+		}
+		return z.intValue().toString(b) + r;
+	};
+
+	// (protected) convert from radix string
+	BigInteger.prototype.fromRadix = function (s, b) {
+		this.fromInt(0);
+		if (b == null) b = 10;
+		var cs = this.chunkSize(b);
+		var d = Math.pow(b, cs), mi = false, j = 0, w = 0;
+		for (var i = 0; i < s.length; ++i) {
+			var x = intAt(s, i);
+			if (x < 0) {
+				if (s.charAt(i) == "-" && this.signum() == 0) mi = true;
+				continue;
+			}
+			w = b * w + x;
+			if (++j >= cs) {
+				this.dMultiply(d);
+				this.dAddOffset(w, 0);
+				j = 0;
+				w = 0;
+			}
+		}
+		if (j > 0) {
+			this.dMultiply(Math.pow(b, j));
+			this.dAddOffset(w, 0);
+		}
+		if (mi) BigInteger.ZERO.subTo(this, this);
+	};
+
+	// (protected) alternate constructor
+	BigInteger.prototype.fromNumber = function (a, b, c) {
+		if ("number" == typeof b) {
+			// new BigInteger(int,int,RNG)
+			if (a < 2) this.fromInt(1);
+			else {
+				this.fromNumber(a, c);
+				if (!this.testBit(a - 1))	// force MSB set
+					this.bitwiseTo(BigInteger.ONE.shiftLeft(a - 1), op_or, this);
+				if (this.isEven()) this.dAddOffset(1, 0); // force odd
+				while (!this.isProbablePrime(b)) {
+					this.dAddOffset(2, 0);
+					if (this.bitLength() > a) this.subTo(BigInteger.ONE.shiftLeft(a - 1), this);
+				}
+			}
+		}
+		else {
+			// new BigInteger(int,RNG)
+			var x = new Array(), t = a & 7;
+			x.length = (a >> 3) + 1;
+			b.nextBytes(x);
+			if (t > 0) x[0] &= ((1 << t) - 1); else x[0] = 0;
+			this.fromString(x, 256);
+		}
+	};
+
+	// (protected) r = this op a (bitwise)
+	BigInteger.prototype.bitwiseTo = function (a, op, r) {
+		var i, f, m = Math.min(a.t, this.t);
+		for (i = 0; i < m; ++i) r[i] = op(this[i], a[i]);
+		if (a.t < this.t) {
+			f = a.s & this.DM;
+			for (i = m; i < this.t; ++i) r[i] = op(this[i], f);
+			r.t = this.t;
+		}
+		else {
+			f = this.s & this.DM;
+			for (i = m; i < a.t; ++i) r[i] = op(f, a[i]);
+			r.t = a.t;
+		}
+		r.s = op(this.s, a.s);
+		r.clamp();
+	};
+
+	// (protected) this op (1<<n)
+	BigInteger.prototype.changeBit = function (n, op) {
+		var r = BigInteger.ONE.shiftLeft(n);
+		this.bitwiseTo(r, op, r);
+		return r;
+	};
+
+	// (protected) r = this + a
+	BigInteger.prototype.addTo = function (a, r) {
+		var i = 0, c = 0, m = Math.min(a.t, this.t);
+		while (i < m) {
+			c += this[i] + a[i];
+			r[i++] = c & this.DM;
+			c >>= this.DB;
+		}
+		if (a.t < this.t) {
+			c += a.s;
+			while (i < this.t) {
+				c += this[i];
+				r[i++] = c & this.DM;
+				c >>= this.DB;
+			}
+			c += this.s;
+		}
+		else {
+			c += this.s;
+			while (i < a.t) {
+				c += a[i];
+				r[i++] = c & this.DM;
+				c >>= this.DB;
+			}
+			c += a.s;
+		}
+		r.s = (c < 0) ? -1 : 0;
+		if (c > 0) r[i++] = c;
+		else if (c < -1) r[i++] = this.DV + c;
+		r.t = i;
+		r.clamp();
+	};
+
+	// (protected) this *= n, this >= 0, 1 < n < DV
+	BigInteger.prototype.dMultiply = function (n) {
+		this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);
+		++this.t;
+		this.clamp();
+	};
+
+	// (protected) this += n << w words, this >= 0
+	BigInteger.prototype.dAddOffset = function (n, w) {
+		if (n == 0) return;
+		while (this.t <= w) this[this.t++] = 0;
+		this[w] += n;
+		while (this[w] >= this.DV) {
+			this[w] -= this.DV;
+			if (++w >= this.t) this[this.t++] = 0;
+			++this[w];
+		}
+	};
+
+	// (protected) r = lower n words of "this * a", a.t <= n
+	// "this" should be the larger one if appropriate.
+	BigInteger.prototype.multiplyLowerTo = function (a, n, r) {
+		var i = Math.min(this.t + a.t, n);
+		r.s = 0; // assumes a,this >= 0
+		r.t = i;
+		while (i > 0) r[--i] = 0;
+		var j;
+		for (j = r.t - this.t; i < j; ++i) r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
+		for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a[i], r, i, 0, n - i);
+		r.clamp();
+	};
+
+
+	// (protected) r = "this * a" without lower n words, n > 0
+	// "this" should be the larger one if appropriate.
+	BigInteger.prototype.multiplyUpperTo = function (a, n, r) {
+		--n;
+		var i = r.t = this.t + a.t - n;
+		r.s = 0; // assumes a,this >= 0
+		while (--i >= 0) r[i] = 0;
+		for (i = Math.max(n - this.t, 0); i < a.t; ++i)
+			r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
+		r.clamp();
+		r.drShiftTo(1, r);
+	};
+
+	// (protected) this % n, n < 2^26
+	BigInteger.prototype.modInt = function (n) {
+		if (n <= 0) return 0;
+		var d = this.DV % n, r = (this.s < 0) ? n - 1 : 0;
+		if (this.t > 0)
+			if (d == 0) r = this[0] % n;
+			else for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n;
+		return r;
+	};
+
+
+	// (protected) true if probably prime (HAC 4.24, Miller-Rabin)
+	BigInteger.prototype.millerRabin = function (t) {
+		var n1 = this.subtract(BigInteger.ONE);
+		var k = n1.getLowestSetBit();
+		if (k <= 0) return false;
+		var r = n1.shiftRight(k);
+		t = (t + 1) >> 1;
+		if (t > lowprimes.length) t = lowprimes.length;
+		var a = nbi();
+		for (var i = 0; i < t; ++i) {
+			//Pick bases at random, instead of starting at 2
+			a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
+			var y = a.modPow(r, this);
+			if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
+				var j = 1;
+				while (j++ < k && y.compareTo(n1) != 0) {
+					y = y.modPowInt(2, this);
+					if (y.compareTo(BigInteger.ONE) == 0) return false;
+				}
+				if (y.compareTo(n1) != 0) return false;
+			}
+		}
+		return true;
+	};
+
+
+
+	// (public)
+	BigInteger.prototype.clone = function () { var r = nbi(); this.copyTo(r); return r; };
+
+	// (public) return value as integer
+	BigInteger.prototype.intValue = function () {
+		if (this.s < 0) {
+			if (this.t == 1) return this[0] - this.DV;
+			else if (this.t == 0) return -1;
+		}
+		else if (this.t == 1) return this[0];
+		else if (this.t == 0) return 0;
+		// assumes 16 < DB < 32
+		return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];
+	};
+
+
+	// (public) return value as byte
+	BigInteger.prototype.byteValue = function () { return (this.t == 0) ? this.s : (this[0] << 24) >> 24; };
+
+	// (public) return value as short (assumes DB>=16)
+	BigInteger.prototype.shortValue = function () { return (this.t == 0) ? this.s : (this[0] << 16) >> 16; };
+
+	// (public) 0 if this == 0, 1 if this > 0
+	BigInteger.prototype.signum = function () {
+		if (this.s < 0) return -1;
+		else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
+		else return 1;
+	};
+
+
+	// (public) convert to bigendian byte array
+	BigInteger.prototype.toByteArray = function () {
+		var i = this.t, r = new Array();
+		r[0] = this.s;
+		var p = this.DB - (i * this.DB) % 8, d, k = 0;
+		if (i-- > 0) {
+			if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p)
+				r[k++] = d | (this.s << (this.DB - p));
+			while (i >= 0) {
+				if (p < 8) {
+					d = (this[i] & ((1 << p) - 1)) << (8 - p);
+					d |= this[--i] >> (p += this.DB - 8);
 				}
 				else {
-					f = this.s & this.DM;
-					for (i = m; i < a.t; ++i) r[i] = op(f, a[i]);
-					r.t = a.t;
+					d = (this[i] >> (p -= 8)) & 0xff;
+					if (p <= 0) { p += this.DB; --i; }
 				}
-				r.s = op(this.s, a.s);
-				r.clamp();
-			};
-
-			// (protected) this op (1<<n)
-			BigInteger.prototype.changeBit = function (n, op) {
-				var r = BigInteger.ONE.shiftLeft(n);
-				this.bitwiseTo(r, op, r);
-				return r;
-			};
-
-			// (protected) r = this + a
-			BigInteger.prototype.addTo = function (a, r) {
-				var i = 0, c = 0, m = Math.min(a.t, this.t);
-				while (i < m) {
-					c += this[i] + a[i];
-					r[i++] = c & this.DM;
-					c >>= this.DB;
-				}
-				if (a.t < this.t) {
-					c += a.s;
-					while (i < this.t) {
-						c += this[i];
-						r[i++] = c & this.DM;
-						c >>= this.DB;
-					}
-					c += this.s;
-				}
-				else {
-					c += this.s;
-					while (i < a.t) {
-						c += a[i];
-						r[i++] = c & this.DM;
-						c >>= this.DB;
-					}
-					c += a.s;
-				}
-				r.s = (c < 0) ? -1 : 0;
-				if (c > 0) r[i++] = c;
-				else if (c < -1) r[i++] = this.DV + c;
-				r.t = i;
-				r.clamp();
-			};
-
-			// (protected) this *= n, this >= 0, 1 < n < DV
-			BigInteger.prototype.dMultiply = function (n) {
-				this[this.t] = this.am(0, n - 1, this, 0, 0, this.t);
-				++this.t;
-				this.clamp();
-			};
-
-			// (protected) this += n << w words, this >= 0
-			BigInteger.prototype.dAddOffset = function (n, w) {
-				if (n == 0) return;
-				while (this.t <= w) this[this.t++] = 0;
-				this[w] += n;
-				while (this[w] >= this.DV) {
-					this[w] -= this.DV;
-					if (++w >= this.t) this[this.t++] = 0;
-					++this[w];
-				}
-			};
-
-			// (protected) r = lower n words of "this * a", a.t <= n
-			// "this" should be the larger one if appropriate.
-			BigInteger.prototype.multiplyLowerTo = function (a, n, r) {
-				var i = Math.min(this.t + a.t, n);
-				r.s = 0; // assumes a,this >= 0
-				r.t = i;
-				while (i > 0) r[--i] = 0;
-				var j;
-				for (j = r.t - this.t; i < j; ++i) r[i + this.t] = this.am(0, a[i], r, i, 0, this.t);
-				for (j = Math.min(a.t, n); i < j; ++i) this.am(0, a[i], r, i, 0, n - i);
-				r.clamp();
-			};
-
-
-			// (protected) r = "this * a" without lower n words, n > 0
-			// "this" should be the larger one if appropriate.
-			BigInteger.prototype.multiplyUpperTo = function (a, n, r) {
-				--n;
-				var i = r.t = this.t + a.t - n;
-				r.s = 0; // assumes a,this >= 0
-				while (--i >= 0) r[i] = 0;
-				for (i = Math.max(n - this.t, 0); i < a.t; ++i)
-					r[this.t + i - n] = this.am(n - i, a[i], r, 0, 0, this.t + i - n);
-				r.clamp();
-				r.drShiftTo(1, r);
-			};
-
-			// (protected) this % n, n < 2^26
-			BigInteger.prototype.modInt = function (n) {
-				if (n <= 0) return 0;
-				var d = this.DV % n, r = (this.s < 0) ? n - 1 : 0;
-				if (this.t > 0)
-					if (d == 0) r = this[0] % n;
-					else for (var i = this.t - 1; i >= 0; --i) r = (d * r + this[i]) % n;
-				return r;
-			};
-
-
-			// (protected) true if probably prime (HAC 4.24, Miller-Rabin)
-			BigInteger.prototype.millerRabin = function (t) {
-				var n1 = this.subtract(BigInteger.ONE);
-				var k = n1.getLowestSetBit();
-				if (k <= 0) return false;
-				var r = n1.shiftRight(k);
-				t = (t + 1) >> 1;
-				if (t > lowprimes.length) t = lowprimes.length;
-				var a = nbi();
-				for (var i = 0; i < t; ++i) {
-					//Pick bases at random, instead of starting at 2
-					a.fromInt(lowprimes[Math.floor(Math.random() * lowprimes.length)]);
-					var y = a.modPow(r, this);
-					if (y.compareTo(BigInteger.ONE) != 0 && y.compareTo(n1) != 0) {
-						var j = 1;
-						while (j++ < k && y.compareTo(n1) != 0) {
-							y = y.modPowInt(2, this);
-							if (y.compareTo(BigInteger.ONE) == 0) return false;
-						}
-						if (y.compareTo(n1) != 0) return false;
-					}
-				}
-				return true;
-			};
-
-
-
-			// (public)
-			BigInteger.prototype.clone = function () { var r = nbi(); this.copyTo(r); return r; };
-
-			// (public) return value as integer
-			BigInteger.prototype.intValue = function () {
-				if (this.s < 0) {
-					if (this.t == 1) return this[0] - this.DV;
-					else if (this.t == 0) return -1;
-				}
-				else if (this.t == 1) return this[0];
-				else if (this.t == 0) return 0;
-				// assumes 16 < DB < 32
-				return ((this[1] & ((1 << (32 - this.DB)) - 1)) << this.DB) | this[0];
-			};
-
-
-			// (public) return value as byte
-			BigInteger.prototype.byteValue = function () { return (this.t == 0) ? this.s : (this[0] << 24) >> 24; };
-
-			// (public) return value as short (assumes DB>=16)
-			BigInteger.prototype.shortValue = function () { return (this.t == 0) ? this.s : (this[0] << 16) >> 16; };
-
-			// (public) 0 if this == 0, 1 if this > 0
-			BigInteger.prototype.signum = function () {
-				if (this.s < 0) return -1;
-				else if (this.t <= 0 || (this.t == 1 && this[0] <= 0)) return 0;
-				else return 1;
-			};
-
-
-			// (public) convert to bigendian byte array
-			BigInteger.prototype.toByteArray = function () {
-				var i = this.t, r = new Array();
-				r[0] = this.s;
-				var p = this.DB - (i * this.DB) % 8, d, k = 0;
-				if (i-- > 0) {
-					if (p < this.DB && (d = this[i] >> p) != (this.s & this.DM) >> p)
-						r[k++] = d | (this.s << (this.DB - p));
-					while (i >= 0) {
-						if (p < 8) {
-							d = (this[i] & ((1 << p) - 1)) << (8 - p);
-							d |= this[--i] >> (p += this.DB - 8);
-						}
-						else {
-							d = (this[i] >> (p -= 8)) & 0xff;
-							if (p <= 0) { p += this.DB; --i; }
-						}
-						if ((d & 0x80) != 0) d |= -256;
-						if (k == 0 && (this.s & 0x80) != (d & 0x80)) ++k;
-						if (k > 0 || d != this.s) r[k++] = d;
-					}
-				}
-				return r;
-			};
-
-			BigInteger.prototype.equals = function (a) { return (this.compareTo(a) == 0); };
-			BigInteger.prototype.min = function (a) { return (this.compareTo(a) < 0) ? this : a; };
-			BigInteger.prototype.max = function (a) { return (this.compareTo(a) > 0) ? this : a; };
-
-			// (public) this & a
-			function op_and(x, y) { return x & y; }
-			BigInteger.prototype.and = function (a) { var r = nbi(); this.bitwiseTo(a, op_and, r); return r; };
-
-			// (public) this | a
-			function op_or(x, y) { return x | y; }
-			BigInteger.prototype.or = function (a) { var r = nbi(); this.bitwiseTo(a, op_or, r); return r; };
-
-			// (public) this ^ a
-			function op_xor(x, y) { return x ^ y; }
-			BigInteger.prototype.xor = function (a) { var r = nbi(); this.bitwiseTo(a, op_xor, r); return r; };
-
-			// (public) this & ~a
-			function op_andnot(x, y) { return x & ~y; }
-			BigInteger.prototype.andNot = function (a) { var r = nbi(); this.bitwiseTo(a, op_andnot, r); return r; };
-
-			// (public) ~this
-			BigInteger.prototype.not = function () {
-				var r = nbi();
-				for (var i = 0; i < this.t; ++i) r[i] = this.DM & ~this[i];
-				r.t = this.t;
-				r.s = ~this.s;
-				return r;
-			};
-
-			// (public) this << n
-			BigInteger.prototype.shiftLeft = function (n) {
-				var r = nbi();
-				if (n < 0) this.rShiftTo(-n, r); else this.lShiftTo(n, r);
-				return r;
-			};
-
-			// (public) this >> n
-			BigInteger.prototype.shiftRight = function (n) {
-				var r = nbi();
-				if (n < 0) this.lShiftTo(-n, r); else this.rShiftTo(n, r);
-				return r;
-			};
-
-			// (public) returns index of lowest 1-bit (or -1 if none)
-			BigInteger.prototype.getLowestSetBit = function () {
-				for (var i = 0; i < this.t; ++i)
-					if (this[i] != 0) return i * this.DB + lbit(this[i]);
-				if (this.s < 0) return this.t * this.DB;
-				return -1;
-			};
-
-			// (public) return number of set bits
-			BigInteger.prototype.bitCount = function () {
-				var r = 0, x = this.s & this.DM;
-				for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);
-				return r;
-			};
-
-			// (public) true iff nth bit is set
-			BigInteger.prototype.testBit = function (n) {
-				var j = Math.floor(n / this.DB);
-				if (j >= this.t) return (this.s != 0);
-				return ((this[j] & (1 << (n % this.DB))) != 0);
-			};
-
-			// (public) this | (1<<n)
-			BigInteger.prototype.setBit = function (n) { return this.changeBit(n, op_or); };
-			// (public) this & ~(1<<n)
-			BigInteger.prototype.clearBit = function (n) { return this.changeBit(n, op_andnot); };
-			// (public) this ^ (1<<n)
-			BigInteger.prototype.flipBit = function (n) { return this.changeBit(n, op_xor); };
-			// (public) this + a
-			BigInteger.prototype.add = function (a) { var r = nbi(); this.addTo(a, r); return r; };
-			// (public) this - a
-			BigInteger.prototype.subtract = function (a) { var r = nbi(); this.subTo(a, r); return r; };
-			// (public) this * a
-			BigInteger.prototype.multiply = function (a) { var r = nbi(); this.multiplyTo(a, r); return r; };
-			// (public) this / a
-			BigInteger.prototype.divide = function (a) { var r = nbi(); this.divRemTo(a, r, null); return r; };
-			// (public) this % a
-			BigInteger.prototype.remainder = function (a) { var r = nbi(); this.divRemTo(a, null, r); return r; };
-			// (public) [this/a,this%a]
-			BigInteger.prototype.divideAndRemainder = function (a) {
-				var q = nbi(), r = nbi();
-				this.divRemTo(a, q, r);
-				return new Array(q, r);
-			};
-
-			// (public) this^e % m (HAC 14.85)
-			BigInteger.prototype.modPow = function (e, m) {
-				var i = e.bitLength(), k, r = nbv(1), z;
-				if (i <= 0) return r;
-				else if (i < 18) k = 1;
-				else if (i < 48) k = 3;
-				else if (i < 144) k = 4;
-				else if (i < 768) k = 5;
-				else k = 6;
-				if (i < 8)
-					z = new Classic(m);
-				else if (m.isEven())
-					z = new Barrett(m);
-				else
-					z = new Montgomery(m);
-
-				// precomputation
-				var g = new Array(), n = 3, k1 = k - 1, km = (1 << k) - 1;
-				g[1] = z.convert(this);
-				if (k > 1) {
-					var g2 = nbi();
-					z.sqrTo(g[1], g2);
-					while (n <= km) {
-						g[n] = nbi();
-						z.mulTo(g2, g[n - 2], g[n]);
-						n += 2;
-					}
-				}
-
-				var j = e.t - 1, w, is1 = true, r2 = nbi(), t;
-				i = nbits(e[j]) - 1;
-				while (j >= 0) {
-					if (i >= k1) w = (e[j] >> (i - k1)) & km;
-					else {
-						w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);
-						if (j > 0) w |= e[j - 1] >> (this.DB + i - k1);
-					}
-
-					n = k;
-					while ((w & 1) == 0) { w >>= 1; --n; }
-					if ((i -= n) < 0) { i += this.DB; --j; }
-					if (is1) {	// ret == 1, don't bother squaring or multiplying it
-						g[w].copyTo(r);
-						is1 = false;
-					}
-					else {
-						while (n > 1) { z.sqrTo(r, r2); z.sqrTo(r2, r); n -= 2; }
-						if (n > 0) z.sqrTo(r, r2); else { t = r; r = r2; r2 = t; }
-						z.mulTo(r2, g[w], r);
-					}
-
-					while (j >= 0 && (e[j] & (1 << i)) == 0) {
-						z.sqrTo(r, r2); t = r; r = r2; r2 = t;
-						if (--i < 0) { i = this.DB - 1; --j; }
-					}
-				}
-				return z.revert(r);
-			};
-
-			// (public) 1/this % m (HAC 14.61)
-			BigInteger.prototype.modInverse = function (m) {
-				var ac = m.isEven();
-				if ((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
-				var u = m.clone(), v = this.clone();
-				var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);
-				while (u.signum() != 0) {
-					while (u.isEven()) {
-						u.rShiftTo(1, u);
-						if (ac) {
-							if (!a.isEven() || !b.isEven()) { a.addTo(this, a); b.subTo(m, b); }
-							a.rShiftTo(1, a);
-						}
-						else if (!b.isEven()) b.subTo(m, b);
-						b.rShiftTo(1, b);
-					}
-					while (v.isEven()) {
-						v.rShiftTo(1, v);
-						if (ac) {
-							if (!c.isEven() || !d.isEven()) { c.addTo(this, c); d.subTo(m, d); }
-							c.rShiftTo(1, c);
-						}
-						else if (!d.isEven()) d.subTo(m, d);
-						d.rShiftTo(1, d);
-					}
-					if (u.compareTo(v) >= 0) {
-						u.subTo(v, u);
-						if (ac) a.subTo(c, a);
-						b.subTo(d, b);
-					}
-					else {
-						v.subTo(u, v);
-						if (ac) c.subTo(a, c);
-						d.subTo(b, d);
-					}
-				}
-				if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
-				if (d.compareTo(m) >= 0) return d.subtract(m);
-				if (d.signum() < 0) d.addTo(m, d); else return d;
-				if (d.signum() < 0) return d.add(m); else return d;
-			};
-
-
-			// (public) this^e
-			BigInteger.prototype.pow = function (e) { return this.exp(e, new NullExp()); };
-
-			// (public) gcd(this,a) (HAC 14.54)
-			BigInteger.prototype.gcd = function (a) {
-				var x = (this.s < 0) ? this.negate() : this.clone();
-				var y = (a.s < 0) ? a.negate() : a.clone();
-				if (x.compareTo(y) < 0) { var t = x; x = y; y = t; }
-				var i = x.getLowestSetBit(), g = y.getLowestSetBit();
-				if (g < 0) return x;
-				if (i < g) g = i;
-				if (g > 0) {
-					x.rShiftTo(g, x);
-					y.rShiftTo(g, y);
-				}
-				while (x.signum() > 0) {
-					if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);
-					if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);
-					if (x.compareTo(y) >= 0) {
-						x.subTo(y, x);
-						x.rShiftTo(1, x);
-					}
-					else {
-						y.subTo(x, y);
-						y.rShiftTo(1, y);
-					}
-				}
-				if (g > 0) y.lShiftTo(g, y);
-				return y;
-			};
-
-			// (public) test primality with certainty >= 1-.5^t
-			BigInteger.prototype.isProbablePrime = function (t) {
-				var i, x = this.abs();
-				if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {
-					for (i = 0; i < lowprimes.length; ++i)
-						if (x[0] == lowprimes[i]) return true;
-					return false;
-				}
-				if (x.isEven()) return false;
-				i = 1;
-				while (i < lowprimes.length) {
-					var m = lowprimes[i], j = i + 1;
-					while (j < lowprimes.length && m < lplim) m *= lowprimes[j++];
-					m = x.modInt(m);
-					while (i < j) if (m % lowprimes[i++] == 0) return false;
-				}
-				return x.millerRabin(t);
-			};
-
-
-			// JSBN-specific extension
-
-			// (public) this^2
-			BigInteger.prototype.square = function () { var r = nbi(); this.squareTo(r); return r; };
-
-
-			// NOTE: BigInteger interfaces not implemented in jsbn:
-			// BigInteger(int signum, byte[] magnitude)
-			// double doubleValue()
-			// float floatValue()
-			// int hashCode()
-			// long longValue()
-			// static BigInteger valueOf(long val)
-
-
-
-			// Copyright Stephan Thomas (start) --- //
-			// https://raw.github.com/bitcoinjs/bitcoinjs-lib/07f9d55ccb6abd962efb6befdd37671f85ea4ff9/src/util.js
-			// BigInteger monkey patching
-			BigInteger.valueOf = nbv;
-
-			/**
-			* Returns a byte array representation of the big integer.
-			*
-			* This returns the absolute of the contained value in big endian
-			* form. A value of zero results in an empty array.
-			*/
-			BigInteger.prototype.toByteArrayUnsigned = function () {
-				var ba = this.abs().toByteArray();
-				if (ba.length) {
-					if (ba[0] == 0) {
-						ba = ba.slice(1);
-					}
-					return ba.map(function (v) {
-						return (v < 0) ? v + 256 : v;
-					});
-				} else {
-					// Empty array, nothing to do
-					return ba;
-				}
-			};
-
-			/**
-			* Turns a byte array into a big integer.
-			*
-			* This function will interpret a byte array as a big integer in big
-			* endian notation and ignore leading zeros.
-			*/
-			BigInteger.fromByteArrayUnsigned = function (ba) {
-				if (!ba.length) {
-					return ba.valueOf(0);
-				} else if (ba[0] & 0x80) {
-					// Prepend a zero so the BigInteger class doesn't mistake this
-					// for a negative integer.
-					return new BigInteger([0].concat(ba));
-				} else {
-					return new BigInteger(ba);
-				}
-			};
-
-			/**
-			* Converts big integer to signed byte representation.
-			*
-			* The format for this value uses a the most significant bit as a sign
-			* bit. If the most significant bit is already occupied by the
-			* absolute value, an extra byte is prepended and the sign bit is set
-			* there.
-			*
-			* Examples:
-			*
-			*      0 =>     0x00
-			*      1 =>     0x01
-			*     -1 =>     0x81
-			*    127 =>     0x7f
-			*   -127 =>     0xff
-			*    128 =>   0x0080
-			*   -128 =>   0x8080
-			*    255 =>   0x00ff
-			*   -255 =>   0x80ff
-			*  16300 =>   0x3fac
-			* -16300 =>   0xbfac
-			*  62300 => 0x00f35c
-			* -62300 => 0x80f35c
-			*/
-			BigInteger.prototype.toByteArraySigned = function () {
-				var val = this.abs().toByteArrayUnsigned();
-				var neg = this.compareTo(BigInteger.ZERO) < 0;
-
-				if (neg) {
-					if (val[0] & 0x80) {
-						val.unshift(0x80);
-					} else {
-						val[0] |= 0x80;
-					}
-				} else {
-					if (val[0] & 0x80) {
-						val.unshift(0x00);
-					}
-				}
-
-				return val;
-			};
-
-			/**
-			* Parse a signed big integer byte representation.
-			*
-			* For details on the format please see BigInteger.toByteArraySigned.
-			*/
-			BigInteger.fromByteArraySigned = function (ba) {
-				// Check for negative value
-				if (ba[0] & 0x80) {
-					// Remove sign bit
-					ba[0] &= 0x7f;
-
-					return BigInteger.fromByteArrayUnsigned(ba).negate();
-				} else {
-					return BigInteger.fromByteArrayUnsigned(ba);
-				}
-			};
-			// Copyright Stephan Thomas (end) --- //
-
-
-
-
-			// ****** REDUCTION ******* //
-
-			// Modular reduction using "classic" algorithm
-			function Classic(m) { this.m = m; }
-			Classic.prototype.convert = function (x) {
-				if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
-				else return x;
-			};
-			Classic.prototype.revert = function (x) { return x; };
-			Classic.prototype.reduce = function (x) { x.divRemTo(this.m, null, x); };
-			Classic.prototype.mulTo = function (x, y, r) { x.multiplyTo(y, r); this.reduce(r); };
-			Classic.prototype.sqrTo = function (x, r) { x.squareTo(r); this.reduce(r); };
-
-
-
-
-
-			// Montgomery reduction
-			function Montgomery(m) {
-				this.m = m;
-				this.mp = m.invDigit();
-				this.mpl = this.mp & 0x7fff;
-				this.mph = this.mp >> 15;
-				this.um = (1 << (m.DB - 15)) - 1;
-				this.mt2 = 2 * m.t;
+				if ((d & 0x80) != 0) d |= -256;
+				if (k == 0 && (this.s & 0x80) != (d & 0x80)) ++k;
+				if (k > 0 || d != this.s) r[k++] = d;
 			}
-			// xR mod m
-			Montgomery.prototype.convert = function (x) {
-				var r = nbi();
-				x.abs().dlShiftTo(this.m.t, r);
-				r.divRemTo(this.m, null, r);
-				if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);
-				return r;
+		}
+		return r;
+	};
+
+	BigInteger.prototype.equals = function (a) { return (this.compareTo(a) == 0); };
+	BigInteger.prototype.min = function (a) { return (this.compareTo(a) < 0) ? this : a; };
+	BigInteger.prototype.max = function (a) { return (this.compareTo(a) > 0) ? this : a; };
+
+	// (public) this & a
+	function op_and(x, y) { return x & y; }
+	BigInteger.prototype.and = function (a) { var r = nbi(); this.bitwiseTo(a, op_and, r); return r; };
+
+	// (public) this | a
+	function op_or(x, y) { return x | y; }
+	BigInteger.prototype.or = function (a) { var r = nbi(); this.bitwiseTo(a, op_or, r); return r; };
+
+	// (public) this ^ a
+	function op_xor(x, y) { return x ^ y; }
+	BigInteger.prototype.xor = function (a) { var r = nbi(); this.bitwiseTo(a, op_xor, r); return r; };
+
+	// (public) this & ~a
+	function op_andnot(x, y) { return x & ~y; }
+	BigInteger.prototype.andNot = function (a) { var r = nbi(); this.bitwiseTo(a, op_andnot, r); return r; };
+
+	// (public) ~this
+	BigInteger.prototype.not = function () {
+		var r = nbi();
+		for (var i = 0; i < this.t; ++i) r[i] = this.DM & ~this[i];
+		r.t = this.t;
+		r.s = ~this.s;
+		return r;
+	};
+
+	// (public) this << n
+	BigInteger.prototype.shiftLeft = function (n) {
+		var r = nbi();
+		if (n < 0) this.rShiftTo(-n, r); else this.lShiftTo(n, r);
+		return r;
+	};
+
+	// (public) this >> n
+	BigInteger.prototype.shiftRight = function (n) {
+		var r = nbi();
+		if (n < 0) this.lShiftTo(-n, r); else this.rShiftTo(n, r);
+		return r;
+	};
+
+	// (public) returns index of lowest 1-bit (or -1 if none)
+	BigInteger.prototype.getLowestSetBit = function () {
+		for (var i = 0; i < this.t; ++i)
+			if (this[i] != 0) return i * this.DB + lbit(this[i]);
+		if (this.s < 0) return this.t * this.DB;
+		return -1;
+	};
+
+	// (public) return number of set bits
+	BigInteger.prototype.bitCount = function () {
+		var r = 0, x = this.s & this.DM;
+		for (var i = 0; i < this.t; ++i) r += cbit(this[i] ^ x);
+		return r;
+	};
+
+	// (public) true iff nth bit is set
+	BigInteger.prototype.testBit = function (n) {
+		var j = Math.floor(n / this.DB);
+		if (j >= this.t) return (this.s != 0);
+		return ((this[j] & (1 << (n % this.DB))) != 0);
+	};
+
+	// (public) this | (1<<n)
+	BigInteger.prototype.setBit = function (n) { return this.changeBit(n, op_or); };
+	// (public) this & ~(1<<n)
+	BigInteger.prototype.clearBit = function (n) { return this.changeBit(n, op_andnot); };
+	// (public) this ^ (1<<n)
+	BigInteger.prototype.flipBit = function (n) { return this.changeBit(n, op_xor); };
+	// (public) this + a
+	BigInteger.prototype.add = function (a) { var r = nbi(); this.addTo(a, r); return r; };
+	// (public) this - a
+	BigInteger.prototype.subtract = function (a) { var r = nbi(); this.subTo(a, r); return r; };
+	// (public) this * a
+	BigInteger.prototype.multiply = function (a) { var r = nbi(); this.multiplyTo(a, r); return r; };
+	// (public) this / a
+	BigInteger.prototype.divide = function (a) { var r = nbi(); this.divRemTo(a, r, null); return r; };
+	// (public) this % a
+	BigInteger.prototype.remainder = function (a) { var r = nbi(); this.divRemTo(a, null, r); return r; };
+	// (public) [this/a,this%a]
+	BigInteger.prototype.divideAndRemainder = function (a) {
+		var q = nbi(), r = nbi();
+		this.divRemTo(a, q, r);
+		return new Array(q, r);
+	};
+
+	// (public) this^e % m (HAC 14.85)
+	BigInteger.prototype.modPow = function (e, m) {
+		var i = e.bitLength(), k, r = nbv(1), z;
+		if (i <= 0) return r;
+		else if (i < 18) k = 1;
+		else if (i < 48) k = 3;
+		else if (i < 144) k = 4;
+		else if (i < 768) k = 5;
+		else k = 6;
+		if (i < 8)
+			z = new Classic(m);
+		else if (m.isEven())
+			z = new Barrett(m);
+		else
+			z = new Montgomery(m);
+
+		// precomputation
+		var g = new Array(), n = 3, k1 = k - 1, km = (1 << k) - 1;
+		g[1] = z.convert(this);
+		if (k > 1) {
+			var g2 = nbi();
+			z.sqrTo(g[1], g2);
+			while (n <= km) {
+				g[n] = nbi();
+				z.mulTo(g2, g[n - 2], g[n]);
+				n += 2;
 			}
-			// x/R mod m
-			Montgomery.prototype.revert = function (x) {
-				var r = nbi();
-				x.copyTo(r);
-				this.reduce(r);
-				return r;
-			};
-			// x = x/R mod m (HAC 14.32)
-			Montgomery.prototype.reduce = function (x) {
-				while (x.t <= this.mt2)	// pad x so am has enough room later
-					x[x.t++] = 0;
-				for (var i = 0; i < this.m.t; ++i) {
-					// faster way of calculating u0 = x[i]*mp mod DV
-					var j = x[i] & 0x7fff;
-					var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;
-					// use am to combine the multiply-shift-add into one call
-					j = i + this.m.t;
-					x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
-					// propagate carry
-					while (x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; }
-				}
-				x.clamp();
-				x.drShiftTo(this.m.t, x);
-				if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
-			};
-			// r = "xy/R mod m"; x,y != r
-			Montgomery.prototype.mulTo = function (x, y, r) { x.multiplyTo(y, r); this.reduce(r); };
-			// r = "x^2/R mod m"; x != r
-			Montgomery.prototype.sqrTo = function (x, r) { x.squareTo(r); this.reduce(r); };
-
-
-
-
-
-			// A "null" reducer
-			function NullExp() { }
-			NullExp.prototype.convert = function (x) { return x; };
-			NullExp.prototype.revert = function (x) { return x; };
-			NullExp.prototype.mulTo = function (x, y, r) { x.multiplyTo(y, r); };
-			NullExp.prototype.sqrTo = function (x, r) { x.squareTo(r); };
-
-
-
-
-
-			// Barrett modular reduction
-			function Barrett(m) {
-				// setup Barrett
-				this.r2 = nbi();
-				this.q3 = nbi();
-				BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);
-				this.mu = this.r2.divide(m);
-				this.m = m;
-			}
-			Barrett.prototype.convert = function (x) {
-				if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);
-				else if (x.compareTo(this.m) < 0) return x;
-				else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
-			};
-			Barrett.prototype.revert = function (x) { return x; };
-			// x = x mod m (HAC 14.42)
-			Barrett.prototype.reduce = function (x) {
-				x.drShiftTo(this.m.t - 1, this.r2);
-				if (x.t > this.m.t + 1) { x.t = this.m.t + 1; x.clamp(); }
-				this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
-				this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
-				while (x.compareTo(this.r2) < 0) x.dAddOffset(1, this.m.t + 1);
-				x.subTo(this.r2, x);
-				while (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
-			};
-			// r = x*y mod m; x,y != r
-			Barrett.prototype.mulTo = function (x, y, r) { x.multiplyTo(y, r); this.reduce(r); };
-			// r = x^2 mod m; x != r
-			Barrett.prototype.sqrTo = function (x, r) { x.squareTo(r); this.reduce(r); };
-
-		})();
-	</script>
-
-	<script type="text/javascript">
-	//---------------------------------------------------------------------
-	// QRCode for JavaScript
-	//
-	// Copyright (c) 2009 Kazuhiko Arase
-	//
-	// URL: http://www.d-project.com/
-	//
-	// Licensed under the MIT license:
-	//   http://www.opensource.org/licenses/mit-license.php
-	//
-	// The word "QR Code" is registered trademark of 
-	// DENSO WAVE INCORPORATED
-	//   http://www.denso-wave.com/qrcode/faqpatent-e.html
-	//
-	//---------------------------------------------------------------------
-
-	(function () {
-		//---------------------------------------------------------------------
-		// QRCode
-		//---------------------------------------------------------------------
-
-		var QRCode = window.QRCode = function (typeNumber, errorCorrectLevel) {
-			this.typeNumber = typeNumber;
-			this.errorCorrectLevel = errorCorrectLevel;
-			this.modules = null;
-			this.moduleCount = 0;
-			this.dataCache = null;
-			this.dataList = new Array();
 		}
 
-		QRCode.prototype = {
+		var j = e.t - 1, w, is1 = true, r2 = nbi(), t;
+		i = nbits(e[j]) - 1;
+		while (j >= 0) {
+			if (i >= k1) w = (e[j] >> (i - k1)) & km;
+			else {
+				w = (e[j] & ((1 << (i + 1)) - 1)) << (k1 - i);
+				if (j > 0) w |= e[j - 1] >> (this.DB + i - k1);
+			}
 
-			addData: function (data) {
-				var newData = new QRCode.QR8bitByte(data);
-				this.dataList.push(newData);
-				this.dataCache = null;
-			},
+			n = k;
+			while ((w & 1) == 0) { w >>= 1; --n; }
+			if ((i -= n) < 0) { i += this.DB; --j; }
+			if (is1) {	// ret == 1, don't bother squaring or multiplying it
+				g[w].copyTo(r);
+				is1 = false;
+			}
+			else {
+				while (n > 1) { z.sqrTo(r, r2); z.sqrTo(r2, r); n -= 2; }
+				if (n > 0) z.sqrTo(r, r2); else { t = r; r = r2; r2 = t; }
+				z.mulTo(r2, g[w], r);
+			}
 
-			isDark: function (row, col) {
-				if (row < 0 || this.moduleCount <= row || col < 0 || this.moduleCount <= col) {
-					throw new Error(row + "," + col);
+			while (j >= 0 && (e[j] & (1 << i)) == 0) {
+				z.sqrTo(r, r2); t = r; r = r2; r2 = t;
+				if (--i < 0) { i = this.DB - 1; --j; }
+			}
+		}
+		return z.revert(r);
+	};
+
+	// (public) 1/this % m (HAC 14.61)
+	BigInteger.prototype.modInverse = function (m) {
+		var ac = m.isEven();
+		if ((this.isEven() && ac) || m.signum() == 0) return BigInteger.ZERO;
+		var u = m.clone(), v = this.clone();
+		var a = nbv(1), b = nbv(0), c = nbv(0), d = nbv(1);
+		while (u.signum() != 0) {
+			while (u.isEven()) {
+				u.rShiftTo(1, u);
+				if (ac) {
+					if (!a.isEven() || !b.isEven()) { a.addTo(this, a); b.subTo(m, b); }
+					a.rShiftTo(1, a);
 				}
-				return this.modules[row][col];
-			},
-
-			getModuleCount: function () {
-				return this.moduleCount;
-			},
-
-			make: function () {
-				this.makeImpl(false, this.getBestMaskPattern());
-			},
-
-			makeImpl: function (test, maskPattern) {
-
-				this.moduleCount = this.typeNumber * 4 + 17;
-				this.modules = new Array(this.moduleCount);
-
-				for (var row = 0; row < this.moduleCount; row++) {
-
-					this.modules[row] = new Array(this.moduleCount);
-
-					for (var col = 0; col < this.moduleCount; col++) {
-						this.modules[row][col] = null; //(col + row) % 3;
-					}
+				else if (!b.isEven()) b.subTo(m, b);
+				b.rShiftTo(1, b);
+			}
+			while (v.isEven()) {
+				v.rShiftTo(1, v);
+				if (ac) {
+					if (!c.isEven() || !d.isEven()) { c.addTo(this, c); d.subTo(m, d); }
+					c.rShiftTo(1, c);
 				}
+				else if (!d.isEven()) d.subTo(m, d);
+				d.rShiftTo(1, d);
+			}
+			if (u.compareTo(v) >= 0) {
+				u.subTo(v, u);
+				if (ac) a.subTo(c, a);
+				b.subTo(d, b);
+			}
+			else {
+				v.subTo(u, v);
+				if (ac) c.subTo(a, c);
+				d.subTo(b, d);
+			}
+		}
+		if (v.compareTo(BigInteger.ONE) != 0) return BigInteger.ZERO;
+		if (d.compareTo(m) >= 0) return d.subtract(m);
+		if (d.signum() < 0) d.addTo(m, d); else return d;
+		if (d.signum() < 0) return d.add(m); else return d;
+	};
 
-				this.setupPositionProbePattern(0, 0);
-				this.setupPositionProbePattern(this.moduleCount - 7, 0);
-				this.setupPositionProbePattern(0, this.moduleCount - 7);
-				this.setupPositionAdjustPattern();
-				this.setupTimingPattern();
-				this.setupTypeInfo(test, maskPattern);
 
-				if (this.typeNumber >= 7) {
-					this.setupTypeNumber(test);
+	// (public) this^e
+	BigInteger.prototype.pow = function (e) { return this.exp(e, new NullExp()); };
+
+	// (public) gcd(this,a) (HAC 14.54)
+	BigInteger.prototype.gcd = function (a) {
+		var x = (this.s < 0) ? this.negate() : this.clone();
+		var y = (a.s < 0) ? a.negate() : a.clone();
+		if (x.compareTo(y) < 0) { var t = x; x = y; y = t; }
+		var i = x.getLowestSetBit(), g = y.getLowestSetBit();
+		if (g < 0) return x;
+		if (i < g) g = i;
+		if (g > 0) {
+			x.rShiftTo(g, x);
+			y.rShiftTo(g, y);
+		}
+		while (x.signum() > 0) {
+			if ((i = x.getLowestSetBit()) > 0) x.rShiftTo(i, x);
+			if ((i = y.getLowestSetBit()) > 0) y.rShiftTo(i, y);
+			if (x.compareTo(y) >= 0) {
+				x.subTo(y, x);
+				x.rShiftTo(1, x);
+			}
+			else {
+				y.subTo(x, y);
+				y.rShiftTo(1, y);
+			}
+		}
+		if (g > 0) y.lShiftTo(g, y);
+		return y;
+	};
+
+	// (public) test primality with certainty >= 1-.5^t
+	BigInteger.prototype.isProbablePrime = function (t) {
+		var i, x = this.abs();
+		if (x.t == 1 && x[0] <= lowprimes[lowprimes.length - 1]) {
+			for (i = 0; i < lowprimes.length; ++i)
+				if (x[0] == lowprimes[i]) return true;
+			return false;
+		}
+		if (x.isEven()) return false;
+		i = 1;
+		while (i < lowprimes.length) {
+			var m = lowprimes[i], j = i + 1;
+			while (j < lowprimes.length && m < lplim) m *= lowprimes[j++];
+			m = x.modInt(m);
+			while (i < j) if (m % lowprimes[i++] == 0) return false;
+		}
+		return x.millerRabin(t);
+	};
+
+
+	// JSBN-specific extension
+
+	// (public) this^2
+	BigInteger.prototype.square = function () { var r = nbi(); this.squareTo(r); return r; };
+
+
+	// NOTE: BigInteger interfaces not implemented in jsbn:
+	// BigInteger(int signum, byte[] magnitude)
+	// double doubleValue()
+	// float floatValue()
+	// int hashCode()
+	// long longValue()
+	// static BigInteger valueOf(long val)
+
+
+
+	// Copyright Stephan Thomas (start) --- //
+	// https://raw.github.com/bitcoinjs/bitcoinjs-lib/07f9d55ccb6abd962efb6befdd37671f85ea4ff9/src/util.js
+	// BigInteger monkey patching
+	BigInteger.valueOf = nbv;
+
+	/**
+	* Returns a byte array representation of the big integer.
+	*
+	* This returns the absolute of the contained value in big endian
+	* form. A value of zero results in an empty array.
+	*/
+	BigInteger.prototype.toByteArrayUnsigned = function () {
+		var ba = this.abs().toByteArray();
+		if (ba.length) {
+			if (ba[0] == 0) {
+				ba = ba.slice(1);
+			}
+			return ba.map(function (v) {
+				return (v < 0) ? v + 256 : v;
+			});
+		} else {
+			// Empty array, nothing to do
+			return ba;
+		}
+	};
+
+	/**
+	* Turns a byte array into a big integer.
+	*
+	* This function will interpret a byte array as a big integer in big
+	* endian notation and ignore leading zeros.
+	*/
+	BigInteger.fromByteArrayUnsigned = function (ba) {
+		if (!ba.length) {
+			return ba.valueOf(0);
+		} else if (ba[0] & 0x80) {
+			// Prepend a zero so the BigInteger class doesn't mistake this
+			// for a negative integer.
+			return new BigInteger([0].concat(ba));
+		} else {
+			return new BigInteger(ba);
+		}
+	};
+
+	/**
+	* Converts big integer to signed byte representation.
+	*
+	* The format for this value uses a the most significant bit as a sign
+	* bit. If the most significant bit is already occupied by the
+	* absolute value, an extra byte is prepended and the sign bit is set
+	* there.
+	*
+	* Examples:
+	*
+	*      0 =>     0x00
+	*      1 =>     0x01
+	*     -1 =>     0x81
+	*    127 =>     0x7f
+	*   -127 =>     0xff
+	*    128 =>   0x0080
+	*   -128 =>   0x8080
+	*    255 =>   0x00ff
+	*   -255 =>   0x80ff
+	*  16300 =>   0x3fac
+	* -16300 =>   0xbfac
+	*  62300 => 0x00f35c
+	* -62300 => 0x80f35c
+	*/
+	BigInteger.prototype.toByteArraySigned = function () {
+		var val = this.abs().toByteArrayUnsigned();
+		var neg = this.compareTo(BigInteger.ZERO) < 0;
+
+		if (neg) {
+			if (val[0] & 0x80) {
+				val.unshift(0x80);
+			} else {
+				val[0] |= 0x80;
+			}
+		} else {
+			if (val[0] & 0x80) {
+				val.unshift(0x00);
+			}
+		}
+
+		return val;
+	};
+
+	/**
+	* Parse a signed big integer byte representation.
+	*
+	* For details on the format please see BigInteger.toByteArraySigned.
+	*/
+	BigInteger.fromByteArraySigned = function (ba) {
+		// Check for negative value
+		if (ba[0] & 0x80) {
+			// Remove sign bit
+			ba[0] &= 0x7f;
+
+			return BigInteger.fromByteArrayUnsigned(ba).negate();
+		} else {
+			return BigInteger.fromByteArrayUnsigned(ba);
+		}
+	};
+	// Copyright Stephan Thomas (end) --- //
+
+
+
+
+	// ****** REDUCTION ******* //
+
+	// Modular reduction using "classic" algorithm
+	function Classic(m) { this.m = m; }
+	Classic.prototype.convert = function (x) {
+		if (x.s < 0 || x.compareTo(this.m) >= 0) return x.mod(this.m);
+		else return x;
+	};
+	Classic.prototype.revert = function (x) { return x; };
+	Classic.prototype.reduce = function (x) { x.divRemTo(this.m, null, x); };
+	Classic.prototype.mulTo = function (x, y, r) { x.multiplyTo(y, r); this.reduce(r); };
+	Classic.prototype.sqrTo = function (x, r) { x.squareTo(r); this.reduce(r); };
+
+
+
+
+
+	// Montgomery reduction
+	function Montgomery(m) {
+		this.m = m;
+		this.mp = m.invDigit();
+		this.mpl = this.mp & 0x7fff;
+		this.mph = this.mp >> 15;
+		this.um = (1 << (m.DB - 15)) - 1;
+		this.mt2 = 2 * m.t;
+	}
+	// xR mod m
+	Montgomery.prototype.convert = function (x) {
+		var r = nbi();
+		x.abs().dlShiftTo(this.m.t, r);
+		r.divRemTo(this.m, null, r);
+		if (x.s < 0 && r.compareTo(BigInteger.ZERO) > 0) this.m.subTo(r, r);
+		return r;
+	}
+	// x/R mod m
+	Montgomery.prototype.revert = function (x) {
+		var r = nbi();
+		x.copyTo(r);
+		this.reduce(r);
+		return r;
+	};
+	// x = x/R mod m (HAC 14.32)
+	Montgomery.prototype.reduce = function (x) {
+		while (x.t <= this.mt2)	// pad x so am has enough room later
+			x[x.t++] = 0;
+		for (var i = 0; i < this.m.t; ++i) {
+			// faster way of calculating u0 = x[i]*mp mod DV
+			var j = x[i] & 0x7fff;
+			var u0 = (j * this.mpl + (((j * this.mph + (x[i] >> 15) * this.mpl) & this.um) << 15)) & x.DM;
+			// use am to combine the multiply-shift-add into one call
+			j = i + this.m.t;
+			x[j] += this.m.am(0, u0, x, i, 0, this.m.t);
+			// propagate carry
+			while (x[j] >= x.DV) { x[j] -= x.DV; x[++j]++; }
+		}
+		x.clamp();
+		x.drShiftTo(this.m.t, x);
+		if (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
+	};
+	// r = "xy/R mod m"; x,y != r
+	Montgomery.prototype.mulTo = function (x, y, r) { x.multiplyTo(y, r); this.reduce(r); };
+	// r = "x^2/R mod m"; x != r
+	Montgomery.prototype.sqrTo = function (x, r) { x.squareTo(r); this.reduce(r); };
+
+
+
+
+
+	// A "null" reducer
+	function NullExp() { }
+	NullExp.prototype.convert = function (x) { return x; };
+	NullExp.prototype.revert = function (x) { return x; };
+	NullExp.prototype.mulTo = function (x, y, r) { x.multiplyTo(y, r); };
+	NullExp.prototype.sqrTo = function (x, r) { x.squareTo(r); };
+
+
+
+
+
+	// Barrett modular reduction
+	function Barrett(m) {
+		// setup Barrett
+		this.r2 = nbi();
+		this.q3 = nbi();
+		BigInteger.ONE.dlShiftTo(2 * m.t, this.r2);
+		this.mu = this.r2.divide(m);
+		this.m = m;
+	}
+	Barrett.prototype.convert = function (x) {
+		if (x.s < 0 || x.t > 2 * this.m.t) return x.mod(this.m);
+		else if (x.compareTo(this.m) < 0) return x;
+		else { var r = nbi(); x.copyTo(r); this.reduce(r); return r; }
+	};
+	Barrett.prototype.revert = function (x) { return x; };
+	// x = x mod m (HAC 14.42)
+	Barrett.prototype.reduce = function (x) {
+		x.drShiftTo(this.m.t - 1, this.r2);
+		if (x.t > this.m.t + 1) { x.t = this.m.t + 1; x.clamp(); }
+		this.mu.multiplyUpperTo(this.r2, this.m.t + 1, this.q3);
+		this.m.multiplyLowerTo(this.q3, this.m.t + 1, this.r2);
+		while (x.compareTo(this.r2) < 0) x.dAddOffset(1, this.m.t + 1);
+		x.subTo(this.r2, x);
+		while (x.compareTo(this.m) >= 0) x.subTo(this.m, x);
+	};
+	// r = x*y mod m; x,y != r
+	Barrett.prototype.mulTo = function (x, y, r) { x.multiplyTo(y, r); this.reduce(r); };
+	// r = x^2 mod m; x != r
+	Barrett.prototype.sqrTo = function (x, r) { x.squareTo(r); this.reduce(r); };
+
+})();
+	</script>
+	<script type="text/javascript">
+//---------------------------------------------------------------------
+// QRCode for JavaScript
+//
+// Copyright (c) 2009 Kazuhiko Arase
+//
+// URL: http://www.d-project.com/
+//
+// Licensed under the MIT license:
+//   http://www.opensource.org/licenses/mit-license.php
+//
+// The word "QR Code" is registered trademark of 
+// DENSO WAVE INCORPORATED
+//   http://www.denso-wave.com/qrcode/faqpatent-e.html
+//
+//---------------------------------------------------------------------
+
+(function () {
+	//---------------------------------------------------------------------
+	// QRCode
+	//---------------------------------------------------------------------
+
+	var QRCode = window.QRCode = function (typeNumber, errorCorrectLevel) {
+		this.typeNumber = typeNumber;
+		this.errorCorrectLevel = errorCorrectLevel;
+		this.modules = null;
+		this.moduleCount = 0;
+		this.dataCache = null;
+		this.dataList = new Array();
+	}
+
+	QRCode.prototype = {
+
+		addData: function (data) {
+			var newData = new QRCode.QR8bitByte(data);
+			this.dataList.push(newData);
+			this.dataCache = null;
+		},
+
+		isDark: function (row, col) {
+			if (row < 0 || this.moduleCount <= row || col < 0 || this.moduleCount <= col) {
+				throw new Error(row + "," + col);
+			}
+			return this.modules[row][col];
+		},
+
+		getModuleCount: function () {
+			return this.moduleCount;
+		},
+
+		make: function () {
+			this.makeImpl(false, this.getBestMaskPattern());
+		},
+
+		makeImpl: function (test, maskPattern) {
+
+			this.moduleCount = this.typeNumber * 4 + 17;
+			this.modules = new Array(this.moduleCount);
+
+			for (var row = 0; row < this.moduleCount; row++) {
+
+				this.modules[row] = new Array(this.moduleCount);
+
+				for (var col = 0; col < this.moduleCount; col++) {
+					this.modules[row][col] = null; //(col + row) % 3;
 				}
+			}
 
-				if (this.dataCache == null) {
-					this.dataCache = QRCode.createData(this.typeNumber, this.errorCorrectLevel, this.dataList);
-				}
+			this.setupPositionProbePattern(0, 0);
+			this.setupPositionProbePattern(this.moduleCount - 7, 0);
+			this.setupPositionProbePattern(0, this.moduleCount - 7);
+			this.setupPositionAdjustPattern();
+			this.setupTimingPattern();
+			this.setupTypeInfo(test, maskPattern);
 
-				this.mapData(this.dataCache, maskPattern);
-			},
+			if (this.typeNumber >= 7) {
+				this.setupTypeNumber(test);
+			}
 
-			setupPositionProbePattern: function (row, col) {
+			if (this.dataCache == null) {
+				this.dataCache = QRCode.createData(this.typeNumber, this.errorCorrectLevel, this.dataList);
+			}
 
-				for (var r = -1; r <= 7; r++) {
+			this.mapData(this.dataCache, maskPattern);
+		},
 
-					if (row + r <= -1 || this.moduleCount <= row + r) continue;
+		setupPositionProbePattern: function (row, col) {
 
-					for (var c = -1; c <= 7; c++) {
+			for (var r = -1; r <= 7; r++) {
 
-						if (col + c <= -1 || this.moduleCount <= col + c) continue;
+				if (row + r <= -1 || this.moduleCount <= row + r) continue;
 
-						if ((0 <= r && r <= 6 && (c == 0 || c == 6))
+				for (var c = -1; c <= 7; c++) {
+
+					if (col + c <= -1 || this.moduleCount <= col + c) continue;
+
+					if ((0 <= r && r <= 6 && (c == 0 || c == 6))
 						|| (0 <= c && c <= 6 && (r == 0 || r == 6))
 						|| (2 <= r && r <= 4 && 2 <= c && c <= 4)) {
-							this.modules[row + r][col + c] = true;
-						} else {
-							this.modules[row + r][col + c] = false;
-						}
+						this.modules[row + r][col + c] = true;
+					} else {
+						this.modules[row + r][col + c] = false;
 					}
 				}
-			},
+			}
+		},
 
-			getBestMaskPattern: function () {
+		getBestMaskPattern: function () {
 
-				var minLostPoint = 0;
-				var pattern = 0;
+			var minLostPoint = 0;
+			var pattern = 0;
 
-				for (var i = 0; i < 8; i++) {
+			for (var i = 0; i < 8; i++) {
 
-					this.makeImpl(true, i);
+				this.makeImpl(true, i);
 
-					var lostPoint = QRCode.Util.getLostPoint(this);
+				var lostPoint = QRCode.Util.getLostPoint(this);
 
-					if (i == 0 || minLostPoint > lostPoint) {
-						minLostPoint = lostPoint;
-						pattern = i;
+				if (i == 0 || minLostPoint > lostPoint) {
+					minLostPoint = lostPoint;
+					pattern = i;
+				}
+			}
+
+			return pattern;
+		},
+
+		createMovieClip: function (target_mc, instance_name, depth) {
+
+			var qr_mc = target_mc.createEmptyMovieClip(instance_name, depth);
+			var cs = 1;
+
+			this.make();
+
+			for (var row = 0; row < this.modules.length; row++) {
+
+				var y = row * cs;
+
+				for (var col = 0; col < this.modules[row].length; col++) {
+
+					var x = col * cs;
+					var dark = this.modules[row][col];
+
+					if (dark) {
+						qr_mc.beginFill(0, 100);
+						qr_mc.moveTo(x, y);
+						qr_mc.lineTo(x + cs, y);
+						qr_mc.lineTo(x + cs, y + cs);
+						qr_mc.lineTo(x, y + cs);
+						qr_mc.endFill();
 					}
 				}
+			}
 
-				return pattern;
-			},
+			return qr_mc;
+		},
 
-			createMovieClip: function (target_mc, instance_name, depth) {
+		setupTimingPattern: function () {
 
-				var qr_mc = target_mc.createEmptyMovieClip(instance_name, depth);
-				var cs = 1;
-
-				this.make();
-
-				for (var row = 0; row < this.modules.length; row++) {
-
-					var y = row * cs;
-
-					for (var col = 0; col < this.modules[row].length; col++) {
-
-						var x = col * cs;
-						var dark = this.modules[row][col];
-
-						if (dark) {
-							qr_mc.beginFill(0, 100);
-							qr_mc.moveTo(x, y);
-							qr_mc.lineTo(x + cs, y);
-							qr_mc.lineTo(x + cs, y + cs);
-							qr_mc.lineTo(x, y + cs);
-							qr_mc.endFill();
-						}
-					}
+			for (var r = 8; r < this.moduleCount - 8; r++) {
+				if (this.modules[r][6] != null) {
+					continue;
 				}
+				this.modules[r][6] = (r % 2 == 0);
+			}
 
-				return qr_mc;
-			},
+			for (var c = 8; c < this.moduleCount - 8; c++) {
+				if (this.modules[6][c] != null) {
+					continue;
+				}
+				this.modules[6][c] = (c % 2 == 0);
+			}
+		},
 
-			setupTimingPattern: function () {
+		setupPositionAdjustPattern: function () {
 
-				for (var r = 8; r < this.moduleCount - 8; r++) {
-					if (this.modules[r][6] != null) {
+			var pos = QRCode.Util.getPatternPosition(this.typeNumber);
+
+			for (var i = 0; i < pos.length; i++) {
+
+				for (var j = 0; j < pos.length; j++) {
+
+					var row = pos[i];
+					var col = pos[j];
+
+					if (this.modules[row][col] != null) {
 						continue;
 					}
-					this.modules[r][6] = (r % 2 == 0);
-				}
 
-				for (var c = 8; c < this.moduleCount - 8; c++) {
-					if (this.modules[6][c] != null) {
-						continue;
-					}
-					this.modules[6][c] = (c % 2 == 0);
-				}
-			},
+					for (var r = -2; r <= 2; r++) {
 
-			setupPositionAdjustPattern: function () {
+						for (var c = -2; c <= 2; c++) {
 
-				var pos = QRCode.Util.getPatternPosition(this.typeNumber);
-
-				for (var i = 0; i < pos.length; i++) {
-
-					for (var j = 0; j < pos.length; j++) {
-
-						var row = pos[i];
-						var col = pos[j];
-
-						if (this.modules[row][col] != null) {
-							continue;
-						}
-
-						for (var r = -2; r <= 2; r++) {
-
-							for (var c = -2; c <= 2; c++) {
-
-								if (r == -2 || r == 2 || c == -2 || c == 2
+							if (r == -2 || r == 2 || c == -2 || c == 2
 								|| (r == 0 && c == 0)) {
-									this.modules[row + r][col + c] = true;
-								} else {
-									this.modules[row + r][col + c] = false;
-								}
+								this.modules[row + r][col + c] = true;
+							} else {
+								this.modules[row + r][col + c] = false;
 							}
 						}
 					}
 				}
-			},
+			}
+		},
 
-			setupTypeNumber: function (test) {
+		setupTypeNumber: function (test) {
 
-				var bits = QRCode.Util.getBCHTypeNumber(this.typeNumber);
+			var bits = QRCode.Util.getBCHTypeNumber(this.typeNumber);
 
-				for (var i = 0; i < 18; i++) {
-					var mod = (!test && ((bits >> i) & 1) == 1);
-					this.modules[Math.floor(i / 3)][i % 3 + this.moduleCount - 8 - 3] = mod;
+			for (var i = 0; i < 18; i++) {
+				var mod = (!test && ((bits >> i) & 1) == 1);
+				this.modules[Math.floor(i / 3)][i % 3 + this.moduleCount - 8 - 3] = mod;
+			}
+
+			for (var i = 0; i < 18; i++) {
+				var mod = (!test && ((bits >> i) & 1) == 1);
+				this.modules[i % 3 + this.moduleCount - 8 - 3][Math.floor(i / 3)] = mod;
+			}
+		},
+
+		setupTypeInfo: function (test, maskPattern) {
+
+			var data = (this.errorCorrectLevel << 3) | maskPattern;
+			var bits = QRCode.Util.getBCHTypeInfo(data);
+
+			// vertical		
+			for (var i = 0; i < 15; i++) {
+
+				var mod = (!test && ((bits >> i) & 1) == 1);
+
+				if (i < 6) {
+					this.modules[i][8] = mod;
+				} else if (i < 8) {
+					this.modules[i + 1][8] = mod;
+				} else {
+					this.modules[this.moduleCount - 15 + i][8] = mod;
 				}
+			}
 
-				for (var i = 0; i < 18; i++) {
-					var mod = (!test && ((bits >> i) & 1) == 1);
-					this.modules[i % 3 + this.moduleCount - 8 - 3][Math.floor(i / 3)] = mod;
+			// horizontal
+			for (var i = 0; i < 15; i++) {
+
+				var mod = (!test && ((bits >> i) & 1) == 1);
+
+				if (i < 8) {
+					this.modules[8][this.moduleCount - i - 1] = mod;
+				} else if (i < 9) {
+					this.modules[8][15 - i - 1 + 1] = mod;
+				} else {
+					this.modules[8][15 - i - 1] = mod;
 				}
-			},
+			}
 
-			setupTypeInfo: function (test, maskPattern) {
+			// fixed module
+			this.modules[this.moduleCount - 8][8] = (!test);
 
-				var data = (this.errorCorrectLevel << 3) | maskPattern;
-				var bits = QRCode.Util.getBCHTypeInfo(data);
+		},
 
-				// vertical		
-				for (var i = 0; i < 15; i++) {
+		mapData: function (data, maskPattern) {
 
-					var mod = (!test && ((bits >> i) & 1) == 1);
+			var inc = -1;
+			var row = this.moduleCount - 1;
+			var bitIndex = 7;
+			var byteIndex = 0;
 
-					if (i < 6) {
-						this.modules[i][8] = mod;
-					} else if (i < 8) {
-						this.modules[i + 1][8] = mod;
-					} else {
-						this.modules[this.moduleCount - 15 + i][8] = mod;
-					}
-				}
+			for (var col = this.moduleCount - 1; col > 0; col -= 2) {
 
-				// horizontal
-				for (var i = 0; i < 15; i++) {
+				if (col == 6) col--;
 
-					var mod = (!test && ((bits >> i) & 1) == 1);
+				while (true) {
 
-					if (i < 8) {
-						this.modules[8][this.moduleCount - i - 1] = mod;
-					} else if (i < 9) {
-						this.modules[8][15 - i - 1 + 1] = mod;
-					} else {
-						this.modules[8][15 - i - 1] = mod;
-					}
-				}
+					for (var c = 0; c < 2; c++) {
 
-				// fixed module
-				this.modules[this.moduleCount - 8][8] = (!test);
+						if (this.modules[row][col - c] == null) {
 
-			},
+							var dark = false;
 
-			mapData: function (data, maskPattern) {
+							if (byteIndex < data.length) {
+								dark = (((data[byteIndex] >>> bitIndex) & 1) == 1);
+							}
 
-				var inc = -1;
-				var row = this.moduleCount - 1;
-				var bitIndex = 7;
-				var byteIndex = 0;
+							var mask = QRCode.Util.getMask(maskPattern, row, col - c);
 
-				for (var col = this.moduleCount - 1; col > 0; col -= 2) {
+							if (mask) {
+								dark = !dark;
+							}
 
-					if (col == 6) col--;
+							this.modules[row][col - c] = dark;
+							bitIndex--;
 
-					while (true) {
-
-						for (var c = 0; c < 2; c++) {
-
-							if (this.modules[row][col - c] == null) {
-
-								var dark = false;
-
-								if (byteIndex < data.length) {
-									dark = (((data[byteIndex] >>> bitIndex) & 1) == 1);
-								}
-
-								var mask = QRCode.Util.getMask(maskPattern, row, col - c);
-
-								if (mask) {
-									dark = !dark;
-								}
-
-								this.modules[row][col - c] = dark;
-								bitIndex--;
-
-								if (bitIndex == -1) {
-									byteIndex++;
-									bitIndex = 7;
-								}
+							if (bitIndex == -1) {
+								byteIndex++;
+								bitIndex = 7;
 							}
 						}
+					}
 
-						row += inc;
+					row += inc;
 
-						if (row < 0 || this.moduleCount <= row) {
-							row -= inc;
-							inc = -inc;
-							break;
-						}
+					if (row < 0 || this.moduleCount <= row) {
+						row -= inc;
+						inc = -inc;
+						break;
 					}
 				}
-
 			}
 
-		};
+		}
 
-		QRCode.PAD0 = 0xEC;
-		QRCode.PAD1 = 0x11;
+	};
 
-		QRCode.createData = function (typeNumber, errorCorrectLevel, dataList) {
+	QRCode.PAD0 = 0xEC;
+	QRCode.PAD1 = 0x11;
 
-			var rsBlocks = QRCode.RSBlock.getRSBlocks(typeNumber, errorCorrectLevel);
+	QRCode.createData = function (typeNumber, errorCorrectLevel, dataList) {
 
-			var buffer = new QRCode.BitBuffer();
+		var rsBlocks = QRCode.RSBlock.getRSBlocks(typeNumber, errorCorrectLevel);
 
-			for (var i = 0; i < dataList.length; i++) {
-				var data = dataList[i];
-				buffer.put(data.mode, 4);
-				buffer.put(data.getLength(), QRCode.Util.getLengthInBits(data.mode, typeNumber));
-				data.write(buffer);
-			}
+		var buffer = new QRCode.BitBuffer();
 
-			// calc num max data.
-			var totalDataCount = 0;
-			for (var i = 0; i < rsBlocks.length; i++) {
-				totalDataCount += rsBlocks[i].dataCount;
-			}
+		for (var i = 0; i < dataList.length; i++) {
+			var data = dataList[i];
+			buffer.put(data.mode, 4);
+			buffer.put(data.getLength(), QRCode.Util.getLengthInBits(data.mode, typeNumber));
+			data.write(buffer);
+		}
 
-			if (buffer.getLengthInBits() > totalDataCount * 8) {
-				throw new Error("code length overflow. ("
+		// calc num max data.
+		var totalDataCount = 0;
+		for (var i = 0; i < rsBlocks.length; i++) {
+			totalDataCount += rsBlocks[i].dataCount;
+		}
+
+		if (buffer.getLengthInBits() > totalDataCount * 8) {
+			throw new Error("code length overflow. ("
 			+ buffer.getLengthInBits()
 			+ ">"
 			+ totalDataCount * 8
 			+ ")");
-			}
-
-			// end code
-			if (buffer.getLengthInBits() + 4 <= totalDataCount * 8) {
-				buffer.put(0, 4);
-			}
-
-			// padding
-			while (buffer.getLengthInBits() % 8 != 0) {
-				buffer.putBit(false);
-			}
-
-			// padding
-			while (true) {
-
-				if (buffer.getLengthInBits() >= totalDataCount * 8) {
-					break;
-				}
-				buffer.put(QRCode.PAD0, 8);
-
-				if (buffer.getLengthInBits() >= totalDataCount * 8) {
-					break;
-				}
-				buffer.put(QRCode.PAD1, 8);
-			}
-
-			return QRCode.createBytes(buffer, rsBlocks);
-		};
-
-		QRCode.createBytes = function (buffer, rsBlocks) {
-
-			var offset = 0;
-
-			var maxDcCount = 0;
-			var maxEcCount = 0;
-
-			var dcdata = new Array(rsBlocks.length);
-			var ecdata = new Array(rsBlocks.length);
-
-			for (var r = 0; r < rsBlocks.length; r++) {
-
-				var dcCount = rsBlocks[r].dataCount;
-				var ecCount = rsBlocks[r].totalCount - dcCount;
-
-				maxDcCount = Math.max(maxDcCount, dcCount);
-				maxEcCount = Math.max(maxEcCount, ecCount);
-
-				dcdata[r] = new Array(dcCount);
-
-				for (var i = 0; i < dcdata[r].length; i++) {
-					dcdata[r][i] = 0xff & buffer.buffer[i + offset];
-				}
-				offset += dcCount;
-
-				var rsPoly = QRCode.Util.getErrorCorrectPolynomial(ecCount);
-				var rawPoly = new QRCode.Polynomial(dcdata[r], rsPoly.getLength() - 1);
-
-				var modPoly = rawPoly.mod(rsPoly);
-				ecdata[r] = new Array(rsPoly.getLength() - 1);
-				for (var i = 0; i < ecdata[r].length; i++) {
-					var modIndex = i + modPoly.getLength() - ecdata[r].length;
-					ecdata[r][i] = (modIndex >= 0) ? modPoly.get(modIndex) : 0;
-				}
-
-			}
-
-			var totalCodeCount = 0;
-			for (var i = 0; i < rsBlocks.length; i++) {
-				totalCodeCount += rsBlocks[i].totalCount;
-			}
-
-			var data = new Array(totalCodeCount);
-			var index = 0;
-
-			for (var i = 0; i < maxDcCount; i++) {
-				for (var r = 0; r < rsBlocks.length; r++) {
-					if (i < dcdata[r].length) {
-						data[index++] = dcdata[r][i];
-					}
-				}
-			}
-
-			for (var i = 0; i < maxEcCount; i++) {
-				for (var r = 0; r < rsBlocks.length; r++) {
-					if (i < ecdata[r].length) {
-						data[index++] = ecdata[r][i];
-					}
-				}
-			}
-
-			return data;
-
-		};
-
-		//---------------------------------------------------------------------
-		// QR8bitByte
-		//---------------------------------------------------------------------
-		QRCode.QR8bitByte = function (data) {
-			this.mode = QRCode.Mode.MODE_8BIT_BYTE;
-			this.data = data;
 		}
 
-		QRCode.QR8bitByte.prototype = {
-			getLength: function (buffer) {
-				return this.data.length;
-			},
+		// end code
+		if (buffer.getLengthInBits() + 4 <= totalDataCount * 8) {
+			buffer.put(0, 4);
+		}
 
-			write: function (buffer) {
-				for (var i = 0; i < this.data.length; i++) {
-					// not JIS ...
-					buffer.put(this.data.charCodeAt(i), 8);
+		// padding
+		while (buffer.getLengthInBits() % 8 != 0) {
+			buffer.putBit(false);
+		}
+
+		// padding
+		while (true) {
+
+			if (buffer.getLengthInBits() >= totalDataCount * 8) {
+				break;
+			}
+			buffer.put(QRCode.PAD0, 8);
+
+			if (buffer.getLengthInBits() >= totalDataCount * 8) {
+				break;
+			}
+			buffer.put(QRCode.PAD1, 8);
+		}
+
+		return QRCode.createBytes(buffer, rsBlocks);
+	};
+
+	QRCode.createBytes = function (buffer, rsBlocks) {
+
+		var offset = 0;
+
+		var maxDcCount = 0;
+		var maxEcCount = 0;
+
+		var dcdata = new Array(rsBlocks.length);
+		var ecdata = new Array(rsBlocks.length);
+
+		for (var r = 0; r < rsBlocks.length; r++) {
+
+			var dcCount = rsBlocks[r].dataCount;
+			var ecCount = rsBlocks[r].totalCount - dcCount;
+
+			maxDcCount = Math.max(maxDcCount, dcCount);
+			maxEcCount = Math.max(maxEcCount, ecCount);
+
+			dcdata[r] = new Array(dcCount);
+
+			for (var i = 0; i < dcdata[r].length; i++) {
+				dcdata[r][i] = 0xff & buffer.buffer[i + offset];
+			}
+			offset += dcCount;
+
+			var rsPoly = QRCode.Util.getErrorCorrectPolynomial(ecCount);
+			var rawPoly = new QRCode.Polynomial(dcdata[r], rsPoly.getLength() - 1);
+
+			var modPoly = rawPoly.mod(rsPoly);
+			ecdata[r] = new Array(rsPoly.getLength() - 1);
+			for (var i = 0; i < ecdata[r].length; i++) {
+				var modIndex = i + modPoly.getLength() - ecdata[r].length;
+				ecdata[r][i] = (modIndex >= 0) ? modPoly.get(modIndex) : 0;
+			}
+
+		}
+
+		var totalCodeCount = 0;
+		for (var i = 0; i < rsBlocks.length; i++) {
+			totalCodeCount += rsBlocks[i].totalCount;
+		}
+
+		var data = new Array(totalCodeCount);
+		var index = 0;
+
+		for (var i = 0; i < maxDcCount; i++) {
+			for (var r = 0; r < rsBlocks.length; r++) {
+				if (i < dcdata[r].length) {
+					data[index++] = dcdata[r][i];
 				}
 			}
-		};
+		}
+
+		for (var i = 0; i < maxEcCount; i++) {
+			for (var r = 0; r < rsBlocks.length; r++) {
+				if (i < ecdata[r].length) {
+					data[index++] = ecdata[r][i];
+				}
+			}
+		}
+
+		return data;
+
+	};
+
+	//---------------------------------------------------------------------
+	// QR8bitByte
+	//---------------------------------------------------------------------
+	QRCode.QR8bitByte = function (data) {
+		this.mode = QRCode.Mode.MODE_8BIT_BYTE;
+		this.data = data;
+	}
+
+	QRCode.QR8bitByte.prototype = {
+		getLength: function (buffer) {
+			return this.data.length;
+		},
+
+		write: function (buffer) {
+			for (var i = 0; i < this.data.length; i++) {
+				// not JIS ...
+				buffer.put(this.data.charCodeAt(i), 8);
+			}
+		}
+	};
 
 
-		//---------------------------------------------------------------------
-		// QRMode
-		//---------------------------------------------------------------------
-		QRCode.Mode = {
-			MODE_NUMBER: 1 << 0,
-			MODE_ALPHA_NUM: 1 << 1,
-			MODE_8BIT_BYTE: 1 << 2,
-			MODE_KANJI: 1 << 3
-		};
+	//---------------------------------------------------------------------
+	// QRMode
+	//---------------------------------------------------------------------
+	QRCode.Mode = {
+		MODE_NUMBER: 1 << 0,
+		MODE_ALPHA_NUM: 1 << 1,
+		MODE_8BIT_BYTE: 1 << 2,
+		MODE_KANJI: 1 << 3
+	};
 
-		//---------------------------------------------------------------------
-		// QRErrorCorrectLevel
-		//---------------------------------------------------------------------
-		QRCode.ErrorCorrectLevel = {
-			L: 1,
-			M: 0,
-			Q: 3,
-			H: 2
-		};
+	//---------------------------------------------------------------------
+	// QRErrorCorrectLevel
+	//---------------------------------------------------------------------
+	QRCode.ErrorCorrectLevel = {
+		L: 1,
+		M: 0,
+		Q: 3,
+		H: 2
+	};
 
 
-		//---------------------------------------------------------------------
-		// QRMaskPattern
-		//---------------------------------------------------------------------
-		QRCode.MaskPattern = {
-			PATTERN000: 0,
-			PATTERN001: 1,
-			PATTERN010: 2,
-			PATTERN011: 3,
-			PATTERN100: 4,
-			PATTERN101: 5,
-			PATTERN110: 6,
-			PATTERN111: 7
-		};
+	//---------------------------------------------------------------------
+	// QRMaskPattern
+	//---------------------------------------------------------------------
+	QRCode.MaskPattern = {
+		PATTERN000: 0,
+		PATTERN001: 1,
+		PATTERN010: 2,
+		PATTERN011: 3,
+		PATTERN100: 4,
+		PATTERN101: 5,
+		PATTERN110: 6,
+		PATTERN111: 7
+	};
 
-		//---------------------------------------------------------------------
-		// QRUtil
-		//---------------------------------------------------------------------
+	//---------------------------------------------------------------------
+	// QRUtil
+	//---------------------------------------------------------------------
 
-		QRCode.Util = {
+	QRCode.Util = {
 
-			PATTERN_POSITION_TABLE: [
+		PATTERN_POSITION_TABLE: [
 		[],
 		[6, 18],
 		[6, 22],
@@ -4114,412 +4107,412 @@
 		[6, 30, 58, 86, 114, 142, 170]
 	],
 
-			G15: (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0),
-			G18: (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0),
-			G15_MASK: (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1),
+		G15: (1 << 10) | (1 << 8) | (1 << 5) | (1 << 4) | (1 << 2) | (1 << 1) | (1 << 0),
+		G18: (1 << 12) | (1 << 11) | (1 << 10) | (1 << 9) | (1 << 8) | (1 << 5) | (1 << 2) | (1 << 0),
+		G15_MASK: (1 << 14) | (1 << 12) | (1 << 10) | (1 << 4) | (1 << 1),
 
-			getBCHTypeInfo: function (data) {
-				var d = data << 10;
-				while (QRCode.Util.getBCHDigit(d) - QRCode.Util.getBCHDigit(QRCode.Util.G15) >= 0) {
-					d ^= (QRCode.Util.G15 << (QRCode.Util.getBCHDigit(d) - QRCode.Util.getBCHDigit(QRCode.Util.G15)));
-				}
-				return ((data << 10) | d) ^ QRCode.Util.G15_MASK;
-			},
+		getBCHTypeInfo: function (data) {
+			var d = data << 10;
+			while (QRCode.Util.getBCHDigit(d) - QRCode.Util.getBCHDigit(QRCode.Util.G15) >= 0) {
+				d ^= (QRCode.Util.G15 << (QRCode.Util.getBCHDigit(d) - QRCode.Util.getBCHDigit(QRCode.Util.G15)));
+			}
+			return ((data << 10) | d) ^ QRCode.Util.G15_MASK;
+		},
 
-			getBCHTypeNumber: function (data) {
-				var d = data << 12;
-				while (QRCode.Util.getBCHDigit(d) - QRCode.Util.getBCHDigit(QRCode.Util.G18) >= 0) {
-					d ^= (QRCode.Util.G18 << (QRCode.Util.getBCHDigit(d) - QRCode.Util.getBCHDigit(QRCode.Util.G18)));
-				}
-				return (data << 12) | d;
-			},
+		getBCHTypeNumber: function (data) {
+			var d = data << 12;
+			while (QRCode.Util.getBCHDigit(d) - QRCode.Util.getBCHDigit(QRCode.Util.G18) >= 0) {
+				d ^= (QRCode.Util.G18 << (QRCode.Util.getBCHDigit(d) - QRCode.Util.getBCHDigit(QRCode.Util.G18)));
+			}
+			return (data << 12) | d;
+		},
 
-			getBCHDigit: function (data) {
+		getBCHDigit: function (data) {
 
-				var digit = 0;
+			var digit = 0;
 
-				while (data != 0) {
-					digit++;
-					data >>>= 1;
-				}
+			while (data != 0) {
+				digit++;
+				data >>>= 1;
+			}
 
-				return digit;
-			},
+			return digit;
+		},
 
-			getPatternPosition: function (typeNumber) {
-				return QRCode.Util.PATTERN_POSITION_TABLE[typeNumber - 1];
-			},
+		getPatternPosition: function (typeNumber) {
+			return QRCode.Util.PATTERN_POSITION_TABLE[typeNumber - 1];
+		},
 
-			getMask: function (maskPattern, i, j) {
+		getMask: function (maskPattern, i, j) {
 
-				switch (maskPattern) {
+			switch (maskPattern) {
 
-					case QRCode.MaskPattern.PATTERN000: return (i + j) % 2 == 0;
-					case QRCode.MaskPattern.PATTERN001: return i % 2 == 0;
-					case QRCode.MaskPattern.PATTERN010: return j % 3 == 0;
-					case QRCode.MaskPattern.PATTERN011: return (i + j) % 3 == 0;
-					case QRCode.MaskPattern.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 == 0;
-					case QRCode.MaskPattern.PATTERN101: return (i * j) % 2 + (i * j) % 3 == 0;
-					case QRCode.MaskPattern.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 == 0;
-					case QRCode.MaskPattern.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 == 0;
+				case QRCode.MaskPattern.PATTERN000: return (i + j) % 2 == 0;
+				case QRCode.MaskPattern.PATTERN001: return i % 2 == 0;
+				case QRCode.MaskPattern.PATTERN010: return j % 3 == 0;
+				case QRCode.MaskPattern.PATTERN011: return (i + j) % 3 == 0;
+				case QRCode.MaskPattern.PATTERN100: return (Math.floor(i / 2) + Math.floor(j / 3)) % 2 == 0;
+				case QRCode.MaskPattern.PATTERN101: return (i * j) % 2 + (i * j) % 3 == 0;
+				case QRCode.MaskPattern.PATTERN110: return ((i * j) % 2 + (i * j) % 3) % 2 == 0;
+				case QRCode.MaskPattern.PATTERN111: return ((i * j) % 3 + (i + j) % 2) % 2 == 0;
 
+				default:
+					throw new Error("bad maskPattern:" + maskPattern);
+			}
+		},
+
+		getErrorCorrectPolynomial: function (errorCorrectLength) {
+
+			var a = new QRCode.Polynomial([1], 0);
+
+			for (var i = 0; i < errorCorrectLength; i++) {
+				a = a.multiply(new QRCode.Polynomial([1, QRCode.Math.gexp(i)], 0));
+			}
+
+			return a;
+		},
+
+		getLengthInBits: function (mode, type) {
+
+			if (1 <= type && type < 10) {
+
+				// 1 - 9
+
+				switch (mode) {
+					case QRCode.Mode.MODE_NUMBER: return 10;
+					case QRCode.Mode.MODE_ALPHA_NUM: return 9;
+					case QRCode.Mode.MODE_8BIT_BYTE: return 8;
+					case QRCode.Mode.MODE_KANJI: return 8;
 					default:
-						throw new Error("bad maskPattern:" + maskPattern);
-				}
-			},
-
-			getErrorCorrectPolynomial: function (errorCorrectLength) {
-
-				var a = new QRCode.Polynomial([1], 0);
-
-				for (var i = 0; i < errorCorrectLength; i++) {
-					a = a.multiply(new QRCode.Polynomial([1, QRCode.Math.gexp(i)], 0));
+						throw new Error("mode:" + mode);
 				}
 
-				return a;
-			},
+			} else if (type < 27) {
 
-			getLengthInBits: function (mode, type) {
+				// 10 - 26
 
-				if (1 <= type && type < 10) {
-
-					// 1 - 9
-
-					switch (mode) {
-						case QRCode.Mode.MODE_NUMBER: return 10;
-						case QRCode.Mode.MODE_ALPHA_NUM: return 9;
-						case QRCode.Mode.MODE_8BIT_BYTE: return 8;
-						case QRCode.Mode.MODE_KANJI: return 8;
-						default:
-							throw new Error("mode:" + mode);
-					}
-
-				} else if (type < 27) {
-
-					// 10 - 26
-
-					switch (mode) {
-						case QRCode.Mode.MODE_NUMBER: return 12;
-						case QRCode.Mode.MODE_ALPHA_NUM: return 11;
-						case QRCode.Mode.MODE_8BIT_BYTE: return 16;
-						case QRCode.Mode.MODE_KANJI: return 10;
-						default:
-							throw new Error("mode:" + mode);
-					}
-
-				} else if (type < 41) {
-
-					// 27 - 40
-
-					switch (mode) {
-						case QRCode.Mode.MODE_NUMBER: return 14;
-						case QRCode.Mode.MODE_ALPHA_NUM: return 13;
-						case QRCode.Mode.MODE_8BIT_BYTE: return 16;
-						case QRCode.Mode.MODE_KANJI: return 12;
-						default:
-							throw new Error("mode:" + mode);
-					}
-
-				} else {
-					throw new Error("type:" + type);
+				switch (mode) {
+					case QRCode.Mode.MODE_NUMBER: return 12;
+					case QRCode.Mode.MODE_ALPHA_NUM: return 11;
+					case QRCode.Mode.MODE_8BIT_BYTE: return 16;
+					case QRCode.Mode.MODE_KANJI: return 10;
+					default:
+						throw new Error("mode:" + mode);
 				}
-			},
 
-			getLostPoint: function (qrCode) {
+			} else if (type < 41) {
 
-				var moduleCount = qrCode.getModuleCount();
+				// 27 - 40
 
-				var lostPoint = 0;
+				switch (mode) {
+					case QRCode.Mode.MODE_NUMBER: return 14;
+					case QRCode.Mode.MODE_ALPHA_NUM: return 13;
+					case QRCode.Mode.MODE_8BIT_BYTE: return 16;
+					case QRCode.Mode.MODE_KANJI: return 12;
+					default:
+						throw new Error("mode:" + mode);
+				}
 
-				// LEVEL1
+			} else {
+				throw new Error("type:" + type);
+			}
+		},
 
-				for (var row = 0; row < moduleCount; row++) {
+		getLostPoint: function (qrCode) {
 
-					for (var col = 0; col < moduleCount; col++) {
+			var moduleCount = qrCode.getModuleCount();
 
-						var sameCount = 0;
-						var dark = qrCode.isDark(row, col);
+			var lostPoint = 0;
 
-						for (var r = -1; r <= 1; r++) {
+			// LEVEL1
 
-							if (row + r < 0 || moduleCount <= row + r) {
+			for (var row = 0; row < moduleCount; row++) {
+
+				for (var col = 0; col < moduleCount; col++) {
+
+					var sameCount = 0;
+					var dark = qrCode.isDark(row, col);
+
+					for (var r = -1; r <= 1; r++) {
+
+						if (row + r < 0 || moduleCount <= row + r) {
+							continue;
+						}
+
+						for (var c = -1; c <= 1; c++) {
+
+							if (col + c < 0 || moduleCount <= col + c) {
 								continue;
 							}
 
-							for (var c = -1; c <= 1; c++) {
+							if (r == 0 && c == 0) {
+								continue;
+							}
 
-								if (col + c < 0 || moduleCount <= col + c) {
-									continue;
-								}
-
-								if (r == 0 && c == 0) {
-									continue;
-								}
-
-								if (dark == qrCode.isDark(row + r, col + c)) {
-									sameCount++;
-								}
+							if (dark == qrCode.isDark(row + r, col + c)) {
+								sameCount++;
 							}
 						}
+					}
 
-						if (sameCount > 5) {
-							lostPoint += (3 + sameCount - 5);
-						}
+					if (sameCount > 5) {
+						lostPoint += (3 + sameCount - 5);
 					}
 				}
+			}
 
-				// LEVEL2
+			// LEVEL2
 
-				for (var row = 0; row < moduleCount - 1; row++) {
-					for (var col = 0; col < moduleCount - 1; col++) {
-						var count = 0;
-						if (qrCode.isDark(row, col)) count++;
-						if (qrCode.isDark(row + 1, col)) count++;
-						if (qrCode.isDark(row, col + 1)) count++;
-						if (qrCode.isDark(row + 1, col + 1)) count++;
-						if (count == 0 || count == 4) {
-							lostPoint += 3;
-						}
+			for (var row = 0; row < moduleCount - 1; row++) {
+				for (var col = 0; col < moduleCount - 1; col++) {
+					var count = 0;
+					if (qrCode.isDark(row, col)) count++;
+					if (qrCode.isDark(row + 1, col)) count++;
+					if (qrCode.isDark(row, col + 1)) count++;
+					if (qrCode.isDark(row + 1, col + 1)) count++;
+					if (count == 0 || count == 4) {
+						lostPoint += 3;
 					}
 				}
+			}
 
-				// LEVEL3
+			// LEVEL3
 
-				for (var row = 0; row < moduleCount; row++) {
-					for (var col = 0; col < moduleCount - 6; col++) {
-						if (qrCode.isDark(row, col)
+			for (var row = 0; row < moduleCount; row++) {
+				for (var col = 0; col < moduleCount - 6; col++) {
+					if (qrCode.isDark(row, col)
 						&& !qrCode.isDark(row, col + 1)
 						&& qrCode.isDark(row, col + 2)
 						&& qrCode.isDark(row, col + 3)
 						&& qrCode.isDark(row, col + 4)
 						&& !qrCode.isDark(row, col + 5)
 						&& qrCode.isDark(row, col + 6)) {
-							lostPoint += 40;
-						}
+						lostPoint += 40;
 					}
 				}
+			}
 
-				for (var col = 0; col < moduleCount; col++) {
-					for (var row = 0; row < moduleCount - 6; row++) {
-						if (qrCode.isDark(row, col)
+			for (var col = 0; col < moduleCount; col++) {
+				for (var row = 0; row < moduleCount - 6; row++) {
+					if (qrCode.isDark(row, col)
 						&& !qrCode.isDark(row + 1, col)
 						&& qrCode.isDark(row + 2, col)
 						&& qrCode.isDark(row + 3, col)
 						&& qrCode.isDark(row + 4, col)
 						&& !qrCode.isDark(row + 5, col)
 						&& qrCode.isDark(row + 6, col)) {
-							lostPoint += 40;
-						}
+						lostPoint += 40;
 					}
 				}
-
-				// LEVEL4
-
-				var darkCount = 0;
-
-				for (var col = 0; col < moduleCount; col++) {
-					for (var row = 0; row < moduleCount; row++) {
-						if (qrCode.isDark(row, col)) {
-							darkCount++;
-						}
-					}
-				}
-
-				var ratio = Math.abs(100 * darkCount / moduleCount / moduleCount - 50) / 5;
-				lostPoint += ratio * 10;
-
-				return lostPoint;
 			}
 
-		};
+			// LEVEL4
 
+			var darkCount = 0;
 
-		//---------------------------------------------------------------------
-		// QRMath
-		//---------------------------------------------------------------------
-
-		QRCode.Math = {
-
-			glog: function (n) {
-
-				if (n < 1) {
-					throw new Error("glog(" + n + ")");
+			for (var col = 0; col < moduleCount; col++) {
+				for (var row = 0; row < moduleCount; row++) {
+					if (qrCode.isDark(row, col)) {
+						darkCount++;
+					}
 				}
+			}
 
-				return QRCode.Math.LOG_TABLE[n];
-			},
+			var ratio = Math.abs(100 * darkCount / moduleCount / moduleCount - 50) / 5;
+			lostPoint += ratio * 10;
 
-			gexp: function (n) {
-
-				while (n < 0) {
-					n += 255;
-				}
-
-				while (n >= 256) {
-					n -= 255;
-				}
-
-				return QRCode.Math.EXP_TABLE[n];
-			},
-
-			EXP_TABLE: new Array(256),
-
-			LOG_TABLE: new Array(256)
-
-		};
-
-		for (var i = 0; i < 8; i++) {
-			QRCode.Math.EXP_TABLE[i] = 1 << i;
+			return lostPoint;
 		}
-		for (var i = 8; i < 256; i++) {
-			QRCode.Math.EXP_TABLE[i] = QRCode.Math.EXP_TABLE[i - 4]
+
+	};
+
+
+	//---------------------------------------------------------------------
+	// QRMath
+	//---------------------------------------------------------------------
+
+	QRCode.Math = {
+
+		glog: function (n) {
+
+			if (n < 1) {
+				throw new Error("glog(" + n + ")");
+			}
+
+			return QRCode.Math.LOG_TABLE[n];
+		},
+
+		gexp: function (n) {
+
+			while (n < 0) {
+				n += 255;
+			}
+
+			while (n >= 256) {
+				n -= 255;
+			}
+
+			return QRCode.Math.EXP_TABLE[n];
+		},
+
+		EXP_TABLE: new Array(256),
+
+		LOG_TABLE: new Array(256)
+
+	};
+
+	for (var i = 0; i < 8; i++) {
+		QRCode.Math.EXP_TABLE[i] = 1 << i;
+	}
+	for (var i = 8; i < 256; i++) {
+		QRCode.Math.EXP_TABLE[i] = QRCode.Math.EXP_TABLE[i - 4]
 		^ QRCode.Math.EXP_TABLE[i - 5]
 		^ QRCode.Math.EXP_TABLE[i - 6]
 		^ QRCode.Math.EXP_TABLE[i - 8];
-		}
-		for (var i = 0; i < 255; i++) {
-			QRCode.Math.LOG_TABLE[QRCode.Math.EXP_TABLE[i]] = i;
+	}
+	for (var i = 0; i < 255; i++) {
+		QRCode.Math.LOG_TABLE[QRCode.Math.EXP_TABLE[i]] = i;
+	}
+
+	//---------------------------------------------------------------------
+	// QRPolynomial
+	//---------------------------------------------------------------------
+
+	QRCode.Polynomial = function (num, shift) {
+
+		if (num.length == undefined) {
+			throw new Error(num.length + "/" + shift);
 		}
 
-		//---------------------------------------------------------------------
-		// QRPolynomial
-		//---------------------------------------------------------------------
+		var offset = 0;
 
-		QRCode.Polynomial = function (num, shift) {
-
-			if (num.length == undefined) {
-				throw new Error(num.length + "/" + shift);
-			}
-
-			var offset = 0;
-
-			while (offset < num.length && num[offset] == 0) {
-				offset++;
-			}
-
-			this.num = new Array(num.length - offset + shift);
-			for (var i = 0; i < num.length - offset; i++) {
-				this.num[i] = num[i + offset];
-			}
+		while (offset < num.length && num[offset] == 0) {
+			offset++;
 		}
 
-		QRCode.Polynomial.prototype = {
-
-			get: function (index) {
-				return this.num[index];
-			},
-
-			getLength: function () {
-				return this.num.length;
-			},
-
-			multiply: function (e) {
-
-				var num = new Array(this.getLength() + e.getLength() - 1);
-
-				for (var i = 0; i < this.getLength(); i++) {
-					for (var j = 0; j < e.getLength(); j++) {
-						num[i + j] ^= QRCode.Math.gexp(QRCode.Math.glog(this.get(i)) + QRCode.Math.glog(e.get(j)));
-					}
-				}
-
-				return new QRCode.Polynomial(num, 0);
-			},
-
-			mod: function (e) {
-
-				if (this.getLength() - e.getLength() < 0) {
-					return this;
-				}
-
-				var ratio = QRCode.Math.glog(this.get(0)) - QRCode.Math.glog(e.get(0));
-
-				var num = new Array(this.getLength());
-
-				for (var i = 0; i < this.getLength(); i++) {
-					num[i] = this.get(i);
-				}
-
-				for (var i = 0; i < e.getLength(); i++) {
-					num[i] ^= QRCode.Math.gexp(QRCode.Math.glog(e.get(i)) + ratio);
-				}
-
-				// recursive call
-				return new QRCode.Polynomial(num, 0).mod(e);
-			}
-		};
-
-		//---------------------------------------------------------------------
-		// QRRSBlock
-		//---------------------------------------------------------------------
-
-		QRCode.RSBlock = function (totalCount, dataCount) {
-			this.totalCount = totalCount;
-			this.dataCount = dataCount;
+		this.num = new Array(num.length - offset + shift);
+		for (var i = 0; i < num.length - offset; i++) {
+			this.num[i] = num[i + offset];
 		}
+	}
 
-		QRCode.RSBlock.RS_BLOCK_TABLE = [
+	QRCode.Polynomial.prototype = {
 
-		// L
-		// M
-		// Q
-		// H
+		get: function (index) {
+			return this.num[index];
+		},
 
-		// 1
+		getLength: function () {
+			return this.num.length;
+		},
+
+		multiply: function (e) {
+
+			var num = new Array(this.getLength() + e.getLength() - 1);
+
+			for (var i = 0; i < this.getLength(); i++) {
+				for (var j = 0; j < e.getLength(); j++) {
+					num[i + j] ^= QRCode.Math.gexp(QRCode.Math.glog(this.get(i)) + QRCode.Math.glog(e.get(j)));
+				}
+			}
+
+			return new QRCode.Polynomial(num, 0);
+		},
+
+		mod: function (e) {
+
+			if (this.getLength() - e.getLength() < 0) {
+				return this;
+			}
+
+			var ratio = QRCode.Math.glog(this.get(0)) - QRCode.Math.glog(e.get(0));
+
+			var num = new Array(this.getLength());
+
+			for (var i = 0; i < this.getLength(); i++) {
+				num[i] = this.get(i);
+			}
+
+			for (var i = 0; i < e.getLength(); i++) {
+				num[i] ^= QRCode.Math.gexp(QRCode.Math.glog(e.get(i)) + ratio);
+			}
+
+			// recursive call
+			return new QRCode.Polynomial(num, 0).mod(e);
+		}
+	};
+
+	//---------------------------------------------------------------------
+	// QRRSBlock
+	//---------------------------------------------------------------------
+
+	QRCode.RSBlock = function (totalCount, dataCount) {
+		this.totalCount = totalCount;
+		this.dataCount = dataCount;
+	}
+
+	QRCode.RSBlock.RS_BLOCK_TABLE = [
+
+	// L
+	// M
+	// Q
+	// H
+
+	// 1
 	[1, 26, 19],
 	[1, 26, 16],
 	[1, 26, 13],
 	[1, 26, 9],
 
-		// 2
+	// 2
 	[1, 44, 34],
 	[1, 44, 28],
 	[1, 44, 22],
 	[1, 44, 16],
 
-		// 3
+	// 3
 	[1, 70, 55],
 	[1, 70, 44],
 	[2, 35, 17],
 	[2, 35, 13],
 
-		// 4		
+	// 4		
 	[1, 100, 80],
 	[2, 50, 32],
 	[2, 50, 24],
 	[4, 25, 9],
 
-		// 5
+	// 5
 	[1, 134, 108],
 	[2, 67, 43],
 	[2, 33, 15, 2, 34, 16],
 	[2, 33, 11, 2, 34, 12],
 
-		// 6
+	// 6
 	[2, 86, 68],
 	[4, 43, 27],
 	[4, 43, 19],
 	[4, 43, 15],
 
-		// 7		
+	// 7		
 	[2, 98, 78],
 	[4, 49, 31],
 	[2, 32, 14, 4, 33, 15],
 	[4, 39, 13, 1, 40, 14],
 
-		// 8
+	// 8
 	[2, 121, 97],
 	[2, 60, 38, 2, 61, 39],
 	[4, 40, 18, 2, 41, 19],
 	[4, 40, 14, 2, 41, 15],
 
-		// 9
+	// 9
 	[2, 146, 116],
 	[3, 58, 36, 2, 59, 37],
 	[4, 36, 16, 4, 37, 17],
 	[4, 36, 12, 4, 37, 13],
 
-		// 10		
+	// 10		
 	[2, 86, 68, 2, 87, 69],
 	[4, 69, 43, 1, 70, 44],
 	[6, 43, 19, 2, 44, 20],
@@ -4527,893 +4520,1190 @@
 
 ];
 
-		QRCode.RSBlock.getRSBlocks = function (typeNumber, errorCorrectLevel) {
+	QRCode.RSBlock.getRSBlocks = function (typeNumber, errorCorrectLevel) {
 
-			var rsBlock = QRCode.RSBlock.getRsBlockTable(typeNumber, errorCorrectLevel);
+		var rsBlock = QRCode.RSBlock.getRsBlockTable(typeNumber, errorCorrectLevel);
 
-			if (rsBlock == undefined) {
-				throw new Error("bad rs block @ typeNumber:" + typeNumber + "/errorCorrectLevel:" + errorCorrectLevel);
-			}
-
-			var length = rsBlock.length / 3;
-
-			var list = new Array();
-
-			for (var i = 0; i < length; i++) {
-
-				var count = rsBlock[i * 3 + 0];
-				var totalCount = rsBlock[i * 3 + 1];
-				var dataCount = rsBlock[i * 3 + 2];
-
-				for (var j = 0; j < count; j++) {
-					list.push(new QRCode.RSBlock(totalCount, dataCount));
-				}
-			}
-
-			return list;
-		};
-
-		QRCode.RSBlock.getRsBlockTable = function (typeNumber, errorCorrectLevel) {
-
-			switch (errorCorrectLevel) {
-				case QRCode.ErrorCorrectLevel.L:
-					return QRCode.RSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 0];
-				case QRCode.ErrorCorrectLevel.M:
-					return QRCode.RSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 1];
-				case QRCode.ErrorCorrectLevel.Q:
-					return QRCode.RSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 2];
-				case QRCode.ErrorCorrectLevel.H:
-					return QRCode.RSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 3];
-				default:
-					return undefined;
-			}
-		};
-
-		//---------------------------------------------------------------------
-		// QRBitBuffer
-		//---------------------------------------------------------------------
-
-		QRCode.BitBuffer = function () {
-			this.buffer = new Array();
-			this.length = 0;
+		if (rsBlock == undefined) {
+			throw new Error("bad rs block @ typeNumber:" + typeNumber + "/errorCorrectLevel:" + errorCorrectLevel);
 		}
 
-		QRCode.BitBuffer.prototype = {
+		var length = rsBlock.length / 3;
 
-			get: function (index) {
-				var bufIndex = Math.floor(index / 8);
-				return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) == 1;
-			},
+		var list = new Array();
 
-			put: function (num, length) {
-				for (var i = 0; i < length; i++) {
-					this.putBit(((num >>> (length - i - 1)) & 1) == 1);
-				}
-			},
+		for (var i = 0; i < length; i++) {
 
-			getLengthInBits: function () {
-				return this.length;
-			},
+			var count = rsBlock[i * 3 + 0];
+			var totalCount = rsBlock[i * 3 + 1];
+			var dataCount = rsBlock[i * 3 + 2];
 
-			putBit: function (bit) {
-
-				var bufIndex = Math.floor(this.length / 8);
-				if (this.buffer.length <= bufIndex) {
-					this.buffer.push(0);
-				}
-
-				if (bit) {
-					this.buffer[bufIndex] |= (0x80 >>> (this.length % 8));
-				}
-
-				this.length++;
+			for (var j = 0; j < count; j++) {
+				list.push(new QRCode.RSBlock(totalCount, dataCount));
 			}
-		};
-	})();
+		}
+
+		return list;
+	};
+
+	QRCode.RSBlock.getRsBlockTable = function (typeNumber, errorCorrectLevel) {
+
+		switch (errorCorrectLevel) {
+			case QRCode.ErrorCorrectLevel.L:
+				return QRCode.RSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 0];
+			case QRCode.ErrorCorrectLevel.M:
+				return QRCode.RSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 1];
+			case QRCode.ErrorCorrectLevel.Q:
+				return QRCode.RSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 2];
+			case QRCode.ErrorCorrectLevel.H:
+				return QRCode.RSBlock.RS_BLOCK_TABLE[(typeNumber - 1) * 4 + 3];
+			default:
+				return undefined;
+		}
+	};
+
+	//---------------------------------------------------------------------
+	// QRBitBuffer
+	//---------------------------------------------------------------------
+
+	QRCode.BitBuffer = function () {
+		this.buffer = new Array();
+		this.length = 0;
+	}
+
+	QRCode.BitBuffer.prototype = {
+
+		get: function (index) {
+			var bufIndex = Math.floor(index / 8);
+			return ((this.buffer[bufIndex] >>> (7 - index % 8)) & 1) == 1;
+		},
+
+		put: function (num, length) {
+			for (var i = 0; i < length; i++) {
+				this.putBit(((num >>> (length - i - 1)) & 1) == 1);
+			}
+		},
+
+		getLengthInBits: function () {
+			return this.length;
+		},
+
+		putBit: function (bit) {
+
+			var bufIndex = Math.floor(this.length / 8);
+			if (this.buffer.length <= bufIndex) {
+				this.buffer.push(0);
+			}
+
+			if (bit) {
+				this.buffer[bufIndex] |= (0x80 >>> (this.length % 8));
+			}
+
+			this.length++;
+		}
+	};
+})();
 	</script>
-
 	<script type="text/javascript">
-		/*
-		Copyright (c) 2011 Stefan Thomas
+/*
+Copyright (c) 2011 Stefan Thomas
 
-		Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
 
-		The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 
-		THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+*/
+
+//https://raw.github.com/bitcoinjs/bitcoinjs-lib/1a7fc9d063f864058809d06ef4542af40be3558f/src/bitcoin.js
+(function (exports) {
+	var Bitcoin = exports;
+})(
+	'object' === typeof module ? module.exports : (window.Bitcoin = {})
+);
+	</script>
+	<script type="text/javascript">
+//https://raw.github.com/bitcoinjs/bitcoinjs-lib/c952aaeb3ee472e3776655b8ea07299ebed702c7/src/base58.js
+(function (Bitcoin) {
+	Bitcoin.Base58 = {
+		alphabet: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
+		validRegex: /^[1-9A-HJ-NP-Za-km-z]+$/,
+		base: BigInteger.valueOf(58),
+
+		/**
+		* Convert a byte array to a base58-encoded string.
+		*
+		* Written by Mike Hearn for BitcoinJ.
+		*   Copyright (c) 2011 Google Inc.
+		*
+		* Ported to JavaScript by Stefan Thomas.
 		*/
+		encode: function (input) {
+			var bi = BigInteger.fromByteArrayUnsigned(input);
+			var chars = [];
 
-		//https://raw.github.com/bitcoinjs/bitcoinjs-lib/1a7fc9d063f864058809d06ef4542af40be3558f/src/bitcoin.js
-		(function (exports) {
-			var Bitcoin = exports;
-		})(
-			'object' === typeof module ? module.exports : (window.Bitcoin = {})
-		);
-	</script>
+			while (bi.compareTo(B58.base) >= 0) {
+				var mod = bi.mod(B58.base);
+				chars.unshift(B58.alphabet[mod.intValue()]);
+				bi = bi.subtract(mod).divide(B58.base);
+			}
+			chars.unshift(B58.alphabet[bi.intValue()]);
 
-	<script type="text/javascript">
-		//https://raw.github.com/bitcoinjs/bitcoinjs-lib/c952aaeb3ee472e3776655b8ea07299ebed702c7/src/base58.js
-		(function (Bitcoin) {
-			Bitcoin.Base58 = {
-				alphabet: "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz",
-				validRegex: /^[1-9A-HJ-NP-Za-km-z]+$/,
-				base: BigInteger.valueOf(58),
+			// Convert leading zeros too.
+			for (var i = 0; i < input.length; i++) {
+				if (input[i] == 0x00) {
+					chars.unshift(B58.alphabet[0]);
+				} else break;
+			}
 
-				/**
-				* Convert a byte array to a base58-encoded string.
-				*
-				* Written by Mike Hearn for BitcoinJ.
-				*   Copyright (c) 2011 Google Inc.
-				*
-				* Ported to JavaScript by Stefan Thomas.
-				*/
-				encode: function (input) {
-					var bi = BigInteger.fromByteArrayUnsigned(input);
-					var chars = [];
+			return chars.join('');
+		},
 
-					while (bi.compareTo(B58.base) >= 0) {
-						var mod = bi.mod(B58.base);
-						chars.unshift(B58.alphabet[mod.intValue()]);
-						bi = bi.subtract(mod).divide(B58.base);
-					}
-					chars.unshift(B58.alphabet[bi.intValue()]);
-
-					// Convert leading zeros too.
-					for (var i = 0; i < input.length; i++) {
-						if (input[i] == 0x00) {
-							chars.unshift(B58.alphabet[0]);
-						} else break;
-					}
-
-					return chars.join('');
-				},
-
-				/**
-				* Convert a base58-encoded string to a byte array.
-				*
-				* Written by Mike Hearn for BitcoinJ.
-				*   Copyright (c) 2011 Google Inc.
-				*
-				* Ported to JavaScript by Stefan Thomas.
-				*/
-				decode: function (input) {
-					var bi = BigInteger.valueOf(0);
-					var leadingZerosNum = 0;
-					for (var i = input.length - 1; i >= 0; i--) {
-						var alphaIndex = B58.alphabet.indexOf(input[i]);
-						if (alphaIndex < 0) {
-							throw "Invalid character";
-						}
-						bi = bi.add(BigInteger.valueOf(alphaIndex)
+		/**
+		* Convert a base58-encoded string to a byte array.
+		*
+		* Written by Mike Hearn for BitcoinJ.
+		*   Copyright (c) 2011 Google Inc.
+		*
+		* Ported to JavaScript by Stefan Thomas.
+		*/
+		decode: function (input) {
+			var bi = BigInteger.valueOf(0);
+			var leadingZerosNum = 0;
+			for (var i = input.length - 1; i >= 0; i--) {
+				var alphaIndex = B58.alphabet.indexOf(input[i]);
+				if (alphaIndex < 0) {
+					throw "Invalid character";
+				}
+				bi = bi.add(BigInteger.valueOf(alphaIndex)
 								.multiply(B58.base.pow(input.length - 1 - i)));
 
-						// This counts leading zero bytes
-						if (input[i] == "1") leadingZerosNum++;
-						else leadingZerosNum = 0;
-					}
-					var bytes = bi.toByteArrayUnsigned();
-
-					// Add leading zeros
-					while (leadingZerosNum-- > 0) bytes.unshift(0);
-
-					return bytes;
-				}
-			};
-
-			var B58 = Bitcoin.Base58;
-		})(
-		'undefined' != typeof Bitcoin ? Bitcoin : module.exports
-		);
-	</script>
-
-	<script type="text/javascript">
-		//https://raw.github.com/bitcoinjs/bitcoinjs-lib/09e8c6e184d6501a0c2c59d73ca64db5c0d3eb95/src/address.js
-		Bitcoin.Address = function (bytes) {
-			if ("string" == typeof bytes) {
-				bytes = Bitcoin.Address.decodeString(bytes);
+				// This counts leading zero bytes
+				if (input[i] == "1") leadingZerosNum++;
+				else leadingZerosNum = 0;
 			}
-			this.hash = bytes;
-			this.version = Bitcoin.Address.networkVersion;
-		};
+			var bytes = bi.toByteArrayUnsigned();
 
-		Bitcoin.Address.networkVersion = 0x00; // mainnet
+			// Add leading zeros
+			while (leadingZerosNum-- > 0) bytes.unshift(0);
 
-		/**
-		* Serialize this object as a standard Bitcoin address.
-		*
-		* Returns the address as a base58-encoded string in the standardized format.
-		*/
-		Bitcoin.Address.prototype.toString = function () {
-			// Get a copy of the hash
-			var hash = this.hash.slice(0);
+			return bytes;
+		}
+	};
 
-			// Version
-			hash.unshift(this.version);
-			var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), { asBytes: true });
-			var bytes = hash.concat(checksum.slice(0, 4));
-			return Bitcoin.Base58.encode(bytes);
-		};
+	var B58 = Bitcoin.Base58;
+})(
+	'undefined' != typeof Bitcoin ? Bitcoin : module.exports
+);
+	</script>
+	<script type="text/javascript">
+//https://raw.github.com/bitcoinjs/bitcoinjs-lib/09e8c6e184d6501a0c2c59d73ca64db5c0d3eb95/src/address.js
+Bitcoin.Address = function (bytes) {
+	if ("string" == typeof bytes) {
+		bytes = Bitcoin.Address.decodeString(bytes);
+	}
+	this.hash = bytes;
+	this.version = Bitcoin.Address.networkVersion;
+};
 
-		Bitcoin.Address.prototype.getHashBase64 = function () {
-			return Crypto.util.bytesToBase64(this.hash);
-		};
+Bitcoin.Address.networkVersion = 0x00; // mainnet
 
-		/**
-		* Parse a Bitcoin address contained in a string.
-		*/
-		Bitcoin.Address.decodeString = function (string) {
-			var bytes = Bitcoin.Base58.decode(string);
-			var hash = bytes.slice(0, 21);
-			var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), { asBytes: true });
+/**
+* Serialize this object as a standard Bitcoin address.
+*
+* Returns the address as a base58-encoded string in the standardized format.
+*/
+Bitcoin.Address.prototype.toString = function () {
+	// Get a copy of the hash
+	var hash = this.hash.slice(0);
 
-			if (checksum[0] != bytes[21] ||
+	// Version
+	hash.unshift(this.version);
+	var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), { asBytes: true });
+	var bytes = hash.concat(checksum.slice(0, 4));
+	return Bitcoin.Base58.encode(bytes);
+};
+
+Bitcoin.Address.prototype.getHashBase64 = function () {
+	return Crypto.util.bytesToBase64(this.hash);
+};
+
+/**
+* Parse a Bitcoin address contained in a string.
+*/
+Bitcoin.Address.decodeString = function (string) {
+	var bytes = Bitcoin.Base58.decode(string);
+	var hash = bytes.slice(0, 21);
+	var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), { asBytes: true });
+
+	if (checksum[0] != bytes[21] ||
 			checksum[1] != bytes[22] ||
 			checksum[2] != bytes[23] ||
 			checksum[3] != bytes[24]) {
-				throw "Checksum validation failed!";
-			}
+		throw "Checksum validation failed!";
+	}
 
-			var version = hash.shift();
+	var version = hash.shift();
 
-			if (version != 0) {
-				throw "Version " + version + " not supported!";
-			}
+	if (version != 0) {
+		throw "Version " + version + " not supported!";
+	}
 
-			return hash;
-		};
+	return hash;
+};
 	</script>
-
 	<script type="text/javascript">
-		//https://raw.github.com/bitcoinjs/bitcoinjs-lib/e90780d3d3b8fc0d027d2bcb38b80479902f223e/src/ecdsa.js
-		Bitcoin.ECDSA = (function () {
-			var ecparams = EllipticCurve.getSECCurveByName("secp256k1");
-			var rng = new SecureRandom();
+//https://raw.github.com/bitcoinjs/bitcoinjs-lib/e90780d3d3b8fc0d027d2bcb38b80479902f223e/src/ecdsa.js
+Bitcoin.ECDSA = (function () {
+	var ecparams = EllipticCurve.getSECCurveByName("secp256k1");
+	var rng = new SecureRandom();
 
-			var P_OVER_FOUR = null;
+	var P_OVER_FOUR = null;
 
-			function implShamirsTrick(P, k, Q, l) {
-				var m = Math.max(k.bitLength(), l.bitLength());
-				var Z = P.add2D(Q);
-				var R = P.curve.getInfinity();
+	function implShamirsTrick(P, k, Q, l) {
+		var m = Math.max(k.bitLength(), l.bitLength());
+		var Z = P.add2D(Q);
+		var R = P.curve.getInfinity();
 
-				for (var i = m - 1; i >= 0; --i) {
-					R = R.twice2D();
+		for (var i = m - 1; i >= 0; --i) {
+			R = R.twice2D();
 
-					R.z = BigInteger.ONE;
+			R.z = BigInteger.ONE;
 
-					if (k.testBit(i)) {
-						if (l.testBit(i)) {
-							R = R.add2D(Z);
-						} else {
-							R = R.add2D(P);
-						}
-					} else {
-						if (l.testBit(i)) {
-							R = R.add2D(Q);
-						}
-					}
+			if (k.testBit(i)) {
+				if (l.testBit(i)) {
+					R = R.add2D(Z);
+				} else {
+					R = R.add2D(P);
 				}
+			} else {
+				if (l.testBit(i)) {
+					R = R.add2D(Q);
+				}
+			}
+		}
 
-				return R;
-			};
+		return R;
+	};
 
-			var ECDSA = {
-				getBigRandom: function (limit) {
-					return new BigInteger(limit.bitLength(), rng)
+	var ECDSA = {
+		getBigRandom: function (limit) {
+			return new BigInteger(limit.bitLength(), rng)
 				.mod(limit.subtract(BigInteger.ONE))
 				.add(BigInteger.ONE);
-				},
-				sign: function (hash, priv) {
-					var d = priv;
-					var n = ecparams.getN();
-					var e = BigInteger.fromByteArrayUnsigned(hash);
+		},
+		sign: function (hash, priv) {
+			var d = priv;
+			var n = ecparams.getN();
+			var e = BigInteger.fromByteArrayUnsigned(hash);
 
-					do {
-						var k = ECDSA.getBigRandom(n);
-						var G = ecparams.getG();
-						var Q = G.multiply(k);
-						var r = Q.getX().toBigInteger().mod(n);
-					} while (r.compareTo(BigInteger.ZERO) <= 0);
+			do {
+				var k = ECDSA.getBigRandom(n);
+				var G = ecparams.getG();
+				var Q = G.multiply(k);
+				var r = Q.getX().toBigInteger().mod(n);
+			} while (r.compareTo(BigInteger.ZERO) <= 0);
 
-					var s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n);
+			var s = k.modInverse(n).multiply(e.add(d.multiply(r))).mod(n);
 
-					return ECDSA.serializeSig(r, s);
-				},
+			return ECDSA.serializeSig(r, s);
+		},
 
-				verify: function (hash, sig, pubkey) {
-					var r, s;
-					if (Bitcoin.Util.isArray(sig)) {
-						var obj = ECDSA.parseSig(sig);
-						r = obj.r;
-						s = obj.s;
-					} else if ("object" === typeof sig && sig.r && sig.s) {
-						r = sig.r;
-						s = sig.s;
-					} else {
-						throw "Invalid value for signature";
-					}
+		verify: function (hash, sig, pubkey) {
+			var r, s;
+			if (Bitcoin.Util.isArray(sig)) {
+				var obj = ECDSA.parseSig(sig);
+				r = obj.r;
+				s = obj.s;
+			} else if ("object" === typeof sig && sig.r && sig.s) {
+				r = sig.r;
+				s = sig.s;
+			} else {
+				throw "Invalid value for signature";
+			}
 
-					var Q;
-					if (pubkey instanceof ec.PointFp) {
-						Q = pubkey;
-					} else if (Bitcoin.Util.isArray(pubkey)) {
-						Q = EllipticCurve.PointFp.decodeFrom(ecparams.getCurve(), pubkey);
-					} else {
-						throw "Invalid format for pubkey value, must be byte array or ec.PointFp";
-					}
-					var e = BigInteger.fromByteArrayUnsigned(hash);
+			var Q;
+			if (pubkey instanceof ec.PointFp) {
+				Q = pubkey;
+			} else if (Bitcoin.Util.isArray(pubkey)) {
+				Q = EllipticCurve.PointFp.decodeFrom(ecparams.getCurve(), pubkey);
+			} else {
+				throw "Invalid format for pubkey value, must be byte array or ec.PointFp";
+			}
+			var e = BigInteger.fromByteArrayUnsigned(hash);
 
-					return ECDSA.verifyRaw(e, r, s, Q);
-				},
+			return ECDSA.verifyRaw(e, r, s, Q);
+		},
 
-				verifyRaw: function (e, r, s, Q) {
-					var n = ecparams.getN();
-					var G = ecparams.getG();
+		verifyRaw: function (e, r, s, Q) {
+			var n = ecparams.getN();
+			var G = ecparams.getG();
 
-					if (r.compareTo(BigInteger.ONE) < 0 ||
+			if (r.compareTo(BigInteger.ONE) < 0 ||
           r.compareTo(n) >= 0)
-						return false;
+				return false;
 
-					if (s.compareTo(BigInteger.ONE) < 0 ||
+			if (s.compareTo(BigInteger.ONE) < 0 ||
           s.compareTo(n) >= 0)
-						return false;
+				return false;
 
-					var c = s.modInverse(n);
+			var c = s.modInverse(n);
 
-					var u1 = e.multiply(c).mod(n);
-					var u2 = r.multiply(c).mod(n);
+			var u1 = e.multiply(c).mod(n);
+			var u2 = r.multiply(c).mod(n);
 
-					// TODO(!!!): For some reason Shamir's trick isn't working with
-					// signed message verification!? Probably an implementation
-					// error!
-					//var point = implShamirsTrick(G, u1, Q, u2);
-					var point = G.multiply(u1).add(Q.multiply(u2));
+			// TODO(!!!): For some reason Shamir's trick isn't working with
+			// signed message verification!? Probably an implementation
+			// error!
+			//var point = implShamirsTrick(G, u1, Q, u2);
+			var point = G.multiply(u1).add(Q.multiply(u2));
 
-					var v = point.getX().toBigInteger().mod(n);
+			var v = point.getX().toBigInteger().mod(n);
 
-					return v.equals(r);
-				},
+			return v.equals(r);
+		},
 
-				/**
-				* Serialize a signature into DER format.
-				*
-				* Takes two BigIntegers representing r and s and returns a byte array.
-				*/
-				serializeSig: function (r, s) {
-					var rBa = r.toByteArraySigned();
-					var sBa = s.toByteArraySigned();
+		/**
+		* Serialize a signature into DER format.
+		*
+		* Takes two BigIntegers representing r and s and returns a byte array.
+		*/
+		serializeSig: function (r, s) {
+			var rBa = r.toByteArraySigned();
+			var sBa = s.toByteArraySigned();
 
-					var sequence = [];
-					sequence.push(0x02); // INTEGER
-					sequence.push(rBa.length);
-					sequence = sequence.concat(rBa);
+			var sequence = [];
+			sequence.push(0x02); // INTEGER
+			sequence.push(rBa.length);
+			sequence = sequence.concat(rBa);
 
-					sequence.push(0x02); // INTEGER
-					sequence.push(sBa.length);
-					sequence = sequence.concat(sBa);
+			sequence.push(0x02); // INTEGER
+			sequence.push(sBa.length);
+			sequence = sequence.concat(sBa);
 
-					sequence.unshift(sequence.length);
-					sequence.unshift(0x30); // SEQUENCE
+			sequence.unshift(sequence.length);
+			sequence.unshift(0x30); // SEQUENCE
 
-					return sequence;
-				},
+			return sequence;
+		},
 
-				/**
-				* Parses a byte array containing a DER-encoded signature.
-				*
-				* This function will return an object of the form:
-				* 
-				* {
-				*   r: BigInteger,
-				*   s: BigInteger
-				* }
-				*/
-				parseSig: function (sig) {
-					var cursor;
-					if (sig[0] != 0x30)
-						throw new Error("Signature not a valid DERSequence");
+		/**
+		* Parses a byte array containing a DER-encoded signature.
+		*
+		* This function will return an object of the form:
+		* 
+		* {
+		*   r: BigInteger,
+		*   s: BigInteger
+		* }
+		*/
+		parseSig: function (sig) {
+			var cursor;
+			if (sig[0] != 0x30)
+				throw new Error("Signature not a valid DERSequence");
 
-					cursor = 2;
-					if (sig[cursor] != 0x02)
-						throw new Error("First element in signature must be a DERInteger"); ;
-					var rBa = sig.slice(cursor + 2, cursor + 2 + sig[cursor + 1]);
+			cursor = 2;
+			if (sig[cursor] != 0x02)
+				throw new Error("First element in signature must be a DERInteger"); ;
+			var rBa = sig.slice(cursor + 2, cursor + 2 + sig[cursor + 1]);
 
-					cursor += 2 + sig[cursor + 1];
-					if (sig[cursor] != 0x02)
-						throw new Error("Second element in signature must be a DERInteger");
-					var sBa = sig.slice(cursor + 2, cursor + 2 + sig[cursor + 1]);
+			cursor += 2 + sig[cursor + 1];
+			if (sig[cursor] != 0x02)
+				throw new Error("Second element in signature must be a DERInteger");
+			var sBa = sig.slice(cursor + 2, cursor + 2 + sig[cursor + 1]);
 
-					cursor += 2 + sig[cursor + 1];
+			cursor += 2 + sig[cursor + 1];
 
-					//if (cursor != sig.length)
-					//	throw new Error("Extra bytes in signature");
+			//if (cursor != sig.length)
+			//	throw new Error("Extra bytes in signature");
 
-					var r = BigInteger.fromByteArrayUnsigned(rBa);
-					var s = BigInteger.fromByteArrayUnsigned(sBa);
+			var r = BigInteger.fromByteArrayUnsigned(rBa);
+			var s = BigInteger.fromByteArrayUnsigned(sBa);
 
-					return { r: r, s: s };
-				},
+			return { r: r, s: s };
+		},
 
-				parseSigCompact: function (sig) {
-					if (sig.length !== 65) {
-						throw "Signature has the wrong length";
-					}
+		parseSigCompact: function (sig) {
+			if (sig.length !== 65) {
+				throw "Signature has the wrong length";
+			}
 
-					// Signature is prefixed with a type byte storing three bits of
-					// information.
-					var i = sig[0] - 27;
-					if (i < 0 || i > 7) {
-						throw "Invalid signature type";
-					}
+			// Signature is prefixed with a type byte storing three bits of
+			// information.
+			var i = sig[0] - 27;
+			if (i < 0 || i > 7) {
+				throw "Invalid signature type";
+			}
 
-					var n = ecparams.getN();
-					var r = BigInteger.fromByteArrayUnsigned(sig.slice(1, 33)).mod(n);
-					var s = BigInteger.fromByteArrayUnsigned(sig.slice(33, 65)).mod(n);
+			var n = ecparams.getN();
+			var r = BigInteger.fromByteArrayUnsigned(sig.slice(1, 33)).mod(n);
+			var s = BigInteger.fromByteArrayUnsigned(sig.slice(33, 65)).mod(n);
 
-					return { r: r, s: s, i: i };
-				},
+			return { r: r, s: s, i: i };
+		},
 
-				/**
-				* Recover a public key from a signature.
-				*
-				* See SEC 1: Elliptic Curve Cryptography, section 4.1.6, "Public
-				* Key Recovery Operation".
-				*
-				* http://www.secg.org/download/aid-780/sec1-v2.pdf
-				*/
-				recoverPubKey: function (r, s, hash, i) {
-					// The recovery parameter i has two bits.
-					i = i & 3;
+		/**
+		* Recover a public key from a signature.
+		*
+		* See SEC 1: Elliptic Curve Cryptography, section 4.1.6, "Public
+		* Key Recovery Operation".
+		*
+		* http://www.secg.org/download/aid-780/sec1-v2.pdf
+		*/
+		recoverPubKey: function (r, s, hash, i) {
+			// The recovery parameter i has two bits.
+			i = i & 3;
 
-					// The less significant bit specifies whether the y coordinate
-					// of the compressed point is even or not.
-					var isYEven = i & 1;
+			// The less significant bit specifies whether the y coordinate
+			// of the compressed point is even or not.
+			var isYEven = i & 1;
 
-					// The more significant bit specifies whether we should use the
-					// first or second candidate key.
-					var isSecondKey = i >> 1;
+			// The more significant bit specifies whether we should use the
+			// first or second candidate key.
+			var isSecondKey = i >> 1;
 
-					var n = ecparams.getN();
-					var G = ecparams.getG();
-					var curve = ecparams.getCurve();
-					var p = curve.getQ();
-					var a = curve.getA().toBigInteger();
-					var b = curve.getB().toBigInteger();
+			var n = ecparams.getN();
+			var G = ecparams.getG();
+			var curve = ecparams.getCurve();
+			var p = curve.getQ();
+			var a = curve.getA().toBigInteger();
+			var b = curve.getB().toBigInteger();
 
-					// We precalculate (p + 1) / 4 where p is if the field order
-					if (!P_OVER_FOUR) {
-						P_OVER_FOUR = p.add(BigInteger.ONE).divide(BigInteger.valueOf(4));
-					}
+			// We precalculate (p + 1) / 4 where p is if the field order
+			if (!P_OVER_FOUR) {
+				P_OVER_FOUR = p.add(BigInteger.ONE).divide(BigInteger.valueOf(4));
+			}
 
-					// 1.1 Compute x
-					var x = isSecondKey ? r.add(n) : r;
+			// 1.1 Compute x
+			var x = isSecondKey ? r.add(n) : r;
 
-					// 1.3 Convert x to point
-					var alpha = x.multiply(x).multiply(x).add(a.multiply(x)).add(b).mod(p);
-					var beta = alpha.modPow(P_OVER_FOUR, p);
+			// 1.3 Convert x to point
+			var alpha = x.multiply(x).multiply(x).add(a.multiply(x)).add(b).mod(p);
+			var beta = alpha.modPow(P_OVER_FOUR, p);
 
-					var xorOdd = beta.isEven() ? (i % 2) : ((i + 1) % 2);
-					// If beta is even, but y isn't or vice versa, then convert it,
-					// otherwise we're done and y == beta.
-					var y = (beta.isEven() ? !isYEven : isYEven) ? beta : p.subtract(beta);
+			var xorOdd = beta.isEven() ? (i % 2) : ((i + 1) % 2);
+			// If beta is even, but y isn't or vice versa, then convert it,
+			// otherwise we're done and y == beta.
+			var y = (beta.isEven() ? !isYEven : isYEven) ? beta : p.subtract(beta);
 
-					// 1.4 Check that nR is at infinity
-					var R = new EllipticCurve.PointFp(curve,
+			// 1.4 Check that nR is at infinity
+			var R = new EllipticCurve.PointFp(curve,
                             curve.fromBigInteger(x),
                             curve.fromBigInteger(y));
-					R.validate();
+			R.validate();
 
-					// 1.5 Compute e from M
-					var e = BigInteger.fromByteArrayUnsigned(hash);
-					var eNeg = BigInteger.ZERO.subtract(e).mod(n);
+			// 1.5 Compute e from M
+			var e = BigInteger.fromByteArrayUnsigned(hash);
+			var eNeg = BigInteger.ZERO.subtract(e).mod(n);
 
-					// 1.6 Compute Q = r^-1 (sR - eG)
-					var rInv = r.modInverse(n);
-					var Q = implShamirsTrick(R, s, G, eNeg).multiply(rInv);
+			// 1.6 Compute Q = r^-1 (sR - eG)
+			var rInv = r.modInverse(n);
+			var Q = implShamirsTrick(R, s, G, eNeg).multiply(rInv);
 
-					Q.validate();
-					if (!ECDSA.verifyRaw(e, r, s, Q)) {
-						throw "Pubkey recovery unsuccessful";
+			Q.validate();
+			if (!ECDSA.verifyRaw(e, r, s, Q)) {
+				throw "Pubkey recovery unsuccessful";
+			}
+
+			var pubKey = new Bitcoin.ECKey();
+			pubKey.pub = Q;
+			return pubKey;
+		},
+
+		/**
+		* Calculate pubkey extraction parameter.
+		*
+		* When extracting a pubkey from a signature, we have to
+		* distinguish four different cases. Rather than putting this
+		* burden on the verifier, Bitcoin includes a 2-bit value with the
+		* signature.
+		*
+		* This function simply tries all four cases and returns the value
+		* that resulted in a successful pubkey recovery.
+		*/
+		calcPubkeyRecoveryParam: function (address, r, s, hash) {
+			for (var i = 0; i < 4; i++) {
+				try {
+					var pubkey = Bitcoin.ECDSA.recoverPubKey(r, s, hash, i);
+					if (pubkey.getBitcoinAddress().toString() == address) {
+						return i;
 					}
+				} catch (e) { }
+			}
+			throw "Unable to find valid recovery factor";
+		}
+	};
 
-					var pubKey = new Bitcoin.ECKey();
-					pubKey.pub = Q;
-					return pubKey;
-				},
-
-				/**
-				* Calculate pubkey extraction parameter.
-				*
-				* When extracting a pubkey from a signature, we have to
-				* distinguish four different cases. Rather than putting this
-				* burden on the verifier, Bitcoin includes a 2-bit value with the
-				* signature.
-				*
-				* This function simply tries all four cases and returns the value
-				* that resulted in a successful pubkey recovery.
-				*/
-				calcPubkeyRecoveryParam: function (address, r, s, hash) {
-					for (var i = 0; i < 4; i++) {
-						try {
-							var pubkey = Bitcoin.ECDSA.recoverPubKey(r, s, hash, i);
-							if (pubkey.getBitcoinAddress().toString() == address) {
-								return i;
-							}
-						} catch (e) { }
-					}
-					throw "Unable to find valid recovery factor";
-				}
-			};
-
-			return ECDSA;
-		})();
+	return ECDSA;
+})();
 	</script>
-
 	<script type="text/javascript">
-		//https://raw.github.com/pointbiz/bitcoinjs-lib/9b2f94a028a7bc9bed94e0722563e9ff1d8e8db8/src/eckey.js
-		Bitcoin.ECKey = (function () {
-			var ECDSA = Bitcoin.ECDSA;
-			var ecparams = EllipticCurve.getSECCurveByName("secp256k1");
-			var rng = new SecureRandom();
+//https://raw.github.com/pointbiz/bitcoinjs-lib/9b2f94a028a7bc9bed94e0722563e9ff1d8e8db8/src/eckey.js
+Bitcoin.ECKey = (function () {
+	var ECDSA = Bitcoin.ECDSA;
+	var ecparams = EllipticCurve.getSECCurveByName("secp256k1");
+	var rng = new SecureRandom();
 
-			var ECKey = function (input) {
-				if (!input) {
-					// Generate new key
-					var n = ecparams.getN();
-					this.priv = ECDSA.getBigRandom(n);
-				} else if (input instanceof BigInteger) {
-					// Input is a private key value
-					this.priv = input;
-				} else if (Bitcoin.Util.isArray(input)) {
-					// Prepend zero byte to prevent interpretation as negative integer
-					this.priv = BigInteger.fromByteArrayUnsigned(input);
-				} else if ("string" == typeof input) {
-					var bytes = null;
-					if (ECKey.isWalletImportFormat(input)) {
-						bytes = ECKey.decodeWalletImportFormat(input);
-					} else if (ECKey.isCompressedWalletImportFormat(input)) {
-						bytes = ECKey.decodeCompressedWalletImportFormat(input);
-						this.compressed = true;
-					} else if (ECKey.isMiniFormat(input)) {
-						bytes = Crypto.SHA256(input, { asBytes: true });
-					} else if (ECKey.isHexFormat(input)) {
-						bytes = Crypto.util.hexToBytes(input);
-					} else if (ECKey.isBase64Format(input)) {
-						bytes = Crypto.util.base64ToBytes(input);
-					}
+	var ECKey = function (input) {
+		if (!input) {
+			// Generate new key
+			var n = ecparams.getN();
+			this.priv = ECDSA.getBigRandom(n);
+		} else if (input instanceof BigInteger) {
+			// Input is a private key value
+			this.priv = input;
+		} else if (Bitcoin.Util.isArray(input)) {
+			// Prepend zero byte to prevent interpretation as negative integer
+			this.priv = BigInteger.fromByteArrayUnsigned(input);
+		} else if ("string" == typeof input) {
+			var bytes = null;
+			if (ECKey.isWalletImportFormat(input)) {
+				bytes = ECKey.decodeWalletImportFormat(input);
+			} else if (ECKey.isCompressedWalletImportFormat(input)) {
+				bytes = ECKey.decodeCompressedWalletImportFormat(input);
+				this.compressed = true;
+			} else if (ECKey.isMiniFormat(input)) {
+				bytes = Crypto.SHA256(input, { asBytes: true });
+			} else if (ECKey.isHexFormat(input)) {
+				bytes = Crypto.util.hexToBytes(input);
+			} else if (ECKey.isBase64Format(input)) {
+				bytes = Crypto.util.base64ToBytes(input);
+			}
 
-					if (bytes == null || bytes.length != 32) {
-						this.priv = null;
-					} else {
-						// Prepend zero byte to prevent interpretation as negative integer
-						this.priv = BigInteger.fromByteArrayUnsigned(bytes);
-					}
-				}
+			if (bytes == null || bytes.length != 32) {
+				this.priv = null;
+			} else {
+				// Prepend zero byte to prevent interpretation as negative integer
+				this.priv = BigInteger.fromByteArrayUnsigned(bytes);
+			}
+		}
 
-				this.compressed = (this.compressed == undefined) ? !!ECKey.compressByDefault : this.compressed;
-			};
+		this.compressed = (this.compressed == undefined) ? !!ECKey.compressByDefault : this.compressed;
+	};
 
-			ECKey.privateKeyPrefix = 0x80; // mainnet 0x80    testnet 0xEF
+	ECKey.privateKeyPrefix = 0x80; // mainnet 0x80    testnet 0xEF
 
-			/**
-			* Whether public keys should be returned compressed by default.
-			*/
-			ECKey.compressByDefault = false;
+	/**
+	* Whether public keys should be returned compressed by default.
+	*/
+	ECKey.compressByDefault = false;
 
-			/**
-			* Set whether the public key should be returned compressed or not.
-			*/
-			ECKey.prototype.setCompressed = function (v) {
-				this.compressed = !!v;
-				if (this.pubPoint) this.pubPoint.compressed = this.compressed;
-			};
+	/**
+	* Set whether the public key should be returned compressed or not.
+	*/
+	ECKey.prototype.setCompressed = function (v) {
+		this.compressed = !!v;
+		if (this.pubPoint) this.pubPoint.compressed = this.compressed;
+		return this;
+	};
 
-			/*
-			* Return public key as a byte array in DER encoding
-			*/
-			ECKey.prototype.getPub = function () {
-				if (this.compressed) {
-					if (this.pubComp) return this.pubComp;
-					return this.pubComp = this.getPubPoint().getEncoded(1);
-				} else {
-					if (this.pubUncomp) return this.pubUncomp;
-					return this.pubUncomp = this.getPubPoint().getEncoded(0);
-				}
-			};
+	/*
+	* Return public key as a byte array in DER encoding
+	*/
+	ECKey.prototype.getPub = function () {
+		if (this.compressed) {
+			if (this.pubComp) return this.pubComp;
+			return this.pubComp = this.getPubPoint().getEncoded(1);
+		} else {
+			if (this.pubUncomp) return this.pubUncomp;
+			return this.pubUncomp = this.getPubPoint().getEncoded(0);
+		}
+	};
 
-			/**
-			* Return public point as ECPoint object.
-			*/
-			ECKey.prototype.getPubPoint = function () {
-				if (!this.pubPoint) {
-					this.pubPoint = ecparams.getG().multiply(this.priv);
-					this.pubPoint.compressed = this.compressed;
-				}
-				return this.pubPoint;
-			};
+	/**
+	* Return public point as ECPoint object.
+	*/
+	ECKey.prototype.getPubPoint = function () {
+		if (!this.pubPoint) {
+			this.pubPoint = ecparams.getG().multiply(this.priv);
+			this.pubPoint.compressed = this.compressed;
+		}
+		return this.pubPoint;
+	};
 
-			ECKey.prototype.getPubKeyHex = function () {
-				if (this.compressed) {
-					if (this.pubKeyHexComp) return this.pubKeyHexComp;
-					return this.pubKeyHexComp = Crypto.util.bytesToHex(this.getPub()).toString().toUpperCase();
-				} else {
-					if (this.pubKeyHexUncomp) return this.pubKeyHexUncomp;
-					return this.pubKeyHexUncomp = Crypto.util.bytesToHex(this.getPub()).toString().toUpperCase();
-				}
-			};
+	ECKey.prototype.getPubKeyHex = function () {
+		if (this.compressed) {
+			if (this.pubKeyHexComp) return this.pubKeyHexComp;
+			return this.pubKeyHexComp = Crypto.util.bytesToHex(this.getPub()).toString().toUpperCase();
+		} else {
+			if (this.pubKeyHexUncomp) return this.pubKeyHexUncomp;
+			return this.pubKeyHexUncomp = Crypto.util.bytesToHex(this.getPub()).toString().toUpperCase();
+		}
+	};
 
-			/**
-			* Get the pubKeyHash for this key.
-			*
-			* This is calculated as RIPE160(SHA256([encoded pubkey])) and returned as
-			* a byte array.
-			*/
-			ECKey.prototype.getPubKeyHash = function () {
-				if (this.compressed) {
-					if (this.pubKeyHashComp) return this.pubKeyHashComp;
-					return this.pubKeyHashComp = Bitcoin.Util.sha256ripe160(this.getPub());
-				} else {
-					if (this.pubKeyHashUncomp) return this.pubKeyHashUncomp;
-					return this.pubKeyHashUncomp = Bitcoin.Util.sha256ripe160(this.getPub());
-				}
-			};
+	/**
+	* Get the pubKeyHash for this key.
+	*
+	* This is calculated as RIPE160(SHA256([encoded pubkey])) and returned as
+	* a byte array.
+	*/
+	ECKey.prototype.getPubKeyHash = function () {
+		if (this.compressed) {
+			if (this.pubKeyHashComp) return this.pubKeyHashComp;
+			return this.pubKeyHashComp = Bitcoin.Util.sha256ripe160(this.getPub());
+		} else {
+			if (this.pubKeyHashUncomp) return this.pubKeyHashUncomp;
+			return this.pubKeyHashUncomp = Bitcoin.Util.sha256ripe160(this.getPub());
+		}
+	};
 
-			ECKey.prototype.getBitcoinAddress = function () {
-				var hash = this.getPubKeyHash();
-				var addr = new Bitcoin.Address(hash);
-				return addr.toString();
-			};
+	ECKey.prototype.getBitcoinAddress = function () {
+		var hash = this.getPubKeyHash();
+		var addr = new Bitcoin.Address(hash);
+		return addr.toString();
+	};
 
-			/*
-			* Takes a public point as a hex string or byte array
-			*/
-			ECKey.prototype.setPub = function (pub) {
-				// byte array
-				if (Bitcoin.Util.isArray(pub)) {
-					pub = Crypto.util.bytesToHex(pub).toString().toUpperCase();
-				}
-				var ecPoint = ecparams.getCurve().decodePointHex(pub);
-				this.setCompressed(ecPoint.compressed);
-				this.pubPoint = ecPoint;
-			};
+	/*
+	* Takes a public point as a hex string or byte array
+	*/
+	ECKey.prototype.setPub = function (pub) {
+		// byte array
+		if (Bitcoin.Util.isArray(pub)) {
+			pub = Crypto.util.bytesToHex(pub).toString().toUpperCase();
+		}
+		var ecPoint = ecparams.getCurve().decodePointHex(pub);
+		this.setCompressed(ecPoint.compressed);
+		this.pubPoint = ecPoint;
+		return this;
+	};
 
-			// Sipa Private Key Wallet Import Format 
-			ECKey.prototype.getBitcoinWalletImportFormat = function () {
-				var bytes = this.getBitcoinPrivateKeyByteArray();
-				bytes.unshift(ECKey.privateKeyPrefix); // prepend 0x80 byte
-				if (this.compressed) bytes.push(0x01); // append 0x01 byte for compressed format
-				var checksum = Crypto.SHA256(Crypto.SHA256(bytes, { asBytes: true }), { asBytes: true });
-				bytes = bytes.concat(checksum.slice(0, 4));
-				var privWif = Bitcoin.Base58.encode(bytes);
-				return privWif;
-			};
+	// Sipa Private Key Wallet Import Format 
+	ECKey.prototype.getBitcoinWalletImportFormat = function () {
+		var bytes = this.getBitcoinPrivateKeyByteArray();
+		bytes.unshift(ECKey.privateKeyPrefix); // prepend 0x80 byte
+		if (this.compressed) bytes.push(0x01); // append 0x01 byte for compressed format
+		var checksum = Crypto.SHA256(Crypto.SHA256(bytes, { asBytes: true }), { asBytes: true });
+		bytes = bytes.concat(checksum.slice(0, 4));
+		var privWif = Bitcoin.Base58.encode(bytes);
+		return privWif;
+	};
 
-			// Private Key Hex Format 
-			ECKey.prototype.getBitcoinHexFormat = function () {
-				return Crypto.util.bytesToHex(this.getBitcoinPrivateKeyByteArray()).toString().toUpperCase();
-			};
+	// Private Key Hex Format 
+	ECKey.prototype.getBitcoinHexFormat = function () {
+		return Crypto.util.bytesToHex(this.getBitcoinPrivateKeyByteArray()).toString().toUpperCase();
+	};
 
-			// Private Key Base64 Format 
-			ECKey.prototype.getBitcoinBase64Format = function () {
-				return Crypto.util.bytesToBase64(this.getBitcoinPrivateKeyByteArray());
-			};
+	// Private Key Base64 Format 
+	ECKey.prototype.getBitcoinBase64Format = function () {
+		return Crypto.util.bytesToBase64(this.getBitcoinPrivateKeyByteArray());
+	};
 
-			ECKey.prototype.getBitcoinPrivateKeyByteArray = function () {
-				// Get a copy of private key as a byte array
-				var bytes = this.priv.toByteArrayUnsigned();
-				// zero pad if private key is less than 32 bytes 
-				while (bytes.length < 32) bytes.unshift(0x00);
-				return bytes;
-			};
+	ECKey.prototype.getBitcoinPrivateKeyByteArray = function () {
+		// Get a copy of private key as a byte array
+		var bytes = this.priv.toByteArrayUnsigned();
+		// zero pad if private key is less than 32 bytes 
+		while (bytes.length < 32) bytes.unshift(0x00);
+		return bytes;
+	};
 
-			ECKey.prototype.toString = function (format) {
-				format = format || "";
-				if (format.toString().toLowerCase() == "base64" || format.toString().toLowerCase() == "b64") {
-					return this.getBitcoinBase64Format();
-				}
-				// Wallet Import Format
-				else if (format.toString().toLowerCase() == "wif") {
-					return this.getBitcoinWalletImportFormat();
-				}
-				else {
-					return this.getBitcoinHexFormat();
-				}
-			};
+	ECKey.prototype.toString = function (format) {
+		format = format || "";
+		if (format.toString().toLowerCase() == "base64" || format.toString().toLowerCase() == "b64") {
+			return this.getBitcoinBase64Format();
+		}
+		// Wallet Import Format
+		else if (format.toString().toLowerCase() == "wif") {
+			return this.getBitcoinWalletImportFormat();
+		}
+		else {
+			return this.getBitcoinHexFormat();
+		}
+	};
 
-			ECKey.prototype.sign = function (hash) {
-				return ECDSA.sign(hash, this.priv);
-			};
+	ECKey.prototype.sign = function (hash) {
+		return ECDSA.sign(hash, this.priv);
+	};
 
-			ECKey.prototype.verify = function (hash, sig) {
-				return ECDSA.verify(hash, sig, this.getPub());
-			};
+	ECKey.prototype.verify = function (hash, sig) {
+		return ECDSA.verify(hash, sig, this.getPub());
+	};
 
-			/**
-			* Parse a wallet import format private key contained in a string.
-			*/
-			ECKey.decodeWalletImportFormat = function (privStr) {
-				var bytes = Bitcoin.Base58.decode(privStr);
-				var hash = bytes.slice(0, 33);
-				var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), { asBytes: true });
-				if (checksum[0] != bytes[33] ||
+	/**
+	* Parse a wallet import format private key contained in a string.
+	*/
+	ECKey.decodeWalletImportFormat = function (privStr) {
+		var bytes = Bitcoin.Base58.decode(privStr);
+		var hash = bytes.slice(0, 33);
+		var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), { asBytes: true });
+		if (checksum[0] != bytes[33] ||
 					checksum[1] != bytes[34] ||
 					checksum[2] != bytes[35] ||
 					checksum[3] != bytes[36]) {
-					throw "Checksum validation failed!";
-				}
-				var version = hash.shift();
-				if (version != ECKey.privateKeyPrefix) {
-					throw "Version " + version + " not supported!";
-				}
-				return hash;
-			};
+			throw "Checksum validation failed!";
+		}
+		var version = hash.shift();
+		if (version != ECKey.privateKeyPrefix) {
+			throw "Version " + version + " not supported!";
+		}
+		return hash;
+	};
 
-			/**
-			* Parse a compressed wallet import format private key contained in a string.
-			*/
-			ECKey.decodeCompressedWalletImportFormat = function (privStr) {
-				var bytes = Bitcoin.Base58.decode(privStr);
-				var hash = bytes.slice(0, 34);
-				var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), { asBytes: true });
-				if (checksum[0] != bytes[34] ||
+	/**
+	* Parse a compressed wallet import format private key contained in a string.
+	*/
+	ECKey.decodeCompressedWalletImportFormat = function (privStr) {
+		var bytes = Bitcoin.Base58.decode(privStr);
+		var hash = bytes.slice(0, 34);
+		var checksum = Crypto.SHA256(Crypto.SHA256(hash, { asBytes: true }), { asBytes: true });
+		if (checksum[0] != bytes[34] ||
 					checksum[1] != bytes[35] ||
 					checksum[2] != bytes[36] ||
 					checksum[3] != bytes[37]) {
-					throw "Checksum validation failed!";
-				}
-				var version = hash.shift();
-				if (version != ECKey.privateKeyPrefix) {
-					throw "Version " + version + " not supported!";
-				}
-				hash.pop();
-				return hash;
-			};
+			throw "Checksum validation failed!";
+		}
+		var version = hash.shift();
+		if (version != ECKey.privateKeyPrefix) {
+			throw "Version " + version + " not supported!";
+		}
+		hash.pop();
+		return hash;
+	};
 
-			// 64 characters [0-9A-F]
-			ECKey.isHexFormat = function (key) {
-				key = key.toString();
-				return /^[A-Fa-f0-9]{64}$/.test(key);
-			};
+	// 64 characters [0-9A-F]
+	ECKey.isHexFormat = function (key) {
+		key = key.toString();
+		return /^[A-Fa-f0-9]{64}$/.test(key);
+	};
 
-			// 51 characters base58, always starts with a '5'
-			ECKey.isWalletImportFormat = function (key) {
-				key = key.toString();
-				return (ECKey.privateKeyPrefix == 0x80) ?
+	// 51 characters base58, always starts with a '5'
+	ECKey.isWalletImportFormat = function (key) {
+		key = key.toString();
+		return (ECKey.privateKeyPrefix == 0x80) ?
 							(/^5[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{50}$/.test(key)) :
 							(/^9[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{50}$/.test(key));
-			};
+	};
 
-			// 52 characters base58
-			ECKey.isCompressedWalletImportFormat = function (key) {
-				key = key.toString();
-				return (ECKey.privateKeyPrefix == 0x80) ?
+	// 52 characters base58
+	ECKey.isCompressedWalletImportFormat = function (key) {
+		key = key.toString();
+		return (ECKey.privateKeyPrefix == 0x80) ?
 							(/^[LK][123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(key)) :
 							(/^c[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{51}$/.test(key));
-			};
+	};
 
-			// 44 characters
-			ECKey.isBase64Format = function (key) {
-				key = key.toString();
-				return (/^[ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789=+\/]{44}$/.test(key));
-			};
+	// 44 characters
+	ECKey.isBase64Format = function (key) {
+		key = key.toString();
+		return (/^[ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789=+\/]{44}$/.test(key));
+	};
 
-			// 22, 26 or 30 characters, always starts with an 'S'
-			ECKey.isMiniFormat = function (key) {
-				key = key.toString();
-				var validChars22 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{21}$/.test(key);
-				var validChars26 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{25}$/.test(key);
-				var validChars30 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{29}$/.test(key);
-				var testBytes = Crypto.SHA256(key + "?", { asBytes: true });
+	// 22, 26 or 30 characters, always starts with an 'S'
+	ECKey.isMiniFormat = function (key) {
+		key = key.toString();
+		var validChars22 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{21}$/.test(key);
+		var validChars26 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{25}$/.test(key);
+		var validChars30 = /^S[123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz]{29}$/.test(key);
+		var testBytes = Crypto.SHA256(key + "?", { asBytes: true });
 
-				return ((testBytes[0] === 0x00 || testBytes[0] === 0x01) && (validChars22 || validChars26 || validChars30));
-			};
+		return ((testBytes[0] === 0x00 || testBytes[0] === 0x01) && (validChars22 || validChars26 || validChars30));
+	};
 
-			return ECKey;
-		})();
+	return ECKey;
+})();
 	</script>
-
 	<script type="text/javascript">
-		//https://raw.github.com/bitcoinjs/bitcoinjs-lib/09e8c6e184d6501a0c2c59d73ca64db5c0d3eb95/src/util.js
-		// Bitcoin utility functions
-		Bitcoin.Util = {
-			/**
-			* Cross-browser compatibility version of Array.isArray.
-			*/
-			isArray: Array.isArray || function (o) {
-				return Object.prototype.toString.call(o) === '[object Array]';
-			},
-			/**
-			* Create an array of a certain length filled with a specific value.
-			*/
-			makeFilledArray: function (len, val) {
-				var array = [];
-				var i = 0;
-				while (i < len) {
-					array[i++] = val;
-				}
-				return array;
-			},
-			/**
-			* Turn an integer into a "var_int".
-			*
-			* "var_int" is a variable length integer used by Bitcoin's binary format.
-			*
-			* Returns a byte array.
-			*/
-			numToVarInt: function (i) {
-				if (i < 0xfd) {
-					// unsigned char
-					return [i];
-				} else if (i <= 1 << 16) {
-					// unsigned short (LE)
-					return [0xfd, i >>> 8, i & 255];
-				} else if (i <= 1 << 32) {
-					// unsigned int (LE)
-					return [0xfe].concat(Crypto.util.wordsToBytes([i]));
-				} else {
-					// unsigned long long (LE)
-					return [0xff].concat(Crypto.util.wordsToBytes([i >>> 32, i]));
-				}
-			},
-			/**
-			* Parse a Bitcoin value byte array, returning a BigInteger.
-			*/
-			valueToBigInt: function (valueBuffer) {
-				if (valueBuffer instanceof BigInteger) return valueBuffer;
+//https://raw.github.com/bitcoinjs/bitcoinjs-lib/09e8c6e184d6501a0c2c59d73ca64db5c0d3eb95/src/util.js
+// Bitcoin utility functions
+Bitcoin.Util = {
+	/**
+	* Cross-browser compatibility version of Array.isArray.
+	*/
+	isArray: Array.isArray || function (o) {
+		return Object.prototype.toString.call(o) === '[object Array]';
+	},
+	/**
+	* Create an array of a certain length filled with a specific value.
+	*/
+	makeFilledArray: function (len, val) {
+		var array = [];
+		var i = 0;
+		while (i < len) {
+			array[i++] = val;
+		}
+		return array;
+	},
+	/**
+	* Turn an integer into a "var_int".
+	*
+	* "var_int" is a variable length integer used by Bitcoin's binary format.
+	*
+	* Returns a byte array.
+	*/
+	numToVarInt: function (i) {
+		if (i < 0xfd) {
+			// unsigned char
+			return [i];
+		} else if (i <= 1 << 16) {
+			// unsigned short (LE)
+			return [0xfd, i >>> 8, i & 255];
+		} else if (i <= 1 << 32) {
+			// unsigned int (LE)
+			return [0xfe].concat(Crypto.util.wordsToBytes([i]));
+		} else {
+			// unsigned long long (LE)
+			return [0xff].concat(Crypto.util.wordsToBytes([i >>> 32, i]));
+		}
+	},
+	/**
+	* Parse a Bitcoin value byte array, returning a BigInteger.
+	*/
+	valueToBigInt: function (valueBuffer) {
+		if (valueBuffer instanceof BigInteger) return valueBuffer;
 
-				// Prepend zero byte to prevent interpretation as negative integer
-				return BigInteger.fromByteArrayUnsigned(valueBuffer);
-			},
-			/**
-			* Format a Bitcoin value as a string.
-			*
-			* Takes a BigInteger or byte-array and returns that amount of Bitcoins in a
-			* nice standard formatting.
-			*
-			* Examples:
-			* 12.3555
-			* 0.1234
-			* 900.99998888
-			* 34.00
-			*/
-			formatValue: function (valueBuffer) {
-				var value = this.valueToBigInt(valueBuffer).toString();
-				var integerPart = value.length > 8 ? value.substr(0, value.length - 8) : '0';
-				var decimalPart = value.length > 8 ? value.substr(value.length - 8) : value;
-				while (decimalPart.length < 8) decimalPart = "0" + decimalPart;
-				decimalPart = decimalPart.replace(/0*$/, '');
-				while (decimalPart.length < 2) decimalPart += "0";
-				return integerPart + "." + decimalPart;
-			},
-			/**
-			* Parse a floating point string as a Bitcoin value.
-			*
-			* Keep in mind that parsing user input is messy. You should always display
-			* the parsed value back to the user to make sure we understood his input
-			* correctly.
-			*/
-			parseValue: function (valueString) {
-				// TODO: Detect other number formats (e.g. comma as decimal separator)
-				var valueComp = valueString.split('.');
-				var integralPart = valueComp[0];
-				var fractionalPart = valueComp[1] || "0";
-				while (fractionalPart.length < 8) fractionalPart += "0";
-				fractionalPart = fractionalPart.replace(/^0+/g, '');
-				var value = BigInteger.valueOf(parseInt(integralPart));
-				value = value.multiply(BigInteger.valueOf(100000000));
-				value = value.add(BigInteger.valueOf(parseInt(fractionalPart)));
-				return value;
-			},
-			/**
-			* Calculate RIPEMD160(SHA256(data)).
-			*
-			* Takes an arbitrary byte array as inputs and returns the hash as a byte
-			* array.
-			*/
-			sha256ripe160: function (data) {
-				return Crypto.RIPEMD160(Crypto.SHA256(data, { asBytes: true }), { asBytes: true });
+		// Prepend zero byte to prevent interpretation as negative integer
+		return BigInteger.fromByteArrayUnsigned(valueBuffer);
+	},
+	/**
+	* Format a Bitcoin value as a string.
+	*
+	* Takes a BigInteger or byte-array and returns that amount of Bitcoins in a
+	* nice standard formatting.
+	*
+	* Examples:
+	* 12.3555
+	* 0.1234
+	* 900.99998888
+	* 34.00
+	*/
+	formatValue: function (valueBuffer) {
+		var value = this.valueToBigInt(valueBuffer).toString();
+		var integerPart = value.length > 8 ? value.substr(0, value.length - 8) : '0';
+		var decimalPart = value.length > 8 ? value.substr(value.length - 8) : value;
+		while (decimalPart.length < 8) decimalPart = "0" + decimalPart;
+		decimalPart = decimalPart.replace(/0*$/, '');
+		while (decimalPart.length < 2) decimalPart += "0";
+		return integerPart + "." + decimalPart;
+	},
+	/**
+	* Parse a floating point string as a Bitcoin value.
+	*
+	* Keep in mind that parsing user input is messy. You should always display
+	* the parsed value back to the user to make sure we understood his input
+	* correctly.
+	*/
+	parseValue: function (valueString) {
+		// TODO: Detect other number formats (e.g. comma as decimal separator)
+		var valueComp = valueString.split('.');
+		var integralPart = valueComp[0];
+		var fractionalPart = valueComp[1] || "0";
+		while (fractionalPart.length < 8) fractionalPart += "0";
+		fractionalPart = fractionalPart.replace(/^0+/g, '');
+		var value = BigInteger.valueOf(parseInt(integralPart));
+		value = value.multiply(BigInteger.valueOf(100000000));
+		value = value.add(BigInteger.valueOf(parseInt(fractionalPart)));
+		return value;
+	},
+	/**
+	* Calculate RIPEMD160(SHA256(data)).
+	*
+	* Takes an arbitrary byte array as inputs and returns the hash as a byte
+	* array.
+	*/
+	sha256ripe160: function (data) {
+		return Crypto.RIPEMD160(Crypto.SHA256(data, { asBytes: true }), { asBytes: true });
+	},
+	// double sha256
+	dsha256: function (data) {
+		return Crypto.SHA256(Crypto.SHA256(data, { asBytes: true }), { asBytes: true });
+	}
+};
+	</script>
+	<script type="text/javascript">
+/*
+* Copyright (c) 2010-2011 Intalio Pte, All Rights Reserved
+* 
+* Permission is hereby granted, free of charge, to any person obtaining a copy
+* of this software and associated documentation files (the "Software"), to deal
+* in the Software without restriction, including without limitation the rights
+* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+* copies of the Software, and to permit persons to whom the Software is
+* furnished to do so, subject to the following conditions:
+* 
+* The above copyright notice and this permission notice shall be included in
+* all copies or substantial portions of the Software.
+* 
+* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+* THE SOFTWARE.
+*/
+// https://github.com/cheongwy/node-scrypt-js
+(function () {
+
+	var MAX_VALUE = 2147483647;
+	var workerUrl = null;
+
+	//function scrypt(byte[] passwd, byte[] salt, int N, int r, int p, int dkLen)
+	/*
+	* N = Cpu cost
+	* r = Memory cost
+	* p = parallelization cost
+	* 
+	*/
+	window.Crypto_scrypt = function (passwd, salt, N, r, p, dkLen, callback) {
+		if (N == 0 || (N & (N - 1)) != 0) throw Error("N must be > 0 and a power of 2");
+
+		if (N > MAX_VALUE / 128 / r) throw Error("Parameter N is too large");
+		if (r > MAX_VALUE / 128 / p) throw Error("Parameter r is too large");
+
+		var PBKDF2_opts = { iterations: 1, hasher: Crypto.SHA256, asBytes: true };
+
+		var B = Crypto.PBKDF2(passwd, salt, p * 128 * r, PBKDF2_opts);
+
+		try {
+			var i = 0;
+			var worksDone = 0;
+			var makeWorker = function () {
+				if (!workerUrl) {
+					var code = '(' + scryptCore.toString() + ')()';
+					var blob;
+					try {
+						blob = new Blob([code], { type: "text/javascript" });
+					} catch (e) {
+						window.BlobBuilder = window.BlobBuilder || window.WebKitBlobBuilder || window.MozBlobBuilder || window.MSBlobBuilder;
+						blob = new BlobBuilder();
+						blob.append(code);
+						blob = blob.getBlob("text/javascript");
+					}
+					workerUrl = URL.createObjectURL(blob);
+				}
+				var worker = new Worker(workerUrl);
+				worker.onmessage = function (event) {
+					var Bi = event.data[0], Bslice = event.data[1];
+					worksDone++;
+
+					if (i < p) {
+						worker.postMessage([N, r, p, B, i++]);
+					}
+
+					var length = Bslice.length, destPos = Bi * 128 * r, srcPos = 0;
+					while (length--) {
+						B[destPos++] = Bslice[srcPos++];
+					}
+
+					if (worksDone == p) {
+						callback(Crypto.PBKDF2(passwd, B, dkLen, PBKDF2_opts));
+					}
+				};
+				return worker;
+			};
+			var workers = [makeWorker(), makeWorker()];
+			workers[0].postMessage([N, r, p, B, i++]);
+			if (p > 1) {
+				workers[1].postMessage([N, r, p, B, i++]);
 			}
-		};
+		} catch (e) {
+			window.setTimeout(function () {
+				scryptCore();
+				callback(Crypto.PBKDF2(passwd, B, dkLen, PBKDF2_opts));
+			}, 0);
+		}
+
+		// using this function to enclose everything needed to create a worker (but also invokable directly for synchronous use)
+		function scryptCore() {
+			var XY = [], V = [];
+
+			if (typeof B === 'undefined') {
+				onmessage = function (event) {
+					var data = event.data;
+					var N = data[0], r = data[1], p = data[2], B = data[3], i = data[4];
+
+					var Bslice = [];
+					arraycopy32(B, i * 128 * r, Bslice, 0, 128 * r);
+					smix(Bslice, 0, r, N, V, XY);
+
+					postMessage([i, Bslice]);
+				};
+			} else {
+				for (var i = 0; i < p; i++) {
+					smix(B, i * 128 * r, r, N, V, XY);
+				}
+			}
+
+			function smix(B, Bi, r, N, V, XY) {
+				var Xi = 0;
+				var Yi = 128 * r;
+				var i;
+
+				arraycopy32(B, Bi, XY, Xi, Yi);
+
+				for (i = 0; i < N; i++) {
+					arraycopy32(XY, Xi, V, i * Yi, Yi);
+					blockmix_salsa8(XY, Xi, Yi, r);
+				}
+
+				for (i = 0; i < N; i++) {
+					var j = integerify(XY, Xi, r) & (N - 1);
+					blockxor(V, j * Yi, XY, Xi, Yi);
+					blockmix_salsa8(XY, Xi, Yi, r);
+				}
+
+				arraycopy32(XY, Xi, B, Bi, Yi);
+			}
+
+			function blockmix_salsa8(BY, Bi, Yi, r) {
+				var X = [];
+				var i;
+
+				arraycopy32(BY, Bi + (2 * r - 1) * 64, X, 0, 64);
+
+				for (i = 0; i < 2 * r; i++) {
+					blockxor(BY, i * 64, X, 0, 64);
+					salsa20_8(X);
+					arraycopy32(X, 0, BY, Yi + (i * 64), 64);
+				}
+
+				for (i = 0; i < r; i++) {
+					arraycopy32(BY, Yi + (i * 2) * 64, BY, Bi + (i * 64), 64);
+				}
+
+				for (i = 0; i < r; i++) {
+					arraycopy32(BY, Yi + (i * 2 + 1) * 64, BY, Bi + (i + r) * 64, 64);
+				}
+			}
+
+			function R(a, b) {
+				return (a << b) | (a >>> (32 - b));
+			}
+
+			function salsa20_8(B) {
+				var B32 = new Array(32);
+				var x = new Array(32);
+				var i;
+
+				for (i = 0; i < 16; i++) {
+					B32[i] = (B[i * 4 + 0] & 0xff) << 0;
+					B32[i] |= (B[i * 4 + 1] & 0xff) << 8;
+					B32[i] |= (B[i * 4 + 2] & 0xff) << 16;
+					B32[i] |= (B[i * 4 + 3] & 0xff) << 24;
+				}
+
+				arraycopy(B32, 0, x, 0, 16);
+
+				for (i = 8; i > 0; i -= 2) {
+					x[4] ^= R(x[0] + x[12], 7); x[8] ^= R(x[4] + x[0], 9);
+					x[12] ^= R(x[8] + x[4], 13); x[0] ^= R(x[12] + x[8], 18);
+					x[9] ^= R(x[5] + x[1], 7); x[13] ^= R(x[9] + x[5], 9);
+					x[1] ^= R(x[13] + x[9], 13); x[5] ^= R(x[1] + x[13], 18);
+					x[14] ^= R(x[10] + x[6], 7); x[2] ^= R(x[14] + x[10], 9);
+					x[6] ^= R(x[2] + x[14], 13); x[10] ^= R(x[6] + x[2], 18);
+					x[3] ^= R(x[15] + x[11], 7); x[7] ^= R(x[3] + x[15], 9);
+					x[11] ^= R(x[7] + x[3], 13); x[15] ^= R(x[11] + x[7], 18);
+					x[1] ^= R(x[0] + x[3], 7); x[2] ^= R(x[1] + x[0], 9);
+					x[3] ^= R(x[2] + x[1], 13); x[0] ^= R(x[3] + x[2], 18);
+					x[6] ^= R(x[5] + x[4], 7); x[7] ^= R(x[6] + x[5], 9);
+					x[4] ^= R(x[7] + x[6], 13); x[5] ^= R(x[4] + x[7], 18);
+					x[11] ^= R(x[10] + x[9], 7); x[8] ^= R(x[11] + x[10], 9);
+					x[9] ^= R(x[8] + x[11], 13); x[10] ^= R(x[9] + x[8], 18);
+					x[12] ^= R(x[15] + x[14], 7); x[13] ^= R(x[12] + x[15], 9);
+					x[14] ^= R(x[13] + x[12], 13); x[15] ^= R(x[14] + x[13], 18);
+				}
+
+				for (i = 0; i < 16; ++i) B32[i] = x[i] + B32[i];
+
+				for (i = 0; i < 16; i++) {
+					var bi = i * 4;
+					B[bi + 0] = (B32[i] >> 0 & 0xff);
+					B[bi + 1] = (B32[i] >> 8 & 0xff);
+					B[bi + 2] = (B32[i] >> 16 & 0xff);
+					B[bi + 3] = (B32[i] >> 24 & 0xff);
+				}
+			}
+
+			function blockxor(S, Si, D, Di, len) {
+				var i = len >> 6;
+				while (i--) {
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+					D[Di++] ^= S[Si++]; D[Di++] ^= S[Si++];
+				}
+			}
+
+			function integerify(B, bi, r) {
+				var n;
+
+				bi += (2 * r - 1) * 64;
+
+				n = (B[bi + 0] & 0xff) << 0;
+				n |= (B[bi + 1] & 0xff) << 8;
+				n |= (B[bi + 2] & 0xff) << 16;
+				n |= (B[bi + 3] & 0xff) << 24;
+
+				return n;
+			}
+
+			function arraycopy(src, srcPos, dest, destPos, length) {
+				while (length--) {
+					dest[destPos++] = src[srcPos++];
+				}
+			}
+
+			function arraycopy32(src, srcPos, dest, destPos, length) {
+				var i = length >> 5;
+				while (i--) {
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+					dest[destPos++] = src[srcPos++]; dest[destPos++] = src[srcPos++];
+				}
+			}
+		} // scryptCore
+	}; // window.Crypto_scrypt
+})();
 	</script>
 
 
@@ -5969,10 +6259,20 @@
 
 
 	<style type="text/css">
-		.more { background: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABEAAAARCAYAAAA7bUf6AAAABHNCSVQICAgIfAhkiAAAAAlwSFlzAAALEgAACxIB0t1+/AAAABx0RVh0U29mdHdhcmUAQWRvYmUgRmlyZXdvcmtzIENTNXG14zYAAAAWdEVYdENyZWF0aW9uIFRpbWUAMDEvMDIvMTLltnQyAAAB1UlEQVQ4jYWTS04bQRCGv3q0x8gMYJCwknCGLDgLVwiH4grhLFaUXdhkQ0A8pBg/FOLpnmbhMYzxRKlNS1Vdf/31V5XknGnb+eXJCBjzbzu9OLu+azu845Opysej4wHmshF4uJ2TUrb3CV0gIBAKRboC5C2vdkDE9fdty6/xDegvXz+NgDbFUejZ+PjDgExmtpxS9vYwMe5u5iyX8RRoa5Ic+C4qx9KUN1MGu4E618yqJ5axAp44KA7ZL3eYzp/HKdVIw7WK8d6BuDvcod9TQlBEIOXEdPlElSoUJabIIs4Z7h9yNDwgqOMayLXw7epHVIBggrsgspZPUBQyiCgugRQji7TAVDF1XB2TlQoOYCqovkmpopS9fcoiM3ue0rOCYf8IU8NklWxiiOQ3EPXtWagIqo6KYWYEc4IGvMViA6RrnCJKVS9B8ypRHG1YKNa0Ur+C+MPt/I2BKWVZUO4FgvQ47PcptEDF+T2Z8TiZUMWIyGtpd+Bze5VTSqP57O/4YG+AN/RXbSiPkwmL5z/be/L+mM4vT2JKeUW7EXD1erMz/Lo4u77f0K9DDhdA1XG11jh9vWBb99Z9gAg5QZ2hzpmUa0RSW4f/gqSY0s3Vz+tufEjvHS8Tg6BXC7qVbQAAAABJRU5ErkJggg==)
-					no-repeat left center; width: 17px; height: 17px; display: inline-block; float: right; }
-		.less { background: url(data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABEAAAARCAYAAAA7bUf6AAAABHNCSVQICAgIfAhkiAAAAAlwSFlzAAAK6wAACusBgosNWgAAABx0RVh0U29mdHdhcmUAQWRvYmUgRmlyZXdvcmtzIENTNXG14zYAAAAWdEVYdENyZWF0aW9uIFRpbWUAMDEvMDIvMTLltnQyAAABuklEQVQ4ja2US25TQRBFT336OSEY5ESyBfEakNiLt0AW5S2QvQQxAiZIYBwSz/yByH7dxcB2bPMME+hJS/W5fetWVUtE8K/HfzdcXfdfqsr4onuGuRz4Jrdzcg6Gg9HfQYAxAqmlSMMlQJO5/oliE4AtQLcR++btZQ+wPVsvVXbTfXFGEMyWU9rVM0yMu/Gc5bJ+DdztxWcH3otKVzbPmyq5LnwfzSgEBMxlhqJEBFWVKKUgG66rur53oH7aOeWkUlJSRCBHZracssorlLXttHpCpzonaYukjmsiivDu08daAZIJ7oLIVg9BUQgQUVwSua5Z5AWmiqnj6pisVXAAU0F1J6WK0q6e024Fs4cplbXonFxgapisk00MkdiBqDd7oSKoOiqGmZHMSZrwPRYHIMfaKaKsyhI01oni6IaFYptSyiOIT27nOwaq5FyQrUAIC/nBhK+UErRSos55z4878CrneJyTnHOvquymf3mOb+hvy/jw+QuLh5/NORkORvsGrq77dc6xpr0RcH07y3oF8G04GN0f6HdEDhdA1XG1vXb6dsAa+3Z8AREiQwkoEeQoiBzocHDkf/wnvwC5IpRVsUDNUgAAAABJRU5ErkJggg==)
-					no-repeat left center; width: 17px; height: 17px; display: inline-block; float: right; }
+			
+		/*	import ubuntu mono bold as our font for display public & private keys.
+			NOTE: This font has been stripped down such that it only includes characters A-Z, a-Z, and 0-9 */
+		@font-face {
+			font-family: 'ubuntu_mono_bold';
+			src: url('images/ubuntumono-b-webfont.eot');
+			src: url('images/ubuntumono-b-webfont.eot?#iefix') format('embedded-opentype'),
+				 url('images/ubuntumono-b-webfont.woff') format('woff'),
+				 url('images/ubuntumono-b-webfont.ttf') format('truetype'),
+				 url('images/ubuntumono-b-webfont.svg#ubuntu_monobold') format('svg');
+			font-weight: bold;
+			font-style: normal;
+		}
+		
 		.right { text-align: right; }
 		.walletarea { display: none; border-top: 2px solid #f7931a; }
 		.keyarea { font-family: Courier New; height: 110px; text-align: left; position: relative; padding: 5px; }
@@ -5996,7 +6296,7 @@
 		
 		#main { position: relative; margin: 0px auto; width: 1010px; color: #444; } /* removed text-align: center; */
 		#logoback {  background-image:url(images/logo.png); background-position: top left; background-repeat: no-repeat; }
-		#generate { font-family: Courier New; height: 158px; text-align: left; position: relative; padding: 5px; border: 2px solid #f7931a; }
+		#generate { font-family: Courier New; height: 158px; text-align: left; position: relative; padding: 5px; border: none; }
 		#generate span { padding: 5px 5px 0 5px; }
 		#menu { visibility: hidden; font-size: 90%; padding: 0 12px;}
 		
@@ -6019,7 +6319,10 @@
 		
 		#paperarea { min-height: 120px; display: none; }
 		#paperarea .keyarea { border: 2px solid #f7931a; border-top: 0; }
-		#paperarea .keyarea.art { display: block; height: auto; border: 0; font-family: Ubuntu, Arial; padding: 0; margin: 0; }
+		
+		/* alphanum for public-private keys*/
+		#paperarea .keyarea.art { display: block; height: auto; border: 0; font-family: ubuntu_mono_bold, Arial, Helvetica, sans-serif; padding: 0; margin: 0; font-size: 13px;}
+		
 		#paperarea .artwallet .papersvg { width: 1010px; height: 331px; border: 0; margin: 0; padding: 0; left: 0; }
 		#paperarea .artwallet .qrcode_public { top: 120px; left: 41px; z-index: 100; margin: 0; float: none; display: block; position: absolute; background-color: #FFFFFF; 
 		                                       padding: 5px 5px 2px 5px; } 
@@ -6027,8 +6330,8 @@
 		                                        padding: 5px 5px 2px 5px; }
 		#paperarea .artwallet .btcaddress  
 		{
-		    position: absolute; top: 275px; left: 40px; z-index: 100; font-size: 11px; background-color: transparent;
-		    font-weight:bold; color: #1739ad; margin: 0;
+		    position: absolute; top: 275px; left: 40px; z-index: 100; background-color: transparent;
+		    color: #1739ad; margin: 0;
 				-webkit-transform-origin:top left; 
 				/* -webkit-transform:rotate(-90deg); */
 				-moz-transform-origin:top left;    
@@ -6043,8 +6346,8 @@
 
 		#paperarea .artwallet .dupbtcaddress  
 		{
-		    position: absolute; top: 45px; left: 40px; z-index: 100; font-size: 11px; background-color: transparent;
-		    font-weight:bold; color: #1739ad; margin: 0;
+		    position: absolute; top: 45px; left: 40px; z-index: 100; background-color: transparent;
+		    color: #1739ad; margin: 0;
 				/* -webkit-transform-origin:top left; */
 				-webkit-transform:rotate(-180deg); 
 				/* -moz-transform-origin:top left; */   
@@ -6059,8 +6362,8 @@
 
 		#paperarea .artwallet .btcprivwif  
 		{
-		    position: absolute; top: 245px; left: 610px; z-index: 100; font-size: 11px; background-color: transparent;
-		    font-weight:bold; color: #000000; margin: 0;  
+		    position: absolute; top: 245px; left: 610px; z-index: 100; background-color: transparent;
+		    color: #000000; margin: 0;  
 				-webkit-transform-origin:top left; 
 				/*-webkit-transform:rotate(-90deg);*/
 				-moz-transform-origin:top left;    
@@ -6075,8 +6378,8 @@
 
 		#paperarea .artwallet .dupbtcprivwif  
 		{
-		    position: absolute; top: 75px; left: 610px; z-index: 100; font-size: 11px; background-color: transparent;
-		    font-weight:bold; color: #000000; margin: 0;  
+		    position: absolute; top: 75px; left: 610px; z-index: 100; background-color: transparent;
+		    color: #000000; margin: 0;  
 				/* -webkit-transform-origin:top left; */ 
 				-webkit-transform:rotate(-180deg);
 				/* -moz-transform-origin:top left; */   
@@ -6089,46 +6392,47 @@
 				transform:rotate(-180deg);
 		}
 
-		.nicerButton {
-			-moz-box-shadow:inset 0px 1px 0px 0px #fce2c1;
-			-webkit-box-shadow:inset 0px 1px 0px 0px #fce2c1;
-			box-shadow:inset 0px 1px 0px 0px #fce2c1;
-			background:-webkit-gradient( linear, left top, left bottom, color-stop(0.05, #ffc477), color-stop(1, #fb9e25) );
-			background:-moz-linear-gradient( center top, #ffc477 5%, #fb9e25 100% );
-			filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#ffc477', endColorstr='#fb9e25');
-			background-color:#ffc477;
-			-webkit-border-top-left-radius:20px;
-			-moz-border-radius-topleft:20px;
-			border-top-left-radius:20px;
-			-webkit-border-top-right-radius:20px;
-			-moz-border-radius-topright:20px;
-			border-top-right-radius:20px;
-			-webkit-border-bottom-right-radius:20px;
-			-moz-border-radius-bottomright:20px;
-			border-bottom-right-radius:20px;
-			-webkit-border-bottom-left-radius:20px;
-			-moz-border-radius-bottomleft:20px;
-			border-bottom-left-radius:20px;
+		.nicerButton { /* thanks http://www.cssbuttongenerator.com */
+			-moz-box-shadow:inset 0px 1px 0px 0px #c1ed9c;
+			-webkit-box-shadow:inset 0px 1px 0px 0px #c1ed9c;
+			box-shadow:inset 0px 1px 0px 0px #c1ed9c;
+			background:-webkit-gradient( linear, left top, left bottom, color-stop(0.05, #9dce2c), color-stop(1, #8cb82b) );
+			background:-moz-linear-gradient( center top, #9dce2c 5%, #8cb82b 100% );
+			filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#9dce2c', endColorstr='#8cb82b');
+			background-color:#9dce2c;
+			-webkit-border-top-left-radius:12px;
+			-moz-border-radius-topleft:12px;
+			border-top-left-radius:12px;
+			-webkit-border-top-right-radius:12px;
+			-moz-border-radius-topright:12px;
+			border-top-right-radius:12px;
+			-webkit-border-bottom-right-radius:12px;
+			-moz-border-radius-bottomright:12px;
+			border-bottom-right-radius:12px;
+			-webkit-border-bottom-left-radius:12px;
+			-moz-border-radius-bottomleft:12px;
+			border-bottom-left-radius:12px;
 			text-indent:0;
-			border:1px solid #eeb44f;
+			border:1px solid #83c41a;
 			display:inline-block;
 			color:#ffffff !important;
 			font-family:Arial;
-			font-size:13px;
+			font-size:14px;
 			font-weight:bold;
 			font-style:normal;
-			height:40px;
-			line-height:40px;
-			width:200px;
-			text-decoration:none !important;
+			height:35px;
+			line-height:35px;
+			width:189px;
+			text-decoration:none;
 			text-align:center;
-			text-shadow:1px 1px 0px #cc9f52;
+			text-shadow:1px 1px 0px #689324;
 		}
 		.nicerButton:hover {
-			background:-webkit-gradient( linear, left top, left bottom, color-stop(0.05, #fb9e25), color-stop(1, #ffc477) );
-			background:-moz-linear-gradient( center top, #fb9e25 5%, #ffc477 100% );
-			filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#fb9e25', endColorstr='#ffc477');
-			background-color:#fb9e25;
+		  background:-webkit-gradient( linear, left top, left bottom, color-stop(0.05, #8cb82b), color-stop(1, #9dce2c) );
+		  background:-moz-linear-gradient( center top, #8cb82b 5%, #9dce2c 100% );
+		  filter:progid:DXImageTransform.Microsoft.gradient(startColorstr='#8cb82b', endColorstr='#9dce2c');
+		  background-color:#8cb82b;
+		  text-decoration: none;
 		}.nicerButton:active {
 			position:relative;
 			top:1px;
@@ -6157,7 +6461,7 @@
 		  -webkit-animation: blink 0.5s infinite linear alternate;
 		  -webkit-font-smoothing: antialiased;
 		}
-		#generatelabelmovemouse { margin: 30px 150px; padding: 30px; font-weight: bold; background-color: #EBFDBF; text-align: center; }
+		#generatelabelmovemouse { margin: 30px 150px; padding: 30px; font-weight: bold; text-align: center; -webkit-border-radius: 8px;-moz-border-radius: 8px;border-radius: 8px;background-color:#F0FED0;-webkit-box-shadow: #B3B3B3 1px 1px 1px;-moz-box-shadow: #B3B3B3 1px 1px 1px; box-shadow: #B3B3B3 1px 1px 1px; }
 		#generatelabelbitcoinaddress { text-align: center;}
 		
 		@media screen 	
@@ -6207,9 +6511,11 @@
 			.footer .copyright { font-size: 75%; clear: both; padding: 5px 0; }
 			.footer .copyright span { padding: 10px 10px; }
 
-			#siginfo { margin: 10px 200px; border: 1px solid #666; padding: 10px; background-color: #999; color: #FFF;}
+			#siginfo { margin: 10px 200px; border: 1px solid #666; padding: 10px; background-color: #999; color: #FFF; z-index: 10000;}
 			#siginfo a, #siginfo a:visited { color: #EFFED3;}
 			#siginfo .closeme { float: right; padding: 0 0 30px 20px; margin: 0;}
+			
+			#supplyKeys { float: left; background-color: #EEFED0; border: 1px solid #CCCCCC; padding: 8px; }
 		}		
 
 		@media print
@@ -6238,8 +6544,8 @@
               <span><a href="?culture=fr" id="culturefr">Français</a></span> -->
               &nbsp;
           	</div>
-			<div id="tagline">Open Source Client-Side JavaScript Bitcoin Wallet Generator <span>Updated September 5, 2013</span></div>
-			<div id="tagsite">For help &amp; security tips, visit <a href="https://bitcoinpaperwallet.com">bitcoinpaperwallet.com</a></div>
+			<div id="tagline">Open Source JavaScript Bitcoin Wallet Generator <span>Updated October 1, 2013</span></div>
+			<div id="tagsite">For help, security tips, or wallet supplies visit <a href="https://bitcoinpaperwallet.com">bitcoinpaperwallet.com</a></div>
             <div id="tagwarning"></div>
         
 		<div class="menu" id="menu">
@@ -6277,10 +6583,12 @@
 				<div class="instructionsarea">
 					<div class="notes">
 						<h1><span id="instructions0">Welcome! Let's print out a beautiful and secure wallet for your bitcoins.</span></h1>
-
+						                        
 						<span id="instructions1"><em>Here's an overview of what will happen, step by step.</em></span>
 						<br /><br />
 
+                        <img src="images/finished-sample-sealed.jpg" width="400" height="203" alt="Sealed Wallet" style="float: right; margin: 0 0 20px 20px;">
+
 						<span id="instructions3"><b>Step 1: Calibrate Printer</b><br />
                         Before printing out a wallet you'll need to "calibrate" your printer for <b>zoom</b> and <b>horizontal shift</b> to accommodate your particular browser / printer combination. Without proper callibration, your wallet will end up the wrong size or with a misaligned reverse side.</span>
 						<br /><br />
@@ -6291,7 +6599,7 @@
                         Then you will put the same page back in your printer (but upside down) to print out the back side of your wallet. This isn't just for good looks: the back side design includes additional tamper-resistant safeguards.</span>
 						<br /><br />	
 						<span id="instructions6"><b>Step 4: Cut, Fold, Seal &amp; Fund</b><br />
-                        Find your scissors! Time to cut out your wallet, fold it, and seal it  with opaque (light-blocking) tape&mdash;or better yet <a href="https://bitcoinpaperwallet.com/#purchase" target="_blank">tamper-evident holographic tape</a>.) Now you're ready to transfer bitcoins from your online holdings to your new wallet.</span>
+                        Find your scissors! Time to cut out your wallet, fold it, and seal it  with opaque (light-blocking) tape&mdash;or better yet <a href="https://bitcoinpaperwallet.com/#purchase" target="_blank"><strong>tamper-evident holographic tape with serial numbers</strong></a>.) Now you're ready to transfer bitcoins from your online holdings to your new wallet.</span>
 						<br /><br />	
 						<span id="instructions2"><a href="http://www.youtube.com/watch?v=a47rrYBWjWQ" target="_blank" class="nicerButton" style="width: 400px;">90 second video demonstration on YouTube &raquo;</a></span>
                                                 
@@ -6343,7 +6651,20 @@
                     	<span><label id="paperlabeladdressesperpage">Addresses per page:</label> <input type="text" id="paperlimitperpage" /></span>
 						<span><label id="paperlabeladdressestogenerate">Addresses to generate:</label> <input type="text" id="paperlimit" /></span>
                     </div>
-					<span><input type="button" id="papergenerate" value="Generate a new wallet" onClick="ninja.wallets.paperwallet.build(document.getElementById('paperlimit').value * 1, document.getElementById('paperlimitperpage').value * 1, !document.getElementById('paperart').checked); printCounter=0;" /></span>
+                    
+                    <div id="keyButtons" style="display: block; float: left;">
+                    <input type="button" id="papergenerate" value="Random-generate new keys" onClick="ninja.wallets.paperwallet.build(document.getElementById('paperlimit').value * 1, document.getElementById('paperlimitperpage').value * 1, !document.getElementById('paperart').checked); printCounter=0;" />
+
+                    <input type="button" id="papergenerate" value="Supply my own key or vanity address..." onClick="document.getElementById('keyButtons').style.display='none'; document.getElementById('supplyKeys').style.display='block';" />
+                    </div>
+                    
+                    <div id="supplyKeys" style="display: none;">
+                    <p style="padding: 0; margin: 0;"><input placeholder="Paste your PRIVATE key here" id="suppliedPrivateKey" name="suppliedPrivateKey" size="75" spellcheck="false" style="font-family: ubuntu_mono_bold, 'Courier New', Courier, monospace;" />&nbsp;<input type="button" id="papergenerate" value="Test &amp; Apply &raquo;" onClick="testAndApplyVanityKey();" />
+                    </p>
+                    <p style="margin: 0; padding:0;"><a href="#" style="font-size: 11px;" onClick="document.getElementById('keyButtons').style.display='block'; document.getElementById('supplyKeys').style.display='none';">&laquo; Back</a></p>
+                    </div>
+                    
+                    
 					<span class="print">
                     <a href="#" class="nicerButton" onClick="doPrint('generate');">Print Wallet Front</a>
                     </span>
@@ -6432,6 +6753,21 @@
 				</div>
 			</div>
 			<div class="authorpgp">
+            
+                <div id="siginfo" style="display: none; position: absolute; top: -300px;">
+                  <p class="closeme"><a href="#" onClick="document.getElementById('siginfo').style.display='none'; return(false);">X</a></p>
+  
+                    After downloading the <a href="https://github.com/cantonbecker/bitcoinpaperwallet" target="_blank">ZIP package</a> for this generator, you should find a file named <b>generate-wallet.html.sig</b> 
+                    which you can use to:
+                    <ol><li> verify that <strong>generate-wallet.html</strong> hasn't been tampered with, and</li>
+                    <li>get proof that it really was authored by Canton Becker (canton@gmail.com) whose public key and fingerprint can be confirmed at <a href="http://cantonbecker.com">cantonbecker.com</a>, bitcointalk.org, etc.</li>
+                    </ol>
+                    For example, if you have GPG installed, just open the terminal, change directory (cd) to where this file lives, and type:<br />
+                    <code>gpg --verify --with-fingerprint generate-wallet.html.sig generate-wallet.html</code>
+                   <br /><br />And then verify the signature's fingerprint against Canton Becker's <a href="http://cantonbecker.com">published PGP/GPG fingerprint</a>.<br /><br />
+                  <a href="http://www.google.com/search?q=how+to+verify+PGP+%22.sig%22+signature+on+file">Learn how to verify a PGP-signed file &raquo;</a>
+                </div>
+
             	<span class="item"><b>Security Details</b></span>
                 <span class="item" style="font-size: 75%;"><a href="https://bitcoinpaperwallet.com/#security" target="_blank">For extra security</a>, do not run this generator directly from the bitcoinpaperwallet.com website.<br />
                 Download the generator and run the HTML as a local file in your browser instead.</span>
@@ -6441,21 +6777,6 @@
 
 				<span class="item" id="footerlabelsig" style="font-size: 75%;"><a href="#" onClick="document.getElementById('siginfo').style.display='block'; return(false);">Validate PGP/GPG signature</a></span>
                 
-                <div id="siginfo" style="display: none;">
-                  <p class="closeme"><a href="#" onClick="document.getElementById('siginfo').style.display='none'; return(false);">X</a></p>
-  
-                    After downloading the ZIP package for this generator, you should find a file named <b>generate-wallet.html.sig</b> 
-                    which you can use to:
-                    <ol><li> verify that <strong>generate-wallet.html</strong> hasn't been tampered with, and</li>
-                    <li>get proof that it really was authored by Canton Becker (canton@gmail.com) whose public key was published in May 2013.</li>
-                    </ol>
-                    For example, if you have GPG installed, you can type:<br />
-                    <code>gpg --verify generate-wallet.html.sig generate-wallet.html</code>
-                   <br /><br />
-                  <a href="http://www.google.com/search?q=how+to+verify+PGP+%22.sig%22+signature+on+file">Learn how to verify a PGP-signed file &raquo;</a>
-                </div>
-
-                
 			</div>
 			<div class="copyright">
 				<span id="footerlabelcopyright1">&copy; Copyright 2013 Canton Becker (<a href="mailto:canton@gmail.com">canton@gmail.com</a>) and Pointbiz/bitaddress.org</span>
@@ -7555,9 +7876,9 @@
 
 	<script type="text/javascript">
 	
-		/****************************************************
-		 Brand new JS functions added for bitcionpaperwallet 
-		 ****************************************************/
+		/********************************************************
+		 Brand new JS functions added for bitcoinpaperwallet.com
+		 ********************************************************/
 	
     	var inlineMediaStyle = null;
 
@@ -7609,12 +7930,25 @@
 			if (myContext == 'generate') {
 				window.printCounter ++;
 				if (window.printCounter == 2) {
-					alert (" *** WARNING *** WARNING *** WARNING *** \n\nYou are about to print a second wallet with the same set of keys. \n\nUnless you intended to make a backup wallet, cancel this print job and click the 'Generate a new wallet' button first.");
+					alert (" *** WARNING *** WARNING *** WARNING *** \n\nYou are about to print a second wallet with the same set of keys. \n\nUnless you intended to make a backup wallet, cancel this print job and generate a fresh set of keys.");
 				}
 			}
 			window.print();	
 		}
 		
+		function testAndApplyVanityKey() { /* Verify that a self-entered key is valid, and compute the corresponding public address, render the wallet. */
+			var suppliedKey = document.getElementById('suppliedPrivateKey').value;
+			suppliedKey = suppliedKey.trim(); // in case any spaces or whitespace got pasted in
+			document.getElementById('suppliedPrivateKey').value = suppliedKey;
+			if (!ninja.privateKey.isPrivateKey(suppliedKey)) {
+				alert ('*** INVALID KEY! ***\r\rThis should be the private "WIF" Wallet Import Format key -- not the public key (or "Vanity Key") itself. These always start with the number 5 and look something like this:\r\r5HuzK5hG43U7v53R7REt4Eu33BsVfhm86PA3Q6iANs13kwqUgSx');
+			} else {			
+				var computedPublicAddress = new Bitcoin.ECKey(suppliedKey).getBitcoinAddress();
+				alert ('OK! This is a valid private key whose public address is:\r\r'+computedPublicAddress);
+				ninja.wallets.paperwallet.showArtisticWallet(1, computedPublicAddress, suppliedKey);
+				window.printCounter = 0;
+			}
+		}
 
 	</script>
 
diff --git a/generate-wallet.html.sig b/generate-wallet.html.sig
index c881485..332d912 100644
--- a/generate-wallet.html.sig
+++ b/generate-wallet.html.sig
@@ -1,11 +1,11 @@
 -----BEGIN PGP SIGNATURE-----
 Comment: GPGTools - http://gpgtools.org
 
-iQEcBAABAgAGBQJSKMgdAAoJEJJ3rXE24dm2oKoH/Rq+RgpDtbZWLdZVKAzPbxlt
-K8x3scTqgbZKHEA4iT7n/bFN8XMm9MD4pCoJ6Jb32NoCFnOLuPvAhvC+ETS2vpQ1
-3w5r+lkbgNsJ7rM5+tgXUjoniClmJ4sLTnAUT3T2dt3elwnG7bjgMiww1OESCKtw
-9Gpgc/15GuKhKfx3KdeSULNW+XtUFYVOtepQfW2F1cEXtG89/XrSkUy+VJABsQLK
-E3FJoTAzQ7zcCvq1FS0BOM/lG5R1ECBQBl7AXtnMVBKAEH38Em98ybPHAzjUsEPw
-G9tMV1d+MW2HPK3JnceMJRfEPBEUJGTw7D1WmiisHLf7GTJ81EUDVZwVSb4rNZc=
-=LxBv
+iQEcBAABAgAGBQJSUbAUAAoJEJJ3rXE24dm2TA4H/1uWo42AgJWbcPGfuoh/gd2E
+d/O2jmbw1lA3D+OHLyqVQFAs+PSIT3u/DS2q/sOMbuoNJKwEU8PE9miyEI0X3yhc
+FuAhJiO6KBtpA2Yp6xqgzPrboZ/wLmdhnzxsZojIfVh+XQh5cTDrMMjq5p2UaZUj
+2HUk41zJ/HrmrlG+eIlHm8vZL1iTgWurR+/zHu0ieDx+3NcEdOHyjsPXhlTLmv7y
+sxk+mYFOebMcuT2lWqwAcO4fMmpQW1aQ15/HsqA5CEbr0uS56u/jRfOj6avWDiSu
+GKZqjqdWHikDqWz5jXHdE2pNJ2HJuphHE0MVyseL6FYOWVAkyPAgOeyKNZG3ktY=
+=PeD6
 -----END PGP SIGNATURE-----
diff --git a/images/logo.png b/images/logo.png
index b8bac9e..5db963e 100644
Binary files a/images/logo.png and b/images/logo.png differ
diff --git a/images/ubuntumono-b-webfont.eot b/images/ubuntumono-b-webfont.eot
new file mode 100755
index 0000000..a73b849
Binary files /dev/null and b/images/ubuntumono-b-webfont.eot differ
diff --git a/images/ubuntumono-b-webfont.svg b/images/ubuntumono-b-webfont.svg
new file mode 100755
index 0000000..6b9a469
--- /dev/null
+++ b/images/ubuntumono-b-webfont.svg
@@ -0,0 +1,91 @@
+<?xml version="1.0" standalone="no"?>
+<!DOCTYPE svg PUBLIC "-//W3C//DTD SVG 1.1//EN" "http://www.w3.org/Graphics/SVG/1.1/DTD/svg11.dtd" >
+<svg xmlns="http://www.w3.org/2000/svg">
+<metadata></metadata>
+<defs>
+<font id="ubuntu_monobold" horiz-adv-x="1024" >
+<font-face units-per-em="2048" ascent="1638" descent="-410" />
+<missing-glyph horiz-adv-x="500" />
+<glyph unicode="&#xd;" />
+<glyph />
+<glyph />
+<glyph unicode=" " />
+<glyph unicode="0" d="M72 637q0 332 114.5 495.5t325.5 163.5q215 0 327.5 -162.5t112.5 -496.5q0 -336 -112.5 -500t-327.5 -164t-327.5 164t-112.5 500zM299 637q0 -219 55.5 -333t157.5 -114q104 0 158.5 114t54.5 333q0 217 -54.5 330.5t-158.5 113.5q-102 0 -157.5 -113.5t-55.5 -330.5z M399 657q0 55 31 96.5t84 41.5q49 0 81 -41.5t32 -96.5t-32 -95t-81 -40q-53 0 -84 40t-31 95z" />
+<glyph unicode="1" d="M98 1004q49 18 106.5 46.5t115 63.5t108.5 74t88 80h172v-1059h252v-209h-770v209h266v709q-57 -41 -131 -73t-125 -50z" />
+<glyph unicode="2" d="M88 1128q82 86 189.5 127t214.5 41q78 0 149.5 -22.5t126.5 -67.5t88 -113.5t33 -158.5q0 -66 -24.5 -126t-65.5 -117.5t-92.5 -111t-104.5 -102.5q-27 -25 -61.5 -58.5t-65.5 -69.5t-52.5 -72.5t-21.5 -67.5h545v-209h-827q-6 20 -5 51t1 43q0 102 37.5 188.5t96 159 t125 135t125 120t96.5 110.5t38 108q0 78 -47 120t-119 42q-59 0 -125 -28.5t-129 -96.5z" />
+<glyph unicode="3" d="M84 43l49 211q47 -20 122 -43t179 -23q129 0 181.5 55.5t52.5 137.5q0 100 -80 140t-203 40h-78v209h94q39 0 78 8t70 26.5t50 49.5t19 78q0 70 -41.5 109.5t-115.5 39.5q-72 0 -142.5 -23.5t-121.5 -58.5l-91 185q55 37 146.5 74.5t206.5 37.5q106 0 185 -26.5 t130 -74.5t75.5 -113.5t24.5 -141.5t-43 -145.5t-114 -106.5q98 -41 152.5 -121t54.5 -190q0 -88 -29 -162t-88 -128t-151.5 -84t-219.5 -30q-47 0 -99 7.5t-100.5 17.5t-89.5 22.5t-63 22.5z" />
+<glyph unicode="4" d="M55 299v184q39 80 100.5 181.5t135.5 208t155.5 210t163.5 185.5h226v-762h137v-207h-137v-299h-252v299h-529zM297 506h287v446q-37 -47 -76 -100t-77 -111.5t-72.5 -118t-61.5 -116.5z" />
+<glyph unicode="5" d="M72 39l51 209q45 -23 114.5 -41.5t174.5 -18.5q74 0 122 16.5t75.5 42t37.5 58.5t10 68q0 53 -17 97t-69.5 76t-148.5 49t-252 17q20 172 32.5 337t18.5 319h647v-209h-436q-4 -66 -10 -137.5t-10 -116.5q254 -16 378.5 -123t124.5 -299q0 -88 -30.5 -163t-94 -130 t-157.5 -86t-219 -31q-49 0 -100.5 6.5t-98.5 15.5t-85 21.5t-58 22.5z" />
+<glyph unicode="6" d="M94 518q0 184 54.5 325.5t154.5 238t241.5 145.5t313.5 49l14 -215q-82 -2 -159.5 -16.5t-143 -48t-113.5 -87t-71 -133.5q39 16 75.5 25.5t65.5 9.5q111 0 188 -33t126 -88t70.5 -129t21.5 -155q0 -74 -23.5 -150t-73 -139.5t-125 -103.5t-180.5 -40 q-213 0 -324.5 132.5t-111.5 412.5zM342 496q0 -59 8 -113.5t28.5 -97.5t56.5 -69t89 -26q43 0 74 20.5t50.5 51.5t28.5 68t9 71q0 96 -43 148.5t-149 52.5q-39 0 -80 -8t-68 -23q-2 -18 -3 -36.5t-1 -38.5z" />
+<glyph unicode="7" d="M100 1059v209h828v-191q-55 -63 -121 -178t-124 -260t-102 -310t-55 -329h-256q6 131 43 277.5t89.5 290t114 271.5t116.5 220h-533z" />
+<glyph unicode="8" d="M78 317q0 96 45 181.5t141 150.5q-90 61 -122.5 131t-32.5 148q0 61 21.5 127.5t68.5 120t124.5 88t192.5 34.5q182 0 289.5 -89.5t107.5 -241.5q0 -88 -43 -173t-135 -143q117 -68 165 -147.5t48 -175.5q0 -61 -23.5 -125t-75.5 -114t-136 -83t-207 -33q-96 0 -175 23.5 t-135.5 68t-87 109t-30.5 143.5zM313 348q0 -82 58.5 -124t138.5 -42q92 0 146.5 44.5t54.5 105.5q0 41 -15.5 71.5t-49.5 56t-87 51.5t-127 54q-57 -47 -88 -105.5t-31 -111.5zM346 944q0 -72 47 -117t166 -94q63 47 90 103.5t27 109.5q0 72 -48 108t-116 36 q-66 0 -116 -37t-50 -109z" />
+<glyph unicode="9" d="M92 868q0 74 25.5 151t76 139.5t126 102t178.5 39.5q213 0 325.5 -143t112.5 -399q0 -184 -53.5 -326.5t-152.5 -239t-239.5 -146.5t-312.5 -50l-8 217q164 2 293 70.5t182 216.5q-80 -35 -143 -35q-111 0 -188.5 31.5t-127 87t-72 128t-22.5 156.5zM338 872 q0 -96 45.5 -147t151.5 -51q39 0 81.5 8t69.5 23q2 16 3 39.5t1 46.5q0 51 -9 103t-30.5 95t-57.5 69.5t-89 26.5q-45 0 -77 -17t-51.5 -46t-28.5 -68t-9 -82z" />
+<glyph unicode="A" d="M18 0q90 375 182.5 683t178.5 585h274q90 -279 179.5 -591t173.5 -677h-271l-59 293h-338l-57 -293h-263zM385 502h248q-12 68 -24.5 131t-28 125.5t-33 127t-37.5 136.5q-20 -72 -37.5 -136.5t-33 -127t-29 -126t-25.5 -130.5z" />
+<glyph unicode="B" d="M111 20v1231q72 12 157.5 21.5t169.5 9.5q143 0 233.5 -29.5t141.5 -78t69.5 -107.5t18.5 -119q0 -90 -44 -159.5t-118 -110.5q129 -47 175.5 -127t46.5 -168q0 -115 -39 -191.5t-105.5 -122.5t-158 -65.5t-195.5 -19.5q-84 0 -174 9t-178 27zM362 211q27 -4 59 -6t62 -2 q43 0 84 7t73 26.5t52.5 55.5t20.5 91q0 92 -58.5 132t-156.5 40h-136v-344zM362 764h99q96 0 145 42t49 116q0 45 -14 72.5t-38.5 43t-57.5 20.5t-68 5q-29 0 -59.5 -2t-55.5 -6v-291z" />
+<glyph unicode="C" d="M55 635q0 158 43 280.5t120 207.5t182.5 129t230.5 44q68 0 122 -11t95 -25.5t68.5 -31t41.5 -24.5l-65 -200q-47 31 -113.5 52t-152.5 21q-59 0 -115.5 -21.5t-100.5 -71.5t-72 -134t-28 -209q0 -217 75 -332.5t245 -115.5q98 0 162.5 22.5t103.5 44.5l64 -199 q-53 -33 -144.5 -60.5t-210.5 -27.5q-268 0 -409.5 172t-141.5 490z" />
+<glyph unicode="D" d="M111 14v1237q86 18 161.5 24.5t141.5 6.5q125 0 228 -37t175 -115.5t112 -200.5t40 -294q0 -176 -44 -300t-122 -202t-185.5 -113.5t-236.5 -35.5q-68 0 -132.5 7t-137.5 23zM362 205q10 -2 22.5 -2h23.5q86 0 144 32.5t94 90t51.5 136.5t15.5 173q0 82 -12.5 159.5 t-43 137t-84 95.5t-137.5 36q-16 0 -36.5 -1t-37.5 -5v-852z" />
+<glyph unicode="E" d="M129 0v1268h768v-209h-516v-285h448v-209h-448v-356h561v-209h-813z" />
+<glyph unicode="F" d="M129 0v1268h776v-209h-524v-307h459v-209h-459v-543h-252z" />
+<glyph unicode="G" d="M55 635q0 162 43 285.5t117 207.5t174 126t215 42q74 0 132.5 -11t101.5 -25.5t70.5 -31t41.5 -24.5l-65 -200q-45 29 -110.5 51t-135.5 22q-90 0 -151.5 -32.5t-101.5 -91t-57.5 -139.5t-17.5 -179q0 -227 72 -334.5t211 -107.5q23 0 49.5 2t48.5 6v463h252v-633 q-45 -16 -140 -37t-231 -21q-119 0 -214 42t-162.5 125t-104.5 207t-37 288z" />
+<glyph unicode="H" d="M92 0v1268h252v-500h336v500h252v-1268h-252v559h-336v-559h-252z" />
+<glyph unicode="I" d="M111 0v209h276v850h-276v209h804v-209h-274v-850h274v-209h-804z" />
+<glyph unicode="J" d="M86 86l96 201q51 -33 113.5 -63.5t128.5 -30.5q98 0 158.5 52t60.5 193v621h-424v209h678v-844q0 -92 -23.5 -174t-78 -143.5t-140.5 -97.5t-209 -36q-129 0 -215 33t-145 80z" />
+<glyph unicode="K" d="M92 0v1268h252v-527q45 57 94 127t93 139.5t81 137t62 123.5h284q-29 -55 -68.5 -126t-90.5 -147.5t-109.5 -156.5t-122.5 -154q63 -61 129 -141t124.5 -171t105.5 -186.5t75 -185.5h-284q-23 72 -65 155t-93 161.5t-107.5 147t-107.5 116.5v-580h-252z" />
+<glyph unicode="L" d="M145 0v1268h254v-1059h543v-209h-797z" />
+<glyph unicode="M" d="M47 0q6 156 13.5 324t15.5 333.5t19 321.5t26 289h209q14 -43 35.5 -110.5t46 -145.5t49 -158t47.5 -147q25 76 51.5 156.5t51 155.5t45 140.5t36.5 108.5h209q14 -166 27.5 -324t23 -312.5t15.5 -311t10 -320.5h-232l13 985l-156 -536h-184l-150 536l11 -985h-232z" />
+<glyph unicode="N" d="M94 0v1268h203q57 -90 114.5 -195.5t112 -210t100.5 -203t78 -172.5v781h228v-1268h-203q-86 211 -187.5 421t-217.5 421v-842h-228z" />
+<glyph unicode="O" d="M55 635q0 328 121 494.5t336 166.5q223 0 340 -166.5t117 -494.5t-119 -495t-336 -167q-223 0 -341 167t-118 495zM311 635q0 -92 7.5 -173t29 -140.5t60 -94t104.5 -34.5q63 0 103 34.5t61.5 95t29 140.5t7.5 172t-7.5 173t-29 140.5t-60 94t-104.5 34.5t-104.5 -34.5 t-60 -95t-29 -140.5t-7.5 -172z" />
+<glyph unicode="P" d="M111 0v1251q37 8 83 14.5t93 9.5t92 5t80 2q242 0 375 -99.5t133 -324.5q0 -227 -134.5 -328.5t-379.5 -101.5h-91v-428h-251zM362 647h103q121 0 182.5 48t61.5 165q0 111 -61 157t-161 46q-23 0 -62.5 -1t-62.5 -5v-410z" />
+<glyph unicode="Q" d="M55 629q0 328 121 494.5t336 166.5q223 0 340 -167t117 -494q0 -287 -92.5 -452t-266.5 -200q23 -51 110 -84.5t238 -60.5l-53 -180q-240 33 -361.5 109.5t-144.5 220.5q-166 41 -255 203.5t-89 443.5zM311 629q0 -92 7.5 -172t29 -140.5t60 -95.5t104.5 -35q63 0 103 35 t61.5 95.5t29 140.5t7.5 172t-7.5 173t-29 140t-60 94t-104.5 35t-104.5 -35t-60 -95t-29 -140t-7.5 -172z" />
+<glyph unicode="R" d="M111 0v1249q37 8 81 15.5t89 10.5t85.5 5t71.5 2q109 0 197 -24.5t151.5 -76t97.5 -130t34 -185.5q0 -111 -45.5 -201t-149.5 -137q35 -53 74 -117.5t75.5 -135t70.5 -141.5t58 -134h-264q-47 123 -109.5 236.5t-133.5 230.5h-132v-467h-251zM362 676h56q129 0 186.5 50 t57.5 142q0 100 -61.5 147.5t-162.5 47.5q-14 0 -34.5 -1t-41.5 -5v-381z" />
+<glyph unicode="S" d="M82 70l74 204q55 -33 131.5 -61.5t187.5 -28.5q63 0 105.5 13.5t67 37t33.5 53t9 60.5q0 39 -22.5 70t-57.5 54.5t-78 43t-86 35.5q-57 20 -118.5 47t-111.5 68t-83 101t-33 151q0 178 116 278t319 100q117 0 203.5 -26.5t146.5 -59.5l-74 -194q-51 29 -113.5 49 t-144.5 20q-201 0 -201 -145q0 -37 20.5 -64.5t52.5 -49t72 -38t78 -30.5q59 -23 124 -50.5t119 -73.5t89 -114.5t35 -173.5q0 -178 -115.5 -275.5t-351.5 -97.5q-158 0 -252 34t-141 63z" />
+<glyph unicode="T" d="M51 1059v209h922v-209h-334v-1059h-254v1059h-334z" />
+<glyph unicode="U" d="M80 459v809h254v-793q0 -80 8 -134t27.5 -87t54.5 -47t88 -14t88 14t55.5 48t28.5 88t8 134v791h252v-809q0 -111 -20.5 -201t-71.5 -153.5t-135 -97.5t-209 -34q-123 0 -206 34t-132 97.5t-69.5 153.5t-20.5 201z" />
+<glyph unicode="V" d="M27 1268h266q12 -98 36.5 -228.5t54.5 -268.5t63.5 -272t66.5 -241q33 104 65.5 238.5t61.5 272.5t53.5 269t40.5 230h264q-25 -123 -60.5 -274.5t-81.5 -318.5t-101.5 -340t-114.5 -335h-260q-49 141 -104.5 319.5t-104.5 355.5t-88 334.5t-57 258.5z" />
+<glyph unicode="W" d="M47 1268h234q-2 -121 -4.5 -250t-4.5 -257t-4 -250t-2 -228q18 66 42 143.5t45.5 153t40 139t28.5 100.5h184q8 -39 24.5 -96t36 -127t43 -149.5t46.5 -163.5q0 106 -2 228t-4 249t-4.5 257t-2.5 251h234q-6 -156 -12.5 -321t-14.5 -327.5t-19 -320.5t-26 -299h-209 q-45 129 -90 277.5t-90 283.5q-45 -129 -94 -280.5t-90 -280.5h-209q-16 141 -28.5 300t-22 321.5t-15.5 327.5t-10 319z" />
+<glyph unicode="X" d="M23 0q20 55 60 133t88 168t101.5 185.5t102.5 183.5l-332 598h272l201 -406l211 406h254l-324 -592q55 -88 108.5 -184.5t99.5 -187.5t81 -170t55 -134h-272q-39 104 -95 231t-118 254q-59 -121 -118.5 -251t-102.5 -234h-272z" />
+<glyph unicode="Y" d="M27 1268h270q47 -147 104.5 -300t118.5 -280q23 47 52.5 119t59.5 151.5t57.5 161.5t49.5 148h260q-39 -104 -77.5 -202.5t-81.5 -195t-92.5 -191.5t-106.5 -196v-483h-254v481q-113 199 -198 388.5t-162 398.5z" />
+<glyph unicode="Z" d="M94 0v145q45 88 96.5 185.5t115 208t138 239.5t164.5 281h-487v209h790v-176q-88 -135 -161.5 -254t-137 -226.5t-120 -207t-107.5 -195.5h545v-209h-836z" />
+<glyph unicode="a" d="M90 295q0 84 33 141.5t88 92t127 50t149 15.5q98 0 175 -16v30q0 72 -45.5 120t-155.5 48q-72 0 -138.5 -10t-107.5 -25l-35 203q47 16 133.5 29.5t178.5 13.5q119 0 197.5 -27.5t125.5 -78t67.5 -123t20.5 -162.5v-573q-55 -12 -163.5 -29t-243.5 -17q-92 0 -167 16.5 t-128.5 54.5t-82 98.5t-28.5 148.5zM338 301q0 -66 49 -93.5t127 -27.5q41 0 80 1t68 5v222q-25 4 -60 7t-63 3q-39 0 -76 -5t-64.5 -17.5t-44 -35t-16.5 -59.5z" />
+<glyph unicode="b" d="M127 29v1349l252 43v-481q53 25 102 34t99 9q94 0 165.5 -36t119.5 -102.5t73 -158.5t25 -205q0 -115 -31 -208t-90.5 -158.5t-145.5 -101.5t-196 -36q-98 0 -200.5 14.5t-172.5 37.5zM379 205q29 -6 60.5 -8t54.5 -2q98 0 155.5 66t57.5 226q0 135 -44.5 207t-134.5 72 q-41 0 -80.5 -11.5t-68.5 -27.5v-522z" />
+<glyph unicode="c" d="M90 481q0 104 33 196.5t100.5 161t171 108.5t246.5 40q86 0 155.5 -12t141.5 -41l-55 -203q-41 14 -91.5 25.5t-127.5 11.5q-90 0 -150.5 -21.5t-97.5 -59.5t-53.5 -91t-16.5 -115q0 -133 75 -208.5t255 -75.5q59 0 123.5 8t118.5 26l36 -206q-53 -20 -128.5 -34 t-178.5 -14q-147 0 -252.5 39t-173 106.5t-99.5 160t-32 198.5z" />
+<glyph unicode="d" d="M57 475q0 236 97.5 372t287.5 136q51 0 100.5 -11t86.5 -32v438l252 43v-1392q-70 -23 -170.5 -37.5t-196.5 -14.5q-225 0 -341 133.5t-116 364.5zM313 487q0 -129 48.5 -210.5t154.5 -81.5q31 0 57.5 2t55.5 6v524q-29 16 -66 27.5t-78 11.5q-90 0 -131 -72t-41 -207z " />
+<glyph unicode="e" d="M63 473q0 127 39 223.5t102.5 161t145.5 97t168 32.5q213 0 323.5 -126t110.5 -367q0 -25 -1 -51.5t-3 -43.5h-624q0 -94 77.5 -148t200.5 -54q76 0 144.5 16t115.5 33l35 -215q-66 -23 -139.5 -38.5t-165.5 -15.5q-123 0 -220.5 32t-166 94.5t-105.5 154.5t-37 215z M324 573h385q0 39 -10.5 75t-33 64.5t-57.5 46t-86 17.5q-49 0 -85 -16.5t-59.5 -45t-36.5 -65.5t-17 -76z" />
+<glyph unicode="f" d="M74 754v209h211v55q0 117 33.5 193.5t91 122.5t131 65.5t151.5 19.5q80 0 164 -14t152 -47l-43 -205q-47 16 -118 33.5t-134 17.5q-35 0 -67 -6t-55.5 -26.5t-37.5 -58.5t-14 -99v-51h395v-209h-395v-754h-254v754h-211z" />
+<glyph unicode="g" d="M68 512q0 238 131 354.5t356 116.5q158 0 342 -51v-815q0 -236 -113.5 -348.5t-365.5 -112.5q-90 0 -173 18.5t-159 42.5l47 213q59 -23 125 -42t164 -19q66 0 108.5 15.5t67.5 42t35 62.5t10 77v38q-53 -20 -97 -30.5t-95 -10.5q-188 0 -285.5 119t-97.5 330zM324 512 q0 -119 43 -181.5t135 -62.5q41 0 76.5 10.5t64.5 26.5v463q-29 6 -51.5 8t-46.5 2q-221 0 -221 -266z" />
+<glyph unicode="h" d="M129 0v1378l252 43v-467q31 10 74 19.5t75 9.5q106 0 178 -31.5t115 -90t61.5 -139.5t18.5 -179v-543h-252v510q0 135 -30.5 194.5t-116.5 59.5q-35 0 -69 -8t-54 -15v-741h-252z" />
+<glyph unicode="i" d="M74 754v209h518v-596q0 -86 31.5 -128t105.5 -42q35 0 84 9t111 38l32 -203q-78 -37 -146.5 -50.5t-125.5 -13.5q-98 0 -164.5 29t-106.5 83t-56.5 132t-16.5 178v355h-266zM264 1239q0 76 46 119t112 43t113 -43t47 -119q0 -74 -47.5 -117t-112.5 -43q-66 0 -112 43 t-46 117z" />
+<glyph unicode="j" d="M100 -260l78 213q51 -29 124 -54.5t132 -25.5q63 0 98 38t35 140v703h-389v209h641v-900q0 -117 -28.5 -195.5t-78.5 -126.5t-119 -68.5t-149 -20.5q-98 0 -182 24.5t-162 63.5zM471 1239q0 76 46 119t112 43t112.5 -43t46.5 -119q0 -74 -47 -117t-112 -43q-66 0 -112 43 t-46 117z" />
+<glyph unicode="k" d="M129 0v1378l254 43v-839q37 43 75 91t73.5 99t68.5 99.5t57 91.5h304q-37 -47 -84.5 -102.5t-97.5 -113t-100 -110.5t-91 -98q51 -49 110.5 -118t116.5 -142.5t105.5 -147.5t76.5 -131h-288q-25 51 -65 115.5t-85 127t-91 119t-85 93.5v-455h-254z" />
+<glyph unicode="l" d="M74 1200v209h518v-1044q0 -98 39 -133t98 -35q76 0 127 20.5t68 26.5l32 -203q-6 -4 -27.5 -14.5t-56 -21.5t-85 -19.5t-113.5 -8.5q-174 0 -254 103.5t-80 302.5v817h-266z" />
+<glyph unicode="m" d="M59 0v926q80 23 158 35t137 12q53 0 95.5 -13.5t72.5 -44.5q35 23 82 40.5t98 17.5q80 0 131.5 -24.5t81 -74t40 -124t10.5 -175.5v-575h-205v588q0 57 -7.5 92t-18.5 53.5t-26.5 24.5t-31.5 6q-18 0 -39 -3t-37 -11q6 -39 10 -86.5t4 -104.5v-192h-204v221 q0 98 -19.5 137t-62.5 39q-12 0 -29.5 -2t-34.5 -6v-756h-205z" />
+<glyph unicode="n" d="M129 0v932q68 18 167 34.5t216 16.5q115 0 190.5 -31.5t119.5 -90t62.5 -139.5t18.5 -179v-543h-252v510q0 135 -30.5 194.5t-124.5 59.5q-29 0 -56.5 -2t-58.5 -6v-756h-252z" />
+<glyph unicode="o" d="M59 483q0 113 34 206t94.5 159.5t144.5 102.5t182 36q100 0 183 -36t143.5 -102.5t93.5 -159.5t33 -206q0 -115 -33 -208t-92.5 -160.5t-142.5 -104.5t-185 -37t-185 37t-143.5 104.5t-93.5 161t-33 207.5zM315 481q0 -129 46.5 -208.5t148.5 -79.5q98 0 148.5 79.5 t50.5 208.5t-46.5 208t-148.5 79q-98 0 -148.5 -79t-50.5 -208z" />
+<glyph unicode="p" d="M129 -338v1270q70 23 171 37t200 14q223 0 342 -135.5t119 -366.5q0 -111 -25 -204t-72 -159.5t-118.5 -103.5t-165.5 -37q-96 0 -199 48v-363h-252zM381 231q25 -16 65.5 -26t81.5 -10q90 0 133.5 72.5t43.5 205.5q0 129 -51.5 212t-155.5 83q-29 0 -62 -3l-55 -5v-529z " />
+<glyph unicode="q" d="M63 481q0 111 31 204t89.5 158.5t145.5 102.5t197 37q47 0 99.5 -4t101.5 -11t93 -16.5t77 -19.5v-1270h-252v365q-47 -23 -99 -36.5t-100 -13.5q-94 0 -165.5 36t-119.5 101.5t-73 158.5t-25 208zM319 473q0 -133 44.5 -205.5t134.5 -72.5q43 0 80.5 10t66.5 26v529 q-18 2 -50 5t-67 3q-104 0 -156.5 -83t-52.5 -212z" />
+<glyph unicode="r" d="M182 0v899q100 37 206 59.5t247 22.5q20 0 58 -2t81 -7t87 -12.5t79 -19.5l-45 -233q-25 6 -58.5 12t-68.5 11t-67.5 7t-55.5 2q-53 0 -104.5 -5t-104.5 -19v-715h-254z" />
+<glyph unicode="s" d="M111 57l39 211q72 -29 152.5 -53.5t164.5 -24.5q92 0 141 13.5t49 54.5q0 27 -15 45.5t-43 31.5t-63.5 25.5t-74.5 24.5q-55 16 -112.5 37.5t-104.5 54.5t-78 83t-31 126q0 61 23.5 115.5t74 96.5t128 65.5t186.5 23.5q94 0 175 -14.5t140 -40.5l-39 -213 q-35 10 -108.5 33.5t-165.5 23.5q-96 0 -130 -23.5t-34 -50.5q0 -23 15.5 -40t41 -31.5t59.5 -27.5t72 -25q55 -18 115 -41t108 -57t78.5 -86t30.5 -128q0 -59 -22.5 -112.5t-74.5 -92t-136 -61.5t-207 -23q-125 0 -213 29t-141 51z" />
+<glyph unicode="t" d="M74 754v209h219v241l252 41v-282h403v-209h-403v-389q0 -53 10 -86t28.5 -51.5t45 -24.5t59.5 -6q35 0 64.5 2t57.5 7t57.5 15t64.5 27l35 -217q-70 -29 -151 -41.5t-157 -12.5q-88 0 -155.5 14.5t-114.5 55.5t-71.5 116t-24.5 195v396h-219z" />
+<glyph unicode="u" d="M121 426v537h252v-504q0 -133 31.5 -197.5t123.5 -64.5q57 0 115 10v756h254v-930q-70 -18 -169 -37t-216 -19q-119 0 -194.5 33t-119.5 93.5t-60.5 142.5t-16.5 180z" />
+<glyph unicode="v" d="M29 963h264q18 -78 43.5 -166t54.5 -177.5t58.5 -173.5t56.5 -153q27 70 59.5 153.5t64.5 173t61.5 177.5t47.5 166h256q-86 -291 -190.5 -536t-196.5 -427h-211q-92 182 -187 427t-181 536z" />
+<glyph unicode="w" d="M23 963h215q8 -178 17 -348.5t34 -350.5q27 78 46 144.5t34.5 127t29 117t27.5 115.5h182q12 -59 25.5 -115.5t29 -117t33 -127t41.5 -144.5q12 94 20.5 180t13.5 171t8 170t7 178h215q-23 -281 -62.5 -529t-88.5 -434h-191q-23 63 -42 116.5t-36.5 103.5t-35 104.5 t-35.5 119.5q-20 -66 -36.5 -118t-34 -103t-36 -104t-45.5 -119h-190q-25 90 -46.5 199.5t-40 233.5t-32.5 257t-26 273z" />
+<glyph unicode="x" d="M41 0q31 57 71 119.5t84 127t92 128t93 121.5l-338 467h264l213 -301l197 301h256l-311 -463q49 -59 96 -126t90 -134.5t78 -129t59 -110.5h-262q-55 104 -110.5 186t-104.5 148q-61 -82 -110.5 -160t-100.5 -174h-256z" />
+<glyph unicode="y" d="M41 -307l47 211q41 -18 73 -25.5t68 -7.5q74 0 119 49t72 117q-90 180 -180 412.5t-164 513.5h262q18 -76 41.5 -162t50.5 -172t56.5 -169t60.5 -155q20 72 42.5 155t43 168t40 171t36.5 164h258q-39 -135 -75 -265.5t-75 -254.5t-83 -242.5t-95 -231.5q-39 -82 -77 -141 t-84 -97t-102.5 -56.5t-131.5 -18.5q-63 0 -115.5 10t-87.5 27z" />
+<glyph unicode="z" d="M137 0v154q47 78 102.5 159.5t111 160.5t108.5 150.5t96 129.5h-397v209h714v-185q-29 -33 -82 -97.5t-115.5 -144t-125 -166.5t-111.5 -161h455v-209h-756z" />
+<glyph unicode="&#xa0;" />
+<glyph unicode="&#x2000;" horiz-adv-x="710" />
+<glyph unicode="&#x2001;" horiz-adv-x="1421" />
+<glyph unicode="&#x2002;" horiz-adv-x="710" />
+<glyph unicode="&#x2003;" horiz-adv-x="1421" />
+<glyph unicode="&#x2004;" horiz-adv-x="473" />
+<glyph unicode="&#x2005;" horiz-adv-x="355" />
+<glyph unicode="&#x2006;" horiz-adv-x="236" />
+<glyph unicode="&#x2007;" horiz-adv-x="236" />
+<glyph unicode="&#x2008;" horiz-adv-x="177" />
+<glyph unicode="&#x2009;" horiz-adv-x="284" />
+<glyph unicode="&#x200a;" horiz-adv-x="78" />
+<glyph unicode="&#x202f;" horiz-adv-x="284" />
+<glyph unicode="&#x205f;" horiz-adv-x="355" />
+<glyph unicode="&#xe000;" horiz-adv-x="962" d="M0 0v963h963v-963h-963z" />
+</font>
+</defs></svg> 
\ No newline at end of file
diff --git a/images/ubuntumono-b-webfont.ttf b/images/ubuntumono-b-webfont.ttf
new file mode 100755
index 0000000..a9c86ac
Binary files /dev/null and b/images/ubuntumono-b-webfont.ttf differ
diff --git a/images/ubuntumono-b-webfont.woff b/images/ubuntumono-b-webfont.woff
new file mode 100755
index 0000000..4c69901
Binary files /dev/null and b/images/ubuntumono-b-webfont.woff differ