1 files changed, 124 insertions, 0 deletions
diff --git a/signaling-server/node_modules/socket.io/node_modules/socket.io-client/lib/vendor/web-socket-js/flash-src/com/hurlant/crypto/hash/MD2.as b/signaling-server/node_modules/socket.io/node_modules/socket.io-client/lib/vendor/web-socket-js/flash-src/com/hurlant/crypto/hash/MD2.as
new file mode 100644
index 0000000..e104f0d
--- /dev/null
+++ b/signaling-server/node_modules/socket.io/node_modules/socket.io-client/lib/vendor/web-socket-js/flash-src/com/hurlant/crypto/hash/MD2.as
@@ -0,0 +1,124 @@
+/**
+ * MD2
+ * 
+ * An ActionScript 3 implementation of the RSA Data Security, Inc MD2 Message
+ * Digest Algorithm, as defined in RFC 1319
+ * Copyright (c) 2007 Henri Torgemane
+ * 
+ * See LICENSE.txt for full license information.
+ * 
+ * Excerpt from http://en.wikipedia.org/wiki/MD2:
+ * > 
+ * > Rogier and Chauvaud (1997) described collisions of MD2's compression function,
+ * > although they were unable to extend the attack to the full MD2.
+ * > 
+ * > In 2004, MD2 was shown to be vulnerable to a preimage attack with time 
+ * > complexity equivalent to 2104 applications of the compression function 
+ * > (Muller, 2004). 
+ * > The author concludes, "MD2 can no longer be considered a secure one-way 
+ * > hash function".
+ * 
+ * also, this implementaton is quite slow.
+ */
+
+package com.hurlant.crypto.hash
+{
+	import flash.utils.ByteArray;
+
+	public class MD2 implements IHash
+	{
+		public static const HASH_SIZE:int = 16;
+		public var pad_size:int = 48; // probably will never get used, only here for SSL 3.0 support
+		
+		private static const S:Array = [ // PI Digits
+ 41,  46,  67, 201, 162, 216, 124,   1,  61,  54,  84, 161, 236, 240,   6,  19,
+ 98, 167,   5, 243, 192, 199, 115, 140, 152, 147,  43, 217, 188,  76, 130, 202,
+ 30, 155,  87,  60, 253, 212, 224,  22, 103,  66, 111,  24, 138,  23, 229,  18,
+190,  78, 196, 214, 218, 158, 222,  73, 160, 251, 245, 142, 187,  47, 238, 122,
+169, 104, 121, 145,  21, 178,   7,  63, 148, 194,  16, 137,  11,  34,  95,  33,
+128, 127,  93, 154,  90, 144,  50,  39,  53,  62, 204, 231, 191, 247, 151,   3,
+255,  25,  48, 179,  72, 165, 181, 209, 215,  94, 146,  42, 172,  86, 170, 198,
+ 79, 184,  56, 210, 150, 164, 125, 182, 118, 252, 107, 226, 156, 116,   4, 241,
+ 69, 157, 112,  89, 100, 113, 135,  32, 134,  91, 207, 101, 230,  45, 168,   2,
+ 27,  96,  37, 173, 174, 176, 185, 246,  28,  70,  97, 105,  52,  64, 126,  15,
+ 85,  71, 163,  35, 221,  81, 175,  58, 195,  92, 249, 206, 186, 197, 234,  38,
+ 44,  83,  13, 110, 133,  40, 132,   9, 211, 223, 205, 244,  65, 129,  77,  82,
+106, 220,  55, 200, 108, 193, 171, 250,  36, 225, 123,   8,  12, 189, 177,  74,
+120, 136, 149, 139, 227,  99, 232, 109, 233, 203, 213, 254,  59,   0,  29,  57,
+242, 239, 183,  14, 102,  88, 208, 228, 166, 119, 114, 248, 235, 117,  75,  10,
+ 49,  68,  80, 180, 143, 237,  31,  26, 219, 153, 141,  51, 159,  17, 131,  20 ];
+		
+
+        public function MD2() { }
+
+		public function getInputSize():uint
+		{
+			return 16;
+		}
+		
+		public function getPadSize():int {
+			return pad_size;
+		}
+		
+		public function getHashSize():uint
+		{
+			return HASH_SIZE;
+		}
+		
+		public function hash(src:ByteArray):ByteArray
+		{
+			var savedLength:uint = src.length;
+			
+			// 3.1 Step 1. Padding
+			var i:uint = (16-src.length%16) || 16;
+			do {
+				src[src.length]=i;
+			} while (src.length%16!=0);
+			
+			// 3.2 Step 2. Checksum
+			var len:uint = src.length;
+			var checksum:ByteArray = new ByteArray;
+			var L:uint = 0;
+			for (i = 0;i<len;i+=16) {
+				for (var j:uint=0;j<16;j++) {
+					L = checksum[j] ^= S[src[i+j] ^ L];
+				}
+			}
+			src.position = src.length;
+			src.writeBytes(checksum);
+			len += 16;
+			
+			// 3.3 Step 3. MD Buffer
+			var X:ByteArray = new ByteArray;
+
+			// 3.4 Process Message
+			for (i=0;i<len;i+=16) {
+				
+				/* Copy block i into X */
+				for (j=0;j<16;j++) {
+					X[32+j] = (X[16+j] = src[i+j])^X[j];
+				}
+				var t:uint=0;
+				/* Do 18 rounds */
+				for (j=0;j<18;j++) {
+					/* Round j. */
+					for (var k:uint=0;k<48;k++) {
+						X[k] = t = X[k]^S[t];
+					}
+					t = (t+j)&0xff;
+				}
+			}
+			// 3.5 Step 5. Output
+			X.length = 16;
+			// restore original length;
+			src.length = savedLength;
+			return X;
+		}
+		
+		public function toString():String
+		{
+			return "md2";
+		}
+		
+	}
+}