Subversion Repositories oidplus

<?php

/**

 * Pure-PHP implementation of Rijndael.

 *

 * Uses mcrypt, if available/possible, and an internal implementation, otherwise.

 *

 * PHP version 5

 *

 * If {@link self::setBlockLength() setBlockLength()} isn't called, it'll be assumed to be 128 bits.  If

 * {@link self::setKeyLength() setKeyLength()} isn't called, it'll be calculated from

 * {@link self::setKey() setKey()}.  ie. if the key is 128-bits, the key length will be 128-bits.  If it's

 * 136-bits it'll be null-padded to 192-bits and 192 bits will be the key length until

 * {@link self::setKey() setKey()} is called, again, at which point, it'll be recalculated.

 *

 * Not all Rijndael implementations may support 160-bits or 224-bits as the block length / key length.  mcrypt, for example,

 * does not.  AES, itself, only supports block lengths of 128 and key lengths of 128, 192, and 256.

 * {@link http://csrc.nist.gov/archive/aes/rijndael/Rijndael-ammended.pdf#page=10 Rijndael-ammended.pdf#page=10} defines the

 * algorithm for block lengths of 192 and 256 but not for block lengths / key lengths of 160 and 224.  Indeed, 160 and 224

 * are first defined as valid key / block lengths in

 * {@link http://csrc.nist.gov/archive/aes/rijndael/Rijndael-ammended.pdf#page=44 Rijndael-ammended.pdf#page=44}:

 * Extensions: Other block and Cipher Key lengths.

 * Note: Use of 160/224-bit Keys must be explicitly set by setKeyLength(160) respectively setKeyLength(224).

 *

 * {@internal The variable names are the same as those in

 * {@link http://www.csrc.nist.gov/publications/fips/fips197/fips-197.pdf#page=10 fips-197.pdf#page=10}.}}

 *

 * Here's a short example of how to use this library:

 * <code>

 * <?php

 *    include 'vendor/autoload.php';

 *

 *    $rijndael = new \phpseclib3\Crypt\Rijndael('ctr');

 *

 *    $rijndael->setKey('abcdefghijklmnop');

 *

 *    $size = 10 * 1024;

 *    $plaintext = '';

 *    for ($i = 0; $i < $size; $i++) {

 *        $plaintext.= 'a';

 *    }

 *

 *    echo $rijndael->decrypt($rijndael->encrypt($plaintext));

 * ?>

 * </code>

 *

 * @category  Crypt

 * @package   Rijndael

 * @author    Jim Wigginton <terrafrost@php.net>

 * @copyright 2008 Jim Wigginton

 * @license   http://www.opensource.org/licenses/mit-license.html  MIT License

 * @link      http://phpseclib.sourceforge.net

 */

namespace phpseclib3\Crypt;

use phpseclib3\Common\Functions\Strings;

use phpseclib3\Crypt\Common\BlockCipher;

use phpseclib3\Exception\BadDecryptionException;

use phpseclib3\Exception\BadModeException;

use phpseclib3\Exception\InconsistentSetupException;

use phpseclib3\Exception\InsufficientSetupException;

/**

 * Pure-PHP implementation of Rijndael.

 *

 * @package Rijndael

 * @author  Jim Wigginton <terrafrost@php.net>

 * @access  public

 */

class Rijndael extends BlockCipher

{

    /**

     * The mcrypt specific name of the cipher

     *

     * Mcrypt is useable for 128/192/256-bit $block_size/$key_length. For 160/224 not.

     * \phpseclib3\Crypt\Rijndael determines automatically whether mcrypt is useable

     * or not for the current $block_size/$key_length.

     * In case of, $cipher_name_mcrypt will be set dynamically at run time accordingly.

     *

     * @see \phpseclib3\Crypt\Common\SymmetricKey::cipher_name_mcrypt

     * @see \phpseclib3\Crypt\Common\SymmetricKey::engine

     * @see self::isValidEngine()

     * @var string

     * @access private

     */

    protected $cipher_name_mcrypt = 'rijndael-128';

