Merge branch 'no-flash-uploader' of git://github.com/sembrestels/Tidypics

7 files changed, 0 insertions, 1713 deletions

diff --git a/vendors/uploadify/com/adobe/crypto/HMAC.as b/vendors/uploadify/com/adobe/crypto/HMAC.as
deleted file mode 100644
index 72f9bffc9..000000000
--- a/vendors/uploadify/com/adobe/crypto/HMAC.as
+++ /dev/null
@@ -1,127 +0,0 @@
-/*

-  Copyright (c) 2008, Adobe Systems Incorporated

-  All rights reserved.

-

-  Redistribution and use in source and binary forms, with or without 

-  modification, are permitted provided that the following conditions are

-  met:

-

-  * Redistributions of source code must retain the above copyright notice, 

-    this list of conditions and the following disclaimer.

-  

-  * Redistributions in binary form must reproduce the above copyright

-    notice, this list of conditions and the following disclaimer in the 

-    documentation and/or other materials provided with the distribution.

-  

-  * Neither the name of Adobe Systems Incorporated nor the names of its 

-    contributors may be used to endorse or promote products derived from 

-    this software without specific prior written permission.

-

-  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

-  IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

-  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

-  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 

-  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

-  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

-  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

-  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF

-  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING

-  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

-  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

-*/

-

-package com.adobe.crypto {

-	import flash.utils.ByteArray;

-	import flash.utils.Endian;

-	import flash.utils.describeType;

-	/**

-	 * Keyed-Hashing for Message Authentication

-	 * Implementation based on algorithm description at 

-	 * http://www.faqs.org/rfcs/rfc2104.html

-	 */

-	public class HMAC 

-	{

-		/**

-		 * Performs the HMAC hash algorithm using byte arrays.

-		 *

-		 * @param secret The secret key

-		 * @param message The message to hash

-		 * @param algorithm Hash object to use

-		 * @return A string containing the hash value of message

-		 * @langversion ActionScript 3.0

-		 * @playerversion Flash 8.5

-		 * @tiptext

-		 */

-		public static function hash( secret:String, message:String, algorithm:Object = null ):String

-		{

-			var text:ByteArray = new ByteArray();

-			var k_secret:ByteArray = new ByteArray();

-			

-			text.writeUTFBytes(message);

-			k_secret.writeUTFBytes(secret);

-			

-			return hashBytes(k_secret, text, algorithm);

-		}

-		

-		/**

-		 * Performs the HMAC hash algorithm using string.

-		 *

-		 * @param secret The secret key

-		 * @param message The message to hash

-		 * @param algorithm Hash object to use

-		 * @return A string containing the hash value of message

-		 * @langversion ActionScript 3.0

-		 * @playerversion Flash 8.5

-		 * @tiptext

-		 */

-		public static function hashBytes( secret:ByteArray, message:ByteArray, algorithm:Object = null ):String

-		{

-			var ipad:ByteArray = new ByteArray();

-			var opad:ByteArray = new ByteArray();

-			var endian:String = Endian.BIG_ENDIAN;

-			

-			if(algorithm == null){

-				algorithm = MD5;

-			}

-			

-			if ( describeType(algorithm).@name.toString() == "com.adobe.crypto::MD5" ) {

-				endian = Endian.LITTLE_ENDIAN;

-			}

-			

-			if ( secret.length > 64 ) {

-				algorithm.hashBytes(secret);

-				secret = new ByteArray();

-				secret.endian = endian;

-				

-				while ( algorithm.digest.bytesAvailable != 0 ) {

-					secret.writeInt(algorithm.digest.readInt());

-				}

-			}

-

-			secret.length = 64

-			secret.position = 0;

-			for ( var x:int = 0; x < 64; x++ ) {

-				var byte:int = secret.readByte();

-				ipad.writeByte(0x36 ^ byte);

-				opad.writeByte(0x5c ^ byte);

-			}

-			

-			ipad.writeBytes(message);

-			algorithm.hashBytes(ipad);

-			var tmp:ByteArray = new ByteArray();

-			tmp.endian = endian;	

-			

-			while ( algorithm.digest.bytesAvailable != 0 ) {

-				tmp.writeInt(algorithm.digest.readInt());

-			}

-			tmp.position = 0;

-			

-			while ( tmp.bytesAvailable != 0 ) {

-				opad.writeByte(tmp.readUnsignedByte());

-			}

-			return algorithm.hashBytes( opad );

-		}

-		

-	}

-	

-}

