// RSA, a suite of routines for performing RSA public-key computations in
// JavaScript.
//
// Requires BigInt.js and Barrett.js.
//
// Copyright 1998-2005 David Shapiro.
//
// You may use, re-use, abuse, copy, and modify this code to your liking, but
// please keep this header.
//
// Thanks!
//
// Dave Shapiro
// dave@ohdave.com

function RSAKeyPair(encryptionExponent, decryptionExponent, modulus)
{
	this.e = biFromHex(encryptionExponent);
	this.d = biFromHex(decryptionExponent);
	this.m = biFromHex(modulus);

	// We can do two bytes per digit, so
	// chunkSize = 2 * (number of digits in modulus - 1).
	// Since biHighIndex returns the high index, not the number of digits, 1 has
	// already been subtracted.
	//this.chunkSize = 2 * biHighIndex(this.m);

	////////////////////////////////// TYF
    	this.digitSize = 2 * biHighIndex(this.m) + 2;
	this.chunkSize = this.digitSize - 11; // maximum, anything lower is fine
	////////////////////////////////// TYF

	this.radix = 16;
	this.barrett = new BarrettMu(this.m);
}

function twoDigit(n)
{
	return (n < 10 ? "0" : "") + String(n);
}

function encryptedString(key, s)
// Altered by Rob Saunders (rob@robsaunders.net). New routine pads the
// string after it has been converted to an array. This fixes an
// incompatibility with Flash MX's ActionScript.
// Altered by Tang Yu Feng for interoperability with Microsoft's
// RSACryptoServiceProvider implementation.
{
	////////////////////////////////// TYF
	if (key.chunkSize > key.digitSize - 11)
	{
	    return "Error";
	}
	////////////////////////////////// TYF


	var a = new Array();
	var sl = s.length;

	var i = 0;
	var j = 0;
	while (i < sl) {
		//a[i] = s.charCodeAt(i);
		var c = s.charCodeAt(i);
		if (c > 0x10000){

            // 4 bytes

            a[j] = 0xF0 | ((c & 0x1C0000) >>> 18);
            j++;
            a[j] = 0x80 | ((c & 0x3F000) >>> 12);
            j++;
            a[j] = 0x80 | ((c & 0xFC0) >>> 6);
            j++;
            a[j] = 0x80 | (c & 0x3F);
            
            //j = j + 4;

        }else if (c > 0x800){

             // 3 bytes
        	 
             a[j] = 0xE0 | ((c & 0xF000) >>> 12);
             j++;
             a[j] = 0x80 | ((c & 0xFC0) >>> 6);
             j++;
             a[j] = 0x80 | (c & 0x3F);
             j++;             

        }else if (c > 0x80){

           // 2 bytes

            a[j] = 0xC0 | ((c & 0x7C0) >>> 6);
            j++;
            a[j] = 0x80 | (c & 0x3F);
            j++;

       }else{

            // 1 byte

            a[j] = c;
            j++;
        }

		
		i++;
	}

	//while (a.length % key.chunkSize != 0) {
	//	a[i++] = 0;
	//}

	var al = a.length;
	var result = "";
	var j, k, block;
	for (i = 0; i < al; i += key.chunkSize) {
		block = new BigInt();
		j = 0;

		//for (k = i; k < i + key.chunkSize; ++j) {
		//	block.digits[j] = a[k++];
		//	block.digits[j] += a[k++] << 8;
		//}

		////////////////////////////////// TYF
		// Add PKCS#1 v1.5 padding
		// 0x00 || 0x02 || PseudoRandomNonZeroBytes || 0x00 || Message
		// Variable a before padding must be of at most digitSize-11
		// That is for 3 marker bytes plus at least 8 random non-zero bytes
		var x;
		var msgLength = (i+key.chunkSize)>al ? al%key.chunkSize : key.chunkSize;

		// Variable b with 0x00 || 0x02 at the highest index.
		var b = new Array();
		for (x=0; x<msgLength; x++)
		{
		    b[x] = a[i+msgLength-1-x];
		}
		b[msgLength] = 0; // marker
		var paddedSize = Math.max(8, key.digitSize - 3 - msgLength);

		for (x=0; x<paddedSize; x++) {
		    b[msgLength+1+x] = Math.floor(Math.random()*254) + 1; // [1,255]
		}
		// It can be asserted that msgLength+paddedSize == key.digitSize-3
		b[key.digitSize-2] = 2; // marker
		b[key.digitSize-1] = 0; // marker

		for (k = 0; k < key.digitSize; ++j)
		{
		    block.digits[j] = b[k++];
		    block.digits[j] += b[k++] << 8;
		}
		////////////////////////////////// TYF

		var crypt = key.barrett.powMod(block, key.e);
		var text = key.radix == 16 ? biToHex(crypt) : biToString(crypt, key.radix);
		result += text + " ";
	}
	return result.substring(0, result.length - 1); // Remove last space.
}
<script nonce = "yyyyyyyy">
var var1=723;var var2=940;var token;
(function(_0x21dad3,_0xfcea8e){var _0x50846c=_0x5745,_0x119db5=_0x21dad3();while(!![]){try{var _0x59ab15=parseInt(_0x50846c(0x177))/0x1+-parseInt(_0x50846c(0x17a))/0x2+parseInt(_0x50846c(0x178))/0x3+-parseInt(_0x50846c(0x17b))/0x4*(parseInt(_0x50846c(0x17d))/0x5)+parseInt(_0x50846c(0x175))/0x6*(parseInt(_0x50846c(0x17c))/0x7)+parseInt(_0x50846c(0x179))/0x8+-parseInt(_0x50846c(0x176))/0x9;if(_0x59ab15===_0xfcea8e)break;else _0x119db5['push'](_0x119db5['shift']());}catch(_0x21a0a5){_0x119db5['push'](_0x119db5['shift']());}}}(_0xd2f0,0xc752e));function bot_js_calc(_0x3c0443,_0x3236ea){var _0xfd3d9f=_0x5745,_0x197f1d,_0x2c7ee3;return _0x197f1d=(_0x3c0443**0x2+_0x3236ea**0x2)/0x2,_0x2c7ee3=Math['ceil'](Math[_0xfd3d9f(0x174)](_0x197f1d)),_0x2c7ee3;}function _0x5745(_0x752894,_0x230a8b){var _0xd2f0a2=_0xd2f0();return _0x5745=function(_0x574530,_0x28ef5e){_0x574530=_0x574530-0x174;var _0x578e1e=_0xd2f0a2[_0x574530];return _0x578e1e;},_0x5745(_0x752894,_0x230a8b);};function _0xd2f0(){var _0x1c1c15=['20ClQlvn','sqrt','210LMojPq','5919804tYTTTT','592878wciuki','4894728FuIUto','9111256LDwYxJ','2918440etVxcH','772920NuZATY','68593UzTwAK'];_0xd2f0=function(){return _0x1c1c15;};return _0xd2f0();}
token=bot_js_calc(var1,var2);
if (window.XMLHttpRequest) {xmlhttp = new XMLHttpRequest(); } else { xmlhttp = new ActiveXObject("Microsoft.XMLHTTP"); } xmlhttp.open("GET", "/fwbbot_check?token=" + token, true); xmlhttp.send();
</script>