    /**

     * The Key Schedule

     *

     * @see self::setup()

     * @var array

     * @access private

     */

    private $w;

    /**

     * The Inverse Key Schedule

     *

     * @see self::setup()

     * @var array

     * @access private

     */

    private $dw;

    /**

     * The Block Length divided by 32

     *

     * {@internal The max value is 256 / 32 = 8, the min value is 128 / 32 = 4.  Exists in conjunction with $block_size

     *    because the encryption / decryption / key schedule creation requires this number and not $block_size.  We could

     *    derive this from $block_size or vice versa, but that'd mean we'd have to do multiple shift operations, so in lieu

     *    of that, we'll just precompute it once.}

     *

     * @see self::setBlockLength()

     * @var int

     * @access private

     */

    private $Nb = 4;

    /**

     * The Key Length (in bytes)

     *

     * {@internal The max value is 256 / 8 = 32, the min value is 128 / 8 = 16.  Exists in conjunction with $Nk

     *    because the encryption / decryption / key schedule creation requires this number and not $key_length.  We could

     *    derive this from $key_length or vice versa, but that'd mean we'd have to do multiple shift operations, so in lieu

     *    of that, we'll just precompute it once.}

     *

     * @see self::setKeyLength()

     * @var int

     * @access private

     */

    protected $key_length = 16;

    /**

     * The Key Length divided by 32

     *

     * @see self::setKeyLength()

     * @var int

     * @access private

     * @internal The max value is 256 / 32 = 8, the min value is 128 / 32 = 4

     */

    private $Nk = 4;

    /**

     * The Number of Rounds

     *

     * {@internal The max value is 14, the min value is 10.}

     *

     * @var int

     * @access private

     */

    private $Nr;

    /**

     * Shift offsets

     *

     * @var array

     * @access private

     */

    private $c;

    /**

     * Holds the last used key- and block_size information

     *

     * @var array

     * @access private

     */

    private $kl;

    /**

     * Default Constructor.

     *

     * @param string $mode

     * @access public

     * @throws \InvalidArgumentException if an invalid / unsupported mode is provided

     */

    public function __construct($mode)

    {

        parent::__construct($mode);

        if ($this->mode == self::MODE_STREAM) {

            throw new BadModeException('Block ciphers cannot be ran in stream mode');

        }

    }

    /**

     * Sets the key length.

     *

     * Valid key lengths are 128, 160, 192, 224, and 256.

     *

     * Note: phpseclib extends Rijndael (and AES) for using 160- and 224-bit keys but they are officially not defined

     *       and the most (if not all) implementations are not able using 160/224-bit keys but round/pad them up to

     *       192/256 bits as, for example, mcrypt will do.

     *

     *       That said, if you want be compatible with other Rijndael and AES implementations,

     *       you should not setKeyLength(160) or setKeyLength(224).

     *

     * Additional: In case of 160- and 224-bit keys, phpseclib will/can, for that reason, not use

     *             the mcrypt php extension, even if available.

     *             This results then in slower encryption.

     *

     * @access public

     * @throws \LengthException if the key length is invalid

     * @param int $length

     */

    public function setKeyLength($length)

    {

        switch ($length) {

            case 128:

            case 160:

            case 192:

            case 224:

            case 256:

                $this->key_length = $length >> 3;

                break;

            default:

                throw new \LengthException('Key size of ' . $length . ' bits is not supported by this algorithm. Only keys of sizes 128, 160, 192, 224 or 256 bits are supported');

        }

        parent::setKeyLength($length);

    }

    /**

     * Sets the key.

     *

     * Rijndael supports five different key lengths

     *

     * @see setKeyLength()

     * @access public

     * @param string $key

     * @throws \LengthException if the key length isn't supported

     */

    public function setKey($key)

    {

        switch (strlen($key)) {

            case 16:

            case 20:

            case 24:

            case 28:

            case 32:

                break;

            default:

                throw new \LengthException('Key of size ' . strlen($key) . ' not supported by this algorithm. Only keys of sizes 16, 20, 24, 28 or 32 are supported');

        }

        parent::setKey($key);

    }