diff --git a/vendors/uploadify/com/adobe/crypto/MD5.as b/vendors/uploadify/com/adobe/crypto/MD5.as
deleted file mode 100644
index da533cc44..000000000
--- a/vendors/uploadify/com/adobe/crypto/MD5.as
+++ /dev/null
@@ -1,281 +0,0 @@
-/*
-  Copyright (c) 2008, Adobe Systems Incorporated
-  All rights reserved.
-
-  Redistribution and use in source and binary forms, with or without 
-  modification, are permitted provided that the following conditions are
-  met:
-
-  * Redistributions of source code must retain the above copyright notice, 
-    this list of conditions and the following disclaimer.
-  
-  * Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the 
-    documentation and/or other materials provided with the distribution.
-  
-  * Neither the name of Adobe Systems Incorporated nor the names of its 
-    contributors may be used to endorse or promote products derived from 
-    this software without specific prior written permission.
-
-  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
-  IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
-  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 
-  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*/
-
-package com.adobe.crypto {
-	
-	import com.adobe.utils.IntUtil;
-	import flash.utils.ByteArray;	
-	/**
-	 * The MD5 Message-Digest Algorithm
-	 *
-	 * Implementation based on algorithm description at 
-	 * http://www.faqs.org/rfcs/rfc1321.html
-	 */
-	public class MD5 {
-		
-		public static var digest:ByteArray;
-		/**
-		 * Performs the MD5 hash algorithm on a string.
-		 *
-		 * @param s The string to hash
-		 * @return A string containing the hash value of s
-		 * @langversion ActionScript 3.0
-		 * @playerversion Flash 8.5
-		 * @tiptext
-		 */
-		 
-		public static function hash(s:String) :String{
-			//Convert to byteArray and send through hashBinary function
-			// so as to only have complex code in one location
-			var ba:ByteArray = new ByteArray();
-			ba.writeUTFBytes(s);	
-			return hashBinary(ba);
-		}
-		
-		public static function hashBytes(s:ByteArray) :String{	
-			return hashBinary(s);
-		}
-		
-		/**
-		 * Performs the MD5 hash algorithm on a ByteArray.
-		 *
-		 * @param s The string to hash
-		 * @return A string containing the hash value of s
-		 * @langversion ActionScript 3.0
-		 * @playerversion Flash 8.5
-		 * @tiptext
-		 */	 
-		public static function hashBinary( s:ByteArray ):String {
-			// initialize the md buffers
-			var a:int = 1732584193;
-			var b:int = -271733879;
-			var c:int = -1732584194;
-			var d:int = 271733878;
-			
-			// variables to store previous values
-			var aa:int;
-			var bb:int;
-			var cc:int;
-			var dd:int;
-			
-			// create the blocks from the string and
-			// save the length as a local var to reduce
-			// lookup in the loop below
-			var x:Array = createBlocks( s );
-			var len:int = x.length;
-			
-			// loop over all of the blocks
-			for ( var i:int = 0; i < len; i += 16) {
-				// save previous values
-				aa = a;
-				bb = b;
-				cc = c;
-				dd = d;				
-				
-				// Round 1
-				a = ff( a, b, c, d, x[int(i+ 0)],  7, -680876936 ); 	// 1
-				d = ff( d, a, b, c, x[int(i+ 1)], 12, -389564586 );	// 2
-				c = ff( c, d, a, b, x[int(i+ 2)], 17, 606105819 ); 	// 3
-				b = ff( b, c, d, a, x[int(i+ 3)], 22, -1044525330 );	// 4
-				a = ff( a, b, c, d, x[int(i+ 4)],  7, -176418897 ); 	// 5
-				d = ff( d, a, b, c, x[int(i+ 5)], 12, 1200080426 ); 	// 6
-				c = ff( c, d, a, b, x[int(i+ 6)], 17, -1473231341 );	// 7
-				b = ff( b, c, d, a, x[int(i+ 7)], 22, -45705983 ); 	// 8
-				a = ff( a, b, c, d, x[int(i+ 8)],  7, 1770035416 ); 	// 9
-				d = ff( d, a, b, c, x[int(i+ 9)], 12, -1958414417 );	// 10
-				c = ff( c, d, a, b, x[int(i+10)], 17, -42063 ); 		// 11
-				b = ff( b, c, d, a, x[int(i+11)], 22, -1990404162 );	// 12
-				a = ff( a, b, c, d, x[int(i+12)],  7, 1804603682 ); 	// 13
-				d = ff( d, a, b, c, x[int(i+13)], 12, -40341101 ); 	// 14
-				c = ff( c, d, a, b, x[int(i+14)], 17, -1502002290 );	// 15
-				b = ff( b, c, d, a, x[int(i+15)], 22, 1236535329 ); 	// 16
-				
-				// Round 2
-				a = gg( a, b, c, d, x[int(i+ 1)],  5, -165796510 ); 	// 17
-				d = gg( d, a, b, c, x[int(i+ 6)],  9, -1069501632 );	// 18
-				c = gg( c, d, a, b, x[int(i+11)], 14, 643717713 ); 	// 19
-				b = gg( b, c, d, a, x[int(i+ 0)], 20, -373897302 ); 	// 20
-				a = gg( a, b, c, d, x[int(i+ 5)],  5, -701558691 ); 	// 21
-				d = gg( d, a, b, c, x[int(i+10)],  9, 38016083 ); 	// 22
-				c = gg( c, d, a, b, x[int(i+15)], 14, -660478335 ); 	// 23
-				b = gg( b, c, d, a, x[int(i+ 4)], 20, -405537848 ); 	// 24
-				a = gg( a, b, c, d, x[int(i+ 9)],  5, 568446438 ); 	// 25
-				d = gg( d, a, b, c, x[int(i+14)],  9, -1019803690 );	// 26
-				c = gg( c, d, a, b, x[int(i+ 3)], 14, -187363961 ); 	// 27
-				b = gg( b, c, d, a, x[int(i+ 8)], 20, 1163531501 ); 	// 28
-				a = gg( a, b, c, d, x[int(i+13)],  5, -1444681467 );	// 29
-				d = gg( d, a, b, c, x[int(i+ 2)],  9, -51403784 ); 	// 30
-				c = gg( c, d, a, b, x[int(i+ 7)], 14, 1735328473 ); 	// 31
-				b = gg( b, c, d, a, x[int(i+12)], 20, -1926607734 );	// 32
-				
-				// Round 3
-				a = hh( a, b, c, d, x[int(i+ 5)],  4, -378558 ); 	// 33
-				d = hh( d, a, b, c, x[int(i+ 8)], 11, -2022574463 );	// 34
-				c = hh( c, d, a, b, x[int(i+11)], 16, 1839030562 ); 	// 35
-				b = hh( b, c, d, a, x[int(i+14)], 23, -35309556 ); 	// 36
-				a = hh( a, b, c, d, x[int(i+ 1)],  4, -1530992060 );	// 37
-				d = hh( d, a, b, c, x[int(i+ 4)], 11, 1272893353 ); 	// 38
-				c = hh( c, d, a, b, x[int(i+ 7)], 16, -155497632 ); 	// 39
-				b = hh( b, c, d, a, x[int(i+10)], 23, -1094730640 );	// 40
-				a = hh( a, b, c, d, x[int(i+13)],  4, 681279174 ); 	// 41
-				d = hh( d, a, b, c, x[int(i+ 0)], 11, -358537222 ); 	// 42
-				c = hh( c, d, a, b, x[int(i+ 3)], 16, -722521979 ); 	// 43
-				b = hh( b, c, d, a, x[int(i+ 6)], 23, 76029189 ); 	// 44
-				a = hh( a, b, c, d, x[int(i+ 9)],  4, -640364487 ); 	// 45
-				d = hh( d, a, b, c, x[int(i+12)], 11, -421815835 ); 	// 46
-				c = hh( c, d, a, b, x[int(i+15)], 16, 530742520 ); 	// 47
-				b = hh( b, c, d, a, x[int(i+ 2)], 23, -995338651 ); 	// 48
-				
-				// Round 4
-				a = ii( a, b, c, d, x[int(i+ 0)],  6, -198630844 ); 	// 49
-				d = ii( d, a, b, c, x[int(i+ 7)], 10, 1126891415 ); 	// 50
-				c = ii( c, d, a, b, x[int(i+14)], 15, -1416354905 );	// 51
-				b = ii( b, c, d, a, x[int(i+ 5)], 21, -57434055 ); 	// 52
-				a = ii( a, b, c, d, x[int(i+12)],  6, 1700485571 ); 	// 53
-				d = ii( d, a, b, c, x[int(i+ 3)], 10, -1894986606 );	// 54
-				c = ii( c, d, a, b, x[int(i+10)], 15, -1051523 ); 	// 55
-				b = ii( b, c, d, a, x[int(i+ 1)], 21, -2054922799 );	// 56
-				a = ii( a, b, c, d, x[int(i+ 8)],  6, 1873313359 ); 	// 57
-				d = ii( d, a, b, c, x[int(i+15)], 10, -30611744 ); 	// 58
-				c = ii( c, d, a, b, x[int(i+ 6)], 15, -1560198380 );	// 59
-				b = ii( b, c, d, a, x[int(i+13)], 21, 1309151649 ); 	// 60
-				a = ii( a, b, c, d, x[int(i+ 4)],  6, -145523070 ); 	// 61
-				d = ii( d, a, b, c, x[int(i+11)], 10, -1120210379 );	// 62
-				c = ii( c, d, a, b, x[int(i+ 2)], 15, 718787259 ); 	// 63
-				b = ii( b, c, d, a, x[int(i+ 9)], 21, -343485551 ); 	// 64
-
-				a += aa;
-				b += bb;
-				c += cc;
-				d += dd;
-			}
-			digest = new ByteArray()
-			digest.writeInt(a);
-			digest.writeInt(b);
-			digest.writeInt(c);
-			digest.writeInt(d);
-			digest.position = 0;
-			// Finish up by concatening the buffers with their hex output
-			return IntUtil.toHex( a ) + IntUtil.toHex( b ) + IntUtil.toHex( c ) + IntUtil.toHex( d );
-		}
-		
-		/**
-		 * Auxiliary function f as defined in RFC
-		 */
-		private static function f( x:int, y:int, z:int ):int {
-			return ( x & y ) | ( (~x) & z );
-		}
-		
-		/**
-		 * Auxiliary function g as defined in RFC
-		 */
-		private static function g( x:int, y:int, z:int ):int {
-			return ( x & z ) | ( y & (~z) );
-		}
-		
-		/**
-		 * Auxiliary function h as defined in RFC
-		 */
-		private static function h( x:int, y:int, z:int ):int {
-			return x ^ y ^ z;
-		}
-		
-		/**
-		 * Auxiliary function i as defined in RFC
-		 */
-		private static function i( x:int, y:int, z:int ):int {
-			return y ^ ( x | (~z) );
-		}
-		
-		/**
-		 * A generic transformation function.  The logic of ff, gg, hh, and
-		 * ii are all the same, minus the function used, so pull that logic
-		 * out and simplify the method bodies for the transoformation functions.
-		 */
-		private static function transform( func:Function, a:int, b:int, c:int, d:int, x:int, s:int, t:int):int {
-			var tmp:int = a + int( func( b, c, d ) ) + x + t;
-			return IntUtil.rol( tmp, s ) +  b;
-		}
-		
-		/**
-		 * ff transformation function
-		 */
-		private static function ff ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
-			return transform( f, a, b, c, d, x, s, t );
-		}
-		
-		/**
-		 * gg transformation function
-		 */
-		private static function gg ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
-			return transform( g, a, b, c, d, x, s, t );
-		}
-		
-		/**
-		 * hh transformation function
-		 */
-		private static function hh ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
-			return transform( h, a, b, c, d, x, s, t );
-		}
-		
-		/**
-		 * ii transformation function
-		 */
-		private static function ii ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {
-			return transform( i, a, b, c, d, x, s, t );
-		}
-		
-		/**
-		 * Converts a string to a sequence of 16-word blocks
-		 * that we'll do the processing on.  Appends padding
-		 * and length in the process.
-		 *
-		 * @param s The string to split into blocks
-		 * @return An array containing the blocks that s was
-		 *			split into.
-		 */
-		private static function createBlocks( s:ByteArray ):Array {
-			var blocks:Array = new Array();
-			var len:int = s.length * 8;
-			var mask:int = 0xFF; // ignore hi byte of characters > 0xFF
-			for( var i:int = 0; i < len; i += 8 ) {
-				blocks[ int(i >> 5) ] |= ( s[ i / 8 ] & mask ) << ( i % 32 );
-			}
-			
-			// append padding and length
-			blocks[ int(len >> 5) ] |= 0x80 << ( len % 32 );
-			blocks[ int(( ( ( len + 64 ) >>> 9 ) << 4 ) + 14) ] = len;
-			return blocks;
-		}
-		
-	}
-}
diff --git a/vendors/uploadify/com/adobe/crypto/MD5Stream.as b/vendors/uploadify/com/adobe/crypto/MD5Stream.as
deleted file mode 100644
index 6e5eed0d8..000000000
--- a/vendors/uploadify/com/adobe/crypto/MD5Stream.as
+++ /dev/null
@@ -1,402 +0,0 @@
-/*

-  Copyright (c) 2008, Adobe Systems Incorporated

-  All rights reserved.

-

-  Redistribution and use in source and binary forms, with or without 

-  modification, are permitted provided that the following conditions are

-  met:

-

-  * Redistributions of source code must retain the above copyright notice, 

-    this list of conditions and the following disclaimer.

-  

-  * Redistributions in binary form must reproduce the above copyright

-    notice, this list of conditions and the following disclaimer in the 

-    documentation and/or other materials provided with the distribution.

-  

-  * Neither the name of Adobe Systems Incorporated nor the names of its 

-    contributors may be used to endorse or promote products derived from 

-    this software without specific prior written permission.

-

-  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

-  IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

-  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

-  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 

-  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

-  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

-  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

-  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF

-  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING

-  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

-  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

-*/