    /**

     * Sets the block length

     *

     * Valid block lengths are 128, 160, 192, 224, and 256.

     *

     * @access public

     * @param int $length

     */

    public function setBlockLength($length)

    {

        switch ($length) {

            case 128:

            case 160:

            case 192:

            case 224:

            case 256:

                break;

            default:

                throw new \LengthException('Key size of ' . $length . ' bits is not supported by this algorithm. Only keys of sizes 128, 160, 192, 224 or 256 bits are supported');

        }

        $this->Nb = $length >> 5;

        $this->block_size = $length >> 3;

        $this->changed = $this->nonIVChanged = true;

        $this->setEngine();

    }

    /**

     * Test for engine validity

     *

     * This is mainly just a wrapper to set things up for \phpseclib3\Crypt\Common\SymmetricKey::isValidEngine()

     *

     * @see \phpseclib3\Crypt\Common\SymmetricKey::__construct()

     * @param int $engine

     * @access protected

     * @return bool

     */

    protected function isValidEngineHelper($engine)

    {

        switch ($engine) {

            case self::ENGINE_LIBSODIUM:

                return function_exists('sodium_crypto_aead_aes256gcm_is_available') &&

                       sodium_crypto_aead_aes256gcm_is_available() &&

                       $this->mode == self::MODE_GCM &&

                       $this->key_length == 32 &&

                       $this->nonce && strlen($this->nonce) == 12 &&

                       $this->block_size == 16;

            case self::ENGINE_OPENSSL_GCM:

                if (!extension_loaded('openssl')) {

                    return false;

                }

                $methods = openssl_get_cipher_methods();

                return $this->mode == self::MODE_GCM &&

                       version_compare(PHP_VERSION, '7.1.0', '>=') &&

                       in_array('aes-' . $this->getKeyLength() . '-gcm', $methods) &&

                       $this->block_size == 16;

            case self::ENGINE_OPENSSL:

                if ($this->block_size != 16) {

                    return false;

                }

                $this->cipher_name_openssl_ecb = 'aes-' . ($this->key_length << 3) . '-ecb';

                $this->cipher_name_openssl = 'aes-' . ($this->key_length << 3) . '-' . $this->openssl_translate_mode();

                break;

            case self::ENGINE_MCRYPT:

                $this->cipher_name_mcrypt = 'rijndael-' . ($this->block_size << 3);

                if ($this->key_length % 8) { // is it a 160/224-bit key?

                    // mcrypt is not usable for them, only for 128/192/256-bit keys

                    return false;

                }

        }

        return parent::isValidEngineHelper($engine);

    }

    /**

     * Encrypts a block

     *

     * @access private

     * @param string $in

     * @return string

     */

    protected function encryptBlock($in)