-

-package com.adobe.crypto

-{

-    import com.adobe.utils.IntUtil;   

-    import flash.utils.ByteArray;

-

-    /**

-     * Perform MD5 hash of an input stream in chunks. This class is

-     * based on com.adobe.crypto.MD5 and can process data in

-     * chunks. Both block creation and hash computation are done

-     * together for whatever input is available so that the memory

-     * overhead at a time is always fixed. Memory usage is governed by

-     * two parameters: one is the amount of data passed in to update()

-     * and the other is memoryBlockSize. The latter comes into play

-     * only when the memory window exceeds the pre allocated memory

-     * window of flash player. Usage: create an instance, call

-     * update(data) repeatedly for all chunks and finally complete()

-     * which will return the md5 hash.

-     */      

-    public class MD5Stream

-    {

-        private static var mask:int = 0xFF;

-

-        private var arr:Array = [];

-

-        /* running count of length */

-        private var arrLen:int;

-        

-        // initialize the md buffers

-        private var a:int = 1732584193;

-        private var b:int = -271733879;

-        private var c:int = -1732584194;

-        private var d:int = 271733878;

-        

-        // variables to store previous values

-        private var aa:int;

-        private var bb:int;

-        private var cc:int;

-        private var dd:int;

-

-        /* index for data read */

-        private var arrIndexLen:int = 0;

-        /* index for hash computation */

-        private var arrProcessIndex:int = 0;

-        /* index for removing stale arr values */

-        private var cleanIndex:int = 0;

-        

-        /** 

-         * Change this value from the default (16384) in the range of

-         * MBs to actually affect GC as GC allocates in pools of

-         * memory */

-        public var memoryBlockSize:int = 16384;

-        

-        

-        public function MD5Stream()

-        {

-            

-        }

-               

-        

-        /**

-         * Pass in chunks of the input data with update(), call

-         * complete() with an optional chunk which will return the

-         * final hash. Equivalent to the way

-         * java.security.MessageDigest works.

-         *

-         * @param input The optional bytearray chunk which is the final part of the input

-         * @return A string containing the hash value

-         * @langversion ActionScript 3.0

-         * @playerversion Flash 8.5

-         * @tiptext

-         */

-        public function complete(input:ByteArray=null):String

-        {

-            if ( arr.length == 0 )

-            {

-                if ( input == null )

-                {

-                    throw new Error("null input to complete without prior call to update. At least an empty bytearray must be passed.");

-                }		 		

-            }

-            

-            if ( input != null )

-            {

-                readIntoArray(input);

-            }

-

-            //pad, append length

-            padArray(arrLen);

-

-            hashRemainingChunks(false);

-            

-            var res:String = IntUtil.toHex( a ) + IntUtil.toHex( b ) + 

-            				 IntUtil.toHex( c ) + IntUtil.toHex( d );

-            resetFields();

-            

-            return res;

-        }

-

-        /**

-         * Pass in chunks of the input data with update(), call

-         * complete() with an optional chunk which will return the

-         * final hash. Equivalent to the way

-         * java.security.MessageDigest works.

-         *

-         * @param input The bytearray chunk to perform the hash on

-         * @langversion ActionScript 3.0

-         * @playerversion Flash 8.5

-         * @tiptext

-         */        

-        public function update(input:ByteArray):void

-        {

-            readIntoArray(input);

-            hashRemainingChunks();

-        }

-

-        /**

-         * Re-initialize this instance for use to perform hashing on

-         * another input stream. This is called automatically by

-         * complete().

-         *

-         * @langversion ActionScript 3.0

-         * @playerversion Flash 8.5

-         * @tiptext

-         */               

-        public function resetFields():void

-        {

-            //truncate array

-            arr.length = 0;

-            arrLen = 0;

-            

-            // initialize the md buffers

-            a = 1732584193;

-            b = -271733879;

-            c = -1732584194;

-            d = 271733878;

-            

-            // variables to store previous values

-            aa = 0;

-            bb = 0;

-            cc = 0;

-            dd = 0;

-            

-            arrIndexLen = 0;            

-            arrProcessIndex = 0;

-            cleanIndex = 0;

-        }

-        

-        /** read into arr and free up used blocks of arr */

-        private function readIntoArray(input:ByteArray):void

-        {

-            var closestChunkLen:int = input.length * 8;

-            arrLen += closestChunkLen;

-            

-            /* clean up memory. if there are entries in the array that

-             * are already processed and the amount is greater than

-             * memoryBlockSize, create a new array, copy the last

-             * block into it and let the old one get picked up by

-             * GC. */

-            if ( arrProcessIndex - cleanIndex > memoryBlockSize )

-            {

-                var newarr:Array= new Array();

-                

-                /* AS Arrays in sparse arrays. arr[2002] can exist 

-                 * without values for arr[0] - arr[2001] */

-                for ( var j:int = arrProcessIndex; j < arr.length; j++ )

-                {						

-                    newarr[j] = arr[j];

-                }

-                

-                cleanIndex = arrProcessIndex;

-                arr = null;

-                arr = newarr;

-            }

-            

-            for ( var k:int = 0; k < closestChunkLen; k+=8 )

-            {

-                //discard high bytes (convert to uint)

-                arr[ int(arrIndexLen >> 5) ] |= ( input[ k / 8 ] & mask ) << ( arrIndexLen % 32 );

-                arrIndexLen += 8;

-            }

-            

-            

-        }

-        

-        private function hashRemainingChunks(bUpdate:Boolean=true):void

-        {

-            var len:int = arr.length;

-

-            /* leave a 16 word block untouched if we are called from

-             * update. This is because, padArray() can modify the last

-             * block and this modification has to happen before we

-             * compute the hash.  */

-            if ( bUpdate )

-            {

-                len -= 16;

-            }

-

-            /* don't do anything if don't have a 16 word block. */

-            if ( arrProcessIndex >= len || len - arrProcessIndex < 15 )

-            {

-                return;

-            }

-

-            

-            for ( var i:int = arrProcessIndex; i < len ; i += 16, arrProcessIndex += 16) 

-            {            	

-                // save previous values

-                aa = a;

-                bb = b;

-                cc = c;

-                dd = d;                         

-                

-                // Round 1

-                a = ff( a, b, c, d, arr[int(i+ 0)],  7, -680876936 );     // 1

-                d = ff( d, a, b, c, arr[int(i+ 1)], 12, -389564586 );     // 2

-                c = ff( c, d, a, b, arr[int(i+ 2)], 17, 606105819 );      // 3

-                b = ff( b, c, d, a, arr[int(i+ 3)], 22, -1044525330 );    // 4

-                a = ff( a, b, c, d, arr[int(i+ 4)],  7, -176418897 );     // 5

-                d = ff( d, a, b, c, arr[int(i+ 5)], 12, 1200080426 );     // 6

-                c = ff( c, d, a, b, arr[int(i+ 6)], 17, -1473231341 );    // 7

-                b = ff( b, c, d, a, arr[int(i+ 7)], 22, -45705983 );      // 8

-                a = ff( a, b, c, d, arr[int(i+ 8)],  7, 1770035416 );     // 9

-                d = ff( d, a, b, c, arr[int(i+ 9)], 12, -1958414417 );    // 10

-                c = ff( c, d, a, b, arr[int(i+10)], 17, -42063 );                 // 11

-                b = ff( b, c, d, a, arr[int(i+11)], 22, -1990404162 );    // 12

-                a = ff( a, b, c, d, arr[int(i+12)],  7, 1804603682 );     // 13

-                d = ff( d, a, b, c, arr[int(i+13)], 12, -40341101 );      // 14

-                c = ff( c, d, a, b, arr[int(i+14)], 17, -1502002290 );    // 15

-                b = ff( b, c, d, a, arr[int(i+15)], 22, 1236535329 );     // 16

-                

-                // Round 2

-                a = gg( a, b, c, d, arr[int(i+ 1)],  5, -165796510 );     // 17

-                d = gg( d, a, b, c, arr[int(i+ 6)],  9, -1069501632 );    // 18

-                c = gg( c, d, a, b, arr[int(i+11)], 14, 643717713 );      // 19

-                b = gg( b, c, d, a, arr[int(i+ 0)], 20, -373897302 );     // 20

-                a = gg( a, b, c, d, arr[int(i+ 5)],  5, -701558691 );     // 21

-                d = gg( d, a, b, c, arr[int(i+10)],  9, 38016083 );       // 22

-                c = gg( c, d, a, b, arr[int(i+15)], 14, -660478335 );     // 23

-                b = gg( b, c, d, a, arr[int(i+ 4)], 20, -405537848 );     // 24

-                a = gg( a, b, c, d, arr[int(i+ 9)],  5, 568446438 );      // 25

-                d = gg( d, a, b, c, arr[int(i+14)],  9, -1019803690 );    // 26

-                c = gg( c, d, a, b, arr[int(i+ 3)], 14, -187363961 );     // 27

-                b = gg( b, c, d, a, arr[int(i+ 8)], 20, 1163531501 );     // 28

-                a = gg( a, b, c, d, arr[int(i+13)],  5, -1444681467 );    // 29

-                d = gg( d, a, b, c, arr[int(i+ 2)],  9, -51403784 );      // 30

-                c = gg( c, d, a, b, arr[int(i+ 7)], 14, 1735328473 );     // 31

-                b = gg( b, c, d, a, arr[int(i+12)], 20, -1926607734 );    // 32

-                

-                // Round 3

-                a = hh( a, b, c, d, arr[int(i+ 5)],  4, -378558 );        // 33

-                d = hh( d, a, b, c, arr[int(i+ 8)], 11, -2022574463 );    // 34

-                c = hh( c, d, a, b, arr[int(i+11)], 16, 1839030562 );     // 35

-                b = hh( b, c, d, a, arr[int(i+14)], 23, -35309556 );      // 36

-                a = hh( a, b, c, d, arr[int(i+ 1)],  4, -1530992060 );    // 37

-                d = hh( d, a, b, c, arr[int(i+ 4)], 11, 1272893353 );     // 38

-                c = hh( c, d, a, b, arr[int(i+ 7)], 16, -155497632 );     // 39

-                b = hh( b, c, d, a, arr[int(i+10)], 23, -1094730640 );    // 40

-                a = hh( a, b, c, d, arr[int(i+13)],  4, 681279174 );      // 41

-                d = hh( d, a, b, c, arr[int(i+ 0)], 11, -358537222 );     // 42

-                c = hh( c, d, a, b, arr[int(i+ 3)], 16, -722521979 );     // 43

-                b = hh( b, c, d, a, arr[int(i+ 6)], 23, 76029189 );       // 44

-                a = hh( a, b, c, d, arr[int(i+ 9)],  4, -640364487 );     // 45

-                d = hh( d, a, b, c, arr[int(i+12)], 11, -421815835 );     // 46

-                c = hh( c, d, a, b, arr[int(i+15)], 16, 530742520 );      // 47

-                b = hh( b, c, d, a, arr[int(i+ 2)], 23, -995338651 );     // 48

-                

-                // Round 4

-                a = ii( a, b, c, d, arr[int(i+ 0)],  6, -198630844 );     // 49

-                d = ii( d, a, b, c, arr[int(i+ 7)], 10, 1126891415 );     // 50

-                c = ii( c, d, a, b, arr[int(i+14)], 15, -1416354905 );    // 51

-                b = ii( b, c, d, a, arr[int(i+ 5)], 21, -57434055 );      // 52

-                a = ii( a, b, c, d, arr[int(i+12)],  6, 1700485571 );     // 53

-                d = ii( d, a, b, c, arr[int(i+ 3)], 10, -1894986606 );    // 54

-                c = ii( c, d, a, b, arr[int(i+10)], 15, -1051523 );       // 55

-                b = ii( b, c, d, a, arr[int(i+ 1)], 21, -2054922799 );    // 56

-                a = ii( a, b, c, d, arr[int(i+ 8)],  6, 1873313359 );     // 57

-                d = ii( d, a, b, c, arr[int(i+15)], 10, -30611744 );      // 58

-                c = ii( c, d, a, b, arr[int(i+ 6)], 15, -1560198380 );    // 59

-                b = ii( b, c, d, a, arr[int(i+13)], 21, 1309151649 );     // 60

-                a = ii( a, b, c, d, arr[int(i+ 4)],  6, -145523070 );     // 61

-                d = ii( d, a, b, c, arr[int(i+11)], 10, -1120210379 );    // 62

-                c = ii( c, d, a, b, arr[int(i+ 2)], 15, 718787259 );      // 63

-                b = ii( b, c, d, a, arr[int(i+ 9)], 21, -343485551 );     // 64

-                

-                a += aa;

-                b += bb;

-                c += cc;

-                d += dd;

-                

-            }

-            

-        }

-        

-        private function padArray(len:int):void

-        {	 		

-            arr[ int(len >> 5) ] |= 0x80 << ( len % 32 );

-            arr[ int(( ( ( len + 64 ) >>> 9 ) << 4 ) + 14) ] = len;

-            arrLen = arr.length;

-        }  

-        

-        /* Code below same as com.adobe.crypto.MD5 */ 

-        

-        /**

-         * Auxiliary function f as defined in RFC

-         */

-        private static function f( x:int, y:int, z:int ):int {

-            return ( x & y ) | ( (~x) & z );

-        }

-        

-        /**

-         * Auxiliary function g as defined in RFC

-         */

-        private static function g( x:int, y:int, z:int ):int {

-            return ( x & z ) | ( y & (~z) );

-        }

-        

-        /**

-         * Auxiliary function h as defined in RFC

-         */

-        private static function h( x:int, y:int, z:int ):int {

-            return x ^ y ^ z;

-        }

-        

-        /**

-         * Auxiliary function i as defined in RFC

-         */

-        private static function i( x:int, y:int, z:int ):int {

-            return y ^ ( x | (~z) );

-        }

-        

-        /**

-         * A generic transformation function.  The logic of ff, gg, hh, and

-         * ii are all the same, minus the function used, so pull that logic

-         * out and simplify the method bodies for the transoformation functions.

-         */

-        private static function transform( func:Function, a:int, b:int, c:int, d:int, x:int, s:int, t:int):int {

-            var tmp:int = a + int( func( b, c, d ) ) + x + t;

-            return IntUtil.rol( tmp, s ) +  b;

-        }

-        

-        /**

-         * ff transformation function

-         */

-        private static function ff ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {

-            return transform( f, a, b, c, d, x, s, t );

-        }

-        

-        /**

-         * gg transformation function

-         */

-        private static function gg ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {

-            return transform( g, a, b, c, d, x, s, t );

-        }

-        

-        /**

-         * hh transformation function

-         */

-        private static function hh ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {

-            return transform( h, a, b, c, d, x, s, t );

-        }

-        

-        /**

-         * ii transformation function

-         */

-        private static function ii ( a:int, b:int, c:int, d:int, x:int, s:int, t:int ):int {

-            return transform( i, a, b, c, d, x, s, t );

-        }

-        

-    }

-}
\ No newline at end of file
diff --git a/vendors/uploadify/com/adobe/crypto/SHA1.as b/vendors/uploadify/com/adobe/crypto/SHA1.as
deleted file mode 100644
index 952f3c70f..000000000
--- a/vendors/uploadify/com/adobe/crypto/SHA1.as
+++ /dev/null
@@ -1,271 +0,0 @@
-/*

-  Copyright (c) 2008, Adobe Systems Incorporated

-  All rights reserved.

-

-  Redistribution and use in source and binary forms, with or without 

-  modification, are permitted provided that the following conditions are

-  met:

-

-  * Redistributions of source code must retain the above copyright notice, 

-    this list of conditions and the following disclaimer.

-  

-  * Redistributions in binary form must reproduce the above copyright

-    notice, this list of conditions and the following disclaimer in the 

-    documentation and/or other materials provided with the distribution.

-  

-  * Neither the name of Adobe Systems Incorporated nor the names of its 

-    contributors may be used to endorse or promote products derived from 

-    this software without specific prior written permission.

-

-  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

-  IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

-  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

-  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 

-  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

-  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

-  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

-  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF

-  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING

-  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

-  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

-*/