    {

        static $tables;

        if (empty($tables)) {

            $tables = &$this->getTables();

        }

        $t0   = $tables[0];

        $t1   = $tables[1];

        $t2   = $tables[2];

        $t3   = $tables[3];

        $sbox = $tables[4];

        $state = [];

        $words = unpack('N*', $in);

        $c = $this->c;

        $w = $this->w;

        $Nb = $this->Nb;

        $Nr = $this->Nr;

        // addRoundKey

        $wc = $Nb - 1;

        foreach ($words as $word) {

            $state[] = $word ^ $w[++$wc];

        }

        // fips-197.pdf#page=19, "Figure 5. Pseudo Code for the Cipher", states that this loop has four components -

        // subBytes, shiftRows, mixColumns, and addRoundKey. fips-197.pdf#page=30, "Implementation Suggestions Regarding

        // Various Platforms" suggests that performs enhanced implementations are described in Rijndael-ammended.pdf.

        // Rijndael-ammended.pdf#page=20, "Implementation aspects / 32-bit processor", discusses such an optimization.

        // Unfortunately, the description given there is not quite correct.  Per aes.spec.v316.pdf#page=19 [1],

        // equation (7.4.7) is supposed to use addition instead of subtraction, so we'll do that here, as well.

        // [1] http://fp.gladman.plus.com/cryptography_technology/rijndael/aes.spec.v316.pdf

        $temp = [];

        for ($round = 1; $round < $Nr; ++$round) {

            $i = 0; // $c[0] == 0

            $j = $c[1];

            $k = $c[2];

            $l = $c[3];

            while ($i < $Nb) {

                $temp[$i] = $t0[$state[$i] >> 24 & 0x000000FF] ^

                            $t1[$state[$j] >> 16 & 0x000000FF] ^

                            $t2[$state[$k] >>  8 & 0x000000FF] ^

                            $t3[$state[$l]       & 0x000000FF] ^

                            $w[++$wc];

                ++$i;

                $j = ($j + 1) % $Nb;

                $k = ($k + 1) % $Nb;

                $l = ($l + 1) % $Nb;

            }

            $state = $temp;

        }

        // subWord

        for ($i = 0; $i < $Nb; ++$i) {

            $state[$i] =   $sbox[$state[$i]       & 0x000000FF]        |

                          ($sbox[$state[$i] >>  8 & 0x000000FF] <<  8) |

                          ($sbox[$state[$i] >> 16 & 0x000000FF] << 16) |

                          ($sbox[$state[$i] >> 24 & 0x000000FF] << 24);

        }

        // shiftRows + addRoundKey

        $i = 0; // $c[0] == 0

        $j = $c[1];

        $k = $c[2];

        $l = $c[3];

        while ($i < $Nb) {

            $temp[$i] = ($state[$i] & 0xFF000000) ^

                        ($state[$j] & 0x00FF0000) ^

                        ($state[$k] & 0x0000FF00) ^

                        ($state[$l] & 0x000000FF) ^

                         $w[$i];

            ++$i;

            $j = ($j + 1) % $Nb;

            $k = ($k + 1) % $Nb;

            $l = ($l + 1) % $Nb;

        }

        return pack('N*', ...$temp);

    }

    /**

     * Decrypts a block

     *

     * @access private

     * @param string $in

     * @return string

     */

    protected function decryptBlock($in)

    {

        static $invtables;

        if (empty($invtables)) {

            $invtables = &$this->getInvTables();

        }

        $dt0   = $invtables[0];

        $dt1   = $invtables[1];

        $dt2   = $invtables[2];

        $dt3   = $invtables[3];

        $isbox = $invtables[4];

        $state = [];

        $words = unpack('N*', $in);

        $c  = $this->c;

        $dw = $this->dw;

        $Nb = $this->Nb;

        $Nr = $this->Nr;

        // addRoundKey

        $wc = $Nb - 1;

        foreach ($words as $word) {

            $state[] = $word ^ $dw[++$wc];

        }

        $temp = [];

        for ($round = $Nr - 1; $round > 0; --$round) {

            $i = 0; // $c[0] == 0

            $j = $Nb - $c[1];

            $k = $Nb - $c[2];

            $l = $Nb - $c[3];

            while ($i < $Nb) {

                $temp[$i] = $dt0[$state[$i] >> 24 & 0x000000FF] ^

                            $dt1[$state[$j] >> 16 & 0x000000FF] ^

                            $dt2[$state[$k] >>  8 & 0x000000FF] ^

                            $dt3[$state[$l]       & 0x000000FF] ^

                            $dw[++$wc];

                ++$i;

                $j = ($j + 1) % $Nb;

                $k = ($k + 1) % $Nb;

                $l = ($l + 1) % $Nb;

            }

            $state = $temp;

        }

        // invShiftRows + invSubWord + addRoundKey

        $i = 0; // $c[0] == 0

        $j = $Nb - $c[1];

        $k = $Nb - $c[2];

        $l = $Nb - $c[3];

        while ($i < $Nb) {

            $word = ($state[$i] & 0xFF000000) |

                    ($state[$j] & 0x00FF0000) |

                    ($state[$k] & 0x0000FF00) |

                    ($state[$l] & 0x000000FF);

            $temp[$i] = $dw[$i] ^ ($isbox[$word       & 0x000000FF]        |

                                  ($isbox[$word >>  8 & 0x000000FF] <<  8) |

                                  ($isbox[$word >> 16 & 0x000000FF] << 16) |

                                  ($isbox[$word >> 24 & 0x000000FF] << 24));

            ++$i;

            $j = ($j + 1) % $Nb;

            $k = ($k + 1) % $Nb;

            $l = ($l + 1) % $Nb;

        }

        return pack('N*', ...$temp);

    }