-

-package com.adobe.crypto

-{

-	import com.adobe.utils.IntUtil;

-	import flash.utils.ByteArray;

-	import mx.utils.Base64Encoder;

-	

-	/**

-	 *  US Secure Hash Algorithm 1 (SHA1)

-	 *

-	 *  Implementation based on algorithm description at 

-	 *  http://www.faqs.org/rfcs/rfc3174.html

-	 */

-	public class SHA1

-	{

-		public static var digest:ByteArray;

-		

-		/**

-		 *  Performs the SHA1 hash algorithm on a string.

-		 *

-		 *  @param s		The string to hash

-		 *  @return			A string containing the hash value of s

-		 *  @langversion	ActionScript 3.0

-		 *  @playerversion	9.0

-		 *  @tiptext

-		 */

-		public static function hash( s:String ):String

-		{

-			var blocks:Array = createBlocksFromString( s );

-			var byteArray:ByteArray = hashBlocks( blocks );

-			

-			return IntUtil.toHex( byteArray.readInt(), true )

-					+ IntUtil.toHex( byteArray.readInt(), true )

-					+ IntUtil.toHex( byteArray.readInt(), true )

-					+ IntUtil.toHex( byteArray.readInt(), true )

-					+ IntUtil.toHex( byteArray.readInt(), true );

-		}

-		

-		/**

-		 *  Performs the SHA1 hash algorithm on a ByteArray.

-		 *

-		 *  @param data		The ByteArray data to hash

-		 *  @return			A string containing the hash value of data

-		 *  @langversion	ActionScript 3.0

-		 *  @playerversion	9.0

-		 */

-		public static function hashBytes( data:ByteArray ):String

-		{

-			var blocks:Array = SHA1.createBlocksFromByteArray( data );

-			var byteArray:ByteArray = hashBlocks(blocks);

-			

-			return IntUtil.toHex( byteArray.readInt(), true )

-					+ IntUtil.toHex( byteArray.readInt(), true )

-					+ IntUtil.toHex( byteArray.readInt(), true )

-					+ IntUtil.toHex( byteArray.readInt(), true )

-					+ IntUtil.toHex( byteArray.readInt(), true );

-		}

-		

-		/**

-		 *  Performs the SHA1 hash algorithm on a string, then does

-		 *  Base64 encoding on the result.

-		 *

-		 *  @param s		The string to hash

-		 *  @return			The base64 encoded hash value of s

-		 *  @langversion	ActionScript 3.0

-		 *  @playerversion	9.0

-		 *  @tiptext

-		 */

-		public static function hashToBase64( s:String ):String

-		{

-			var blocks:Array = SHA1.createBlocksFromString( s );

-			var byteArray:ByteArray = hashBlocks(blocks);

-

-			// ByteArray.toString() returns the contents as a UTF-8 string,

-			// which we can't use because certain byte sequences might trigger

-			// a UTF-8 conversion.  Instead, we convert the bytes to characters

-			// one by one.

-			var charsInByteArray:String = "";

-			byteArray.position = 0;

-			for (var j:int = 0; j < byteArray.length; j++)

-			{

-				var byte:uint = byteArray.readUnsignedByte();

-				charsInByteArray += String.fromCharCode(byte);

-			}

-

-			var encoder:Base64Encoder = new Base64Encoder();

-			encoder.encode(charsInByteArray);

-			return encoder.flush();

-		}

-		

-		private static function hashBlocks( blocks:Array ):ByteArray

-		{

-			// initialize the h's

-			var h0:int = 0x67452301;

-			var h1:int = 0xefcdab89;

-			var h2:int = 0x98badcfe;

-			var h3:int = 0x10325476;

-			var h4:int = 0xc3d2e1f0;

-			

-			var len:int = blocks.length;

-			var w:Array = new Array( 80 );

-			

-			// loop over all of the blocks

-			for ( var i:int = 0; i < len; i += 16 ) {

-			

-				// 6.1.c

-				var a:int = h0;

-				var b:int = h1;

-				var c:int = h2;

-				var d:int = h3;

-				var e:int = h4;

-				

-				// 80 steps to process each block

-				// TODO: unroll for faster execution, or 4 loops of

-				// 20 each to avoid the k and f function calls

-				for ( var t:int = 0; t < 80; t++ ) {

-					

-					if ( t < 16 ) {

-						// 6.1.a

-						w[ t ] = blocks[ i + t ];

-					} else {

-						// 6.1.b

-						w[ t ] = IntUtil.rol( w[ t - 3 ] ^ w[ t - 8 ] ^ w[ t - 14 ] ^ w[ t - 16 ], 1 );

-					}

-					

-					// 6.1.d

-					var temp:int = IntUtil.rol( a, 5 ) + f( t, b, c, d ) + e + int( w[ t ] ) + k( t );

-					

-					e = d;

-					d = c;

-					c = IntUtil.rol( b, 30 );

-					b = a;

-					a = temp;

-				}

-				

-				// 6.1.e

-				h0 += a;

-				h1 += b;

-				h2 += c;

-				h3 += d;

-				h4 += e;		

-			}

-			

-			var byteArray:ByteArray = new ByteArray();

-			byteArray.writeInt(h0);

-			byteArray.writeInt(h1);

-			byteArray.writeInt(h2);

-			byteArray.writeInt(h3);

-			byteArray.writeInt(h4);

-			byteArray.position = 0;

-			

-			digest = new ByteArray();

-			digest.writeBytes(byteArray);

-			digest.position = 0;

-			return byteArray;

-		}

-

-		/**

-		 *  Performs the logical function based on t

-		 */

-		private static function f( t:int, b:int, c:int, d:int ):int {

-			if ( t < 20 ) {

-				return ( b & c ) | ( ~b & d );

-			} else if ( t < 40 ) {

-				return b ^ c ^ d;

-			} else if ( t < 60 ) {

-				return ( b & c ) | ( b & d ) | ( c & d );

-			}

-			return b ^ c ^ d;

-		}

-		

-		/**

-		 *  Determines the constant value based on t

-		 */

-		private static function k( t:int ):int {

-			if ( t < 20 ) {

-				return 0x5a827999;

-			} else if ( t < 40 ) {

-				return 0x6ed9eba1;

-			} else if ( t < 60 ) {

-				return 0x8f1bbcdc;

-			}

-			return 0xca62c1d6;

-		}

-					

-		/**

-		 *  Converts a ByteArray to a sequence of 16-word blocks

-		 *  that we'll do the processing on.  Appends padding

-		 *  and length in the process.

-		 *

-		 *  @param data		The data to split into blocks

-		 *  @return			An array containing the blocks into which data was split

-		 */

-		private static function createBlocksFromByteArray( data:ByteArray ):Array

-		{

-			var oldPosition:int = data.position;

-			data.position = 0;

-			

-			var blocks:Array = new Array();

-			var len:int = data.length * 8;

-			var mask:int = 0xFF; // ignore hi byte of characters > 0xFF

-			for( var i:int = 0; i < len; i += 8 )

-			{

-				blocks[ i >> 5 ] |= ( data.readByte() & mask ) << ( 24 - i % 32 );

-			}

-			

-			// append padding and length

-			blocks[ len >> 5 ] |= 0x80 << ( 24 - len % 32 );

-			blocks[ ( ( ( len + 64 ) >> 9 ) << 4 ) + 15 ] = len;

-			

-			data.position = oldPosition;

-			

-			return blocks;

-		}

-					

-		/**

-		 *  Converts a string to a sequence of 16-word blocks

-		 *  that we'll do the processing on.  Appends padding

-		 *  and length in the process.

-		 *

-		 *  @param s	The string to split into blocks

-		 *  @return		An array containing the blocks that s was split into.

-		 */

-		private static function createBlocksFromString( s:String ):Array

-		{

-			var blocks:Array = new Array();

-			var len:int = s.length * 8;

-			var mask:int = 0xFF; // ignore hi byte of characters > 0xFF

-			for( var i:int = 0; i < len; i += 8 ) {

-				blocks[ i >> 5 ] |= ( s.charCodeAt( i / 8 ) & mask ) << ( 24 - i % 32 );

-			}

-			

-			// append padding and length

-			blocks[ len >> 5 ] |= 0x80 << ( 24 - len % 32 );

-			blocks[ ( ( ( len + 64 ) >> 9 ) << 4 ) + 15 ] = len;

-			return blocks;

-		}

-		

-	}

-}