    /**

     * Setup the self::ENGINE_INTERNAL $engine

     *

     * (re)init, if necessary, the internal cipher $engine and flush all $buffers

     * Used (only) if $engine == self::ENGINE_INTERNAL

     *

     * _setup() will be called each time if $changed === true

     * typically this happens when using one or more of following public methods:

     *

     * - setKey()

     *

     * - setIV()

     *

     * - disableContinuousBuffer()

     *

     * - First run of encrypt() / decrypt() with no init-settings

     *

     * {@internal setup() is always called before en/decryption.}

     *

     * {@internal Could, but not must, extend by the child Crypt_* class}

     *

     * @see self::setKey()

     * @see self::setIV()

     * @see self::disableContinuousBuffer()

     * @access private

     */

    protected function setup()

    {

        if (!$this->changed) {

            return;

        }

        parent::setup();

        if (is_string($this->iv) && strlen($this->iv) != $this->block_size) {

            throw new InconsistentSetupException('The IV length (' . strlen($this->iv) . ') does not match the block size (' . $this->block_size . ')');

        }

    }

    /**

     * Setup the key (expansion)

     *

     * @see \phpseclib3\Crypt\Common\SymmetricKey::setupKey()

     * @access private

     */

    protected function setupKey()

    {

        // Each number in $rcon is equal to the previous number multiplied by two in Rijndael's finite field.

        // See http://en.wikipedia.org/wiki/Finite_field_arithmetic#Multiplicative_inverse

        static $rcon = [0,

            0x01000000, 0x02000000, 0x04000000, 0x08000000, 0x10000000,

            0x20000000, 0x40000000, 0x80000000, 0x1B000000, 0x36000000,

            0x6C000000, 0xD8000000, 0xAB000000, 0x4D000000, 0x9A000000,

            0x2F000000, 0x5E000000, 0xBC000000, 0x63000000, 0xC6000000,

            0x97000000, 0x35000000, 0x6A000000, 0xD4000000, 0xB3000000,

            0x7D000000, 0xFA000000, 0xEF000000, 0xC5000000, 0x91000000

        ];

        if (isset($this->kl['key']) && $this->key === $this->kl['key'] && $this->key_length === $this->kl['key_length'] && $this->block_size === $this->kl['block_size']) {

            // already expanded

            return;

        }

        $this->kl = ['key' => $this->key, 'key_length' => $this->key_length, 'block_size' => $this->block_size];

        $this->Nk = $this->key_length >> 2;

        // see Rijndael-ammended.pdf#page=44

        $this->Nr = max($this->Nk, $this->Nb) + 6;

        // shift offsets for Nb = 5, 7 are defined in Rijndael-ammended.pdf#page=44,

        //     "Table 8: Shift offsets in Shiftrow for the alternative block lengths"

        // shift offsets for Nb = 4, 6, 8 are defined in Rijndael-ammended.pdf#page=14,

        //     "Table 2: Shift offsets for different block lengths"

        switch ($this->Nb) {

            case 4:

            case 5:

            case 6:

                $this->c = [0, 1, 2, 3];

                break;

            case 7:

                $this->c = [0, 1, 2, 4];

                break;

            case 8:

                $this->c = [0, 1, 3, 4];

        }

        $w = array_values(unpack('N*words', $this->key));

        $length = $this->Nb * ($this->Nr + 1);

        for ($i = $this->Nk; $i < $length; $i++) {

            $temp = $w[$i - 1];

            if ($i % $this->Nk == 0) {

                // according to <http://php.net/language.types.integer>, "the size of an integer is platform-dependent".

                // on a 32-bit machine, it's 32-bits, and on a 64-bit machine, it's 64-bits. on a 32-bit machine,

                // 0xFFFFFFFF << 8 == 0xFFFFFF00, but on a 64-bit machine, it equals 0xFFFFFFFF00. as such, doing 'and'

                // with 0xFFFFFFFF (or 0xFFFFFF00) on a 32-bit machine is unnecessary, but on a 64-bit machine, it is.

                $temp = (($temp << 8) & 0xFFFFFF00) | (($temp >> 24) & 0x000000FF); // rotWord

                $temp = $this->subWord($temp) ^ $rcon[$i / $this->Nk];

            } elseif ($this->Nk > 6 && $i % $this->Nk == 4) {

                $temp = $this->subWord($temp);

            }

            $w[$i] = $w[$i - $this->Nk] ^ $temp;

        }

        // convert the key schedule from a vector of $Nb * ($Nr + 1) length to a matrix with $Nr + 1 rows and $Nb columns

        // and generate the inverse key schedule.  more specifically,

        // according to <http://csrc.nist.gov/archive/aes/rijndael/Rijndael-ammended.pdf#page=23> (section 5.3.3),

        // "The key expansion for the Inverse Cipher is defined as follows:

        //        1. Apply the Key Expansion.

        //        2. Apply InvMixColumn to all Round Keys except the first and the last one."

        // also, see fips-197.pdf#page=27, "5.3.5 Equivalent Inverse Cipher"

        list($dt0, $dt1, $dt2, $dt3) = $this->getInvTables();

        $temp = $this->w = $this->dw = [];

        for ($i = $row = $col = 0; $i < $length; $i++, $col++) {

            if ($col == $this->Nb) {

                if ($row == 0) {

                    $this->dw[0] = $this->w[0];

                } else {

                    // subWord + invMixColumn + invSubWord = invMixColumn

                    $j = 0;

                    while ($j < $this->Nb) {

                        $dw = $this->subWord($this->w[$row][$j]);

                        $temp[$j] = $dt0[$dw >> 24 & 0x000000FF] ^

                                    $dt1[$dw >> 16 & 0x000000FF] ^

                                    $dt2[$dw >>  8 & 0x000000FF] ^

                                    $dt3[$dw       & 0x000000FF];

                        $j++;

                    }

                    $this->dw[$row] = $temp;

                }

                $col = 0;

                $row++;

            }

            $this->w[$row][$col] = $w[$i];

        }

        $this->dw[$row] = $this->w[$row];

        // Converting to 1-dim key arrays (both ascending)

        $this->dw = array_reverse($this->dw);

        $w  = array_pop($this->w);

        $dw = array_pop($this->dw);

        foreach ($this->w as $r => $wr) {

            foreach ($wr as $c => $wc) {

                $w[]  = $wc;

                $dw[] = $this->dw[$r][$c];

            }

        }

        $this->w  = $w;

        $this->dw = $dw;

    }

    /**

     * Performs S-Box substitutions

     *

     * @return array

     * @access private

     * @param int $word

     */

    private function subWord($word)

    {

        static $sbox;

        if (empty($sbox)) {

            list(, , , , $sbox) = self::getTables();

        }

        return  $sbox[$word       & 0x000000FF]        |

               ($sbox[$word >>  8 & 0x000000FF] <<  8) |

               ($sbox[$word >> 16 & 0x000000FF] << 16) |

               ($sbox[$word >> 24 & 0x000000FF] << 24);

    }

    /**

     * Provides the mixColumns and sboxes tables

     *

     * @see self::encryptBlock()

     * @see self::setupInlineCrypt()

     * @see self::subWord()

     * @access private

     * @return array &$tables

     */

    protected function &getTables()

    {

        static $tables;

        if (empty($tables)) {

            // according to <http://csrc.nist.gov/archive/aes/rijndael/Rijndael-ammended.pdf#page=19> (section 5.2.1),

            // precomputed tables can be used in the mixColumns phase. in that example, they're assigned t0...t3, so

            // those are the names we'll use.

            $t3 = array_map('intval', [

                // with array_map('intval', ...) we ensure we have only int's and not

                // some slower floats converted by php automatically on high values

                0x6363A5C6, 0x7C7C84F8, 0x777799EE, 0x7B7B8DF6, 0xF2F20DFF, 0x6B6BBDD6, 0x6F6FB1DE, 0xC5C55491,

                0x30305060, 0x01010302, 0x6767A9CE, 0x2B2B7D56, 0xFEFE19E7, 0xD7D762B5, 0xABABE64D, 0x76769AEC,

                0xCACA458F, 0x82829D1F, 0xC9C94089, 0x7D7D87FA, 0xFAFA15EF, 0x5959EBB2, 0x4747C98E, 0xF0F00BFB,

                0xADADEC41, 0xD4D467B3, 0xA2A2FD5F, 0xAFAFEA45, 0x9C9CBF23, 0xA4A4F753, 0x727296E4, 0xC0C05B9B,

                0xB7B7C275, 0xFDFD1CE1, 0x9393AE3D, 0x26266A4C, 0x36365A6C, 0x3F3F417E, 0xF7F702F5, 0xCCCC4F83,

                0x34345C68, 0xA5A5F451, 0xE5E534D1, 0xF1F108F9, 0x717193E2, 0xD8D873AB, 0x31315362, 0x15153F2A,

                0x04040C08, 0xC7C75295, 0x23236546, 0xC3C35E9D, 0x18182830, 0x9696A137, 0x05050F0A, 0x9A9AB52F,

                0x0707090E, 0x12123624, 0x80809B1B, 0xE2E23DDF, 0xEBEB26CD, 0x2727694E, 0xB2B2CD7F, 0x75759FEA,

                0x09091B12, 0x83839E1D, 0x2C2C7458, 0x1A1A2E34, 0x1B1B2D36, 0x6E6EB2DC, 0x5A5AEEB4, 0xA0A0FB5B,

                0x5252F6A4, 0x3B3B4D76, 0xD6D661B7, 0xB3B3CE7D, 0x29297B52, 0xE3E33EDD, 0x2F2F715E, 0x84849713,

                0x5353F5A6, 0xD1D168B9, 0x00000000, 0xEDED2CC1, 0x20206040, 0xFCFC1FE3, 0xB1B1C879, 0x5B5BEDB6,

                0x6A6ABED4, 0xCBCB468D, 0xBEBED967, 0x39394B72, 0x4A4ADE94, 0x4C4CD498, 0x5858E8B0, 0xCFCF4A85,

                0xD0D06BBB, 0xEFEF2AC5, 0xAAAAE54F, 0xFBFB16ED, 0x4343C586, 0x4D4DD79A, 0x33335566, 0x85859411,

                0x4545CF8A, 0xF9F910E9, 0x02020604, 0x7F7F81FE, 0x5050F0A0, 0x3C3C4478, 0x9F9FBA25, 0xA8A8E34B,

                0x5151F3A2, 0xA3A3FE5D, 0x4040C080, 0x8F8F8A05, 0x9292AD3F, 0x9D9DBC21, 0x38384870, 0xF5F504F1,

                0xBCBCDF63, 0xB6B6C177, 0xDADA75AF, 0x21216342, 0x10103020, 0xFFFF1AE5, 0xF3F30EFD, 0xD2D26DBF,

                0xCDCD4C81, 0x0C0C1418, 0x13133526, 0xECEC2FC3, 0x5F5FE1BE, 0x9797A235, 0x4444CC88, 0x1717392E,

                0xC4C45793, 0xA7A7F255, 0x7E7E82FC, 0x3D3D477A, 0x6464ACC8, 0x5D5DE7BA, 0x19192B32, 0x737395E6,

                0x6060A0C0, 0x81819819, 0x4F4FD19E, 0xDCDC7FA3, 0x22226644, 0x2A2A7E54, 0x9090AB3B, 0x8888830B,

                0x4646CA8C, 0xEEEE29C7, 0xB8B8D36B, 0x14143C28, 0xDEDE79A7, 0x5E5EE2BC, 0x0B0B1D16, 0xDBDB76AD,