diff --git a/vendors/uploadify/com/adobe/crypto/SHA224.as b/vendors/uploadify/com/adobe/crypto/SHA224.as
deleted file mode 100644
index ee1545373..000000000
--- a/vendors/uploadify/com/adobe/crypto/SHA224.as
+++ /dev/null
@@ -1,257 +0,0 @@
-/*
-  Copyright (c) 2008, Adobe Systems Incorporated
-  All rights reserved.
-
-  Redistribution and use in source and binary forms, with or without 
-  modification, are permitted provided that the following conditions are
-  met:
-
-  * Redistributions of source code must retain the above copyright notice, 
-    this list of conditions and the following disclaimer.
-  
-  * Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the 
-    documentation and/or other materials provided with the distribution.
-  
-  * Neither the name of Adobe Systems Incorporated nor the names of its 
-    contributors may be used to endorse or promote products derived from 
-    this software without specific prior written permission.
-
-  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
-  IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
-  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 
-  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*/
-
-package com.adobe.crypto
-{
-	import com.adobe.utils.IntUtil;
-	import flash.utils.ByteArray;
-	import mx.utils.Base64Encoder;
-	
-	/**
-	 * The SHA-224 algorithm
-	 * 
-	 * @see http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
-	 */
-	public class SHA224
-	{
-		public static var digest:ByteArray;
-		
-		/**
-		 *  Performs the SHA224 hash algorithm on a string.
-		 *
-		 *  @param s		The string to hash
-		 *  @return			A string containing the hash value of s
-		 *  @langversion	ActionScript 3.0
-		 *  @playerversion	9.0
-		 *  @tiptext
-		 */
-		public static function hash( s:String ):String {
-			var blocks:Array = createBlocksFromString( s );
-			var byteArray:ByteArray = hashBlocks( blocks );
-			return IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true );
-		}
-		
-		/**
-		 *  Performs the SHA224 hash algorithm on a ByteArray.
-		 *
-		 *  @param data		The ByteArray data to hash
-		 *  @return			A string containing the hash value of data
-		 *  @langversion	ActionScript 3.0
-		 *  @playerversion	9.0
-		 */
-		public static function hashBytes( data:ByteArray ):String
-		{
-			var blocks:Array = createBlocksFromByteArray( data );
-			var byteArray:ByteArray = hashBlocks(blocks);
-			return IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true );
-		}
-		
-		/**
-		 *  Performs the SHA224 hash algorithm on a string, then does
-		 *  Base64 encoding on the result.
-		 *
-		 *  @param s		The string to hash
-		 *  @return			The base64 encoded hash value of s
-		 *  @langversion	ActionScript 3.0
-		 *  @playerversion	9.0
-		 *  @tiptext
-		 */
-		public static function hashToBase64( s:String ):String
-		{
-			var blocks:Array = createBlocksFromString( s );
-			var byteArray:ByteArray = hashBlocks(blocks);
-
-			// ByteArray.toString() returns the contents as a UTF-8 string,
-			// which we can't use because certain byte sequences might trigger
-			// a UTF-8 conversion.  Instead, we convert the bytes to characters
-			// one by one.
-			var charsInByteArray:String = "";
-			byteArray.position = 0;
-			for (var j:int = 0; j < byteArray.length; j++)
-			{
-				var byte:uint = byteArray.readUnsignedByte();
-				charsInByteArray += String.fromCharCode(byte);
-			}
-
-			var encoder:Base64Encoder = new Base64Encoder();
-			encoder.encode(charsInByteArray);
-			return encoder.flush();
-		}
-		
-		private static function hashBlocks( blocks:Array ):ByteArray {
-			var h0:int = 0xc1059ed8;
-			var h1:int = 0x367cd507;
-			var h2:int = 0x3070dd17;
-			var h3:int = 0xf70e5939;
-			var h4:int = 0xffc00b31;
-			var h5:int = 0x68581511;
-			var h6:int = 0x64f98fa7;
-			var h7:int = 0xbefa4fa4;
-			
-			var k:Array = new Array(0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2);
-			
-			var len:int = blocks.length;
-			var w:Array = new Array();
-			
-			// loop over all of the blocks
-			for ( var i:int = 0; i < len; i += 16 ) {
-				
-				var a:int = h0;
-				var b:int = h1;
-				var c:int = h2;
-				var d:int = h3;
-				var e:int = h4;
-				var f:int = h5;
-				var g:int = h6;
-				var h:int = h7;
-				
-				for(var t:int = 0; t < 64; t++) {
-					
-					if ( t < 16 ) {
-						w[t] = blocks[ i + t ];
-						if(isNaN(w[t])) { w[t] = 0; }
-					} else {
-						var ws0:int = IntUtil.ror(w[t-15], 7) ^ IntUtil.ror(w[t-15], 18) ^ (w[t-15] >>> 3);
-						var ws1:int = IntUtil.ror(w[t-2], 17) ^ IntUtil.ror(w[t-2], 19) ^ (w[t-2] >>> 10);
-						w[t] = w[t-16] + ws0 + w[t-7] + ws1;
-					}
-					
-					var s0:int = IntUtil.ror(a, 2) ^ IntUtil.ror(a, 13) ^ IntUtil.ror(a, 22);
-					var maj:int = (a & b) ^ (a & c) ^ (b & c);
-					var t2:int = s0 + maj;
-					var s1:int = IntUtil.ror(e, 6) ^ IntUtil.ror(e, 11) ^ IntUtil.ror(e, 25);
-					var ch:int = (e & f) ^ ((~e) & g);
-					var t1:int = h + s1 + ch + k[t] + w[t];
-					
-					h = g;
-					g = f;
-					f = e;
-					e = d + t1;
-					d = c;
-					c = b;
-					b = a;
-					a = t1 + t2;
-				}
-					
-				//Add this chunk's hash to result so far:
-				h0 += a;
-				h1 += b;
-				h2 += c;
-				h3 += d;
-				h4 += e;
-				h5 += f;
-				h6 += g;
-				h7 += h;
-			}
-			
-			var byteArray:ByteArray = new ByteArray();
-			byteArray.writeInt(h0);
-			byteArray.writeInt(h1);
-			byteArray.writeInt(h2);
-			byteArray.writeInt(h3);
-			byteArray.writeInt(h4);
-			byteArray.writeInt(h5);
-			byteArray.writeInt(h6);
-			byteArray.position = 0;
-			
-			digest = new ByteArray();
-			digest.writeBytes(byteArray);
-			digest.position = 0;
-			return byteArray;
-		}
-		
-		/**
-		 *  Converts a ByteArray to a sequence of 16-word blocks
-		 *  that we'll do the processing on.  Appends padding
-		 *  and length in the process.
-		 *
-		 *  @param data		The data to split into blocks
-		 *  @return			An array containing the blocks into which data was split
-		 */
-		private static function createBlocksFromByteArray( data:ByteArray ):Array
-		{
-			var oldPosition:int = data.position;
-			data.position = 0;
-			
-			var blocks:Array = new Array();
-			var len:int = data.length * 8;
-			var mask:int = 0xFF; // ignore hi byte of characters > 0xFF
-			for( var i:int = 0; i < len; i += 8 )
-			{
-				blocks[ i >> 5 ] |= ( data.readByte() & mask ) << ( 24 - i % 32 );
-			}
-			
-			// append padding and length
-			blocks[ len >> 5 ] |= 0x80 << ( 24 - len % 32 );
-			blocks[ ( ( ( len + 64 ) >> 9 ) << 4 ) + 15 ] = len;
-			
-			data.position = oldPosition;
-			
-			return blocks;
-		}
-					
-		/**
-		 *  Converts a string to a sequence of 16-word blocks
-		 *  that we'll do the processing on.  Appends padding
-		 *  and length in the process.
-		 *
-		 *  @param s	The string to split into blocks
-		 *  @return		An array containing the blocks that s was split into.
-		 */
-		private static function createBlocksFromString( s:String ):Array
-		{
-			var blocks:Array = new Array();
-			var len:int = s.length * 8;
-			var mask:int = 0xFF; // ignore hi byte of characters > 0xFF
-			for( var i:int = 0; i < len; i += 8 ) {
-				blocks[ i >> 5 ] |= ( s.charCodeAt( i / 8 ) & mask ) << ( 24 - i % 32 );
-			}
-			
-			// append padding and length
-			blocks[ len >> 5 ] |= 0x80 << ( 24 - len % 32 );
-			blocks[ ( ( ( len + 64 ) >> 9 ) << 4 ) + 15 ] = len;
-			return blocks;
-		}
-	}
-}
diff --git a/vendors/uploadify/com/adobe/crypto/SHA256.as b/vendors/uploadify/com/adobe/crypto/SHA256.as
deleted file mode 100644
index 09a2ba23d..000000000
--- a/vendors/uploadify/com/adobe/crypto/SHA256.as
+++ /dev/null
@@ -1,261 +0,0 @@
-/*
-  Copyright (c) 2008, Adobe Systems Incorporated
-  All rights reserved.
-
-  Redistribution and use in source and binary forms, with or without 
-  modification, are permitted provided that the following conditions are
-  met:
-
-  * Redistributions of source code must retain the above copyright notice, 
-    this list of conditions and the following disclaimer.
-  
-  * Redistributions in binary form must reproduce the above copyright
-    notice, this list of conditions and the following disclaimer in the 
-    documentation and/or other materials provided with the distribution.
-  
-  * Neither the name of Adobe Systems Incorporated nor the names of its 
-    contributors may be used to endorse or promote products derived from 
-    this software without specific prior written permission.
-
-  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
-  IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
-  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 
-  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
-  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
-  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
-  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
-  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-*/
-
-package com.adobe.crypto
-{
-	import com.adobe.utils.IntUtil;
-	import flash.utils.ByteArray;
-	import mx.utils.Base64Encoder;
-	
-	/**
-	 * The SHA-256 algorithm
-	 * 
-	 * @see http://csrc.nist.gov/publications/fips/fips180-2/fips180-2withchangenotice.pdf
-	 */
-	public class SHA256
-	{
-		public static var digest:ByteArray;
-		/**
-		 *  Performs the SHA256 hash algorithm on a string.
-		 *
-		 *  @param s		The string to hash
-		 *  @return			A string containing the hash value of s
-		 *  @langversion	ActionScript 3.0
-		 *  @playerversion	9.0
-		 *  @tiptext
-		 */
-		public static function hash( s:String ):String {
-			var blocks:Array = createBlocksFromString( s );
-			var byteArray:ByteArray = hashBlocks( blocks );
-			
-			return IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true );
-		}
-		
-		/**
-		 *  Performs the SHA256 hash algorithm on a ByteArray.
-		 *
-		 *  @param data		The ByteArray data to hash
-		 *  @return			A string containing the hash value of data
-		 *  @langversion	ActionScript 3.0
-		 *  @playerversion	9.0
-		 */
-		public static function hashBytes( data:ByteArray ):String
-		{
-			var blocks:Array = createBlocksFromByteArray( data );
-			var byteArray:ByteArray = hashBlocks(blocks);
-			
-			return IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true )
-					+ IntUtil.toHex( byteArray.readInt(), true );
-		}
-		
-		/**
-		 *  Performs the SHA256 hash algorithm on a string, then does
-		 *  Base64 encoding on the result.
-		 *
-		 *  @param s		The string to hash
-		 *  @return			The base64 encoded hash value of s
-		 *  @langversion	ActionScript 3.0
-		 *  @playerversion	9.0
-		 *  @tiptext
-		 */
-		public static function hashToBase64( s:String ):String
-		{
-			var blocks:Array = createBlocksFromString( s );
-			var byteArray:ByteArray = hashBlocks(blocks);
-
-			// ByteArray.toString() returns the contents as a UTF-8 string,
-			// which we can't use because certain byte sequences might trigger
-			// a UTF-8 conversion.  Instead, we convert the bytes to characters
-			// one by one.
-			var charsInByteArray:String = "";
-			byteArray.position = 0;
-			for (var j:int = 0; j < byteArray.length; j++)
-			{
-				var byte:uint = byteArray.readUnsignedByte();
-				charsInByteArray += String.fromCharCode(byte);
-			}
-
-			var encoder:Base64Encoder = new Base64Encoder();
-			encoder.encode(charsInByteArray);
-			return encoder.flush();
-		}
-		
-		private static function hashBlocks( blocks:Array ):ByteArray {
-			var h0:int = 0x6a09e667;
-			var h1:int = 0xbb67ae85;
-			var h2:int = 0x3c6ef372;
-			var h3:int = 0xa54ff53a;
-			var h4:int = 0x510e527f;
-			var h5:int = 0x9b05688c;
-			var h6:int = 0x1f83d9ab;
-			var h7:int = 0x5be0cd19;
-			
-			var k:Array = new Array(0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5, 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174, 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da, 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967, 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85, 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070, 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3, 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2);
-			
-			var len:int = blocks.length;
-			var w:Array = new Array( 64 );
-			
-			// loop over all of the blocks
-			for ( var i:int = 0; i < len; i += 16 ) {
-				
-				var a:int = h0;
-				var b:int = h1;
-				var c:int = h2;
-				var d:int = h3;
-				var e:int = h4;
-				var f:int = h5;
-				var g:int = h6;
-				var h:int = h7;
-				
-				for(var t:int = 0; t < 64; t++) {
-					
-					if ( t < 16 ) {
-						w[t] = blocks[ i + t ];
-						if(isNaN(w[t])) { w[t] = 0; }
-					} else {
-						var ws0:int = IntUtil.ror(w[t-15], 7) ^ IntUtil.ror(w[t-15], 18) ^ (w[t-15] >>> 3);
-						var ws1:int = IntUtil.ror(w[t-2], 17) ^ IntUtil.ror(w[t-2], 19) ^ (w[t-2] >>> 10);
-						w[t] = w[t-16] + ws0 + w[t-7] + ws1;
-					}
-					
-					var s0:int = IntUtil.ror(a, 2) ^ IntUtil.ror(a, 13) ^ IntUtil.ror(a, 22);
-					var maj:int = (a & b) ^ (a & c) ^ (b & c);
-					var t2:int = s0 + maj;
-					var s1:int = IntUtil.ror(e, 6) ^ IntUtil.ror(e, 11) ^ IntUtil.ror(e, 25);
-					var ch:int = (e & f) ^ ((~e) & g);
-					var t1:int = h + s1 + ch + k[t] + w[t];
-					
-					h = g;
-					g = f;
-					f = e;
-					e = d + t1;
-					d = c;
-					c = b;
-					b = a;
-					a = t1 + t2;
-				}
-					
-				//Add this chunk's hash to result so far:
-				h0 += a;
-				h1 += b;
-				h2 += c;
-				h3 += d;
-				h4 += e;
-				h5 += f;
-				h6 += g;
-				h7 += h;
-			}
-			
-			var byteArray:ByteArray = new ByteArray();
-			byteArray.writeInt(h0);
-			byteArray.writeInt(h1);
-			byteArray.writeInt(h2);
-			byteArray.writeInt(h3);
-			byteArray.writeInt(h4);
-			byteArray.writeInt(h5);
-			byteArray.writeInt(h6);
-			byteArray.writeInt(h7);
-			byteArray.position = 0;
-			
-			digest = new ByteArray();
-			digest.writeBytes(byteArray);
-			digest.position = 0;
-			return byteArray;
-		}
-		
-		/**
-		 *  Converts a ByteArray to a sequence of 16-word blocks
-		 *  that we'll do the processing on.  Appends padding
-		 *  and length in the process.
-		 *
-		 *  @param data		The data to split into blocks
-		 *  @return			An array containing the blocks into which data was split
-		 */
-		private static function createBlocksFromByteArray( data:ByteArray ):Array
-		{
-			var oldPosition:int = data.position;
-			data.position = 0;
-			
-			var blocks:Array = new Array();
-			var len:int = data.length * 8;
-			var mask:int = 0xFF; // ignore hi byte of characters > 0xFF
-			for( var i:int = 0; i < len; i += 8 )
-			{
-				blocks[ i >> 5 ] |= ( data.readByte() & mask ) << ( 24 - i % 32 );
-			}
-			
-			// append padding and length
-			blocks[ len >> 5 ] |= 0x80 << ( 24 - len % 32 );
-			blocks[ ( ( ( len + 64 ) >> 9 ) << 4 ) + 15 ] = len;
-			
-			data.position = oldPosition;
-			
-			return blocks;
-		}
-					
-		/**
-		 *  Converts a string to a sequence of 16-word blocks
-		 *  that we'll do the processing on.  Appends padding
-		 *  and length in the process.
-		 *
-		 *  @param s	The string to split into blocks
-		 *  @return		An array containing the blocks that s was split into.
-		 */
-		private static function createBlocksFromString( s:String ):Array
-		{
-			var blocks:Array = new Array();
-			var len:int = s.length * 8;
-			var mask:int = 0xFF; // ignore hi byte of characters > 0xFF
-			for( var i:int = 0; i < len; i += 8 ) {
-				blocks[ i >> 5 ] |= ( s.charCodeAt( i / 8 ) & mask ) << ( 24 - i % 32 );
-			}
-			
-			// append padding and length
-			blocks[ len >> 5 ] |= 0x80 << ( 24 - len % 32 );
-			blocks[ ( ( ( len + 64 ) >> 9 ) << 4 ) + 15 ] = len;
-			return blocks;
-		}
-	}
-}
diff --git a/vendors/uploadify/com/adobe/crypto/WSSEUsernameToken.as b/vendors/uploadify/com/adobe/crypto/WSSEUsernameToken.as
deleted file mode 100644
index 92bbba6dc..000000000
--- a/vendors/uploadify/com/adobe/crypto/WSSEUsernameToken.as
+++ /dev/null
@@ -1,114 +0,0 @@
-/*

-  Copyright (c) 2008, Adobe Systems Incorporated

-  All rights reserved.

-

-  Redistribution and use in source and binary forms, with or without 

-  modification, are permitted provided that the following conditions are

-  met:

-

-  * Redistributions of source code must retain the above copyright notice, 

-    this list of conditions and the following disclaimer.

-  

-  * Redistributions in binary form must reproduce the above copyright

-    notice, this list of conditions and the following disclaimer in the 

-    documentation and/or other materials provided with the distribution.

-  

-  * Neither the name of Adobe Systems Incorporated nor the names of its 

-    contributors may be used to endorse or promote products derived from 

-    this software without specific prior written permission.

-

-  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

-  IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

-  THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

-  PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 

-  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,

-  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,

-  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR

-  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF

-  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING

-  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS

-  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

-*/

-

-package com.adobe.crypto

-{

-	import mx.formatters.DateFormatter;

-	import mx.utils.Base64Encoder;

-	

-	/**

-	 * Web Services Security Username Token

-	 *

-	 * Implementation based on algorithm description at 

-	 * http://www.oasis-open.org/committees/wss/documents/WSS-Username-02-0223-merged.pdf

-	 */

-	public class WSSEUsernameToken

-	{

-		/**

-		 * Generates a WSSE Username Token.

-		 *

-		 * @param username The username

-		 * @param password The password

-		 * @param nonce A cryptographically random nonce (if null, the nonce

-		 * will be generated)

-		 * @param timestamp The time at which the token is generated (if null,

-		 * the time will be set to the moment of execution)

-		 * @return The generated token

-		 * @langversion ActionScript 3.0

-		 * @playerversion Flash 9.0

-		 * @tiptext

-		 */

-		public static function getUsernameToken(username:String, password:String, nonce:String=null, timestamp:Date=null):String

-		{

-			if (nonce == null)

-			{

-				nonce = generateNonce();

-			}

-			nonce = base64Encode(nonce);

-		

-			var created:String = generateTimestamp(timestamp);

-		

-			var password64:String = getBase64Digest(nonce,

-				created,

-				password);

-		

-			var token:String = new String("UsernameToken Username=\"");

-			token += username + "\", " +

-					 "PasswordDigest=\"" + password64 + "\", " +

-					 "Nonce=\"" + nonce + "\", " +

-					 "Created=\"" + created + "\"";

-			return token;

-		}

-		

-		private static function generateNonce():String

-		{

-			// Math.random returns a Number between 0 and 1.  We don't want our

-			// nonce to contain invalid characters (e.g. the period) so we

-			// strip them out before returning the result.

-			var s:String =  Math.random().toString();

-			return s.replace(".", "");

-		}

-		

-		internal static function base64Encode(s:String):String

-		{

-			var encoder:Base64Encoder = new Base64Encoder();

-			encoder.encode(s);

-			return encoder.flush();

-		}

-		

-		internal static function generateTimestamp(timestamp:Date):String

-		{

-			if (timestamp == null)

-			{

-				timestamp = new Date();

-			}

-			var dateFormatter:DateFormatter = new DateFormatter();

-			dateFormatter.formatString = "YYYY-MM-DDTJJ:NN:SS"

-			return dateFormatter.format(timestamp) + "Z";

-		}

-		

-		internal static function getBase64Digest(nonce:String, created:String, password:String):String

-		{

-			return SHA1.hashToBase64(nonce + created + password);

-		}

-	}

-}
\ No newline at end of file