-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Pure-PHP implementation of AES.
- *
- * Uses mcrypt, if available, and an internal implementation, otherwise.
- *
- * PHP versions 4 and 5
- *
- * If {@link Crypt_AES::setKeyLength() setKeyLength()} isn't called, it'll be calculated from
- * {@link Crypt_AES::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 160-bits and 160 bits will be the key length until {@link Crypt_Rijndael::setKey() setKey()}
- * is called, again, at which point, it'll be recalculated.
- *
- * Since Crypt_AES extends Crypt_Rijndael, some functions are available to be called that, in the context of AES, don't
- * make a whole lot of sense. {@link Crypt_AES::setBlockLength() setBlockLength()}, for instance. Calling that function,
- * however possible, won't do anything (AES has a fixed block length whereas Rijndael has a variable one).
- *
- * Here's a short example of how to use this library:
- * <code>
- * <?php
- * include('Crypt/AES.php');
- *
- * $aes = new Crypt_AES();
- *
- * $aes->setKey('abcdefghijklmnop');
- *
- * $size = 10 * 1024;
- * $plaintext = '';
- * for ($i = 0; $i < $size; $i++) {
- * $plaintext.= 'a';
- * }
- *
- * echo $aes->decrypt($aes->encrypt($plaintext));
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Crypt
- * @package Crypt_AES
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMVIII Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: AES.php,v 1.7 2010/02/09 06:10:25 terrafrost Exp $
- * @link http://phpseclib.sourceforge.net
- */
-
-/**
- * Include Crypt_Rijndael
- */
-require_once 'Rijndael.php';
-
-/**#@+
- * @access public
- * @see Crypt_AES::encrypt()
- * @see Crypt_AES::decrypt()
- */
-/**
- * Encrypt / decrypt using the Counter mode.
- *
- * Set to -1 since that's what Crypt/Random.php uses to index the CTR mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Counter_.28CTR.29
- */
-define('CRYPT_AES_MODE_CTR', -1);
-/**
- * Encrypt / decrypt using the Electronic Code Book mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Electronic_codebook_.28ECB.29
- */
-define('CRYPT_AES_MODE_ECB', 1);
-/**
- * Encrypt / decrypt using the Code Book Chaining mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher-block_chaining_.28CBC.29
- */
-define('CRYPT_AES_MODE_CBC', 2);
-/**#@-*/
-
-/**#@+
- * @access private
- * @see Crypt_AES::Crypt_AES()
- */
-/**
- * Toggles the internal implementation
- */
-define('CRYPT_AES_MODE_INTERNAL', 1);
-/**
- * Toggles the mcrypt implementation
- */
-define('CRYPT_AES_MODE_MCRYPT', 2);
-/**#@-*/
-
-/**
- * Pure-PHP implementation of AES.
- *
- * @author Jim Wigginton <terrafrost@php.net>
- * @version 0.1.0
- * @access public
- * @package Crypt_AES
- */
-class Crypt_AES extends Crypt_Rijndael {
- /**
- * mcrypt resource for encryption
- *
- * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.
- * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.
- *
- * @see Crypt_AES::encrypt()
- * @var String
- * @access private
- */
- var $enmcrypt;
-
- /**
- * mcrypt resource for decryption
- *
- * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.
- * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.
- *
- * @see Crypt_AES::decrypt()
- * @var String
- * @access private
- */
- var $demcrypt;
-
- /**
- * Default Constructor.
- *
- * Determines whether or not the mcrypt extension should be used. $mode should only, at present, be
- * CRYPT_AES_MODE_ECB or CRYPT_AES_MODE_CBC. If not explictly set, CRYPT_AES_MODE_CBC will be used.
- *
- * @param optional Integer $mode
- * @return Crypt_AES
- * @access public
- */
- function Crypt_AES($mode = CRYPT_AES_MODE_CBC)
- {
- if ( !defined('CRYPT_AES_MODE') ) {
- switch (true) {
- case extension_loaded('mcrypt'):
- // i'd check to see if aes was supported, by doing in_array('des', mcrypt_list_algorithms('')),
- // but since that can be changed after the object has been created, there doesn't seem to be
- // a lot of point...
- define('CRYPT_AES_MODE', CRYPT_AES_MODE_MCRYPT);
- break;
- default:
- define('CRYPT_AES_MODE', CRYPT_AES_MODE_INTERNAL);
- }
- }
-
- switch ( CRYPT_AES_MODE ) {
- case CRYPT_AES_MODE_MCRYPT:
- switch ($mode) {
- case CRYPT_AES_MODE_ECB:
- $this->mode = MCRYPT_MODE_ECB;
- break;
- case CRYPT_AES_MODE_CTR:
- // ctr doesn't have a constant associated with it even though it appears to be fairly widely
- // supported. in lieu of knowing just how widely supported it is, i've, for now, opted not to
- // include a compatibility layer. the layer has been implemented but, for now, is commented out.
- $this->mode = 'ctr';
- //$this->mode = in_array('ctr', mcrypt_list_modes()) ? 'ctr' : CRYPT_AES_MODE_CTR;
- break;
- case CRYPT_AES_MODE_CBC:
- default:
- $this->mode = MCRYPT_MODE_CBC;
- }
-
- break;
- default:
- switch ($mode) {
- case CRYPT_AES_MODE_ECB:
- $this->mode = CRYPT_RIJNDAEL_MODE_ECB;
- break;
- case CRYPT_AES_MODE_CTR:
- $this->mode = CRYPT_RIJNDAEL_MODE_CTR;
- break;
- case CRYPT_AES_MODE_CBC:
- default:
- $this->mode = CRYPT_RIJNDAEL_MODE_CBC;
- }
- }
-
- if (CRYPT_AES_MODE == CRYPT_AES_MODE_INTERNAL) {
- parent::Crypt_Rijndael($this->mode);
- }
- }
-
- /**
- * Dummy function
- *
- * Since Crypt_AES extends Crypt_Rijndael, this function is, technically, available, but it doesn't do anything.
- *
- * @access public
- * @param Integer $length
- */
- function setBlockLength($length)
- {
- return;
- }
-
- /**
- * Encrypts a message.
- *
- * $plaintext will be padded with up to 16 additional bytes. Other AES implementations may or may not pad in the
- * same manner. Other common approaches to padding and the reasons why it's necessary are discussed in the following
- * URL:
- *
- * {@link http://www.di-mgt.com.au/cryptopad.html http://www.di-mgt.com.au/cryptopad.html}
- *
- * An alternative to padding is to, separately, send the length of the file. This is what SSH, in fact, does.
- * strlen($plaintext) will still need to be a multiple of 16, however, arbitrary values can be added to make it that
- * length.
- *
- * @see Crypt_AES::decrypt()
- * @access public
- * @param String $plaintext
- */
- function encrypt($plaintext)
- {
- if ( CRYPT_AES_MODE == CRYPT_AES_MODE_MCRYPT ) {
- $this->_mcryptSetup();
- /*
- if ($this->mode == CRYPT_AES_MODE_CTR) {
- $iv = $this->encryptIV;
- $xor = mcrypt_generic($this->enmcrypt, $this->_generate_xor(strlen($plaintext), $iv));
- $ciphertext = $plaintext ^ $xor;
- if ($this->continuousBuffer) {
- $this->encryptIV = $iv;
- }
- return $ciphertext;
- }
- */
-
- if ($this->mode != 'ctr') {
- $plaintext = $this->_pad($plaintext);
- }
-
- $ciphertext = mcrypt_generic($this->enmcrypt, $plaintext);
-
- if (!$this->continuousBuffer) {
- mcrypt_generic_init($this->enmcrypt, $this->key, $this->iv);
- }
-
- return $ciphertext;
- }
-
- return parent::encrypt($plaintext);
- }
-
- /**
- * Decrypts a message.
- *
- * If strlen($ciphertext) is not a multiple of 16, null bytes will be added to the end of the string until it is.
- *
- * @see Crypt_AES::encrypt()
- * @access public
- * @param String $ciphertext
- */
- function decrypt($ciphertext)
- {
- if ( CRYPT_AES_MODE == CRYPT_AES_MODE_MCRYPT ) {
- $this->_mcryptSetup();
- /*
- if ($this->mode == CRYPT_AES_MODE_CTR) {
- $iv = $this->decryptIV;
- $xor = mcrypt_generic($this->enmcrypt, $this->_generate_xor(strlen($ciphertext), $iv));
- $plaintext = $ciphertext ^ $xor;
- if ($this->continuousBuffer) {
- $this->decryptIV = $iv;
- }
- return $plaintext;
- }
- */
-
- if ($this->mode != 'ctr') {
- // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :
- // "The data is padded with "\0" to make sure the length of the data is n * blocksize."
- $ciphertext = str_pad($ciphertext, (strlen($ciphertext) + 15) & 0xFFFFFFF0, chr(0));
- }
-
- $plaintext = mdecrypt_generic($this->demcrypt, $ciphertext);
-
- if (!$this->continuousBuffer) {
- mcrypt_generic_init($this->demcrypt, $this->key, $this->iv);
- }
-
- return $this->mode != 'ctr' ? $this->_unpad($plaintext) : $plaintext;
- }
-
- return parent::decrypt($ciphertext);
- }
-
- /**
- * Setup mcrypt
- *
- * Validates all the variables.
- *
- * @access private
- */
- function _mcryptSetup()
- {
- if (!$this->changed) {
- return;
- }
-
- if (!$this->explicit_key_length) {
- // this just copied from Crypt_Rijndael::_setup()
- $length = strlen($this->key) >> 2;
- if ($length > 8) {
- $length = 8;
- } else if ($length < 4) {
- $length = 4;
- }
- $this->Nk = $length;
- $this->key_size = $length << 2;
- }
-
- switch ($this->Nk) {
- case 4: // 128
- $this->key_size = 16;
- break;
- case 5: // 160
- case 6: // 192
- $this->key_size = 24;
- break;
- case 7: // 224
- case 8: // 256
- $this->key_size = 32;
- }
-
- $this->key = substr($this->key, 0, $this->key_size);
- $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($this->iv, 0, 16), 16, chr(0));
-
- if (!isset($this->enmcrypt)) {
- $mode = $this->mode;
- //$mode = $this->mode == CRYPT_AES_MODE_CTR ? MCRYPT_MODE_ECB : $this->mode;
-
- $this->demcrypt = mcrypt_module_open(MCRYPT_RIJNDAEL_128, '', $mode, '');
- $this->enmcrypt = mcrypt_module_open(MCRYPT_RIJNDAEL_128, '', $mode, '');
- } // else should mcrypt_generic_deinit be called?
-
- mcrypt_generic_init($this->demcrypt, $this->key, $this->iv);
- mcrypt_generic_init($this->enmcrypt, $this->key, $this->iv);
-
- $this->changed = false;
- }
-
- /**
- * Encrypts a block
- *
- * Optimized over Crypt_Rijndael's implementation by means of loop unrolling.
- *
- * @see Crypt_Rijndael::_encryptBlock()
- * @access private
- * @param String $in
- * @return String
- */
- function _encryptBlock($in)
- {
- $state = unpack('N*word', $in);
-
- $Nr = $this->Nr;
- $w = $this->w;
- $t0 = $this->t0;
- $t1 = $this->t1;
- $t2 = $this->t2;
- $t3 = $this->t3;
-
- // addRoundKey and reindex $state
- $state = array(
- $state['word1'] ^ $w[0][0],
- $state['word2'] ^ $w[0][1],
- $state['word3'] ^ $w[0][2],
- $state['word4'] ^ $w[0][3]
- );
-
- // shiftRows + subWord + mixColumns + addRoundKey
- // we could loop unroll this and use if statements to do more rounds as necessary, but, in my tests, that yields
- // only a marginal improvement. since that also, imho, hinders the readability of the code, i've opted not to do it.
- for ($round = 1; $round < $this->Nr; $round++) {
- $state = array(
- $t0[$state[0] & 0xFF000000] ^ $t1[$state[1] & 0x00FF0000] ^ $t2[$state[2] & 0x0000FF00] ^ $t3[$state[3] & 0x000000FF] ^ $w[$round][0],
- $t0[$state[1] & 0xFF000000] ^ $t1[$state[2] & 0x00FF0000] ^ $t2[$state[3] & 0x0000FF00] ^ $t3[$state[0] & 0x000000FF] ^ $w[$round][1],
- $t0[$state[2] & 0xFF000000] ^ $t1[$state[3] & 0x00FF0000] ^ $t2[$state[0] & 0x0000FF00] ^ $t3[$state[1] & 0x000000FF] ^ $w[$round][2],
- $t0[$state[3] & 0xFF000000] ^ $t1[$state[0] & 0x00FF0000] ^ $t2[$state[1] & 0x0000FF00] ^ $t3[$state[2] & 0x000000FF] ^ $w[$round][3]
- );
-
- }
-
- // subWord
- $state = array(
- $this->_subWord($state[0]),
- $this->_subWord($state[1]),
- $this->_subWord($state[2]),
- $this->_subWord($state[3])
- );
-
- // shiftRows + addRoundKey
- $state = array(
- ($state[0] & 0xFF000000) ^ ($state[1] & 0x00FF0000) ^ ($state[2] & 0x0000FF00) ^ ($state[3] & 0x000000FF) ^ $this->w[$this->Nr][0],
- ($state[1] & 0xFF000000) ^ ($state[2] & 0x00FF0000) ^ ($state[3] & 0x0000FF00) ^ ($state[0] & 0x000000FF) ^ $this->w[$this->Nr][1],
- ($state[2] & 0xFF000000) ^ ($state[3] & 0x00FF0000) ^ ($state[0] & 0x0000FF00) ^ ($state[1] & 0x000000FF) ^ $this->w[$this->Nr][2],
- ($state[3] & 0xFF000000) ^ ($state[0] & 0x00FF0000) ^ ($state[1] & 0x0000FF00) ^ ($state[2] & 0x000000FF) ^ $this->w[$this->Nr][3]
- );
-
- return pack('N*', $state[0], $state[1], $state[2], $state[3]);
- }
-
- /**
- * Decrypts a block
- *
- * Optimized over Crypt_Rijndael's implementation by means of loop unrolling.
- *
- * @see Crypt_Rijndael::_decryptBlock()
- * @access private
- * @param String $in
- * @return String
- */
- function _decryptBlock($in)
- {
- $state = unpack('N*word', $in);
-
- $Nr = $this->Nr;
- $dw = $this->dw;
- $dt0 = $this->dt0;
- $dt1 = $this->dt1;
- $dt2 = $this->dt2;
- $dt3 = $this->dt3;
-
- // addRoundKey and reindex $state
- $state = array(
- $state['word1'] ^ $dw[$this->Nr][0],
- $state['word2'] ^ $dw[$this->Nr][1],
- $state['word3'] ^ $dw[$this->Nr][2],
- $state['word4'] ^ $dw[$this->Nr][3]
- );
-
-
- // invShiftRows + invSubBytes + invMixColumns + addRoundKey
- for ($round = $this->Nr - 1; $round > 0; $round--) {
- $state = array(
- $dt0[$state[0] & 0xFF000000] ^ $dt1[$state[3] & 0x00FF0000] ^ $dt2[$state[2] & 0x0000FF00] ^ $dt3[$state[1] & 0x000000FF] ^ $dw[$round][0],
- $dt0[$state[1] & 0xFF000000] ^ $dt1[$state[0] & 0x00FF0000] ^ $dt2[$state[3] & 0x0000FF00] ^ $dt3[$state[2] & 0x000000FF] ^ $dw[$round][1],
- $dt0[$state[2] & 0xFF000000] ^ $dt1[$state[1] & 0x00FF0000] ^ $dt2[$state[0] & 0x0000FF00] ^ $dt3[$state[3] & 0x000000FF] ^ $dw[$round][2],
- $dt0[$state[3] & 0xFF000000] ^ $dt1[$state[2] & 0x00FF0000] ^ $dt2[$state[1] & 0x0000FF00] ^ $dt3[$state[0] & 0x000000FF] ^ $dw[$round][3]
- );
- }
-
- // invShiftRows + invSubWord + addRoundKey
- $state = array(
- $this->_invSubWord(($state[0] & 0xFF000000) ^ ($state[3] & 0x00FF0000) ^ ($state[2] & 0x0000FF00) ^ ($state[1] & 0x000000FF)) ^ $dw[0][0],
- $this->_invSubWord(($state[1] & 0xFF000000) ^ ($state[0] & 0x00FF0000) ^ ($state[3] & 0x0000FF00) ^ ($state[2] & 0x000000FF)) ^ $dw[0][1],
- $this->_invSubWord(($state[2] & 0xFF000000) ^ ($state[1] & 0x00FF0000) ^ ($state[0] & 0x0000FF00) ^ ($state[3] & 0x000000FF)) ^ $dw[0][2],
- $this->_invSubWord(($state[3] & 0xFF000000) ^ ($state[2] & 0x00FF0000) ^ ($state[1] & 0x0000FF00) ^ ($state[0] & 0x000000FF)) ^ $dw[0][3]
- );
-
- return pack('N*', $state[0], $state[1], $state[2], $state[3]);
- }
-}
-
-// vim: ts=4:sw=4:et:
-// vim6: fdl=1:
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP implementation of AES.\r
+ *\r
+ * Uses mcrypt, if available, and an internal implementation, otherwise.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * If {@link Crypt_AES::setKeyLength() setKeyLength()} isn't called, it'll be calculated from\r
+ * {@link Crypt_AES::setKey() setKey()}. ie. if the key is 128-bits, the key length will be 128-bits. If it's 136-bits\r
+ * it'll be null-padded to 160-bits and 160 bits will be the key length until {@link Crypt_Rijndael::setKey() setKey()}\r
+ * is called, again, at which point, it'll be recalculated.\r
+ *\r
+ * Since Crypt_AES extends Crypt_Rijndael, some functions are available to be called that, in the context of AES, don't\r
+ * make a whole lot of sense. {@link Crypt_AES::setBlockLength() setBlockLength()}, for instance. Calling that function,\r
+ * however possible, won't do anything (AES has a fixed block length whereas Rijndael has a variable one).\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/AES.php');\r
+ *\r
+ * $aes = new Crypt_AES();\r
+ *\r
+ * $aes->setKey('abcdefghijklmnop');\r
+ *\r
+ * $size = 10 * 1024;\r
+ * $plaintext = '';\r
+ * for ($i = 0; $i < $size; $i++) {\r
+ * $plaintext.= 'a';\r
+ * }\r
+ *\r
+ * echo $aes->decrypt($aes->encrypt($plaintext));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_AES\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMVIII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**\r
+ * Include Crypt_Rijndael\r
+ */\r
+if (!class_exists('Crypt_Rijndael')) {\r
+ require_once 'Rijndael.php';\r
+}\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_AES::encrypt()\r
+ * @see Crypt_AES::decrypt()\r
+ */\r
+/**\r
+ * Encrypt / decrypt using the Counter mode.\r
+ *\r
+ * Set to -1 since that's what Crypt/Random.php uses to index the CTR mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Counter_.28CTR.29\r
+ */\r
+define('CRYPT_AES_MODE_CTR', -1);\r
+/**\r
+ * Encrypt / decrypt using the Electronic Code Book mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Electronic_codebook_.28ECB.29\r
+ */\r
+define('CRYPT_AES_MODE_ECB', 1);\r
+/**\r
+ * Encrypt / decrypt using the Code Book Chaining mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher-block_chaining_.28CBC.29\r
+ */\r
+define('CRYPT_AES_MODE_CBC', 2);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher_feedback_.28CFB.29\r
+ */\r
+define('CRYPT_AES_MODE_CFB', 3);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Output_feedback_.28OFB.29\r
+ */\r
+define('CRYPT_AES_MODE_OFB', 4);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_AES::Crypt_AES()\r
+ */\r
+/**\r
+ * Toggles the internal implementation\r
+ */\r
+define('CRYPT_AES_MODE_INTERNAL', 1);\r
+/**\r
+ * Toggles the mcrypt implementation\r
+ */\r
+define('CRYPT_AES_MODE_MCRYPT', 2);\r
+/**#@-*/\r
+\r
+/**\r
+ * Pure-PHP implementation of AES.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @version 0.1.0\r
+ * @access public\r
+ * @package Crypt_AES\r
+ */\r
+class Crypt_AES extends Crypt_Rijndael {\r
+ /**\r
+ * mcrypt resource for encryption\r
+ *\r
+ * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.\r
+ * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.\r
+ *\r
+ * @see Crypt_AES::encrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $enmcrypt;\r
+\r
+ /**\r
+ * mcrypt resource for decryption\r
+ *\r
+ * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.\r
+ * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.\r
+ *\r
+ * @see Crypt_AES::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $demcrypt;\r
+\r
+ /**\r
+ * mcrypt resource for CFB mode\r
+ *\r
+ * @see Crypt_AES::encrypt()\r
+ * @see Crypt_AES::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $ecb;\r
+\r
+ /**\r
+ * Default Constructor.\r
+ *\r
+ * Determines whether or not the mcrypt extension should be used. $mode should only, at present, be\r
+ * CRYPT_AES_MODE_ECB or CRYPT_AES_MODE_CBC. If not explictly set, CRYPT_AES_MODE_CBC will be used.\r
+ *\r
+ * @param optional Integer $mode\r
+ * @return Crypt_AES\r
+ * @access public\r
+ */\r
+ function Crypt_AES($mode = CRYPT_AES_MODE_CBC)\r
+ {\r
+ if ( !defined('CRYPT_AES_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('mcrypt') && in_array('rijndael-128', mcrypt_list_algorithms()):\r
+ define('CRYPT_AES_MODE', CRYPT_AES_MODE_MCRYPT);\r
+ break;\r
+ default:\r
+ define('CRYPT_AES_MODE', CRYPT_AES_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ switch ( CRYPT_AES_MODE ) {\r
+ case CRYPT_AES_MODE_MCRYPT:\r
+ switch ($mode) {\r
+ case CRYPT_AES_MODE_ECB:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_ECB;\r
+ break;\r
+ case CRYPT_AES_MODE_CTR:\r
+ // ctr doesn't have a constant associated with it even though it appears to be fairly widely\r
+ // supported. in lieu of knowing just how widely supported it is, i've, for now, opted not to\r
+ // include a compatibility layer. the layer has been implemented but, for now, is commented out.\r
+ $this->mode = 'ctr';\r
+ //$this->mode = in_array('ctr', mcrypt_list_modes()) ? 'ctr' : CRYPT_AES_MODE_CTR;\r
+ break;\r
+ case CRYPT_AES_MODE_CFB:\r
+ $this->mode = 'ncfb';\r
+ break;\r
+ case CRYPT_AES_MODE_OFB:\r
+ $this->mode = MCRYPT_MODE_NOFB;\r
+ break;\r
+ case CRYPT_AES_MODE_CBC:\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_CBC;\r
+ }\r
+\r
+ break;\r
+ default:\r
+ switch ($mode) {\r
+ case CRYPT_AES_MODE_ECB:\r
+ $this->paddable = true;\r
+ $this->mode = CRYPT_RIJNDAEL_MODE_ECB;\r
+ break;\r
+ case CRYPT_AES_MODE_CTR:\r
+ $this->mode = CRYPT_RIJNDAEL_MODE_CTR;\r
+ break;\r
+ case CRYPT_AES_MODE_CFB:\r
+ $this->mode = CRYPT_RIJNDAEL_MODE_CFB;\r
+ break;\r
+ case CRYPT_AES_MODE_OFB:\r
+ $this->mode = CRYPT_RIJNDAEL_MODE_OFB;\r
+ break;\r
+ case CRYPT_AES_MODE_CBC:\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = CRYPT_RIJNDAEL_MODE_CBC;\r
+ }\r
+ }\r
+\r
+ if (CRYPT_AES_MODE == CRYPT_AES_MODE_INTERNAL) {\r
+ parent::Crypt_Rijndael($this->mode);\r
+ }\r
+\r
+ }\r
+\r
+ /**\r
+ * Dummy function\r
+ *\r
+ * Since Crypt_AES extends Crypt_Rijndael, this function is, technically, available, but it doesn't do anything.\r
+ *\r
+ * @access public\r
+ * @param Integer $length\r
+ */\r
+ function setBlockLength($length)\r
+ {\r
+ return;\r
+ }\r
+\r
+ /**\r
+ * Sets the initialization vector. (optional)\r
+ *\r
+ * SetIV is not required when CRYPT_RIJNDAEL_MODE_ECB is being used. If not explictly set, it'll be assumed\r
+ * to be all zero's.\r
+ *\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function setIV($iv)\r
+ {\r
+ parent::setIV($iv);\r
+ if ( CRYPT_AES_MODE == CRYPT_AES_MODE_MCRYPT ) {\r
+ $this->changed = true;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Encrypts a message.\r
+ *\r
+ * $plaintext will be padded with up to 16 additional bytes. Other AES implementations may or may not pad in the\r
+ * same manner. Other common approaches to padding and the reasons why it's necessary are discussed in the following\r
+ * URL:\r
+ *\r
+ * {@link http://www.di-mgt.com.au/cryptopad.html http://www.di-mgt.com.au/cryptopad.html}\r
+ *\r
+ * An alternative to padding is to, separately, send the length of the file. This is what SSH, in fact, does.\r
+ * strlen($plaintext) will still need to be a multiple of 16, however, arbitrary values can be added to make it that\r
+ * length.\r
+ *\r
+ * @see Crypt_AES::decrypt()\r
+ * @access public\r
+ * @param String $plaintext\r
+ */\r
+ function encrypt($plaintext)\r
+ {\r
+ if ( CRYPT_AES_MODE == CRYPT_AES_MODE_MCRYPT ) {\r
+ $this->_mcryptSetup();\r
+\r
+ // re: http://phpseclib.sourceforge.net/cfb-demo.phps\r
+ // using mcrypt's default handing of CFB the above would output two different things. using phpseclib's\r
+ // rewritten CFB implementation the above outputs the same thing twice.\r
+ if ($this->mode == 'ncfb' && $this->continuousBuffer) {\r
+ $iv = &$this->encryptIV;\r
+ $pos = &$this->enbuffer['pos'];\r
+ $len = strlen($plaintext);\r
+ $ciphertext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 16 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $plaintext;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ $this->enbuffer['enmcrypt_init'] = true;\r
+ }\r
+ if ($len >= 16) {\r
+ if ($this->enbuffer['enmcrypt_init'] === false || $len > 280) {\r
+ if ($this->enbuffer['enmcrypt_init'] === true) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $iv);\r
+ $this->enbuffer['enmcrypt_init'] = false;\r
+ }\r
+ $ciphertext.= mcrypt_generic($this->enmcrypt, substr($plaintext, $i, $len - $len % 16));\r
+ $iv = substr($ciphertext, -16);\r
+ $len%= 16;\r
+ } else {\r
+ while ($len >= 16) {\r
+ $iv = mcrypt_generic($this->ecb, $iv) ^ substr($plaintext, $i, 16);\r
+ $ciphertext.= $iv;\r
+ $len-= 16;\r
+ $i+= 16;\r
+ }\r
+ }\r
+ }\r
+\r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $block = $iv ^ substr($plaintext, -$len);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ if ($this->paddable) {\r
+ $plaintext = $this->_pad($plaintext);\r
+ }\r
+\r
+ $ciphertext = mcrypt_generic($this->enmcrypt, $plaintext);\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->iv);\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ return parent::encrypt($plaintext);\r
+ }\r
+\r
+ /**\r
+ * Decrypts a message.\r
+ *\r
+ * If strlen($ciphertext) is not a multiple of 16, null bytes will be added to the end of the string until it is.\r
+ *\r
+ * @see Crypt_AES::encrypt()\r
+ * @access public\r
+ * @param String $ciphertext\r
+ */\r
+ function decrypt($ciphertext)\r
+ {\r
+ if ( CRYPT_AES_MODE == CRYPT_AES_MODE_MCRYPT ) {\r
+ $this->_mcryptSetup();\r
+\r
+ if ($this->mode == 'ncfb' && $this->continuousBuffer) {\r
+ $iv = &$this->decryptIV;\r
+ $pos = &$this->debuffer['pos'];\r
+ $len = strlen($ciphertext);\r
+ $plaintext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 16 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ // ie. $i = min($max, $len), $len-= $i, $pos+= $i, $pos%= $blocksize\r
+ $plaintext = substr($iv, $orig_pos) ^ $ciphertext;\r
+ $iv = substr_replace($iv, substr($ciphertext, 0, $i), $orig_pos, $i);\r
+ }\r
+ if ($len >= 16) {\r
+ $cb = substr($ciphertext, $i, $len - $len % 16);\r
+ $plaintext.= mcrypt_generic($this->ecb, $iv . $cb) ^ $cb;\r
+ $iv = substr($cb, -16);\r
+ $len%= 16;\r
+ }\r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $plaintext.= $iv ^ substr($ciphertext, -$len);\r
+ $iv = substr_replace($iv, substr($ciphertext, -$len), 0, $len);\r
+ $pos = $len;\r
+ }\r
+\r
+ return $plaintext;\r
+ }\r
+\r
+ if ($this->paddable) {\r
+ // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :\r
+ // "The data is padded with "\0" to make sure the length of the data is n * blocksize."\r
+ $ciphertext = str_pad($ciphertext, (strlen($ciphertext) + 15) & 0xFFFFFFF0, chr(0));\r
+ }\r
+\r
+ $plaintext = mdecrypt_generic($this->demcrypt, $ciphertext);\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->iv);\r
+ }\r
+\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ return parent::decrypt($ciphertext);\r
+ }\r
+\r
+ /**\r
+ * Setup mcrypt\r
+ *\r
+ * Validates all the variables.\r
+ *\r
+ * @access private\r
+ */\r
+ function _mcryptSetup()\r
+ {\r
+ if (!$this->changed) {\r
+ return;\r
+ }\r
+\r
+ if (!$this->explicit_key_length) {\r
+ // this just copied from Crypt_Rijndael::_setup()\r
+ $length = strlen($this->key) >> 2;\r
+ if ($length > 8) {\r
+ $length = 8;\r
+ } else if ($length < 4) {\r
+ $length = 4;\r
+ }\r
+ $this->Nk = $length;\r
+ $this->key_size = $length << 2;\r
+ }\r
+\r
+ switch ($this->Nk) {\r
+ case 4: // 128\r
+ $this->key_size = 16;\r
+ break;\r
+ case 5: // 160\r
+ case 6: // 192\r
+ $this->key_size = 24;\r
+ break;\r
+ case 7: // 224\r
+ case 8: // 256\r
+ $this->key_size = 32;\r
+ }\r
+\r
+ $this->key = str_pad(substr($this->key, 0, $this->key_size), $this->key_size, chr(0));\r
+ $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($this->iv, 0, 16), 16, chr(0));\r
+\r
+ if (!isset($this->enmcrypt)) {\r
+ $mode = $this->mode;\r
+ //$mode = $this->mode == CRYPT_AES_MODE_CTR ? MCRYPT_MODE_ECB : $this->mode;\r
+\r
+ $this->demcrypt = mcrypt_module_open(MCRYPT_RIJNDAEL_128, '', $mode, '');\r
+ $this->enmcrypt = mcrypt_module_open(MCRYPT_RIJNDAEL_128, '', $mode, '');\r
+\r
+ if ($mode == 'ncfb') {\r
+ $this->ecb = mcrypt_module_open(MCRYPT_RIJNDAEL_128, '', MCRYPT_MODE_ECB, '');\r
+ }\r
+\r
+ } // else should mcrypt_generic_deinit be called?\r
+\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->iv);\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->iv);\r
+\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->key, "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0");\r
+ }\r
+\r
+ $this->changed = false;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive "packets" as if they are a continuous buffer.\r
+ *\r
+ * The default behavior.\r
+ *\r
+ * @see Crypt_Rijndael::disableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function enableContinuousBuffer()\r
+ {\r
+ parent::enableContinuousBuffer();\r
+\r
+ if (CRYPT_AES_MODE == CRYPT_AES_MODE_MCRYPT) {\r
+ $this->enbuffer['enmcrypt_init'] = true;\r
+ $this->debuffer['demcrypt_init'] = true;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive packets as if they are a discontinuous buffer.\r
+ *\r
+ * The default behavior.\r
+ *\r
+ * @see Crypt_Rijndael::enableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function disableContinuousBuffer()\r
+ {\r
+ parent::disableContinuousBuffer();\r
+\r
+ if (CRYPT_AES_MODE == CRYPT_AES_MODE_MCRYPT) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->iv);\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->iv);\r
+ }\r
+ }\r
+}\r
+\r
+// vim: ts=4:sw=4:et:\r
+// vim6: fdl=1:\r
--- /dev/null
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP implementation of Blowfish.\r
+ *\r
+ * Uses mcrypt, if available, and an internal implementation, otherwise.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * Useful resources are as follows:\r
+ *\r
+ * - {@link http://en.wikipedia.org/wiki/Blowfish Wikipedia description of Blowfish}\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/Blowfish.php');\r
+ *\r
+ * $blowfish = new Crypt_Blowfish();\r
+ *\r
+ * $blowfish->setKey('12345678901234567890123456789012');\r
+ *\r
+ * $plaintext = str_repeat('a', 1024);\r
+ *\r
+ * echo $blowfish->decrypt($blowfish->encrypt($plaintext));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ *\r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ *\r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_Blowfish\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @author Hans-Juergen Petrich <petrich@tronic-media.com>\r
+ * @copyright MMVII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @version 1.0\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_Blowfish::encrypt()\r
+ * @see Crypt_Blowfish::decrypt()\r
+ */\r
+/**\r
+ * Encrypt / decrypt using the Counter mode.\r
+ *\r
+ * Set to -1 since that's what Crypt/Random.php uses to index the CTR mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Counter_.28CTR.29\r
+ */\r
+define('CRYPT_BLOWFISH_MODE_CTR', -1);\r
+/**\r
+ * Encrypt / decrypt using the Electronic Code Book mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Electronic_codebook_.28ECB.29\r
+ */\r
+define('CRYPT_BLOWFISH_MODE_ECB', 1);\r
+/**\r
+ * Encrypt / decrypt using the Code Book Chaining mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher-block_chaining_.28CBC.29\r
+ */\r
+define('CRYPT_BLOWFISH_MODE_CBC', 2);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher_feedback_.28CFB.29\r
+ */\r
+define('CRYPT_BLOWFISH_MODE_CFB', 3);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Output_feedback_.28OFB.29\r
+ */\r
+define('CRYPT_BLOWFISH_MODE_OFB', 4);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_Blowfish::Crypt_Blowfish()\r
+ */\r
+/**\r
+ * Toggles the internal implementation\r
+ */\r
+define('CRYPT_BLOWFISH_MODE_INTERNAL', 1);\r
+/**\r
+ * Toggles the mcrypt implementation\r
+ */\r
+define('CRYPT_BLOWFISH_MODE_MCRYPT', 2);\r
+/**#@-*/\r
+\r
+/**\r
+ * Pure-PHP implementation of Blowfish.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @author Hans-Juergen Petrich <petrich@tronic-media.com>\r
+ * @version 1.0\r
+ * @access public\r
+ * @package Crypt_Blowfish\r
+ */\r
+class Crypt_Blowfish {\r
+ /**\r
+ * The Key as String\r
+ *\r
+ * @see Crypt_Blowfish::setKey()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $key = "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * The Encryption Mode\r
+ *\r
+ * @see Crypt_Blowfish::Crypt_Blowfish()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $mode;\r
+\r
+ /**\r
+ * Continuous Buffer status\r
+ *\r
+ * @see Crypt_Blowfish::enableContinuousBuffer()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $continuousBuffer = false;\r
+\r
+ /**\r
+ * Padding status\r
+ *\r
+ * @see Crypt_Blowfish::enablePadding()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $padding = true;\r
+\r
+ /**\r
+ * The Initialization Vector\r
+ *\r
+ * @see Crypt_Blowfish::setIV()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $iv = "\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * A "sliding" Initialization Vector\r
+ *\r
+ * @see Crypt_Blowfish::enableContinuousBuffer()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $encryptIV = "\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * A "sliding" Initialization Vector\r
+ *\r
+ * @see Crypt_Blowfish::enableContinuousBuffer()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $decryptIV = "\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * mcrypt resource for encryption\r
+ *\r
+ * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.\r
+ * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.\r
+ *\r
+ * @see Crypt_Blowfish::encrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $enmcrypt;\r
+\r
+ /**\r
+ * mcrypt resource for decryption\r
+ *\r
+ * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.\r
+ * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.\r
+ *\r
+ * @see Crypt_Blowfish::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $demcrypt;\r
+\r
+ /**\r
+ * Does the enmcrypt resource need to be (re)initialized?\r
+ *\r
+ * @see Crypt_Blowfish::setKey()\r
+ * @see Crypt_Blowfish::setIV()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $enchanged = true;\r
+\r
+ /**\r
+ * Does the demcrypt resource need to be (re)initialized?\r
+ *\r
+ * @see Crypt_Blowfish::setKey()\r
+ * @see Crypt_Blowfish::setIV()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $dechanged = true;\r
+\r
+ /**\r
+ * Is the mode one that is paddable?\r
+ *\r
+ * @see Crypt_Blowfish::Crypt_Blowfish()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $paddable = false;\r
+\r
+ /**\r
+ * Encryption buffer for CTR, OFB and CFB modes\r
+ *\r
+ * @see Crypt_Blowfish::encrypt()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0, 'enmcrypt_init' => true);\r
+\r
+ /**\r
+ * Decryption buffer for CTR, OFB and CFB modes\r
+ *\r
+ * @see Crypt_Blowfish::decrypt()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0, 'demcrypt_init' => true);\r
+\r
+ /**\r
+ * mcrypt resource for CFB mode\r
+ *\r
+ * @see Crypt_Blowfish::encrypt()\r
+ * @see Crypt_Blowfish::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $ecb;\r
+\r
+ /**\r
+ * Performance-optimized callback function for en/decrypt()\r
+ *\r
+ * @var Callback\r
+ * @access private\r
+ */\r
+ var $inline_crypt;\r
+\r
+ /**\r
+ * The fixed subkeys boxes ($sbox0 - $sbox3) with 256 entries each\r
+ *\r
+ * S-Box 1\r
+ *\r
+ * @access private\r
+ * @var array\r
+ */\r
+ var $sbox0 = array (\r
+ 0xd1310ba6, 0x98dfb5ac, 0x2ffd72db, 0xd01adfb7, 0xb8e1afed, 0x6a267e96, 0xba7c9045, 0xf12c7f99,\r
+ 0x24a19947, 0xb3916cf7, 0x0801f2e2, 0x858efc16, 0x636920d8, 0x71574e69, 0xa458fea3, 0xf4933d7e,\r
+ 0x0d95748f, 0x728eb658, 0x718bcd58, 0x82154aee, 0x7b54a41d, 0xc25a59b5, 0x9c30d539, 0x2af26013,\r
+ 0xc5d1b023, 0x286085f0, 0xca417918, 0xb8db38ef, 0x8e79dcb0, 0x603a180e, 0x6c9e0e8b, 0xb01e8a3e,\r
+ 0xd71577c1, 0xbd314b27, 0x78af2fda, 0x55605c60, 0xe65525f3, 0xaa55ab94, 0x57489862, 0x63e81440,\r
+ 0x55ca396a, 0x2aab10b6, 0xb4cc5c34, 0x1141e8ce, 0xa15486af, 0x7c72e993, 0xb3ee1411, 0x636fbc2a,\r
+ 0x2ba9c55d, 0x741831f6, 0xce5c3e16, 0x9b87931e, 0xafd6ba33, 0x6c24cf5c, 0x7a325381, 0x28958677,\r
+ 0x3b8f4898, 0x6b4bb9af, 0xc4bfe81b, 0x66282193, 0x61d809cc, 0xfb21a991, 0x487cac60, 0x5dec8032,\r
+ 0xef845d5d, 0xe98575b1, 0xdc262302, 0xeb651b88, 0x23893e81, 0xd396acc5, 0x0f6d6ff3, 0x83f44239,\r
+ 0x2e0b4482, 0xa4842004, 0x69c8f04a, 0x9e1f9b5e, 0x21c66842, 0xf6e96c9a, 0x670c9c61, 0xabd388f0,\r
+ 0x6a51a0d2, 0xd8542f68, 0x960fa728, 0xab5133a3, 0x6eef0b6c, 0x137a3be4, 0xba3bf050, 0x7efb2a98,\r
+ 0xa1f1651d, 0x39af0176, 0x66ca593e, 0x82430e88, 0x8cee8619, 0x456f9fb4, 0x7d84a5c3, 0x3b8b5ebe,\r
+ 0xe06f75d8, 0x85c12073, 0x401a449f, 0x56c16aa6, 0x4ed3aa62, 0x363f7706, 0x1bfedf72, 0x429b023d,\r
+ 0x37d0d724, 0xd00a1248, 0xdb0fead3, 0x49f1c09b, 0x075372c9, 0x80991b7b, 0x25d479d8, 0xf6e8def7,\r
+ 0xe3fe501a, 0xb6794c3b, 0x976ce0bd, 0x04c006ba, 0xc1a94fb6, 0x409f60c4, 0x5e5c9ec2, 0x196a2463,\r
+ 0x68fb6faf, 0x3e6c53b5, 0x1339b2eb, 0x3b52ec6f, 0x6dfc511f, 0x9b30952c, 0xcc814544, 0xaf5ebd09,\r
+ 0xbee3d004, 0xde334afd, 0x660f2807, 0x192e4bb3, 0xc0cba857, 0x45c8740f, 0xd20b5f39, 0xb9d3fbdb,\r
+ 0x5579c0bd, 0x1a60320a, 0xd6a100c6, 0x402c7279, 0x679f25fe, 0xfb1fa3cc, 0x8ea5e9f8, 0xdb3222f8,\r
+ 0x3c7516df, 0xfd616b15, 0x2f501ec8, 0xad0552ab, 0x323db5fa, 0xfd238760, 0x53317b48, 0x3e00df82,\r
+ 0x9e5c57bb, 0xca6f8ca0, 0x1a87562e, 0xdf1769db, 0xd542a8f6, 0x287effc3, 0xac6732c6, 0x8c4f5573,\r
+ 0x695b27b0, 0xbbca58c8, 0xe1ffa35d, 0xb8f011a0, 0x10fa3d98, 0xfd2183b8, 0x4afcb56c, 0x2dd1d35b,\r
+ 0x9a53e479, 0xb6f84565, 0xd28e49bc, 0x4bfb9790, 0xe1ddf2da, 0xa4cb7e33, 0x62fb1341, 0xcee4c6e8,\r
+ 0xef20cada, 0x36774c01, 0xd07e9efe, 0x2bf11fb4, 0x95dbda4d, 0xae909198, 0xeaad8e71, 0x6b93d5a0,\r
+ 0xd08ed1d0, 0xafc725e0, 0x8e3c5b2f, 0x8e7594b7, 0x8ff6e2fb, 0xf2122b64, 0x8888b812, 0x900df01c,\r
+ 0x4fad5ea0, 0x688fc31c, 0xd1cff191, 0xb3a8c1ad, 0x2f2f2218, 0xbe0e1777, 0xea752dfe, 0x8b021fa1,\r
+ 0xe5a0cc0f, 0xb56f74e8, 0x18acf3d6, 0xce89e299, 0xb4a84fe0, 0xfd13e0b7, 0x7cc43b81, 0xd2ada8d9,\r
+ 0x165fa266, 0x80957705, 0x93cc7314, 0x211a1477, 0xe6ad2065, 0x77b5fa86, 0xc75442f5, 0xfb9d35cf,\r
+ 0xebcdaf0c, 0x7b3e89a0, 0xd6411bd3, 0xae1e7e49, 0x00250e2d, 0x2071b35e, 0x226800bb, 0x57b8e0af,\r
+ 0x2464369b, 0xf009b91e, 0x5563911d, 0x59dfa6aa, 0x78c14389, 0xd95a537f, 0x207d5ba2, 0x02e5b9c5,\r
+ 0x83260376, 0x6295cfa9, 0x11c81968, 0x4e734a41, 0xb3472dca, 0x7b14a94a, 0x1b510052, 0x9a532915,\r
+ 0xd60f573f, 0xbc9bc6e4, 0x2b60a476, 0x81e67400, 0x08ba6fb5, 0x571be91f, 0xf296ec6b, 0x2a0dd915,\r
+ 0xb6636521, 0xe7b9f9b6, 0xff34052e, 0xc5855664, 0x53b02d5d, 0xa99f8fa1, 0x08ba4799, 0x6e85076a\r
+ );\r
+\r
+ /**\r
+ * S-Box 1\r
+ *\r
+ * @access private\r
+ * @var array\r
+ */\r
+ var $sbox1 = array(\r
+ 0x4b7a70e9, 0xb5b32944, 0xdb75092e, 0xc4192623, 0xad6ea6b0, 0x49a7df7d, 0x9cee60b8, 0x8fedb266,\r
+ 0xecaa8c71, 0x699a17ff, 0x5664526c, 0xc2b19ee1, 0x193602a5, 0x75094c29, 0xa0591340, 0xe4183a3e,\r
+ 0x3f54989a, 0x5b429d65, 0x6b8fe4d6, 0x99f73fd6, 0xa1d29c07, 0xefe830f5, 0x4d2d38e6, 0xf0255dc1,\r
+ 0x4cdd2086, 0x8470eb26, 0x6382e9c6, 0x021ecc5e, 0x09686b3f, 0x3ebaefc9, 0x3c971814, 0x6b6a70a1,\r
+ 0x687f3584, 0x52a0e286, 0xb79c5305, 0xaa500737, 0x3e07841c, 0x7fdeae5c, 0x8e7d44ec, 0x5716f2b8,\r
+ 0xb03ada37, 0xf0500c0d, 0xf01c1f04, 0x0200b3ff, 0xae0cf51a, 0x3cb574b2, 0x25837a58, 0xdc0921bd,\r
+ 0xd19113f9, 0x7ca92ff6, 0x94324773, 0x22f54701, 0x3ae5e581, 0x37c2dadc, 0xc8b57634, 0x9af3dda7,\r
+ 0xa9446146, 0x0fd0030e, 0xecc8c73e, 0xa4751e41, 0xe238cd99, 0x3bea0e2f, 0x3280bba1, 0x183eb331,\r
+ 0x4e548b38, 0x4f6db908, 0x6f420d03, 0xf60a04bf, 0x2cb81290, 0x24977c79, 0x5679b072, 0xbcaf89af,\r
+ 0xde9a771f, 0xd9930810, 0xb38bae12, 0xdccf3f2e, 0x5512721f, 0x2e6b7124, 0x501adde6, 0x9f84cd87,\r
+ 0x7a584718, 0x7408da17, 0xbc9f9abc, 0xe94b7d8c, 0xec7aec3a, 0xdb851dfa, 0x63094366, 0xc464c3d2,\r
+ 0xef1c1847, 0x3215d908, 0xdd433b37, 0x24c2ba16, 0x12a14d43, 0x2a65c451, 0x50940002, 0x133ae4dd,\r
+ 0x71dff89e, 0x10314e55, 0x81ac77d6, 0x5f11199b, 0x043556f1, 0xd7a3c76b, 0x3c11183b, 0x5924a509,\r
+ 0xf28fe6ed, 0x97f1fbfa, 0x9ebabf2c, 0x1e153c6e, 0x86e34570, 0xeae96fb1, 0x860e5e0a, 0x5a3e2ab3,\r
+ 0x771fe71c, 0x4e3d06fa, 0x2965dcb9, 0x99e71d0f, 0x803e89d6, 0x5266c825, 0x2e4cc978, 0x9c10b36a,\r
+ 0xc6150eba, 0x94e2ea78, 0xa5fc3c53, 0x1e0a2df4, 0xf2f74ea7, 0x361d2b3d, 0x1939260f, 0x19c27960,\r
+ 0x5223a708, 0xf71312b6, 0xebadfe6e, 0xeac31f66, 0xe3bc4595, 0xa67bc883, 0xb17f37d1, 0x018cff28,\r
+ 0xc332ddef, 0xbe6c5aa5, 0x65582185, 0x68ab9802, 0xeecea50f, 0xdb2f953b, 0x2aef7dad, 0x5b6e2f84,\r
+ 0x1521b628, 0x29076170, 0xecdd4775, 0x619f1510, 0x13cca830, 0xeb61bd96, 0x0334fe1e, 0xaa0363cf,\r
+ 0xb5735c90, 0x4c70a239, 0xd59e9e0b, 0xcbaade14, 0xeecc86bc, 0x60622ca7, 0x9cab5cab, 0xb2f3846e,\r
+ 0x648b1eaf, 0x19bdf0ca, 0xa02369b9, 0x655abb50, 0x40685a32, 0x3c2ab4b3, 0x319ee9d5, 0xc021b8f7,\r
+ 0x9b540b19, 0x875fa099, 0x95f7997e, 0x623d7da8, 0xf837889a, 0x97e32d77, 0x11ed935f, 0x16681281,\r
+ 0x0e358829, 0xc7e61fd6, 0x96dedfa1, 0x7858ba99, 0x57f584a5, 0x1b227263, 0x9b83c3ff, 0x1ac24696,\r
+ 0xcdb30aeb, 0x532e3054, 0x8fd948e4, 0x6dbc3128, 0x58ebf2ef, 0x34c6ffea, 0xfe28ed61, 0xee7c3c73,\r
+ 0x5d4a14d9, 0xe864b7e3, 0x42105d14, 0x203e13e0, 0x45eee2b6, 0xa3aaabea, 0xdb6c4f15, 0xfacb4fd0,\r
+ 0xc742f442, 0xef6abbb5, 0x654f3b1d, 0x41cd2105, 0xd81e799e, 0x86854dc7, 0xe44b476a, 0x3d816250,\r
+ 0xcf62a1f2, 0x5b8d2646, 0xfc8883a0, 0xc1c7b6a3, 0x7f1524c3, 0x69cb7492, 0x47848a0b, 0x5692b285,\r
+ 0x095bbf00, 0xad19489d, 0x1462b174, 0x23820e00, 0x58428d2a, 0x0c55f5ea, 0x1dadf43e, 0x233f7061,\r
+ 0x3372f092, 0x8d937e41, 0xd65fecf1, 0x6c223bdb, 0x7cde3759, 0xcbee7460, 0x4085f2a7, 0xce77326e,\r
+ 0xa6078084, 0x19f8509e, 0xe8efd855, 0x61d99735, 0xa969a7aa, 0xc50c06c2, 0x5a04abfc, 0x800bcadc,\r
+ 0x9e447a2e, 0xc3453484, 0xfdd56705, 0x0e1e9ec9, 0xdb73dbd3, 0x105588cd, 0x675fda79, 0xe3674340,\r
+ 0xc5c43465, 0x713e38d8, 0x3d28f89e, 0xf16dff20, 0x153e21e7, 0x8fb03d4a, 0xe6e39f2b, 0xdb83adf7\r
+ );\r
+\r
+ /**\r
+ * S-Box 2\r
+ *\r
+ * @access private\r
+ * @var array\r
+ */\r
+ var $sbox2 = array(\r
+ 0xe93d5a68, 0x948140f7, 0xf64c261c, 0x94692934, 0x411520f7, 0x7602d4f7, 0xbcf46b2e, 0xd4a20068,\r
+ 0xd4082471, 0x3320f46a, 0x43b7d4b7, 0x500061af, 0x1e39f62e, 0x97244546, 0x14214f74, 0xbf8b8840,\r
+ 0x4d95fc1d, 0x96b591af, 0x70f4ddd3, 0x66a02f45, 0xbfbc09ec, 0x03bd9785, 0x7fac6dd0, 0x31cb8504,\r
+ 0x96eb27b3, 0x55fd3941, 0xda2547e6, 0xabca0a9a, 0x28507825, 0x530429f4, 0x0a2c86da, 0xe9b66dfb,\r
+ 0x68dc1462, 0xd7486900, 0x680ec0a4, 0x27a18dee, 0x4f3ffea2, 0xe887ad8c, 0xb58ce006, 0x7af4d6b6,\r
+ 0xaace1e7c, 0xd3375fec, 0xce78a399, 0x406b2a42, 0x20fe9e35, 0xd9f385b9, 0xee39d7ab, 0x3b124e8b,\r
+ 0x1dc9faf7, 0x4b6d1856, 0x26a36631, 0xeae397b2, 0x3a6efa74, 0xdd5b4332, 0x6841e7f7, 0xca7820fb,\r
+ 0xfb0af54e, 0xd8feb397, 0x454056ac, 0xba489527, 0x55533a3a, 0x20838d87, 0xfe6ba9b7, 0xd096954b,\r
+ 0x55a867bc, 0xa1159a58, 0xcca92963, 0x99e1db33, 0xa62a4a56, 0x3f3125f9, 0x5ef47e1c, 0x9029317c,\r
+ 0xfdf8e802, 0x04272f70, 0x80bb155c, 0x05282ce3, 0x95c11548, 0xe4c66d22, 0x48c1133f, 0xc70f86dc,\r
+ 0x07f9c9ee, 0x41041f0f, 0x404779a4, 0x5d886e17, 0x325f51eb, 0xd59bc0d1, 0xf2bcc18f, 0x41113564,\r
+ 0x257b7834, 0x602a9c60, 0xdff8e8a3, 0x1f636c1b, 0x0e12b4c2, 0x02e1329e, 0xaf664fd1, 0xcad18115,\r
+ 0x6b2395e0, 0x333e92e1, 0x3b240b62, 0xeebeb922, 0x85b2a20e, 0xe6ba0d99, 0xde720c8c, 0x2da2f728,\r
+ 0xd0127845, 0x95b794fd, 0x647d0862, 0xe7ccf5f0, 0x5449a36f, 0x877d48fa, 0xc39dfd27, 0xf33e8d1e,\r
+ 0x0a476341, 0x992eff74, 0x3a6f6eab, 0xf4f8fd37, 0xa812dc60, 0xa1ebddf8, 0x991be14c, 0xdb6e6b0d,\r
+ 0xc67b5510, 0x6d672c37, 0x2765d43b, 0xdcd0e804, 0xf1290dc7, 0xcc00ffa3, 0xb5390f92, 0x690fed0b,\r
+ 0x667b9ffb, 0xcedb7d9c, 0xa091cf0b, 0xd9155ea3, 0xbb132f88, 0x515bad24, 0x7b9479bf, 0x763bd6eb,\r
+ 0x37392eb3, 0xcc115979, 0x8026e297, 0xf42e312d, 0x6842ada7, 0xc66a2b3b, 0x12754ccc, 0x782ef11c,\r
+ 0x6a124237, 0xb79251e7, 0x06a1bbe6, 0x4bfb6350, 0x1a6b1018, 0x11caedfa, 0x3d25bdd8, 0xe2e1c3c9,\r
+ 0x44421659, 0x0a121386, 0xd90cec6e, 0xd5abea2a, 0x64af674e, 0xda86a85f, 0xbebfe988, 0x64e4c3fe,\r
+ 0x9dbc8057, 0xf0f7c086, 0x60787bf8, 0x6003604d, 0xd1fd8346, 0xf6381fb0, 0x7745ae04, 0xd736fccc,\r
+ 0x83426b33, 0xf01eab71, 0xb0804187, 0x3c005e5f, 0x77a057be, 0xbde8ae24, 0x55464299, 0xbf582e61,\r
+ 0x4e58f48f, 0xf2ddfda2, 0xf474ef38, 0x8789bdc2, 0x5366f9c3, 0xc8b38e74, 0xb475f255, 0x46fcd9b9,\r
+ 0x7aeb2661, 0x8b1ddf84, 0x846a0e79, 0x915f95e2, 0x466e598e, 0x20b45770, 0x8cd55591, 0xc902de4c,\r
+ 0xb90bace1, 0xbb8205d0, 0x11a86248, 0x7574a99e, 0xb77f19b6, 0xe0a9dc09, 0x662d09a1, 0xc4324633,\r
+ 0xe85a1f02, 0x09f0be8c, 0x4a99a025, 0x1d6efe10, 0x1ab93d1d, 0x0ba5a4df, 0xa186f20f, 0x2868f169,\r
+ 0xdcb7da83, 0x573906fe, 0xa1e2ce9b, 0x4fcd7f52, 0x50115e01, 0xa70683fa, 0xa002b5c4, 0x0de6d027,\r
+ 0x9af88c27, 0x773f8641, 0xc3604c06, 0x61a806b5, 0xf0177a28, 0xc0f586e0, 0x006058aa, 0x30dc7d62,\r
+ 0x11e69ed7, 0x2338ea63, 0x53c2dd94, 0xc2c21634, 0xbbcbee56, 0x90bcb6de, 0xebfc7da1, 0xce591d76,\r
+ 0x6f05e409, 0x4b7c0188, 0x39720a3d, 0x7c927c24, 0x86e3725f, 0x724d9db9, 0x1ac15bb4, 0xd39eb8fc,\r
+ 0xed545578, 0x08fca5b5, 0xd83d7cd3, 0x4dad0fc4, 0x1e50ef5e, 0xb161e6f8, 0xa28514d9, 0x6c51133c,\r
+ 0x6fd5c7e7, 0x56e14ec4, 0x362abfce, 0xddc6c837, 0xd79a3234, 0x92638212, 0x670efa8e, 0x406000e0\r
+ );\r
+\r
+ /**\r
+ * S-Box 3\r
+ *\r
+ * @access private\r
+ * @var array\r
+ */\r
+ var $sbox3 = array(\r
+ 0x3a39ce37, 0xd3faf5cf, 0xabc27737, 0x5ac52d1b, 0x5cb0679e, 0x4fa33742, 0xd3822740, 0x99bc9bbe,\r
+ 0xd5118e9d, 0xbf0f7315, 0xd62d1c7e, 0xc700c47b, 0xb78c1b6b, 0x21a19045, 0xb26eb1be, 0x6a366eb4,\r
+ 0x5748ab2f, 0xbc946e79, 0xc6a376d2, 0x6549c2c8, 0x530ff8ee, 0x468dde7d, 0xd5730a1d, 0x4cd04dc6,\r
+ 0x2939bbdb, 0xa9ba4650, 0xac9526e8, 0xbe5ee304, 0xa1fad5f0, 0x6a2d519a, 0x63ef8ce2, 0x9a86ee22,\r
+ 0xc089c2b8, 0x43242ef6, 0xa51e03aa, 0x9cf2d0a4, 0x83c061ba, 0x9be96a4d, 0x8fe51550, 0xba645bd6,\r
+ 0x2826a2f9, 0xa73a3ae1, 0x4ba99586, 0xef5562e9, 0xc72fefd3, 0xf752f7da, 0x3f046f69, 0x77fa0a59,\r
+ 0x80e4a915, 0x87b08601, 0x9b09e6ad, 0x3b3ee593, 0xe990fd5a, 0x9e34d797, 0x2cf0b7d9, 0x022b8b51,\r
+ 0x96d5ac3a, 0x017da67d, 0xd1cf3ed6, 0x7c7d2d28, 0x1f9f25cf, 0xadf2b89b, 0x5ad6b472, 0x5a88f54c,\r
+ 0xe029ac71, 0xe019a5e6, 0x47b0acfd, 0xed93fa9b, 0xe8d3c48d, 0x283b57cc, 0xf8d56629, 0x79132e28,\r
+ 0x785f0191, 0xed756055, 0xf7960e44, 0xe3d35e8c, 0x15056dd4, 0x88f46dba, 0x03a16125, 0x0564f0bd,\r
+ 0xc3eb9e15, 0x3c9057a2, 0x97271aec, 0xa93a072a, 0x1b3f6d9b, 0x1e6321f5, 0xf59c66fb, 0x26dcf319,\r
+ 0x7533d928, 0xb155fdf5, 0x03563482, 0x8aba3cbb, 0x28517711, 0xc20ad9f8, 0xabcc5167, 0xccad925f,\r
+ 0x4de81751, 0x3830dc8e, 0x379d5862, 0x9320f991, 0xea7a90c2, 0xfb3e7bce, 0x5121ce64, 0x774fbe32,\r
+ 0xa8b6e37e, 0xc3293d46, 0x48de5369, 0x6413e680, 0xa2ae0810, 0xdd6db224, 0x69852dfd, 0x09072166,\r
+ 0xb39a460a, 0x6445c0dd, 0x586cdecf, 0x1c20c8ae, 0x5bbef7dd, 0x1b588d40, 0xccd2017f, 0x6bb4e3bb,\r
+ 0xdda26a7e, 0x3a59ff45, 0x3e350a44, 0xbcb4cdd5, 0x72eacea8, 0xfa6484bb, 0x8d6612ae, 0xbf3c6f47,\r
+ 0xd29be463, 0x542f5d9e, 0xaec2771b, 0xf64e6370, 0x740e0d8d, 0xe75b1357, 0xf8721671, 0xaf537d5d,\r
+ 0x4040cb08, 0x4eb4e2cc, 0x34d2466a, 0x0115af84, 0xe1b00428, 0x95983a1d, 0x06b89fb4, 0xce6ea048,\r
+ 0x6f3f3b82, 0x3520ab82, 0x011a1d4b, 0x277227f8, 0x611560b1, 0xe7933fdc, 0xbb3a792b, 0x344525bd,\r
+ 0xa08839e1, 0x51ce794b, 0x2f32c9b7, 0xa01fbac9, 0xe01cc87e, 0xbcc7d1f6, 0xcf0111c3, 0xa1e8aac7,\r
+ 0x1a908749, 0xd44fbd9a, 0xd0dadecb, 0xd50ada38, 0x0339c32a, 0xc6913667, 0x8df9317c, 0xe0b12b4f,\r
+ 0xf79e59b7, 0x43f5bb3a, 0xf2d519ff, 0x27d9459c, 0xbf97222c, 0x15e6fc2a, 0x0f91fc71, 0x9b941525,\r
+ 0xfae59361, 0xceb69ceb, 0xc2a86459, 0x12baa8d1, 0xb6c1075e, 0xe3056a0c, 0x10d25065, 0xcb03a442,\r
+ 0xe0ec6e0e, 0x1698db3b, 0x4c98a0be, 0x3278e964, 0x9f1f9532, 0xe0d392df, 0xd3a0342b, 0x8971f21e,\r
+ 0x1b0a7441, 0x4ba3348c, 0xc5be7120, 0xc37632d8, 0xdf359f8d, 0x9b992f2e, 0xe60b6f47, 0x0fe3f11d,\r
+ 0xe54cda54, 0x1edad891, 0xce6279cf, 0xcd3e7e6f, 0x1618b166, 0xfd2c1d05, 0x848fd2c5, 0xf6fb2299,\r
+ 0xf523f357, 0xa6327623, 0x93a83531, 0x56cccd02, 0xacf08162, 0x5a75ebb5, 0x6e163697, 0x88d273cc,\r
+ 0xde966292, 0x81b949d0, 0x4c50901b, 0x71c65614, 0xe6c6c7bd, 0x327a140a, 0x45e1d006, 0xc3f27b9a,\r
+ 0xc9aa53fd, 0x62a80f00, 0xbb25bfe2, 0x35bdd2f6, 0x71126905, 0xb2040222, 0xb6cbcf7c, 0xcd769c2b,\r
+ 0x53113ec0, 0x1640e3d3, 0x38abbd60, 0x2547adf0, 0xba38209c, 0xf746ce76, 0x77afa1c5, 0x20756060,\r
+ 0x85cbfe4e, 0x8ae88dd8, 0x7aaaf9b0, 0x4cf9aa7e, 0x1948c25c, 0x02fb8a8c, 0x01c36ae4, 0xd6ebe1f9,\r
+ 0x90d4f869, 0xa65cdea0, 0x3f09252d, 0xc208e69f, 0xb74e6132, 0xce77e25b, 0x578fdfe3, 0x3ac372e6\r
+ );\r
+\r
+ /**\r
+ * P-Array consists of 18 32-bit subkeys\r
+ *\r
+ * @var array $parray\r
+ * @access private\r
+ */\r
+ var $parray = array(\r
+ 0x243f6a88, 0x85a308d3, 0x13198a2e, 0x03707344, 0xa4093822, 0x299f31d0,\r
+ 0x082efa98, 0xec4e6c89, 0x452821e6, 0x38d01377, 0xbe5466cf, 0x34e90c6c,\r
+ 0xc0ac29b7, 0xc97c50dd, 0x3f84d5b5, 0xb5470917, 0x9216d5d9, 0x8979fb1b\r
+ );\r
+\r
+ /**\r
+ * The BCTX-working Array\r
+ *\r
+ * Holds the expanded key [p] and the key-depended s-boxes [sb]\r
+ *\r
+ * @var array $bctx\r
+ * @access private\r
+ */\r
+ var $bctx = array();\r
+\r
+ /**\r
+ * Default Constructor.\r
+ *\r
+ * Determines whether or not the mcrypt extension should be used.\r
+ * If not explictly set, CRYPT_BLOWFISH_MODE_CBC will be used.\r
+ *\r
+ * @param optional Integer $mode\r
+ * @access public\r
+ */\r
+ function Crypt_Blowfish($mode = CRYPT_BLOWFISH_MODE_CBC)\r
+ {\r
+ if ( !defined('CRYPT_BLOWFISH_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('mcrypt') && in_array('blowfish', mcrypt_list_algorithms()):\r
+ define('CRYPT_BLOWFISH_MODE', CRYPT_BLOWFISH_MODE_MCRYPT);\r
+ break;\r
+ default:\r
+ define('CRYPT_BLOWFISH_MODE', CRYPT_BLOWFISH_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ switch ( CRYPT_BLOWFISH_MODE ) {\r
+ case CRYPT_BLOWFISH_MODE_MCRYPT:\r
+ switch ($mode) {\r
+ case CRYPT_BLOWFISH_MODE_ECB:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_ECB;\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_CTR:\r
+ $this->mode = 'ctr';\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_CFB:\r
+ $this->mode = 'ncfb';\r
+ $this->ecb = mcrypt_module_open(MCRYPT_BLOWFISH, '', MCRYPT_MODE_ECB, '');\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_OFB:\r
+ $this->mode = MCRYPT_MODE_NOFB;\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_CBC:\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_CBC;\r
+ }\r
+ $this->enmcrypt = mcrypt_module_open(MCRYPT_BLOWFISH, '', $this->mode, '');\r
+ $this->demcrypt = mcrypt_module_open(MCRYPT_BLOWFISH, '', $this->mode, '');\r
+\r
+ break;\r
+ default:\r
+ switch ($mode) {\r
+ case CRYPT_BLOWFISH_MODE_ECB:\r
+ case CRYPT_BLOWFISH_MODE_CBC:\r
+ $this->paddable = true;\r
+ $this->mode = $mode;\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_CTR:\r
+ case CRYPT_BLOWFISH_MODE_CFB:\r
+ case CRYPT_BLOWFISH_MODE_OFB:\r
+ $this->mode = $mode;\r
+ break;\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = CRYPT_BLOWFISH_MODE_CBC;\r
+ }\r
+ $this->inline_crypt_setup();\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Sets the key.\r
+ *\r
+ * Keys can be of any length. Blowfish, itself, requires the use of a key between 32 and max. 448-bits long.\r
+ * If the key is less than 32-bits we NOT fill the key to 32bit but let the key as it is to be compatible\r
+ * with mcrypt because mcrypt act this way with blowfish key's < 32 bits.\r
+ *\r
+ * If the key is more than 448-bits, we trim the excess bits.\r
+ *\r
+ * If the key is not explicitly set, or empty, it'll be assumed a 128 bits key to be all null bytes.\r
+ *\r
+ * @access public\r
+ * @param String $key\r
+ */\r
+ function setKey($key)\r
+ {\r
+ $keylength = strlen($key);\r
+\r
+ if (!$keylength) {\r
+ $key = "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0";\r
+ }\r
+ elseif ($keylength > 56) {\r
+ $key = substr($key, 0, 56);\r
+ }\r
+\r
+ $this->key = $key;\r
+\r
+ $this->enchanged = true;\r
+ $this->dechanged = true;\r
+\r
+ if (CRYPT_BLOWFISH_MODE == CRYPT_BLOWFISH_MODE_MCRYPT) {\r
+ return;\r
+ }\r
+\r
+ /* key-expanding p[] and S-Box building sb[] */\r
+ $this->bctx = array(\r
+ 'p' => array(),\r
+ 'sb' => array(\r
+ $this->sbox0,\r
+ $this->sbox1,\r
+ $this->sbox2,\r
+ $this->sbox3\r
+ )\r
+ );\r
+\r
+ // unpack binary string in unsigned chars\r
+ $key = array_values(unpack('C*', $key));\r
+ $keyl = count($key);\r
+ for ($j = 0, $i = 0; $i < 18; ++$i) {\r
+ // xor P1 with the first 32-bits of the key, xor P2 with the second 32-bits ...\r
+ for ($data = 0, $k = 0; $k < 4; ++$k) {\r
+ $data = ($data << 8) | $key[$j];\r
+ if (++$j >= $keyl) {\r
+ $j = 0;\r
+ }\r
+ }\r
+ $this->bctx['p'][] = $this->parray[$i] ^ $data;\r
+ }\r
+\r
+ // encrypt the zero-string, replace P1 and P2 with the encrypted data,\r
+ // encrypt P3 and P4 with the new P1 and P2, do it with all P-array and subkeys\r
+ $datal = 0;\r
+ $datar = 0;\r
+ for ($i = 0; $i < 18; $i += 2) {\r
+ $this->_encryptBlock($datal, $datar);\r
+ $this->bctx['p'][$i ] = $datal;\r
+ $this->bctx['p'][$i + 1] = $datar;\r
+ }\r
+ for ($i = 0; $i < 4; ++$i) {\r
+ for ($j = 0; $j < 256; $j += 2) {\r
+ $this->_encryptBlock($datal, $datar);\r
+ $this->bctx['sb'][$i][$j ] = $datal;\r
+ $this->bctx['sb'][$i][$j + 1] = $datar;\r
+ }\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Encrypt the block.\r
+ *\r
+ * @access private\r
+ * @param int $Xl left uInt32 part of the block\r
+ * @param int $Xr right uInt32 part of the block\r
+ * @return void\r
+ */\r
+ function _encryptBlock(&$Xl, &$Xr)\r
+ {\r
+ $p = $this->bctx['p'];\r
+ $sb_0 = $this->bctx['sb'][0];\r
+ $sb_1 = $this->bctx['sb'][1];\r
+ $sb_2 = $this->bctx['sb'][2];\r
+ $sb_3 = $this->bctx['sb'][3];\r
+ $l = $Xl;\r
+ $r = $Xr;\r
+\r
+ $i = -1;\r
+ while ($i < 15) {\r
+ $l^= $p[++$i];\r
+ $r^= ($sb_0[$l >> 24 & 0xff] +\r
+ $sb_1[$l >> 16 & 0xff] ^\r
+ $sb_2[$l >> 8 & 0xff]) +\r
+ $sb_3[$l & 0xff];\r
+\r
+ $r^= $p[++$i];\r
+ $l^= ($sb_0[$r >> 24 & 0xff] +\r
+ $sb_1[$r >> 16 & 0xff] ^\r
+ $sb_2[$r >> 8 & 0xff]) +\r
+ $sb_3[$r & 0xff];\r
+\r
+ }\r
+ $Xr = $l ^ $p[16];\r
+ $Xl = $r ^ $p[17];\r
+ }\r
+\r
+ /**\r
+ * Sets the password.\r
+ *\r
+ * Depending on what $method is set to, setPassword()'s (optional) parameters are as follows:\r
+ * {@link http://en.wikipedia.org/wiki/PBKDF2 pbkdf2}:\r
+ * $hash, $salt, $count\r
+ *\r
+ * @param String $password\r
+ * @param optional String $method\r
+ * @access public\r
+ */\r
+ function setPassword($password, $method = 'pbkdf2')\r
+ {\r
+ $key = '';\r
+\r
+ switch ($method) {\r
+ default: // 'pbkdf2'\r
+ list(, , $hash, $salt, $count) = func_get_args();\r
+ if (!isset($hash)) {\r
+ $hash = 'sha1';\r
+ }\r
+ // WPA and WPA2 use the SSID as the salt\r
+ if (!isset($salt)) {\r
+ $salt = 'phpseclib/salt';\r
+ }\r
+ // RFC2898#section-4.2 uses 1,000 iterations by default\r
+ // WPA and WPA2 use 4,096.\r
+ if (!isset($count)) {\r
+ $count = 1000;\r
+ }\r
+\r
+ if (!class_exists('Crypt_Hash')) {\r
+ require_once('Crypt/Hash.php');\r
+ }\r
+\r
+ $i = 1;\r
+ while (strlen($key) < 56) {\r
+ //$dk.= $this->_pbkdf($password, $salt, $count, $i++);\r
+ $hmac = new Crypt_Hash();\r
+ $hmac->setHash($hash);\r
+ $hmac->setKey($password);\r
+ $f = $u = $hmac->hash($salt . pack('N', $i++));\r
+ for ($j = 2; $j <= $count; $j++) {\r
+ $u = $hmac->hash($u);\r
+ $f^= $u;\r
+ }\r
+ $key.= $f;\r
+ }\r
+ }\r
+\r
+ $this->setKey($key);\r
+ }\r
+\r
+ /**\r
+ * Sets the initialization vector. (optional)\r
+ *\r
+ * SetIV is not required when CRYPT_BLOWFISH_MODE_ECB is being used. If not explictly set, it'll be assumed\r
+ * to be all null bytes.\r
+ *\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function setIV($iv)\r
+ {\r
+ $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($iv, 0, 8), 8, chr(0));\r
+ $this->enchanged = true;\r
+ $this->dechanged = true;\r
+ }\r
+\r
+ /**\r
+ * Encrypts a message.\r
+ *\r
+ * $plaintext will be padded with up to 8 additional bytes. Other Blowfish implementations may or may not pad in the\r
+ * same manner. Other common approaches to padding and the reasons why it's necessary are discussed in the following\r
+ * URL:\r
+ *\r
+ * {@link http://www.di-mgt.com.au/cryptopad.html http://www.di-mgt.com.au/cryptopad.html}\r
+ *\r
+ * An alternative to padding is to, separately, send the length of the file. This is what SSH, in fact, does.\r
+ * strlen($plaintext) will still need to be a multiple of 8, however, arbitrary values can be added to make it that\r
+ * length.\r
+ *\r
+ * @see Crypt_Blowfish::decrypt()\r
+ * @access public\r
+ * @param String $plaintext\r
+ */\r
+ function encrypt($plaintext)\r
+ {\r
+ if ( CRYPT_BLOWFISH_MODE == CRYPT_BLOWFISH_MODE_MCRYPT ) {\r
+ if ($this->paddable) {\r
+ $plaintext = $this->_pad($plaintext);\r
+ }\r
+\r
+ if ($this->enchanged) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->encryptIV);\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->key, "\0\0\0\0\0\0\0\0");\r
+ }\r
+ $this->enchanged = false;\r
+ }\r
+\r
+ if ($this->mode != 'ncfb' || !$this->continuousBuffer) {\r
+ $ciphertext = mcrypt_generic($this->enmcrypt, $plaintext);\r
+ } else {\r
+ $iv = &$this->encryptIV;\r
+ $pos = &$this->enbuffer['pos'];\r
+ $len = strlen($plaintext);\r
+ $ciphertext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 8 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $plaintext;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ $this->enbuffer['enmcrypt_init'] = true;\r
+ }\r
+ if ($len >= 8) {\r
+ if ($this->enbuffer['enmcrypt_init'] === false || $len > 600) {\r
+ if ($this->enbuffer['enmcrypt_init'] === true) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $iv);\r
+ $this->enbuffer['enmcrypt_init'] = false;\r
+ }\r
+ $ciphertext.= mcrypt_generic($this->enmcrypt, substr($plaintext, $i, $len - $len % 8));\r
+ $iv = substr($ciphertext, -8);\r
+ $len%= 8;\r
+ } else {\r
+ while ($len >= 8) {\r
+ $iv = mcrypt_generic($this->ecb, $iv) ^ substr($plaintext, $i, 8);\r
+ $ciphertext.= $iv;\r
+ $len-= 8;\r
+ $i+= 8;\r
+ }\r
+ }\r
+ }\r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $block = $iv ^ substr($plaintext, -$len);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ }\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->encryptIV);\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ if (empty($this->bctx)) {\r
+ $this->setKey($this->key);\r
+ }\r
+\r
+ $inline = $this->inline_crypt;\r
+ return $inline('encrypt', $this, $plaintext);\r
+ }\r
+\r
+ /**\r
+ * Decrypts a message.\r
+ *\r
+ * If strlen($ciphertext) is not a multiple of 8, null bytes will be added to the end of the string until it is.\r
+ *\r
+ * @see Crypt_Blowfish::encrypt()\r
+ * @access public\r
+ * @param String $ciphertext\r
+ */\r
+ function decrypt($ciphertext)\r
+ {\r
+ if ( CRYPT_BLOWFISH_MODE == CRYPT_BLOWFISH_MODE_MCRYPT ) {\r
+ if ($this->paddable) {\r
+ // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :\r
+ // "The data is padded with "\0" to make sure the length of the data is n * blocksize."\r
+ $ciphertext = str_pad($ciphertext, strlen($ciphertext) + (8 - strlen($ciphertext) % 8) % 8, chr(0));\r
+ }\r
+\r
+ if ($this->dechanged) {\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->decryptIV);\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->key, "\0\0\0\0\0\0\0\0");\r
+ }\r
+ $this->dechanged = false;\r
+ }\r
+\r
+ if ($this->mode != 'ncfb' || !$this->continuousBuffer) {\r
+ $plaintext = mdecrypt_generic($this->demcrypt, $ciphertext);\r
+ } else {\r
+ $iv = &$this->decryptIV;\r
+ $pos = &$this->debuffer['pos'];\r
+ $len = strlen($ciphertext);\r
+ $plaintext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 8 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $ciphertext;\r
+ $iv = substr_replace($iv, substr($ciphertext, 0, $i), $orig_pos, $i);\r
+ }\r
+ if ($len >= 8) {\r
+ $cb = substr($ciphertext, $i, $len - $len % 8);\r
+ $plaintext.= mcrypt_generic($this->ecb, $iv . $cb) ^ $cb;\r
+ $iv = substr($cb, -8);\r
+ $len%= 8;\r
+ }\r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $plaintext.= $iv ^ substr($ciphertext, -$len);\r
+ $iv = substr_replace($iv, substr($ciphertext, -$len), 0, $len);\r
+ $pos = $len;\r
+ }\r
+ return $plaintext;\r
+ }\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->decryptIV);\r
+ }\r
+\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ if (empty($this->bctx)) {\r
+ $this->setKey($this->key);\r
+ }\r
+\r
+ $inline = $this->inline_crypt;\r
+ return $inline('decrypt', $this, $ciphertext);\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive "packets" as if they are a continuous buffer.\r
+ *\r
+ * @see Crypt_Blowfish::disableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function enableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = true;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive packets as if they are a discontinuous buffer.\r
+ *\r
+ * The default behavior.\r
+ *\r
+ * @see Crypt_Blowfish::enableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function disableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = false;\r
+ $this->encryptIV = $this->iv;\r
+ $this->decryptIV = $this->iv;\r
+ $this->enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0, 'enmcrypt_init' => true);\r
+ $this->debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0, 'demcrypt_init' => true);\r
+\r
+ if (CRYPT_BLOWFISH_MODE == CRYPT_BLOWFISH_MODE_MCRYPT) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->iv);\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->iv);\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Pad "packets".\r
+ *\r
+ * Blowfish works by encrypting 8 bytes at a time. If you ever need to encrypt or decrypt something that's not\r
+ * a multiple of 8, it becomes necessary to pad the input so that it's length is a multiple of eight.\r
+ *\r
+ * Padding is enabled by default. Sometimes, however, it is undesirable to pad strings. Such is the case in SSH1,\r
+ * where "packets" are padded with random bytes before being encrypted. Unpad these packets and you risk stripping\r
+ * away characters that shouldn't be stripped away. (SSH knows how many bytes are added because the length is\r
+ * transmitted separately)\r
+ *\r
+ * @see Crypt_Blowfish::disablePadding()\r
+ * @access public\r
+ */\r
+ function enablePadding()\r
+ {\r
+ $this->padding = true;\r
+ }\r
+\r
+ /**\r
+ * Do not pad packets.\r
+ *\r
+ * @see Crypt_Blowfish::enablePadding()\r
+ * @access public\r
+ */\r
+ function disablePadding()\r
+ {\r
+ $this->padding = false;\r
+ }\r
+\r
+ /**\r
+ * Pads a string\r
+ *\r
+ * Pads a string using the RSA PKCS padding standards so that its length is a multiple of the blocksize (8).\r
+ *\r
+ * If padding is disabled and $text is not a multiple of the blocksize, the string will be padded regardless\r
+ * and padding will, hence forth, be enabled.\r
+ *\r
+ * @see Crypt_Blowfish::_unpad()\r
+ * @access private\r
+ */\r
+ function _pad($text)\r
+ {\r
+ $length = strlen($text);\r
+\r
+ if (!$this->padding) {\r
+ if ($length % 8 == 0) {\r
+ return $text;\r
+ } else {\r
+ user_error("The plaintext's length ($length) is not a multiple of the block size (8)");\r
+ $this->padding = true;\r
+ }\r
+ }\r
+\r
+ $pad = 8 - ($length % 8);\r
+\r
+ return str_pad($text, $length + $pad, chr($pad));\r
+ }\r
+\r
+ /**\r
+ * Unpads a string\r
+ *\r
+ * If padding is enabled and the reported padding length is invalid the encryption key will be assumed to be wrong\r
+ * and false will be returned.\r
+ *\r
+ * @see Crypt_Blowfish::_pad()\r
+ * @access private\r
+ */\r
+ function _unpad($text)\r
+ {\r
+ if (!$this->padding) {\r
+ return $text;\r
+ }\r
+\r
+ $length = ord($text[strlen($text) - 1]);\r
+\r
+ if (!$length || $length > 8) {\r
+ return false;\r
+ }\r
+\r
+ return substr($text, 0, -$length);\r
+ }\r
+\r
+ /**\r
+ * String Shift\r
+ *\r
+ * Inspired by array_shift\r
+ *\r
+ * @param String $string\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _string_shift(&$string)\r
+ {\r
+ $substr = substr($string, 0, 8);\r
+ $string = substr($string, 8);\r
+ return $substr;\r
+ }\r
+\r
+ /**\r
+ * Generate CTR XOR encryption key\r
+ *\r
+ * Encrypt the output of this and XOR it against the ciphertext / plaintext to get the\r
+ * plaintext / ciphertext in CTR mode.\r
+ *\r
+ * @see Crypt_Blowfish::decrypt()\r
+ * @see Crypt_Blowfish::encrypt()\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function _generate_xor(&$iv)\r
+ {\r
+ $xor = $iv;\r
+ for ($j = 4; $j <= 8; $j+=4) {\r
+ $temp = substr($iv, -$j, 4);\r
+ switch ($temp) {\r
+ case "\xFF\xFF\xFF\xFF":\r
+ $iv = substr_replace($iv, "\x00\x00\x00\x00", -$j, 4);\r
+ break;\r
+ case "\x7F\xFF\xFF\xFF":\r
+ $iv = substr_replace($iv, "\x80\x00\x00\x00", -$j, 4);\r
+ break 2;\r
+ default:\r
+ extract(unpack('Ncount', $temp));\r
+ $iv = substr_replace($iv, pack('N', $count + 1), -$j, 4);\r
+ break 2;\r
+ }\r
+ }\r
+\r
+ return $xor;\r
+ }\r
+\r
+ /**\r
+ * Creates performance-optimized function for de/encrypt(), storing it in $this->inline_crypt\r
+ *\r
+ * @access private\r
+ */\r
+ function inline_crypt_setup()\r
+ {/*{{{*/\r
+ $lambda_functions =& Crypt_Blowfish::get_lambda_functions();\r
+ $block_size = 8;\r
+ $mode = $this->mode;\r
+ $code_hash = "$mode";\r
+\r
+ if (!isset($lambda_functions[$code_hash])) {\r
+ $init_cryptBlock = '\r
+ extract($self->bctx["p"], EXTR_PREFIX_ALL, "p");\r
+ extract($self->bctx["sb"], EXTR_PREFIX_ALL, "sb");\r
+ ';\r
+\r
+ // Generating encrypt code:\r
+ $_encryptBlock = '\r
+ $in = unpack("N*", $in);\r
+ $l = $in[1];\r
+ $r = $in[2];\r
+ ';\r
+ for ($i = 0; $i < 16; $i+= 2) {\r
+ $_encryptBlock.= '\r
+ $l^= $p_'.($i).';\r
+ $r^= ($sb_0[$l >> 24 & 0xff] +\r
+ $sb_1[$l >> 16 & 0xff] ^\r
+ $sb_2[$l >> 8 & 0xff]) +\r
+ $sb_3[$l & 0xff];\r
+\r
+ $r^= $p_'.($i + 1).';\r
+ $l^= ($sb_0[$r >> 24 & 0xff] +\r
+ $sb_1[$r >> 16 & 0xff] ^\r
+ $sb_2[$r >> 8 & 0xff]) +\r
+ $sb_3[$r & 0xff];\r
+ ';\r
+ }\r
+ $_encryptBlock.= '\r
+ $in = pack("N*", $r ^ $p_17, $l ^ $p_16);\r
+ ';\r
+\r
+ // Generating decrypt code:\r
+ $_decryptBlock = '\r
+ $in = unpack("N*", $in);\r
+ $l = $in[1];\r
+ $r = $in[2];\r
+ ';\r
+\r
+ for ($i = 17; $i > 2; $i-= 2) {\r
+ $_decryptBlock.= '\r
+ $l^= $p_'.($i).';\r
+ $r^= ($sb_0[$l >> 24 & 0xff] +\r
+ $sb_1[$l >> 16 & 0xff] ^\r
+ $sb_2[$l >> 8 & 0xff]) +\r
+ $sb_3[$l & 0xff];\r
+\r
+ $r^= $p_'.($i - 1).';\r
+ $l^= ($sb_0[$r >> 24 & 0xff] +\r
+ $sb_1[$r >> 16 & 0xff] ^\r
+ $sb_2[$r >> 8 & 0xff]) +\r
+ $sb_3[$r & 0xff];\r
+ ';\r
+ }\r
+\r
+ $_decryptBlock.= '\r
+ $in = pack("N*", $r ^ $p_0, $l ^ $p_1);\r
+ ';\r
+\r
+ // Generating mode of operation code:\r
+ switch ($mode) {\r
+ case CRYPT_BLOWFISH_MODE_ECB:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $text = $self->_pad($text);\r
+ $plaintext_len = strlen($text);\r
+\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.');\r
+ '.$_encryptBlock.'\r
+ $ciphertext.= $in;\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $text = str_pad($text, strlen($text) + ('.$block_size.' - strlen($text) % '.$block_size.') % '.$block_size.', chr(0));\r
+ $ciphertext_len = strlen($text);\r
+\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.');\r
+ '.$_decryptBlock.'\r
+ $plaintext.= $in;\r
+ }\r
+\r
+ return $self->_unpad($plaintext);\r
+ ';\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_CBC:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $text = $self->_pad($text);\r
+ $plaintext_len = strlen($text);\r
+\r
+ $in = $self->encryptIV;\r
+\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.') ^ $in;\r
+ '.$_encryptBlock.'\r
+ $ciphertext.= $in;\r
+ }\r
+\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $in;\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $text = str_pad($text, strlen($text) + ('.$block_size.' - strlen($text) % '.$block_size.') % '.$block_size.', chr(0));\r
+ $ciphertext_len = strlen($text);\r
+\r
+ $iv = $self->decryptIV;\r
+\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = $block = substr($text, $i, '.$block_size.');\r
+ '.$_decryptBlock.'\r
+ $plaintext.= $in ^ $iv;\r
+ $iv = $block;\r
+ }\r
+\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $iv;\r
+ }\r
+\r
+ return $self->_unpad($plaintext);\r
+ ';\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_CTR:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+ $xor = $self->encryptIV;\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if (strlen($buffer["encrypted"])) {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["encrypted"])) {\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_encryptBlock.'\r
+ $buffer["encrypted"].= $in;\r
+ }\r
+ $key = $self->_string_shift($buffer["encrypted"]);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_encryptBlock.'\r
+ $key = $in;\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $xor;\r
+ if ($start = $plaintext_len % '.$block_size.') {\r
+ $buffer["encrypted"] = substr($key, $start) . $buffer["encrypted"];\r
+ }\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+ $xor = $self->decryptIV;\r
+ $buffer = &$self->debuffer;\r
+\r
+ if (strlen($buffer["ciphertext"])) {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["ciphertext"])) {\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_encryptBlock.'\r
+ $buffer["ciphertext"].= $in;\r
+ }\r
+ $key = $self->_string_shift($buffer["ciphertext"]);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_encryptBlock.'\r
+ $key = $in;\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $xor;\r
+ if ($start = $ciphertext_len % '.$block_size.') {\r
+ $buffer["ciphertext"] = substr($key, $start) . $buffer["ciphertext"];\r
+ }\r
+ }\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_CFB:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if ($self->continuousBuffer) {\r
+ $iv = &$self->encryptIV;\r
+ $pos = &$buffer["pos"];\r
+ } else {\r
+ $iv = $self->encryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($text);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = '.$block_size.' - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $text;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ }\r
+ while ($len >= '.$block_size.') {\r
+ $in = $iv;\r
+ '.$_encryptBlock.';\r
+ $iv = $in ^ substr($text, $i, '.$block_size.');\r
+ $ciphertext.= $iv;\r
+ $len-= '.$block_size.';\r
+ $i+= '.$block_size.';\r
+ }\r
+ if ($len) {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $block = $iv ^ substr($text, $i);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $buffer = &$self->debuffer;\r
+\r
+ if ($self->continuousBuffer) {\r
+ $iv = &$self->decryptIV;\r
+ $pos = &$buffer["pos"];\r
+ } else {\r
+ $iv = $self->decryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($text);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = '.$block_size.' - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $text;\r
+ $iv = substr_replace($iv, substr($text, 0, $i), $orig_pos, $i);\r
+ }\r
+ while ($len >= '.$block_size.') {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $cb = substr($text, $i, '.$block_size.');\r
+ $plaintext.= $iv ^ $cb;\r
+ $iv = $cb;\r
+ $len-= '.$block_size.';\r
+ $i+= '.$block_size.';\r
+ }\r
+ if ($len) {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $plaintext.= $iv ^ substr($text, $i);\r
+ $iv = substr_replace($iv, substr($text, $i), 0, $len);\r
+ $pos = $len;\r
+ }\r
+\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ case CRYPT_BLOWFISH_MODE_OFB:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+ $xor = $self->encryptIV;\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if (strlen($buffer["xor"])) {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["xor"])) {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $buffer["xor"].= $xor;\r
+ }\r
+ $key = $self->_string_shift($buffer["xor"]);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $ciphertext.= substr($text, $i, '.$block_size.') ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $xor;\r
+ if ($start = $plaintext_len % '.$block_size.') {\r
+ $buffer["xor"] = substr($key, $start) . $buffer["xor"];\r
+ }\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+ $xor = $self->decryptIV;\r
+ $buffer = &$self->debuffer;\r
+\r
+ if (strlen($buffer["xor"])) {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["xor"])) {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $buffer["xor"].= $xor;\r
+ }\r
+ $key = $self->_string_shift($buffer["xor"]);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $plaintext.= substr($text, $i, '.$block_size.') ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $xor;\r
+ if ($start = $ciphertext_len % '.$block_size.') {\r
+ $buffer["xor"] = substr($key, $start) . $buffer["xor"];\r
+ }\r
+ }\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ }\r
+ $fnc_head = '$action, &$self, $text';\r
+ $fnc_body = $init_cryptBlock . 'if ($action == "encrypt") { ' . $encrypt . ' } else { ' . $decrypt . ' }';\r
+\r
+ if (function_exists('create_function') && is_callable('create_function')) {\r
+ $lambda_functions[$code_hash] = create_function($fnc_head, $fnc_body);\r
+ } else {\r
+ eval('function ' . ($lambda_functions[$code_hash] = 'f' . md5(microtime())) . '(' . $fnc_head . ') { ' . $fnc_body . ' }');\r
+ }\r
+ }\r
+ $this->inline_crypt = $lambda_functions[$code_hash];\r
+ }/*}}}*/\r
+\r
+ /**\r
+ * Holds the lambda_functions table (classwide)\r
+ *\r
+ * @see inline_crypt_setup()\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function &get_lambda_functions()\r
+ {\r
+ static $functions = array();\r
+ return $functions;\r
+ }\r
+}\r
+\r
+// vim: ts=4:sw=4:et:\r
+// vim6: fdl=1:\r
-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Pure-PHP implementation of DES.
- *
- * Uses mcrypt, if available, and an internal implementation, otherwise.
- *
- * PHP versions 4 and 5
- *
- * Useful resources are as follows:
- *
- * - {@link http://en.wikipedia.org/wiki/DES_supplementary_material Wikipedia: DES supplementary material}
- * - {@link http://www.itl.nist.gov/fipspubs/fip46-2.htm FIPS 46-2 - (DES), Data Encryption Standard}
- * - {@link http://www.cs.eku.edu/faculty/styer/460/Encrypt/JS-DES.html JavaScript DES Example}
- *
- * Here's a short example of how to use this library:
- * <code>
- * <?php
- * include('Crypt/DES.php');
- *
- * $des = new Crypt_DES();
- *
- * $des->setKey('abcdefgh');
- *
- * $size = 10 * 1024;
- * $plaintext = '';
- * for ($i = 0; $i < $size; $i++) {
- * $plaintext.= 'a';
- * }
- *
- * echo $des->decrypt($des->encrypt($plaintext));
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Crypt
- * @package Crypt_DES
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMVII Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: DES.php,v 1.12 2010/02/09 06:10:26 terrafrost Exp $
- * @link http://phpseclib.sourceforge.net
- */
-
-/**#@+
- * @access private
- * @see Crypt_DES::_prepareKey()
- * @see Crypt_DES::_processBlock()
- */
-/**
- * Contains array_reverse($keys[CRYPT_DES_DECRYPT])
- */
-define('CRYPT_DES_ENCRYPT', 0);
-/**
- * Contains array_reverse($keys[CRYPT_DES_ENCRYPT])
- */
-define('CRYPT_DES_DECRYPT', 1);
-/**#@-*/
-
-/**#@+
- * @access public
- * @see Crypt_DES::encrypt()
- * @see Crypt_DES::decrypt()
- */
-/**
- * Encrypt / decrypt using the Counter mode.
- *
- * Set to -1 since that's what Crypt/Random.php uses to index the CTR mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Counter_.28CTR.29
- */
-define('CRYPT_DES_MODE_CTR', -1);
-/**
- * Encrypt / decrypt using the Electronic Code Book mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Electronic_codebook_.28ECB.29
- */
-define('CRYPT_DES_MODE_ECB', 1);
-/**
- * Encrypt / decrypt using the Code Book Chaining mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher-block_chaining_.28CBC.29
- */
-define('CRYPT_DES_MODE_CBC', 2);
-/**#@-*/
-
-/**#@+
- * @access private
- * @see Crypt_DES::Crypt_DES()
- */
-/**
- * Toggles the internal implementation
- */
-define('CRYPT_DES_MODE_INTERNAL', 1);
-/**
- * Toggles the mcrypt implementation
- */
-define('CRYPT_DES_MODE_MCRYPT', 2);
-/**#@-*/
-
-/**
- * Pure-PHP implementation of DES.
- *
- * @author Jim Wigginton <terrafrost@php.net>
- * @version 0.1.0
- * @access public
- * @package Crypt_DES
- */
-class Crypt_DES {
- /**
- * The Key Schedule
- *
- * @see Crypt_DES::setKey()
- * @var Array
- * @access private
- */
- var $keys = "\0\0\0\0\0\0\0\0";
-
- /**
- * The Encryption Mode
- *
- * @see Crypt_DES::Crypt_DES()
- * @var Integer
- * @access private
- */
- var $mode;
-
- /**
- * Continuous Buffer status
- *
- * @see Crypt_DES::enableContinuousBuffer()
- * @var Boolean
- * @access private
- */
- var $continuousBuffer = false;
-
- /**
- * Padding status
- *
- * @see Crypt_DES::enablePadding()
- * @var Boolean
- * @access private
- */
- var $padding = true;
-
- /**
- * The Initialization Vector
- *
- * @see Crypt_DES::setIV()
- * @var String
- * @access private
- */
- var $iv = "\0\0\0\0\0\0\0\0";
-
- /**
- * A "sliding" Initialization Vector
- *
- * @see Crypt_DES::enableContinuousBuffer()
- * @var String
- * @access private
- */
- var $encryptIV = "\0\0\0\0\0\0\0\0";
-
- /**
- * A "sliding" Initialization Vector
- *
- * @see Crypt_DES::enableContinuousBuffer()
- * @var String
- * @access private
- */
- var $decryptIV = "\0\0\0\0\0\0\0\0";
-
- /**
- * mcrypt resource for encryption
- *
- * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.
- * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.
- *
- * @see Crypt_AES::encrypt()
- * @var String
- * @access private
- */
- var $enmcrypt;
-
- /**
- * mcrypt resource for decryption
- *
- * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.
- * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.
- *
- * @see Crypt_AES::decrypt()
- * @var String
- * @access private
- */
- var $demcrypt;
-
- /**
- * Does the (en|de)mcrypt resource need to be (re)initialized?
- *
- * @see setKey()
- * @see setIV()
- * @var Boolean
- * @access private
- */
- var $changed = true;
-
- /**
- * Default Constructor.
- *
- * Determines whether or not the mcrypt extension should be used. $mode should only, at present, be
- * CRYPT_DES_MODE_ECB or CRYPT_DES_MODE_CBC. If not explictly set, CRYPT_DES_MODE_CBC will be used.
- *
- * @param optional Integer $mode
- * @return Crypt_DES
- * @access public
- */
- function Crypt_DES($mode = CRYPT_MODE_DES_CBC)
- {
- if ( !defined('CRYPT_DES_MODE') ) {
- switch (true) {
- case extension_loaded('mcrypt'):
- // i'd check to see if des was supported, by doing in_array('des', mcrypt_list_algorithms('')),
- // but since that can be changed after the object has been created, there doesn't seem to be
- // a lot of point...
- define('CRYPT_DES_MODE', CRYPT_DES_MODE_MCRYPT);
- break;
- default:
- define('CRYPT_DES_MODE', CRYPT_DES_MODE_INTERNAL);
- }
- }
-
- switch ( CRYPT_DES_MODE ) {
- case CRYPT_DES_MODE_MCRYPT:
- switch ($mode) {
- case CRYPT_DES_MODE_ECB:
- $this->mode = MCRYPT_MODE_ECB;
- break;
- case CRYPT_DES_MODE_CTR:
- $this->mode = 'ctr';
- //$this->mode = in_array('ctr', mcrypt_list_modes()) ? 'ctr' : CRYPT_DES_MODE_CTR;
- break;
- case CRYPT_DES_MODE_CBC:
- default:
- $this->mode = MCRYPT_MODE_CBC;
- }
-
- break;
- default:
- switch ($mode) {
- case CRYPT_DES_MODE_ECB:
- case CRYPT_DES_MODE_CTR:
- case CRYPT_DES_MODE_CBC:
- $this->mode = $mode;
- break;
- default:
- $this->mode = CRYPT_DES_MODE_CBC;
- }
- }
- }
-
- /**
- * Sets the key.
- *
- * Keys can be of any length. DES, itself, uses 64-bit keys (eg. strlen($key) == 8), however, we
- * only use the first eight, if $key has more then eight characters in it, and pad $key with the
- * null byte if it is less then eight characters long.
- *
- * DES also requires that every eighth bit be a parity bit, however, we'll ignore that.
- *
- * If the key is not explicitly set, it'll be assumed to be all zero's.
- *
- * @access public
- * @param String $key
- */
- function setKey($key)
- {
- $this->keys = ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) ? substr($key, 0, 8) : $this->_prepareKey($key);
- $this->changed = true;
- }
-
- /**
- * Sets the initialization vector. (optional)
- *
- * SetIV is not required when CRYPT_DES_MODE_ECB is being used. If not explictly set, it'll be assumed
- * to be all zero's.
- *
- * @access public
- * @param String $iv
- */
- function setIV($iv)
- {
- $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($iv, 0, 8), 8, chr(0));
- $this->changed = true;
- }
-
- /**
- * Generate CTR XOR encryption key
- *
- * Encrypt the output of this and XOR it against the ciphertext / plaintext to get the
- * plaintext / ciphertext in CTR mode.
- *
- * @see Crypt_DES::decrypt()
- * @see Crypt_DES::encrypt()
- * @access public
- * @param Integer $length
- * @param String $iv
- */
- function _generate_xor($length, &$iv)
- {
- $xor = '';
- $num_blocks = ($length + 7) >> 3;
- for ($i = 0; $i < $num_blocks; $i++) {
- $xor.= $iv;
- for ($j = 4; $j <= 8; $j+=4) {
- $temp = substr($iv, -$j, 4);
- switch ($temp) {
- case "\xFF\xFF\xFF\xFF":
- $iv = substr_replace($iv, "\x00\x00\x00\x00", -$j, 4);
- break;
- case "\x7F\xFF\xFF\xFF":
- $iv = substr_replace($iv, "\x80\x00\x00\x00", -$j, 4);
- break 2;
- default:
- extract(unpack('Ncount', $temp));
- $iv = substr_replace($iv, pack('N', $count + 1), -$j, 4);
- break 2;
- }
- }
- }
-
- return $xor;
- }
-
- /**
- * Encrypts a message.
- *
- * $plaintext will be padded with up to 8 additional bytes. Other DES implementations may or may not pad in the
- * same manner. Other common approaches to padding and the reasons why it's necessary are discussed in the following
- * URL:
- *
- * {@link http://www.di-mgt.com.au/cryptopad.html http://www.di-mgt.com.au/cryptopad.html}
- *
- * An alternative to padding is to, separately, send the length of the file. This is what SSH, in fact, does.
- * strlen($plaintext) will still need to be a multiple of 8, however, arbitrary values can be added to make it that
- * length.
- *
- * @see Crypt_DES::decrypt()
- * @access public
- * @param String $plaintext
- */
- function encrypt($plaintext)
- {
- if ($this->mode != CRYPT_DES_MODE_CTR && $this->mode != 'ctr') {
- $plaintext = $this->_pad($plaintext);
- }
-
- if ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) {
- if ($this->changed) {
- if (!isset($this->enmcrypt)) {
- $this->enmcrypt = mcrypt_module_open(MCRYPT_DES, '', $this->mode, '');
- }
- mcrypt_generic_init($this->enmcrypt, $this->keys, $this->encryptIV);
- $this->changed = false;
- }
-
- $ciphertext = mcrypt_generic($this->enmcrypt, $plaintext);
-
- if (!$this->continuousBuffer) {
- mcrypt_generic_init($this->enmcrypt, $this->keys, $this->encryptIV);
- }
-
- return $ciphertext;
- }
-
- if (!is_array($this->keys)) {
- $this->keys = $this->_prepareKey("\0\0\0\0\0\0\0\0");
- }
-
- $ciphertext = '';
- switch ($this->mode) {
- case CRYPT_DES_MODE_ECB:
- for ($i = 0; $i < strlen($plaintext); $i+=8) {
- $ciphertext.= $this->_processBlock(substr($plaintext, $i, 8), CRYPT_DES_ENCRYPT);
- }
- break;
- case CRYPT_DES_MODE_CBC:
- $xor = $this->encryptIV;
- for ($i = 0; $i < strlen($plaintext); $i+=8) {
- $block = substr($plaintext, $i, 8);
- $block = $this->_processBlock($block ^ $xor, CRYPT_DES_ENCRYPT);
- $xor = $block;
- $ciphertext.= $block;
- }
- if ($this->continuousBuffer) {
- $this->encryptIV = $xor;
- }
- break;
- case CRYPT_DES_MODE_CTR:
- $xor = $this->encryptIV;
- for ($i = 0; $i < strlen($plaintext); $i+=8) {
- $block = substr($plaintext, $i, 8);
- $key = $this->_processBlock($this->_generate_xor(8, $xor), CRYPT_DES_ENCRYPT);
- $ciphertext.= $block ^ $key;
- }
- if ($this->continuousBuffer) {
- $this->encryptIV = $xor;
- }
- }
-
- return $ciphertext;
- }
-
- /**
- * Decrypts a message.
- *
- * If strlen($ciphertext) is not a multiple of 8, null bytes will be added to the end of the string until it is.
- *
- * @see Crypt_DES::encrypt()
- * @access public
- * @param String $ciphertext
- */
- function decrypt($ciphertext)
- {
- if ($this->mode != CRYPT_DES_MODE_CTR && $this->mode != 'ctr') {
- // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :
- // "The data is padded with "\0" to make sure the length of the data is n * blocksize."
- $ciphertext = str_pad($ciphertext, (strlen($ciphertext) + 7) & 0xFFFFFFF8, chr(0));
- }
-
- if ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) {
- if ($this->changed) {
- if (!isset($this->demcrypt)) {
- $this->demcrypt = mcrypt_module_open(MCRYPT_DES, '', $this->mode, '');
- }
- mcrypt_generic_init($this->demcrypt, $this->keys, $this->decryptIV);
- $this->changed = false;
- }
-
- $plaintext = mdecrypt_generic($this->demcrypt, $ciphertext);
-
- if (!$this->continuousBuffer) {
- mcrypt_generic_init($this->demcrypt, $this->keys, $this->decryptIV);
- }
-
- return $this->mode != 'ctr' ? $this->_unpad($plaintext) : $plaintext;
- }
-
- if (!is_array($this->keys)) {
- $this->keys = $this->_prepareKey("\0\0\0\0\0\0\0\0");
- }
-
- $plaintext = '';
- switch ($this->mode) {
- case CRYPT_DES_MODE_ECB:
- for ($i = 0; $i < strlen($ciphertext); $i+=8) {
- $plaintext.= $this->_processBlock(substr($ciphertext, $i, 8), CRYPT_DES_DECRYPT);
- }
- break;
- case CRYPT_DES_MODE_CBC:
- $xor = $this->decryptIV;
- for ($i = 0; $i < strlen($ciphertext); $i+=8) {
- $block = substr($ciphertext, $i, 8);
- $plaintext.= $this->_processBlock($block, CRYPT_DES_DECRYPT) ^ $xor;
- $xor = $block;
- }
- if ($this->continuousBuffer) {
- $this->decryptIV = $xor;
- }
- break;
- case CRYPT_DES_MODE_CTR:
- $xor = $this->decryptIV;
- for ($i = 0; $i < strlen($ciphertext); $i+=8) {
- $block = substr($ciphertext, $i, 8);
- $key = $this->_processBlock($this->_generate_xor(8, $xor), CRYPT_DES_ENCRYPT);
- $plaintext.= $block ^ $key;
- }
- if ($this->continuousBuffer) {
- $this->decryptIV = $xor;
- }
- }
-
- return $this->mode != CRYPT_DES_MODE_CTR ? $this->_unpad($plaintext) : $plaintext;
- }
-
- /**
- * Treat consecutive "packets" as if they are a continuous buffer.
- *
- * Say you have a 16-byte plaintext $plaintext. Using the default behavior, the two following code snippets
- * will yield different outputs:
- *
- * <code>
- * echo $des->encrypt(substr($plaintext, 0, 8));
- * echo $des->encrypt(substr($plaintext, 8, 8));
- * </code>
- * <code>
- * echo $des->encrypt($plaintext);
- * </code>
- *
- * The solution is to enable the continuous buffer. Although this will resolve the above discrepancy, it creates
- * another, as demonstrated with the following:
- *
- * <code>
- * $des->encrypt(substr($plaintext, 0, 8));
- * echo $des->decrypt($des->encrypt(substr($plaintext, 8, 8)));
- * </code>
- * <code>
- * echo $des->decrypt($des->encrypt(substr($plaintext, 8, 8)));
- * </code>
- *
- * With the continuous buffer disabled, these would yield the same output. With it enabled, they yield different
- * outputs. The reason is due to the fact that the initialization vector's change after every encryption /
- * decryption round when the continuous buffer is enabled. When it's disabled, they remain constant.
- *
- * Put another way, when the continuous buffer is enabled, the state of the Crypt_DES() object changes after each
- * encryption / decryption round, whereas otherwise, it'd remain constant. For this reason, it's recommended that
- * continuous buffers not be used. They do offer better security and are, in fact, sometimes required (SSH uses them),
- * however, they are also less intuitive and more likely to cause you problems.
- *
- * @see Crypt_DES::disableContinuousBuffer()
- * @access public
- */
- function enableContinuousBuffer()
- {
- $this->continuousBuffer = true;
- }
-
- /**
- * Treat consecutive packets as if they are a discontinuous buffer.
- *
- * The default behavior.
- *
- * @see Crypt_DES::enableContinuousBuffer()
- * @access public
- */
- function disableContinuousBuffer()
- {
- $this->continuousBuffer = false;
- $this->encryptIV = $this->iv;
- $this->decryptIV = $this->iv;
- }
-
- /**
- * Pad "packets".
- *
- * DES works by encrypting eight bytes at a time. If you ever need to encrypt or decrypt something that's not
- * a multiple of eight, it becomes necessary to pad the input so that it's length is a multiple of eight.
- *
- * Padding is enabled by default. Sometimes, however, it is undesirable to pad strings. Such is the case in SSH1,
- * where "packets" are padded with random bytes before being encrypted. Unpad these packets and you risk stripping
- * away characters that shouldn't be stripped away. (SSH knows how many bytes are added because the length is
- * transmitted separately)
- *
- * @see Crypt_DES::disablePadding()
- * @access public
- */
- function enablePadding()
- {
- $this->padding = true;
- }
-
- /**
- * Do not pad packets.
- *
- * @see Crypt_DES::enablePadding()
- * @access public
- */
- function disablePadding()
- {
- $this->padding = false;
- }
-
- /**
- * Pads a string
- *
- * Pads a string using the RSA PKCS padding standards so that its length is a multiple of the blocksize (8).
- * 8 - (strlen($text) & 7) bytes are added, each of which is equal to chr(8 - (strlen($text) & 7)
- *
- * If padding is disabled and $text is not a multiple of the blocksize, the string will be padded regardless
- * and padding will, hence forth, be enabled.
- *
- * @see Crypt_DES::_unpad()
- * @access private
- */
- function _pad($text)
- {
- $length = strlen($text);
-
- if (!$this->padding) {
- if (($length & 7) == 0) {
- return $text;
- } else {
- user_error("The plaintext's length ($length) is not a multiple of the block size (8)", E_USER_NOTICE);
- $this->padding = true;
- }
- }
-
- $pad = 8 - ($length & 7);
- return str_pad($text, $length + $pad, chr($pad));
- }
-
- /**
- * Unpads a string
- *
- * If padding is enabled and the reported padding length is invalid the encryption key will be assumed to be wrong
- * and false will be returned.
- *
- * @see Crypt_DES::_pad()
- * @access private
- */
- function _unpad($text)
- {
- if (!$this->padding) {
- return $text;
- }
-
- $length = ord($text[strlen($text) - 1]);
-
- if (!$length || $length > 8) {
- return false;
- }
-
- return substr($text, 0, -$length);
- }
-
- /**
- * Encrypts or decrypts a 64-bit block
- *
- * $mode should be either CRYPT_DES_ENCRYPT or CRYPT_DES_DECRYPT. See
- * {@link http://en.wikipedia.org/wiki/Image:Feistel.png Feistel.png} to get a general
- * idea of what this function does.
- *
- * @access private
- * @param String $block
- * @param Integer $mode
- * @return String
- */
- function _processBlock($block, $mode)
- {
- // s-boxes. in the official DES docs, they're described as being matrices that
- // one accesses by using the first and last bits to determine the row and the
- // middle four bits to determine the column. in this implementation, they've
- // been converted to vectors
- static $sbox = array(
- array(
- 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,
- 3, 10 ,10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,
- 4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,
- 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13
- ),
- array(
- 15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,
- 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,
- 0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,
- 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9
- ),
- array(
- 10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,
- 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,
- 13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,
- 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12
- ),
- array(
- 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,
- 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,
- 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,
- 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14
- ),
- array(
- 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,
- 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,
- 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,
- 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3
- ),
- array(
- 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,
- 0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,
- 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,
- 7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13
- ),
- array(
- 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,
- 3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,
- 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,
- 10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12
- ),
- array(
- 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,
- 10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,
- 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,
- 0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11
- )
- );
-
- $keys = $this->keys;
-
- $temp = unpack('Na/Nb', $block);
- $block = array($temp['a'], $temp['b']);
-
- // because php does arithmetic right shifts, if the most significant bits are set, right
- // shifting those into the correct position will add 1's - not 0's. this will intefere
- // with the | operation unless a second & is done. so we isolate these bits and left shift
- // them into place. we then & each block with 0x7FFFFFFF to prevennt 1's from being added
- // for any other shifts.
- $msb = array(
- ($block[0] >> 31) & 1,
- ($block[1] >> 31) & 1
- );
- $block[0] &= 0x7FFFFFFF;
- $block[1] &= 0x7FFFFFFF;
-
- // we isolate the appropriate bit in the appropriate integer and shift as appropriate. in
- // some cases, there are going to be multiple bits in the same integer that need to be shifted
- // in the same way. we combine those into one shift operation.
- $block = array(
- (($block[1] & 0x00000040) << 25) | (($block[1] & 0x00004000) << 16) |
- (($block[1] & 0x00400001) << 7) | (($block[1] & 0x40000100) >> 2) |
- (($block[0] & 0x00000040) << 21) | (($block[0] & 0x00004000) << 12) |
- (($block[0] & 0x00400001) << 3) | (($block[0] & 0x40000100) >> 6) |
- (($block[1] & 0x00000010) << 19) | (($block[1] & 0x00001000) << 10) |
- (($block[1] & 0x00100000) << 1) | (($block[1] & 0x10000000) >> 8) |
- (($block[0] & 0x00000010) << 15) | (($block[0] & 0x00001000) << 6) |
- (($block[0] & 0x00100000) >> 3) | (($block[0] & 0x10000000) >> 12) |
- (($block[1] & 0x00000004) << 13) | (($block[1] & 0x00000400) << 4) |
- (($block[1] & 0x00040000) >> 5) | (($block[1] & 0x04000000) >> 14) |
- (($block[0] & 0x00000004) << 9) | ( $block[0] & 0x00000400 ) |
- (($block[0] & 0x00040000) >> 9) | (($block[0] & 0x04000000) >> 18) |
- (($block[1] & 0x00010000) >> 11) | (($block[1] & 0x01000000) >> 20) |
- (($block[0] & 0x00010000) >> 15) | (($block[0] & 0x01000000) >> 24)
- ,
- (($block[1] & 0x00000080) << 24) | (($block[1] & 0x00008000) << 15) |
- (($block[1] & 0x00800002) << 6) | (($block[0] & 0x00000080) << 20) |
- (($block[0] & 0x00008000) << 11) | (($block[0] & 0x00800002) << 2) |
- (($block[1] & 0x00000020) << 18) | (($block[1] & 0x00002000) << 9) |
- ( $block[1] & 0x00200000 ) | (($block[1] & 0x20000000) >> 9) |
- (($block[0] & 0x00000020) << 14) | (($block[0] & 0x00002000) << 5) |
- (($block[0] & 0x00200000) >> 4) | (($block[0] & 0x20000000) >> 13) |
- (($block[1] & 0x00000008) << 12) | (($block[1] & 0x00000800) << 3) |
- (($block[1] & 0x00080000) >> 6) | (($block[1] & 0x08000000) >> 15) |
- (($block[0] & 0x00000008) << 8) | (($block[0] & 0x00000800) >> 1) |
- (($block[0] & 0x00080000) >> 10) | (($block[0] & 0x08000000) >> 19) |
- (($block[1] & 0x00000200) >> 3) | (($block[0] & 0x00000200) >> 7) |
- (($block[1] & 0x00020000) >> 12) | (($block[1] & 0x02000000) >> 21) |
- (($block[0] & 0x00020000) >> 16) | (($block[0] & 0x02000000) >> 25) |
- ($msb[1] << 28) | ($msb[0] << 24)
- );
-
- for ($i = 0; $i < 16; $i++) {
- // start of "the Feistel (F) function" - see the following URL:
- // http://en.wikipedia.org/wiki/Image:Data_Encryption_Standard_InfoBox_Diagram.png
- $temp = (($sbox[0][((($block[1] >> 27) & 0x1F) | (($block[1] & 1) << 5)) ^ $keys[$mode][$i][0]]) << 28)
- | (($sbox[1][(($block[1] & 0x1F800000) >> 23) ^ $keys[$mode][$i][1]]) << 24)
- | (($sbox[2][(($block[1] & 0x01F80000) >> 19) ^ $keys[$mode][$i][2]]) << 20)
- | (($sbox[3][(($block[1] & 0x001F8000) >> 15) ^ $keys[$mode][$i][3]]) << 16)
- | (($sbox[4][(($block[1] & 0x0001F800) >> 11) ^ $keys[$mode][$i][4]]) << 12)
- | (($sbox[5][(($block[1] & 0x00001F80) >> 7) ^ $keys[$mode][$i][5]]) << 8)
- | (($sbox[6][(($block[1] & 0x000001F8) >> 3) ^ $keys[$mode][$i][6]]) << 4)
- | ( $sbox[7][((($block[1] & 0x1F) << 1) | (($block[1] >> 31) & 1)) ^ $keys[$mode][$i][7]]);
-
- $msb = ($temp >> 31) & 1;
- $temp &= 0x7FFFFFFF;
- $newBlock = (($temp & 0x00010000) << 15) | (($temp & 0x02020120) << 5)
- | (($temp & 0x00001800) << 17) | (($temp & 0x01000000) >> 10)
- | (($temp & 0x00000008) << 24) | (($temp & 0x00100000) << 6)
- | (($temp & 0x00000010) << 21) | (($temp & 0x00008000) << 9)
- | (($temp & 0x00000200) << 12) | (($temp & 0x10000000) >> 27)
- | (($temp & 0x00000040) << 14) | (($temp & 0x08000000) >> 8)
- | (($temp & 0x00004000) << 4) | (($temp & 0x00000002) << 16)
- | (($temp & 0x00442000) >> 6) | (($temp & 0x40800000) >> 15)
- | (($temp & 0x00000001) << 11) | (($temp & 0x20000000) >> 20)
- | (($temp & 0x00080000) >> 13) | (($temp & 0x00000004) << 3)
- | (($temp & 0x04000000) >> 22) | (($temp & 0x00000480) >> 7)
- | (($temp & 0x00200000) >> 19) | ($msb << 23);
- // end of "the Feistel (F) function" - $newBlock is F's output
-
- $temp = $block[1];
- $block[1] = $block[0] ^ $newBlock;
- $block[0] = $temp;
- }
-
- $msb = array(
- ($block[0] >> 31) & 1,
- ($block[1] >> 31) & 1
- );
- $block[0] &= 0x7FFFFFFF;
- $block[1] &= 0x7FFFFFFF;
-
- $block = array(
- (($block[0] & 0x01000004) << 7) | (($block[1] & 0x01000004) << 6) |
- (($block[0] & 0x00010000) << 13) | (($block[1] & 0x00010000) << 12) |
- (($block[0] & 0x00000100) << 19) | (($block[1] & 0x00000100) << 18) |
- (($block[0] & 0x00000001) << 25) | (($block[1] & 0x00000001) << 24) |
- (($block[0] & 0x02000008) >> 2) | (($block[1] & 0x02000008) >> 3) |
- (($block[0] & 0x00020000) << 4) | (($block[1] & 0x00020000) << 3) |
- (($block[0] & 0x00000200) << 10) | (($block[1] & 0x00000200) << 9) |
- (($block[0] & 0x00000002) << 16) | (($block[1] & 0x00000002) << 15) |
- (($block[0] & 0x04000000) >> 11) | (($block[1] & 0x04000000) >> 12) |
- (($block[0] & 0x00040000) >> 5) | (($block[1] & 0x00040000) >> 6) |
- (($block[0] & 0x00000400) << 1) | ( $block[1] & 0x00000400 ) |
- (($block[0] & 0x08000000) >> 20) | (($block[1] & 0x08000000) >> 21) |
- (($block[0] & 0x00080000) >> 14) | (($block[1] & 0x00080000) >> 15) |
- (($block[0] & 0x00000800) >> 8) | (($block[1] & 0x00000800) >> 9)
- ,
- (($block[0] & 0x10000040) << 3) | (($block[1] & 0x10000040) << 2) |
- (($block[0] & 0x00100000) << 9) | (($block[1] & 0x00100000) << 8) |
- (($block[0] & 0x00001000) << 15) | (($block[1] & 0x00001000) << 14) |
- (($block[0] & 0x00000010) << 21) | (($block[1] & 0x00000010) << 20) |
- (($block[0] & 0x20000080) >> 6) | (($block[1] & 0x20000080) >> 7) |
- ( $block[0] & 0x00200000 ) | (($block[1] & 0x00200000) >> 1) |
- (($block[0] & 0x00002000) << 6) | (($block[1] & 0x00002000) << 5) |
- (($block[0] & 0x00000020) << 12) | (($block[1] & 0x00000020) << 11) |
- (($block[0] & 0x40000000) >> 15) | (($block[1] & 0x40000000) >> 16) |
- (($block[0] & 0x00400000) >> 9) | (($block[1] & 0x00400000) >> 10) |
- (($block[0] & 0x00004000) >> 3) | (($block[1] & 0x00004000) >> 4) |
- (($block[0] & 0x00800000) >> 18) | (($block[1] & 0x00800000) >> 19) |
- (($block[0] & 0x00008000) >> 12) | (($block[1] & 0x00008000) >> 13) |
- ($msb[0] << 7) | ($msb[1] << 6)
- );
-
- return pack('NN', $block[0], $block[1]);
- }
-
- /**
- * Creates the key schedule.
- *
- * @access private
- * @param String $key
- * @return Array
- */
- function _prepareKey($key)
- {
- static $shifts = array( // number of key bits shifted per round
- 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1
- );
-
- // pad the key and remove extra characters as appropriate.
- $key = str_pad(substr($key, 0, 8), 8, chr(0));
-
- $temp = unpack('Na/Nb', $key);
- $key = array($temp['a'], $temp['b']);
- $msb = array(
- ($key[0] >> 31) & 1,
- ($key[1] >> 31) & 1
- );
- $key[0] &= 0x7FFFFFFF;
- $key[1] &= 0x7FFFFFFF;
-
- $key = array(
- (($key[1] & 0x00000002) << 26) | (($key[1] & 0x00000204) << 17) |
- (($key[1] & 0x00020408) << 8) | (($key[1] & 0x02040800) >> 1) |
- (($key[0] & 0x00000002) << 22) | (($key[0] & 0x00000204) << 13) |
- (($key[0] & 0x00020408) << 4) | (($key[0] & 0x02040800) >> 5) |
- (($key[1] & 0x04080000) >> 10) | (($key[0] & 0x04080000) >> 14) |
- (($key[1] & 0x08000000) >> 19) | (($key[0] & 0x08000000) >> 23) |
- (($key[0] & 0x00000010) >> 1) | (($key[0] & 0x00001000) >> 10) |
- (($key[0] & 0x00100000) >> 19) | (($key[0] & 0x10000000) >> 28)
- ,
- (($key[1] & 0x00000080) << 20) | (($key[1] & 0x00008000) << 11) |
- (($key[1] & 0x00800000) << 2) | (($key[0] & 0x00000080) << 16) |
- (($key[0] & 0x00008000) << 7) | (($key[0] & 0x00800000) >> 2) |
- (($key[1] & 0x00000040) << 13) | (($key[1] & 0x00004000) << 4) |
- (($key[1] & 0x00400000) >> 5) | (($key[1] & 0x40000000) >> 14) |
- (($key[0] & 0x00000040) << 9) | ( $key[0] & 0x00004000 ) |
- (($key[0] & 0x00400000) >> 9) | (($key[0] & 0x40000000) >> 18) |
- (($key[1] & 0x00000020) << 6) | (($key[1] & 0x00002000) >> 3) |
- (($key[1] & 0x00200000) >> 12) | (($key[1] & 0x20000000) >> 21) |
- (($key[0] & 0x00000020) << 2) | (($key[0] & 0x00002000) >> 7) |
- (($key[0] & 0x00200000) >> 16) | (($key[0] & 0x20000000) >> 25) |
- (($key[1] & 0x00000010) >> 1) | (($key[1] & 0x00001000) >> 10) |
- (($key[1] & 0x00100000) >> 19) | (($key[1] & 0x10000000) >> 28) |
- ($msb[1] << 24) | ($msb[0] << 20)
- );
-
- $keys = array();
- for ($i = 0; $i < 16; $i++) {
- $key[0] <<= $shifts[$i];
- $temp = ($key[0] & 0xF0000000) >> 28;
- $key[0] = ($key[0] | $temp) & 0x0FFFFFFF;
-
- $key[1] <<= $shifts[$i];
- $temp = ($key[1] & 0xF0000000) >> 28;
- $key[1] = ($key[1] | $temp) & 0x0FFFFFFF;
-
- $temp = array(
- (($key[1] & 0x00004000) >> 9) | (($key[1] & 0x00000800) >> 7) |
- (($key[1] & 0x00020000) >> 14) | (($key[1] & 0x00000010) >> 2) |
- (($key[1] & 0x08000000) >> 26) | (($key[1] & 0x00800000) >> 23)
- ,
- (($key[1] & 0x02400000) >> 20) | (($key[1] & 0x00000001) << 4) |
- (($key[1] & 0x00002000) >> 10) | (($key[1] & 0x00040000) >> 18) |
- (($key[1] & 0x00000080) >> 6)
- ,
- ( $key[1] & 0x00000020 ) | (($key[1] & 0x00000200) >> 5) |
- (($key[1] & 0x00010000) >> 13) | (($key[1] & 0x01000000) >> 22) |
- (($key[1] & 0x00000004) >> 1) | (($key[1] & 0x00100000) >> 20)
- ,
- (($key[1] & 0x00001000) >> 7) | (($key[1] & 0x00200000) >> 17) |
- (($key[1] & 0x00000002) << 2) | (($key[1] & 0x00000100) >> 6) |
- (($key[1] & 0x00008000) >> 14) | (($key[1] & 0x04000000) >> 26)
- ,
- (($key[0] & 0x00008000) >> 10) | ( $key[0] & 0x00000010 ) |
- (($key[0] & 0x02000000) >> 22) | (($key[0] & 0x00080000) >> 17) |
- (($key[0] & 0x00000200) >> 8) | (($key[0] & 0x00000002) >> 1)
- ,
- (($key[0] & 0x04000000) >> 21) | (($key[0] & 0x00010000) >> 12) |
- (($key[0] & 0x00000020) >> 2) | (($key[0] & 0x00000800) >> 9) |
- (($key[0] & 0x00800000) >> 22) | (($key[0] & 0x00000100) >> 8)
- ,
- (($key[0] & 0x00001000) >> 7) | (($key[0] & 0x00000088) >> 3) |
- (($key[0] & 0x00020000) >> 14) | (($key[0] & 0x00000001) << 2) |
- (($key[0] & 0x00400000) >> 21)
- ,
- (($key[0] & 0x00000400) >> 5) | (($key[0] & 0x00004000) >> 10) |
- (($key[0] & 0x00000040) >> 3) | (($key[0] & 0x00100000) >> 18) |
- (($key[0] & 0x08000000) >> 26) | (($key[0] & 0x01000000) >> 24)
- );
-
- $keys[] = $temp;
- }
-
- $temp = array(
- CRYPT_DES_ENCRYPT => $keys,
- CRYPT_DES_DECRYPT => array_reverse($keys)
- );
-
- return $temp;
- }
-}
-
-// vim: ts=4:sw=4:et:
-// vim6: fdl=1:
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP implementation of DES.\r
+ *\r
+ * Uses mcrypt, if available, and an internal implementation, otherwise.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * Useful resources are as follows:\r
+ *\r
+ * - {@link http://en.wikipedia.org/wiki/DES_supplementary_material Wikipedia: DES supplementary material}\r
+ * - {@link http://www.itl.nist.gov/fipspubs/fip46-2.htm FIPS 46-2 - (DES), Data Encryption Standard}\r
+ * - {@link http://www.cs.eku.edu/faculty/styer/460/Encrypt/JS-DES.html JavaScript DES Example}\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/DES.php');\r
+ *\r
+ * $des = new Crypt_DES();\r
+ *\r
+ * $des->setKey('abcdefgh');\r
+ *\r
+ * $size = 10 * 1024;\r
+ * $plaintext = '';\r
+ * for ($i = 0; $i < $size; $i++) {\r
+ * $plaintext.= 'a';\r
+ * }\r
+ *\r
+ * echo $des->decrypt($des->encrypt($plaintext));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_DES\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMVII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_DES::_prepareKey()\r
+ * @see Crypt_DES::_processBlock()\r
+ */\r
+/**\r
+ * Contains array_reverse($keys[CRYPT_DES_DECRYPT])\r
+ */\r
+define('CRYPT_DES_ENCRYPT', 0);\r
+/**\r
+ * Contains array_reverse($keys[CRYPT_DES_ENCRYPT])\r
+ */\r
+define('CRYPT_DES_DECRYPT', 1);\r
+/**\r
+ * Contains $keys[CRYPT_DES_ENCRYPT] as 1-dim array\r
+ */\r
+define('CRYPT_DES_ENCRYPT_1DIM', 2);\r
+/**\r
+ * Contains $keys[CRYPT_DES_DECRYPT] as 1-dim array\r
+ */\r
+define('CRYPT_DES_DECRYPT_1DIM', 3);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_DES::encrypt()\r
+ * @see Crypt_DES::decrypt()\r
+ */\r
+/**\r
+ * Encrypt / decrypt using the Counter mode.\r
+ *\r
+ * Set to -1 since that's what Crypt/Random.php uses to index the CTR mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Counter_.28CTR.29\r
+ */\r
+define('CRYPT_DES_MODE_CTR', -1);\r
+/**\r
+ * Encrypt / decrypt using the Electronic Code Book mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Electronic_codebook_.28ECB.29\r
+ */\r
+define('CRYPT_DES_MODE_ECB', 1);\r
+/**\r
+ * Encrypt / decrypt using the Code Book Chaining mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher-block_chaining_.28CBC.29\r
+ */\r
+define('CRYPT_DES_MODE_CBC', 2);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher_feedback_.28CFB.29\r
+ */\r
+define('CRYPT_DES_MODE_CFB', 3);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Output_feedback_.28OFB.29\r
+ */\r
+define('CRYPT_DES_MODE_OFB', 4);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_DES::Crypt_DES()\r
+ */\r
+/**\r
+ * Toggles the internal implementation\r
+ */\r
+define('CRYPT_DES_MODE_INTERNAL', 1);\r
+/**\r
+ * Toggles the mcrypt implementation\r
+ */\r
+define('CRYPT_DES_MODE_MCRYPT', 2);\r
+/**#@-*/\r
+\r
+/**\r
+ * Pure-PHP implementation of DES.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @version 0.1.0\r
+ * @access public\r
+ * @package Crypt_DES\r
+ */\r
+class Crypt_DES {\r
+ /**\r
+ * The Key Schedule\r
+ *\r
+ * @see Crypt_DES::setKey()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $keys = "\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * The Encryption Mode\r
+ *\r
+ * @see Crypt_DES::Crypt_DES()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $mode;\r
+\r
+ /**\r
+ * Continuous Buffer status\r
+ *\r
+ * @see Crypt_DES::enableContinuousBuffer()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $continuousBuffer = false;\r
+\r
+ /**\r
+ * Padding status\r
+ *\r
+ * @see Crypt_DES::enablePadding()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $padding = true;\r
+\r
+ /**\r
+ * The Initialization Vector\r
+ *\r
+ * @see Crypt_DES::setIV()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $iv = "\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * A "sliding" Initialization Vector\r
+ *\r
+ * @see Crypt_DES::enableContinuousBuffer()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $encryptIV = "\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * A "sliding" Initialization Vector\r
+ *\r
+ * @see Crypt_DES::enableContinuousBuffer()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $decryptIV = "\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * mcrypt resource for encryption\r
+ *\r
+ * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.\r
+ * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.\r
+ *\r
+ * @see Crypt_DES::encrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $enmcrypt;\r
+\r
+ /**\r
+ * mcrypt resource for decryption\r
+ *\r
+ * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.\r
+ * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.\r
+ *\r
+ * @see Crypt_DES::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $demcrypt;\r
+\r
+ /**\r
+ * Does the enmcrypt resource need to be (re)initialized?\r
+ *\r
+ * @see Crypt_DES::setKey()\r
+ * @see Crypt_DES::setIV()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $enchanged = true;\r
+\r
+ /**\r
+ * Does the demcrypt resource need to be (re)initialized?\r
+ *\r
+ * @see Crypt_DES::setKey()\r
+ * @see Crypt_DES::setIV()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $dechanged = true;\r
+\r
+ /**\r
+ * Is the mode one that is paddable?\r
+ *\r
+ * @see Crypt_DES::Crypt_DES()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $paddable = false;\r
+\r
+ /**\r
+ * Encryption buffer for CTR, OFB and CFB modes\r
+ *\r
+ * @see Crypt_DES::encrypt()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0, 'enmcrypt_init' => true);\r
+\r
+ /**\r
+ * Decryption buffer for CTR, OFB and CFB modes\r
+ *\r
+ * @see Crypt_DES::decrypt()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0, 'demcrypt_init' => true);\r
+\r
+ /**\r
+ * mcrypt resource for CFB mode\r
+ *\r
+ * @see Crypt_DES::encrypt()\r
+ * @see Crypt_DES::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $ecb;\r
+\r
+ /**\r
+ * Performance-optimized callback function for en/decrypt()\r
+ * \r
+ * @var Callback\r
+ * @access private\r
+ */\r
+ var $inline_crypt;\r
+\r
+ /**\r
+ * Holds whether performance-optimized $inline_crypt should be used or not.\r
+ *\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $use_inline_crypt = false;\r
+\r
+ /**\r
+ * Shuffle table.\r
+ *\r
+ * For each byte value index, the entry holds an 8-byte string\r
+ * with each byte containing all bits in the same state as the\r
+ * corresponding bit in the index value.\r
+ *\r
+ * @see Crypt_DES::_processBlock()\r
+ * @see Crypt_DES::_prepareKey()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $shuffle = array(\r
+ "\x00\x00\x00\x00\x00\x00\x00\x00", "\x00\x00\x00\x00\x00\x00\x00\xFF",\r
+ "\x00\x00\x00\x00\x00\x00\xFF\x00", "\x00\x00\x00\x00\x00\x00\xFF\xFF",\r
+ "\x00\x00\x00\x00\x00\xFF\x00\x00", "\x00\x00\x00\x00\x00\xFF\x00\xFF",\r
+ "\x00\x00\x00\x00\x00\xFF\xFF\x00", "\x00\x00\x00\x00\x00\xFF\xFF\xFF",\r
+ "\x00\x00\x00\x00\xFF\x00\x00\x00", "\x00\x00\x00\x00\xFF\x00\x00\xFF",\r
+ "\x00\x00\x00\x00\xFF\x00\xFF\x00", "\x00\x00\x00\x00\xFF\x00\xFF\xFF",\r
+ "\x00\x00\x00\x00\xFF\xFF\x00\x00", "\x00\x00\x00\x00\xFF\xFF\x00\xFF",\r
+ "\x00\x00\x00\x00\xFF\xFF\xFF\x00", "\x00\x00\x00\x00\xFF\xFF\xFF\xFF",\r
+ "\x00\x00\x00\xFF\x00\x00\x00\x00", "\x00\x00\x00\xFF\x00\x00\x00\xFF",\r
+ "\x00\x00\x00\xFF\x00\x00\xFF\x00", "\x00\x00\x00\xFF\x00\x00\xFF\xFF",\r
+ "\x00\x00\x00\xFF\x00\xFF\x00\x00", "\x00\x00\x00\xFF\x00\xFF\x00\xFF",\r
+ "\x00\x00\x00\xFF\x00\xFF\xFF\x00", "\x00\x00\x00\xFF\x00\xFF\xFF\xFF",\r
+ "\x00\x00\x00\xFF\xFF\x00\x00\x00", "\x00\x00\x00\xFF\xFF\x00\x00\xFF",\r
+ "\x00\x00\x00\xFF\xFF\x00\xFF\x00", "\x00\x00\x00\xFF\xFF\x00\xFF\xFF",\r
+ "\x00\x00\x00\xFF\xFF\xFF\x00\x00", "\x00\x00\x00\xFF\xFF\xFF\x00\xFF",\r
+ "\x00\x00\x00\xFF\xFF\xFF\xFF\x00", "\x00\x00\x00\xFF\xFF\xFF\xFF\xFF",\r
+ "\x00\x00\xFF\x00\x00\x00\x00\x00", "\x00\x00\xFF\x00\x00\x00\x00\xFF",\r
+ "\x00\x00\xFF\x00\x00\x00\xFF\x00", "\x00\x00\xFF\x00\x00\x00\xFF\xFF",\r
+ "\x00\x00\xFF\x00\x00\xFF\x00\x00", "\x00\x00\xFF\x00\x00\xFF\x00\xFF",\r
+ "\x00\x00\xFF\x00\x00\xFF\xFF\x00", "\x00\x00\xFF\x00\x00\xFF\xFF\xFF",\r
+ "\x00\x00\xFF\x00\xFF\x00\x00\x00", "\x00\x00\xFF\x00\xFF\x00\x00\xFF",\r
+ "\x00\x00\xFF\x00\xFF\x00\xFF\x00", "\x00\x00\xFF\x00\xFF\x00\xFF\xFF",\r
+ "\x00\x00\xFF\x00\xFF\xFF\x00\x00", "\x00\x00\xFF\x00\xFF\xFF\x00\xFF",\r
+ "\x00\x00\xFF\x00\xFF\xFF\xFF\x00", "\x00\x00\xFF\x00\xFF\xFF\xFF\xFF",\r
+ "\x00\x00\xFF\xFF\x00\x00\x00\x00", "\x00\x00\xFF\xFF\x00\x00\x00\xFF",\r
+ "\x00\x00\xFF\xFF\x00\x00\xFF\x00", "\x00\x00\xFF\xFF\x00\x00\xFF\xFF",\r
+ "\x00\x00\xFF\xFF\x00\xFF\x00\x00", "\x00\x00\xFF\xFF\x00\xFF\x00\xFF",\r
+ "\x00\x00\xFF\xFF\x00\xFF\xFF\x00", "\x00\x00\xFF\xFF\x00\xFF\xFF\xFF",\r
+ "\x00\x00\xFF\xFF\xFF\x00\x00\x00", "\x00\x00\xFF\xFF\xFF\x00\x00\xFF",\r
+ "\x00\x00\xFF\xFF\xFF\x00\xFF\x00", "\x00\x00\xFF\xFF\xFF\x00\xFF\xFF",\r
+ "\x00\x00\xFF\xFF\xFF\xFF\x00\x00", "\x00\x00\xFF\xFF\xFF\xFF\x00\xFF",\r
+ "\x00\x00\xFF\xFF\xFF\xFF\xFF\x00", "\x00\x00\xFF\xFF\xFF\xFF\xFF\xFF",\r
+ "\x00\xFF\x00\x00\x00\x00\x00\x00", "\x00\xFF\x00\x00\x00\x00\x00\xFF",\r
+ "\x00\xFF\x00\x00\x00\x00\xFF\x00", "\x00\xFF\x00\x00\x00\x00\xFF\xFF",\r
+ "\x00\xFF\x00\x00\x00\xFF\x00\x00", "\x00\xFF\x00\x00\x00\xFF\x00\xFF",\r
+ "\x00\xFF\x00\x00\x00\xFF\xFF\x00", "\x00\xFF\x00\x00\x00\xFF\xFF\xFF",\r
+ "\x00\xFF\x00\x00\xFF\x00\x00\x00", "\x00\xFF\x00\x00\xFF\x00\x00\xFF",\r
+ "\x00\xFF\x00\x00\xFF\x00\xFF\x00", "\x00\xFF\x00\x00\xFF\x00\xFF\xFF",\r
+ "\x00\xFF\x00\x00\xFF\xFF\x00\x00", "\x00\xFF\x00\x00\xFF\xFF\x00\xFF",\r
+ "\x00\xFF\x00\x00\xFF\xFF\xFF\x00", "\x00\xFF\x00\x00\xFF\xFF\xFF\xFF",\r
+ "\x00\xFF\x00\xFF\x00\x00\x00\x00", "\x00\xFF\x00\xFF\x00\x00\x00\xFF",\r
+ "\x00\xFF\x00\xFF\x00\x00\xFF\x00", "\x00\xFF\x00\xFF\x00\x00\xFF\xFF",\r
+ "\x00\xFF\x00\xFF\x00\xFF\x00\x00", "\x00\xFF\x00\xFF\x00\xFF\x00\xFF",\r
+ "\x00\xFF\x00\xFF\x00\xFF\xFF\x00", "\x00\xFF\x00\xFF\x00\xFF\xFF\xFF",\r
+ "\x00\xFF\x00\xFF\xFF\x00\x00\x00", "\x00\xFF\x00\xFF\xFF\x00\x00\xFF",\r
+ "\x00\xFF\x00\xFF\xFF\x00\xFF\x00", "\x00\xFF\x00\xFF\xFF\x00\xFF\xFF",\r
+ "\x00\xFF\x00\xFF\xFF\xFF\x00\x00", "\x00\xFF\x00\xFF\xFF\xFF\x00\xFF",\r
+ "\x00\xFF\x00\xFF\xFF\xFF\xFF\x00", "\x00\xFF\x00\xFF\xFF\xFF\xFF\xFF",\r
+ "\x00\xFF\xFF\x00\x00\x00\x00\x00", "\x00\xFF\xFF\x00\x00\x00\x00\xFF",\r
+ "\x00\xFF\xFF\x00\x00\x00\xFF\x00", "\x00\xFF\xFF\x00\x00\x00\xFF\xFF",\r
+ "\x00\xFF\xFF\x00\x00\xFF\x00\x00", "\x00\xFF\xFF\x00\x00\xFF\x00\xFF",\r
+ "\x00\xFF\xFF\x00\x00\xFF\xFF\x00", "\x00\xFF\xFF\x00\x00\xFF\xFF\xFF",\r
+ "\x00\xFF\xFF\x00\xFF\x00\x00\x00", "\x00\xFF\xFF\x00\xFF\x00\x00\xFF",\r
+ "\x00\xFF\xFF\x00\xFF\x00\xFF\x00", "\x00\xFF\xFF\x00\xFF\x00\xFF\xFF",\r
+ "\x00\xFF\xFF\x00\xFF\xFF\x00\x00", "\x00\xFF\xFF\x00\xFF\xFF\x00\xFF",\r
+ "\x00\xFF\xFF\x00\xFF\xFF\xFF\x00", "\x00\xFF\xFF\x00\xFF\xFF\xFF\xFF",\r
+ "\x00\xFF\xFF\xFF\x00\x00\x00\x00", "\x00\xFF\xFF\xFF\x00\x00\x00\xFF",\r
+ "\x00\xFF\xFF\xFF\x00\x00\xFF\x00", "\x00\xFF\xFF\xFF\x00\x00\xFF\xFF",\r
+ "\x00\xFF\xFF\xFF\x00\xFF\x00\x00", "\x00\xFF\xFF\xFF\x00\xFF\x00\xFF",\r
+ "\x00\xFF\xFF\xFF\x00\xFF\xFF\x00", "\x00\xFF\xFF\xFF\x00\xFF\xFF\xFF",\r
+ "\x00\xFF\xFF\xFF\xFF\x00\x00\x00", "\x00\xFF\xFF\xFF\xFF\x00\x00\xFF",\r
+ "\x00\xFF\xFF\xFF\xFF\x00\xFF\x00", "\x00\xFF\xFF\xFF\xFF\x00\xFF\xFF",\r
+ "\x00\xFF\xFF\xFF\xFF\xFF\x00\x00", "\x00\xFF\xFF\xFF\xFF\xFF\x00\xFF",\r
+ "\x00\xFF\xFF\xFF\xFF\xFF\xFF\x00", "\x00\xFF\xFF\xFF\xFF\xFF\xFF\xFF",\r
+ "\xFF\x00\x00\x00\x00\x00\x00\x00", "\xFF\x00\x00\x00\x00\x00\x00\xFF",\r
+ "\xFF\x00\x00\x00\x00\x00\xFF\x00", "\xFF\x00\x00\x00\x00\x00\xFF\xFF",\r
+ "\xFF\x00\x00\x00\x00\xFF\x00\x00", "\xFF\x00\x00\x00\x00\xFF\x00\xFF",\r
+ "\xFF\x00\x00\x00\x00\xFF\xFF\x00", "\xFF\x00\x00\x00\x00\xFF\xFF\xFF",\r
+ "\xFF\x00\x00\x00\xFF\x00\x00\x00", "\xFF\x00\x00\x00\xFF\x00\x00\xFF",\r
+ "\xFF\x00\x00\x00\xFF\x00\xFF\x00", "\xFF\x00\x00\x00\xFF\x00\xFF\xFF",\r
+ "\xFF\x00\x00\x00\xFF\xFF\x00\x00", "\xFF\x00\x00\x00\xFF\xFF\x00\xFF",\r
+ "\xFF\x00\x00\x00\xFF\xFF\xFF\x00", "\xFF\x00\x00\x00\xFF\xFF\xFF\xFF",\r
+ "\xFF\x00\x00\xFF\x00\x00\x00\x00", "\xFF\x00\x00\xFF\x00\x00\x00\xFF",\r
+ "\xFF\x00\x00\xFF\x00\x00\xFF\x00", "\xFF\x00\x00\xFF\x00\x00\xFF\xFF",\r
+ "\xFF\x00\x00\xFF\x00\xFF\x00\x00", "\xFF\x00\x00\xFF\x00\xFF\x00\xFF",\r
+ "\xFF\x00\x00\xFF\x00\xFF\xFF\x00", "\xFF\x00\x00\xFF\x00\xFF\xFF\xFF",\r
+ "\xFF\x00\x00\xFF\xFF\x00\x00\x00", "\xFF\x00\x00\xFF\xFF\x00\x00\xFF",\r
+ "\xFF\x00\x00\xFF\xFF\x00\xFF\x00", "\xFF\x00\x00\xFF\xFF\x00\xFF\xFF",\r
+ "\xFF\x00\x00\xFF\xFF\xFF\x00\x00", "\xFF\x00\x00\xFF\xFF\xFF\x00\xFF",\r
+ "\xFF\x00\x00\xFF\xFF\xFF\xFF\x00", "\xFF\x00\x00\xFF\xFF\xFF\xFF\xFF",\r
+ "\xFF\x00\xFF\x00\x00\x00\x00\x00", "\xFF\x00\xFF\x00\x00\x00\x00\xFF",\r
+ "\xFF\x00\xFF\x00\x00\x00\xFF\x00", "\xFF\x00\xFF\x00\x00\x00\xFF\xFF",\r
+ "\xFF\x00\xFF\x00\x00\xFF\x00\x00", "\xFF\x00\xFF\x00\x00\xFF\x00\xFF",\r
+ "\xFF\x00\xFF\x00\x00\xFF\xFF\x00", "\xFF\x00\xFF\x00\x00\xFF\xFF\xFF",\r
+ "\xFF\x00\xFF\x00\xFF\x00\x00\x00", "\xFF\x00\xFF\x00\xFF\x00\x00\xFF",\r
+ "\xFF\x00\xFF\x00\xFF\x00\xFF\x00", "\xFF\x00\xFF\x00\xFF\x00\xFF\xFF",\r
+ "\xFF\x00\xFF\x00\xFF\xFF\x00\x00", "\xFF\x00\xFF\x00\xFF\xFF\x00\xFF",\r
+ "\xFF\x00\xFF\x00\xFF\xFF\xFF\x00", "\xFF\x00\xFF\x00\xFF\xFF\xFF\xFF",\r
+ "\xFF\x00\xFF\xFF\x00\x00\x00\x00", "\xFF\x00\xFF\xFF\x00\x00\x00\xFF",\r
+ "\xFF\x00\xFF\xFF\x00\x00\xFF\x00", "\xFF\x00\xFF\xFF\x00\x00\xFF\xFF",\r
+ "\xFF\x00\xFF\xFF\x00\xFF\x00\x00", "\xFF\x00\xFF\xFF\x00\xFF\x00\xFF",\r
+ "\xFF\x00\xFF\xFF\x00\xFF\xFF\x00", "\xFF\x00\xFF\xFF\x00\xFF\xFF\xFF",\r
+ "\xFF\x00\xFF\xFF\xFF\x00\x00\x00", "\xFF\x00\xFF\xFF\xFF\x00\x00\xFF",\r
+ "\xFF\x00\xFF\xFF\xFF\x00\xFF\x00", "\xFF\x00\xFF\xFF\xFF\x00\xFF\xFF",\r
+ "\xFF\x00\xFF\xFF\xFF\xFF\x00\x00", "\xFF\x00\xFF\xFF\xFF\xFF\x00\xFF",\r
+ "\xFF\x00\xFF\xFF\xFF\xFF\xFF\x00", "\xFF\x00\xFF\xFF\xFF\xFF\xFF\xFF",\r
+ "\xFF\xFF\x00\x00\x00\x00\x00\x00", "\xFF\xFF\x00\x00\x00\x00\x00\xFF",\r
+ "\xFF\xFF\x00\x00\x00\x00\xFF\x00", "\xFF\xFF\x00\x00\x00\x00\xFF\xFF",\r
+ "\xFF\xFF\x00\x00\x00\xFF\x00\x00", "\xFF\xFF\x00\x00\x00\xFF\x00\xFF",\r
+ "\xFF\xFF\x00\x00\x00\xFF\xFF\x00", "\xFF\xFF\x00\x00\x00\xFF\xFF\xFF",\r
+ "\xFF\xFF\x00\x00\xFF\x00\x00\x00", "\xFF\xFF\x00\x00\xFF\x00\x00\xFF",\r
+ "\xFF\xFF\x00\x00\xFF\x00\xFF\x00", "\xFF\xFF\x00\x00\xFF\x00\xFF\xFF",\r
+ "\xFF\xFF\x00\x00\xFF\xFF\x00\x00", "\xFF\xFF\x00\x00\xFF\xFF\x00\xFF",\r
+ "\xFF\xFF\x00\x00\xFF\xFF\xFF\x00", "\xFF\xFF\x00\x00\xFF\xFF\xFF\xFF",\r
+ "\xFF\xFF\x00\xFF\x00\x00\x00\x00", "\xFF\xFF\x00\xFF\x00\x00\x00\xFF",\r
+ "\xFF\xFF\x00\xFF\x00\x00\xFF\x00", "\xFF\xFF\x00\xFF\x00\x00\xFF\xFF",\r
+ "\xFF\xFF\x00\xFF\x00\xFF\x00\x00", "\xFF\xFF\x00\xFF\x00\xFF\x00\xFF",\r
+ "\xFF\xFF\x00\xFF\x00\xFF\xFF\x00", "\xFF\xFF\x00\xFF\x00\xFF\xFF\xFF",\r
+ "\xFF\xFF\x00\xFF\xFF\x00\x00\x00", "\xFF\xFF\x00\xFF\xFF\x00\x00\xFF",\r
+ "\xFF\xFF\x00\xFF\xFF\x00\xFF\x00", "\xFF\xFF\x00\xFF\xFF\x00\xFF\xFF",\r
+ "\xFF\xFF\x00\xFF\xFF\xFF\x00\x00", "\xFF\xFF\x00\xFF\xFF\xFF\x00\xFF",\r
+ "\xFF\xFF\x00\xFF\xFF\xFF\xFF\x00", "\xFF\xFF\x00\xFF\xFF\xFF\xFF\xFF",\r
+ "\xFF\xFF\xFF\x00\x00\x00\x00\x00", "\xFF\xFF\xFF\x00\x00\x00\x00\xFF",\r
+ "\xFF\xFF\xFF\x00\x00\x00\xFF\x00", "\xFF\xFF\xFF\x00\x00\x00\xFF\xFF",\r
+ "\xFF\xFF\xFF\x00\x00\xFF\x00\x00", "\xFF\xFF\xFF\x00\x00\xFF\x00\xFF",\r
+ "\xFF\xFF\xFF\x00\x00\xFF\xFF\x00", "\xFF\xFF\xFF\x00\x00\xFF\xFF\xFF",\r
+ "\xFF\xFF\xFF\x00\xFF\x00\x00\x00", "\xFF\xFF\xFF\x00\xFF\x00\x00\xFF",\r
+ "\xFF\xFF\xFF\x00\xFF\x00\xFF\x00", "\xFF\xFF\xFF\x00\xFF\x00\xFF\xFF",\r
+ "\xFF\xFF\xFF\x00\xFF\xFF\x00\x00", "\xFF\xFF\xFF\x00\xFF\xFF\x00\xFF",\r
+ "\xFF\xFF\xFF\x00\xFF\xFF\xFF\x00", "\xFF\xFF\xFF\x00\xFF\xFF\xFF\xFF",\r
+ "\xFF\xFF\xFF\xFF\x00\x00\x00\x00", "\xFF\xFF\xFF\xFF\x00\x00\x00\xFF",\r
+ "\xFF\xFF\xFF\xFF\x00\x00\xFF\x00", "\xFF\xFF\xFF\xFF\x00\x00\xFF\xFF",\r
+ "\xFF\xFF\xFF\xFF\x00\xFF\x00\x00", "\xFF\xFF\xFF\xFF\x00\xFF\x00\xFF",\r
+ "\xFF\xFF\xFF\xFF\x00\xFF\xFF\x00", "\xFF\xFF\xFF\xFF\x00\xFF\xFF\xFF",\r
+ "\xFF\xFF\xFF\xFF\xFF\x00\x00\x00", "\xFF\xFF\xFF\xFF\xFF\x00\x00\xFF",\r
+ "\xFF\xFF\xFF\xFF\xFF\x00\xFF\x00", "\xFF\xFF\xFF\xFF\xFF\x00\xFF\xFF",\r
+ "\xFF\xFF\xFF\xFF\xFF\xFF\x00\x00", "\xFF\xFF\xFF\xFF\xFF\xFF\x00\xFF",\r
+ "\xFF\xFF\xFF\xFF\xFF\xFF\xFF\x00", "\xFF\xFF\xFF\xFF\xFF\xFF\xFF\xFF"\r
+ );\r
+\r
+ /**\r
+ * IP mapping helper table.\r
+ *\r
+ * Indexing this table with each source byte performs the initial bit permutation.\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $ipmap = array(\r
+ 0x00, 0x10, 0x01, 0x11, 0x20, 0x30, 0x21, 0x31,\r
+ 0x02, 0x12, 0x03, 0x13, 0x22, 0x32, 0x23, 0x33,\r
+ 0x40, 0x50, 0x41, 0x51, 0x60, 0x70, 0x61, 0x71,\r
+ 0x42, 0x52, 0x43, 0x53, 0x62, 0x72, 0x63, 0x73,\r
+ 0x04, 0x14, 0x05, 0x15, 0x24, 0x34, 0x25, 0x35,\r
+ 0x06, 0x16, 0x07, 0x17, 0x26, 0x36, 0x27, 0x37,\r
+ 0x44, 0x54, 0x45, 0x55, 0x64, 0x74, 0x65, 0x75,\r
+ 0x46, 0x56, 0x47, 0x57, 0x66, 0x76, 0x67, 0x77,\r
+ 0x80, 0x90, 0x81, 0x91, 0xA0, 0xB0, 0xA1, 0xB1,\r
+ 0x82, 0x92, 0x83, 0x93, 0xA2, 0xB2, 0xA3, 0xB3,\r
+ 0xC0, 0xD0, 0xC1, 0xD1, 0xE0, 0xF0, 0xE1, 0xF1,\r
+ 0xC2, 0xD2, 0xC3, 0xD3, 0xE2, 0xF2, 0xE3, 0xF3,\r
+ 0x84, 0x94, 0x85, 0x95, 0xA4, 0xB4, 0xA5, 0xB5,\r
+ 0x86, 0x96, 0x87, 0x97, 0xA6, 0xB6, 0xA7, 0xB7,\r
+ 0xC4, 0xD4, 0xC5, 0xD5, 0xE4, 0xF4, 0xE5, 0xF5,\r
+ 0xC6, 0xD6, 0xC7, 0xD7, 0xE6, 0xF6, 0xE7, 0xF7,\r
+ 0x08, 0x18, 0x09, 0x19, 0x28, 0x38, 0x29, 0x39,\r
+ 0x0A, 0x1A, 0x0B, 0x1B, 0x2A, 0x3A, 0x2B, 0x3B,\r
+ 0x48, 0x58, 0x49, 0x59, 0x68, 0x78, 0x69, 0x79,\r
+ 0x4A, 0x5A, 0x4B, 0x5B, 0x6A, 0x7A, 0x6B, 0x7B,\r
+ 0x0C, 0x1C, 0x0D, 0x1D, 0x2C, 0x3C, 0x2D, 0x3D,\r
+ 0x0E, 0x1E, 0x0F, 0x1F, 0x2E, 0x3E, 0x2F, 0x3F,\r
+ 0x4C, 0x5C, 0x4D, 0x5D, 0x6C, 0x7C, 0x6D, 0x7D,\r
+ 0x4E, 0x5E, 0x4F, 0x5F, 0x6E, 0x7E, 0x6F, 0x7F,\r
+ 0x88, 0x98, 0x89, 0x99, 0xA8, 0xB8, 0xA9, 0xB9,\r
+ 0x8A, 0x9A, 0x8B, 0x9B, 0xAA, 0xBA, 0xAB, 0xBB,\r
+ 0xC8, 0xD8, 0xC9, 0xD9, 0xE8, 0xF8, 0xE9, 0xF9,\r
+ 0xCA, 0xDA, 0xCB, 0xDB, 0xEA, 0xFA, 0xEB, 0xFB,\r
+ 0x8C, 0x9C, 0x8D, 0x9D, 0xAC, 0xBC, 0xAD, 0xBD,\r
+ 0x8E, 0x9E, 0x8F, 0x9F, 0xAE, 0xBE, 0xAF, 0xBF,\r
+ 0xCC, 0xDC, 0xCD, 0xDD, 0xEC, 0xFC, 0xED, 0xFD,\r
+ 0xCE, 0xDE, 0xCF, 0xDF, 0xEE, 0xFE, 0xEF, 0xFF\r
+ );\r
+\r
+ /**\r
+ * Inverse IP mapping helper table.\r
+ * Indexing this table with a byte value reverses the bit order.\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $invipmap = array(\r
+ 0x00, 0x80, 0x40, 0xC0, 0x20, 0xA0, 0x60, 0xE0,\r
+ 0x10, 0x90, 0x50, 0xD0, 0x30, 0xB0, 0x70, 0xF0,\r
+ 0x08, 0x88, 0x48, 0xC8, 0x28, 0xA8, 0x68, 0xE8,\r
+ 0x18, 0x98, 0x58, 0xD8, 0x38, 0xB8, 0x78, 0xF8,\r
+ 0x04, 0x84, 0x44, 0xC4, 0x24, 0xA4, 0x64, 0xE4,\r
+ 0x14, 0x94, 0x54, 0xD4, 0x34, 0xB4, 0x74, 0xF4,\r
+ 0x0C, 0x8C, 0x4C, 0xCC, 0x2C, 0xAC, 0x6C, 0xEC,\r
+ 0x1C, 0x9C, 0x5C, 0xDC, 0x3C, 0xBC, 0x7C, 0xFC,\r
+ 0x02, 0x82, 0x42, 0xC2, 0x22, 0xA2, 0x62, 0xE2,\r
+ 0x12, 0x92, 0x52, 0xD2, 0x32, 0xB2, 0x72, 0xF2,\r
+ 0x0A, 0x8A, 0x4A, 0xCA, 0x2A, 0xAA, 0x6A, 0xEA,\r
+ 0x1A, 0x9A, 0x5A, 0xDA, 0x3A, 0xBA, 0x7A, 0xFA,\r
+ 0x06, 0x86, 0x46, 0xC6, 0x26, 0xA6, 0x66, 0xE6,\r
+ 0x16, 0x96, 0x56, 0xD6, 0x36, 0xB6, 0x76, 0xF6,\r
+ 0x0E, 0x8E, 0x4E, 0xCE, 0x2E, 0xAE, 0x6E, 0xEE,\r
+ 0x1E, 0x9E, 0x5E, 0xDE, 0x3E, 0xBE, 0x7E, 0xFE,\r
+ 0x01, 0x81, 0x41, 0xC1, 0x21, 0xA1, 0x61, 0xE1,\r
+ 0x11, 0x91, 0x51, 0xD1, 0x31, 0xB1, 0x71, 0xF1,\r
+ 0x09, 0x89, 0x49, 0xC9, 0x29, 0xA9, 0x69, 0xE9,\r
+ 0x19, 0x99, 0x59, 0xD9, 0x39, 0xB9, 0x79, 0xF9,\r
+ 0x05, 0x85, 0x45, 0xC5, 0x25, 0xA5, 0x65, 0xE5,\r
+ 0x15, 0x95, 0x55, 0xD5, 0x35, 0xB5, 0x75, 0xF5,\r
+ 0x0D, 0x8D, 0x4D, 0xCD, 0x2D, 0xAD, 0x6D, 0xED,\r
+ 0x1D, 0x9D, 0x5D, 0xDD, 0x3D, 0xBD, 0x7D, 0xFD,\r
+ 0x03, 0x83, 0x43, 0xC3, 0x23, 0xA3, 0x63, 0xE3,\r
+ 0x13, 0x93, 0x53, 0xD3, 0x33, 0xB3, 0x73, 0xF3,\r
+ 0x0B, 0x8B, 0x4B, 0xCB, 0x2B, 0xAB, 0x6B, 0xEB,\r
+ 0x1B, 0x9B, 0x5B, 0xDB, 0x3B, 0xBB, 0x7B, 0xFB,\r
+ 0x07, 0x87, 0x47, 0xC7, 0x27, 0xA7, 0x67, 0xE7,\r
+ 0x17, 0x97, 0x57, 0xD7, 0x37, 0xB7, 0x77, 0xF7,\r
+ 0x0F, 0x8F, 0x4F, 0xCF, 0x2F, 0xAF, 0x6F, 0xEF,\r
+ 0x1F, 0x9F, 0x5F, 0xDF, 0x3F, 0xBF, 0x7F, 0xFF\r
+ );\r
+\r
+ /**\r
+ * Pre-permuted S-box1\r
+ *\r
+ * Each box ($sbox1-$sbox8) has been vectorized, then each value pre-permuted using the\r
+ * P table: concatenation can then be replaced by exclusive ORs.\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox1 = array(\r
+ 0x00808200, 0x00000000, 0x00008000, 0x00808202,\r
+ 0x00808002, 0x00008202, 0x00000002, 0x00008000,\r
+ 0x00000200, 0x00808200, 0x00808202, 0x00000200,\r
+ 0x00800202, 0x00808002, 0x00800000, 0x00000002,\r
+ 0x00000202, 0x00800200, 0x00800200, 0x00008200,\r
+ 0x00008200, 0x00808000, 0x00808000, 0x00800202,\r
+ 0x00008002, 0x00800002, 0x00800002, 0x00008002,\r
+ 0x00000000, 0x00000202, 0x00008202, 0x00800000,\r
+ 0x00008000, 0x00808202, 0x00000002, 0x00808000,\r
+ 0x00808200, 0x00800000, 0x00800000, 0x00000200,\r
+ 0x00808002, 0x00008000, 0x00008200, 0x00800002,\r
+ 0x00000200, 0x00000002, 0x00800202, 0x00008202,\r
+ 0x00808202, 0x00008002, 0x00808000, 0x00800202,\r
+ 0x00800002, 0x00000202, 0x00008202, 0x00808200,\r
+ 0x00000202, 0x00800200, 0x00800200, 0x00000000,\r
+ 0x00008002, 0x00008200, 0x00000000, 0x00808002\r
+ );\r
+\r
+ /**\r
+ * Pre-permuted S-box2\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox2 = array(\r
+ 0x40084010, 0x40004000, 0x00004000, 0x00084010,\r
+ 0x00080000, 0x00000010, 0x40080010, 0x40004010,\r
+ 0x40000010, 0x40084010, 0x40084000, 0x40000000,\r
+ 0x40004000, 0x00080000, 0x00000010, 0x40080010,\r
+ 0x00084000, 0x00080010, 0x40004010, 0x00000000,\r
+ 0x40000000, 0x00004000, 0x00084010, 0x40080000,\r
+ 0x00080010, 0x40000010, 0x00000000, 0x00084000,\r
+ 0x00004010, 0x40084000, 0x40080000, 0x00004010,\r
+ 0x00000000, 0x00084010, 0x40080010, 0x00080000,\r
+ 0x40004010, 0x40080000, 0x40084000, 0x00004000,\r
+ 0x40080000, 0x40004000, 0x00000010, 0x40084010,\r
+ 0x00084010, 0x00000010, 0x00004000, 0x40000000,\r
+ 0x00004010, 0x40084000, 0x00080000, 0x40000010,\r
+ 0x00080010, 0x40004010, 0x40000010, 0x00080010,\r
+ 0x00084000, 0x00000000, 0x40004000, 0x00004010,\r
+ 0x40000000, 0x40080010, 0x40084010, 0x00084000\r
+ );\r
+\r
+ /**\r
+ * Pre-permuted S-box3\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox3 = array(\r
+ 0x00000104, 0x04010100, 0x00000000, 0x04010004,\r
+ 0x04000100, 0x00000000, 0x00010104, 0x04000100,\r
+ 0x00010004, 0x04000004, 0x04000004, 0x00010000,\r
+ 0x04010104, 0x00010004, 0x04010000, 0x00000104,\r
+ 0x04000000, 0x00000004, 0x04010100, 0x00000100,\r
+ 0x00010100, 0x04010000, 0x04010004, 0x00010104,\r
+ 0x04000104, 0x00010100, 0x00010000, 0x04000104,\r
+ 0x00000004, 0x04010104, 0x00000100, 0x04000000,\r
+ 0x04010100, 0x04000000, 0x00010004, 0x00000104,\r
+ 0x00010000, 0x04010100, 0x04000100, 0x00000000,\r
+ 0x00000100, 0x00010004, 0x04010104, 0x04000100,\r
+ 0x04000004, 0x00000100, 0x00000000, 0x04010004,\r
+ 0x04000104, 0x00010000, 0x04000000, 0x04010104,\r
+ 0x00000004, 0x00010104, 0x00010100, 0x04000004,\r
+ 0x04010000, 0x04000104, 0x00000104, 0x04010000,\r
+ 0x00010104, 0x00000004, 0x04010004, 0x00010100\r
+ );\r
+\r
+ /**\r
+ * Pre-permuted S-box4\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox4 = array(\r
+ 0x80401000, 0x80001040, 0x80001040, 0x00000040,\r
+ 0x00401040, 0x80400040, 0x80400000, 0x80001000,\r
+ 0x00000000, 0x00401000, 0x00401000, 0x80401040,\r
+ 0x80000040, 0x00000000, 0x00400040, 0x80400000,\r
+ 0x80000000, 0x00001000, 0x00400000, 0x80401000,\r
+ 0x00000040, 0x00400000, 0x80001000, 0x00001040,\r
+ 0x80400040, 0x80000000, 0x00001040, 0x00400040,\r
+ 0x00001000, 0x00401040, 0x80401040, 0x80000040,\r
+ 0x00400040, 0x80400000, 0x00401000, 0x80401040,\r
+ 0x80000040, 0x00000000, 0x00000000, 0x00401000,\r
+ 0x00001040, 0x00400040, 0x80400040, 0x80000000,\r
+ 0x80401000, 0x80001040, 0x80001040, 0x00000040,\r
+ 0x80401040, 0x80000040, 0x80000000, 0x00001000,\r
+ 0x80400000, 0x80001000, 0x00401040, 0x80400040,\r
+ 0x80001000, 0x00001040, 0x00400000, 0x80401000,\r
+ 0x00000040, 0x00400000, 0x00001000, 0x00401040\r
+ );\r
+\r
+ /**\r
+ * Pre-permuted S-box5\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox5 = array(\r
+ 0x00000080, 0x01040080, 0x01040000, 0x21000080,\r
+ 0x00040000, 0x00000080, 0x20000000, 0x01040000,\r
+ 0x20040080, 0x00040000, 0x01000080, 0x20040080,\r
+ 0x21000080, 0x21040000, 0x00040080, 0x20000000,\r
+ 0x01000000, 0x20040000, 0x20040000, 0x00000000,\r
+ 0x20000080, 0x21040080, 0x21040080, 0x01000080,\r
+ 0x21040000, 0x20000080, 0x00000000, 0x21000000,\r
+ 0x01040080, 0x01000000, 0x21000000, 0x00040080,\r
+ 0x00040000, 0x21000080, 0x00000080, 0x01000000,\r
+ 0x20000000, 0x01040000, 0x21000080, 0x20040080,\r
+ 0x01000080, 0x20000000, 0x21040000, 0x01040080,\r
+ 0x20040080, 0x00000080, 0x01000000, 0x21040000,\r
+ 0x21040080, 0x00040080, 0x21000000, 0x21040080,\r
+ 0x01040000, 0x00000000, 0x20040000, 0x21000000,\r
+ 0x00040080, 0x01000080, 0x20000080, 0x00040000,\r
+ 0x00000000, 0x20040000, 0x01040080, 0x20000080\r
+ );\r
+\r
+ /**\r
+ * Pre-permuted S-box6\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox6 = array(\r
+ 0x10000008, 0x10200000, 0x00002000, 0x10202008,\r
+ 0x10200000, 0x00000008, 0x10202008, 0x00200000,\r
+ 0x10002000, 0x00202008, 0x00200000, 0x10000008,\r
+ 0x00200008, 0x10002000, 0x10000000, 0x00002008,\r
+ 0x00000000, 0x00200008, 0x10002008, 0x00002000,\r
+ 0x00202000, 0x10002008, 0x00000008, 0x10200008,\r
+ 0x10200008, 0x00000000, 0x00202008, 0x10202000,\r
+ 0x00002008, 0x00202000, 0x10202000, 0x10000000,\r
+ 0x10002000, 0x00000008, 0x10200008, 0x00202000,\r
+ 0x10202008, 0x00200000, 0x00002008, 0x10000008,\r
+ 0x00200000, 0x10002000, 0x10000000, 0x00002008,\r
+ 0x10000008, 0x10202008, 0x00202000, 0x10200000,\r
+ 0x00202008, 0x10202000, 0x00000000, 0x10200008,\r
+ 0x00000008, 0x00002000, 0x10200000, 0x00202008,\r
+ 0x00002000, 0x00200008, 0x10002008, 0x00000000,\r
+ 0x10202000, 0x10000000, 0x00200008, 0x10002008\r
+ );\r
+\r
+ /**\r
+ * Pre-permuted S-box7\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox7 = array(\r
+ 0x00100000, 0x02100001, 0x02000401, 0x00000000,\r
+ 0x00000400, 0x02000401, 0x00100401, 0x02100400,\r
+ 0x02100401, 0x00100000, 0x00000000, 0x02000001,\r
+ 0x00000001, 0x02000000, 0x02100001, 0x00000401,\r
+ 0x02000400, 0x00100401, 0x00100001, 0x02000400,\r
+ 0x02000001, 0x02100000, 0x02100400, 0x00100001,\r
+ 0x02100000, 0x00000400, 0x00000401, 0x02100401,\r
+ 0x00100400, 0x00000001, 0x02000000, 0x00100400,\r
+ 0x02000000, 0x00100400, 0x00100000, 0x02000401,\r
+ 0x02000401, 0x02100001, 0x02100001, 0x00000001,\r
+ 0x00100001, 0x02000000, 0x02000400, 0x00100000,\r
+ 0x02100400, 0x00000401, 0x00100401, 0x02100400,\r
+ 0x00000401, 0x02000001, 0x02100401, 0x02100000,\r
+ 0x00100400, 0x00000000, 0x00000001, 0x02100401,\r
+ 0x00000000, 0x00100401, 0x02100000, 0x00000400,\r
+ 0x02000001, 0x02000400, 0x00000400, 0x00100001\r
+ );\r
+\r
+ /**\r
+ * Pre-permuted S-box8\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox8 = array(\r
+ 0x08000820, 0x00000800, 0x00020000, 0x08020820,\r
+ 0x08000000, 0x08000820, 0x00000020, 0x08000000,\r
+ 0x00020020, 0x08020000, 0x08020820, 0x00020800,\r
+ 0x08020800, 0x00020820, 0x00000800, 0x00000020,\r
+ 0x08020000, 0x08000020, 0x08000800, 0x00000820,\r
+ 0x00020800, 0x00020020, 0x08020020, 0x08020800,\r
+ 0x00000820, 0x00000000, 0x00000000, 0x08020020,\r
+ 0x08000020, 0x08000800, 0x00020820, 0x00020000,\r
+ 0x00020820, 0x00020000, 0x08020800, 0x00000800,\r
+ 0x00000020, 0x08020020, 0x00000800, 0x00020820,\r
+ 0x08000800, 0x00000020, 0x08000020, 0x08020000,\r
+ 0x08020020, 0x08000000, 0x00020000, 0x08000820,\r
+ 0x00000000, 0x08020820, 0x00020020, 0x08000020,\r
+ 0x08020000, 0x08000800, 0x08000820, 0x00000000,\r
+ 0x08020820, 0x00020800, 0x00020800, 0x00000820,\r
+ 0x00000820, 0x00020020, 0x08000000, 0x08020800\r
+ );\r
+\r
+ /**\r
+ * Default Constructor.\r
+ *\r
+ * Determines whether or not the mcrypt extension should be used. $mode should only, at present, be\r
+ * CRYPT_DES_MODE_ECB or CRYPT_DES_MODE_CBC. If not explictly set, CRYPT_DES_MODE_CBC will be used.\r
+ *\r
+ * @param optional Integer $mode\r
+ * @return Crypt_DES\r
+ * @access public\r
+ */\r
+ function Crypt_DES($mode = CRYPT_DES_MODE_CBC)\r
+ {\r
+ if ( !defined('CRYPT_DES_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('mcrypt') && in_array('des', mcrypt_list_algorithms()):\r
+ define('CRYPT_DES_MODE', CRYPT_DES_MODE_MCRYPT);\r
+ break;\r
+ default:\r
+ define('CRYPT_DES_MODE', CRYPT_DES_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ switch ( CRYPT_DES_MODE ) {\r
+ case CRYPT_DES_MODE_MCRYPT:\r
+ switch ($mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_ECB;\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ $this->mode = 'ctr';\r
+ //$this->mode = in_array('ctr', mcrypt_list_modes()) ? 'ctr' : CRYPT_DES_MODE_CTR;\r
+ break;\r
+ case CRYPT_DES_MODE_CFB:\r
+ $this->mode = 'ncfb';\r
+ $this->ecb = mcrypt_module_open(MCRYPT_DES, '', MCRYPT_MODE_ECB, '');\r
+ break;\r
+ case CRYPT_DES_MODE_OFB:\r
+ $this->mode = MCRYPT_MODE_NOFB;\r
+ break;\r
+ case CRYPT_DES_MODE_CBC:\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_CBC;\r
+ }\r
+ $this->enmcrypt = mcrypt_module_open(MCRYPT_DES, '', $this->mode, '');\r
+ $this->demcrypt = mcrypt_module_open(MCRYPT_DES, '', $this->mode, '');\r
+\r
+ break;\r
+ default:\r
+ switch ($mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ case CRYPT_DES_MODE_CBC:\r
+ $this->paddable = true;\r
+ $this->mode = $mode;\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ case CRYPT_DES_MODE_CFB:\r
+ case CRYPT_DES_MODE_OFB:\r
+ $this->mode = $mode;\r
+ break;\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = CRYPT_DES_MODE_CBC;\r
+ }\r
+ if (function_exists('create_function') && is_callable('create_function')) {\r
+ $this->inline_crypt_setup();\r
+ $this->use_inline_crypt = true;\r
+ }\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Sets the key.\r
+ *\r
+ * Keys can be of any length. DES, itself, uses 64-bit keys (eg. strlen($key) == 8), however, we\r
+ * only use the first eight, if $key has more then eight characters in it, and pad $key with the\r
+ * null byte if it is less then eight characters long.\r
+ *\r
+ * DES also requires that every eighth bit be a parity bit, however, we'll ignore that.\r
+ *\r
+ * If the key is not explicitly set, it'll be assumed to be all zero's.\r
+ *\r
+ * @access public\r
+ * @param String $key\r
+ */\r
+ function setKey($key)\r
+ {\r
+ $this->keys = ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) ? str_pad(substr($key, 0, 8), 8, chr(0)) : $this->_prepareKey($key);\r
+ $this->enchanged = true;\r
+ $this->dechanged = true;\r
+ }\r
+\r
+ /**\r
+ * Sets the password.\r
+ *\r
+ * Depending on what $method is set to, setPassword()'s (optional) parameters are as follows:\r
+ * {@link http://en.wikipedia.org/wiki/PBKDF2 pbkdf2}:\r
+ * $hash, $salt, $count\r
+ *\r
+ * @param String $password\r
+ * @param optional String $method\r
+ * @access public\r
+ */\r
+ function setPassword($password, $method = 'pbkdf2')\r
+ {\r
+ $key = '';\r
+\r
+ switch ($method) {\r
+ default: // 'pbkdf2'\r
+ list(, , $hash, $salt, $count) = func_get_args();\r
+ if (!isset($hash)) {\r
+ $hash = 'sha1';\r
+ }\r
+ // WPA and WPA2 use the SSID as the salt\r
+ if (!isset($salt)) {\r
+ $salt = 'phpseclib/salt';\r
+ }\r
+ // RFC2898#section-4.2 uses 1,000 iterations by default\r
+ // WPA and WPA2 use 4,096.\r
+ if (!isset($count)) {\r
+ $count = 1000;\r
+ }\r
+\r
+ if (!class_exists('Crypt_Hash')) {\r
+ require_once('Crypt/Hash.php');\r
+ }\r
+\r
+ $i = 1;\r
+ while (strlen($key) < 8) { // $dkLen == 8\r
+ //$dk.= $this->_pbkdf($password, $salt, $count, $i++);\r
+ $hmac = new Crypt_Hash();\r
+ $hmac->setHash($hash);\r
+ $hmac->setKey($password);\r
+ $f = $u = $hmac->hash($salt . pack('N', $i++));\r
+ for ($j = 2; $j <= $count; $j++) {\r
+ $u = $hmac->hash($u);\r
+ $f^= $u;\r
+ }\r
+ $key.= $f;\r
+ }\r
+ }\r
+\r
+ $this->setKey($key);\r
+ }\r
+\r
+ /**\r
+ * Sets the initialization vector. (optional)\r
+ *\r
+ * SetIV is not required when CRYPT_DES_MODE_ECB is being used. If not explictly set, it'll be assumed\r
+ * to be all zero's.\r
+ *\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function setIV($iv)\r
+ {\r
+ $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($iv, 0, 8), 8, chr(0));\r
+ $this->enchanged = true;\r
+ $this->dechanged = true;\r
+ }\r
+\r
+ /**\r
+ * Generate CTR XOR encryption key\r
+ *\r
+ * Encrypt the output of this and XOR it against the ciphertext / plaintext to get the\r
+ * plaintext / ciphertext in CTR mode.\r
+ *\r
+ * @see Crypt_DES::decrypt()\r
+ * @see Crypt_DES::encrypt()\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function _generate_xor(&$iv)\r
+ {\r
+ $xor = $iv;\r
+ for ($j = 4; $j <= 8; $j+=4) {\r
+ $temp = substr($iv, -$j, 4);\r
+ switch ($temp) {\r
+ case "\xFF\xFF\xFF\xFF":\r
+ $iv = substr_replace($iv, "\x00\x00\x00\x00", -$j, 4);\r
+ break;\r
+ case "\x7F\xFF\xFF\xFF":\r
+ $iv = substr_replace($iv, "\x80\x00\x00\x00", -$j, 4);\r
+ break 2;\r
+ default:\r
+ extract(unpack('Ncount', $temp));\r
+ $iv = substr_replace($iv, pack('N', $count + 1), -$j, 4);\r
+ break 2;\r
+ }\r
+ }\r
+\r
+ return $xor;\r
+ }\r
+\r
+ /**\r
+ * Encrypts a message.\r
+ *\r
+ * $plaintext will be padded with up to 8 additional bytes. Other DES implementations may or may not pad in the\r
+ * same manner. Other common approaches to padding and the reasons why it's necessary are discussed in the following\r
+ * URL:\r
+ *\r
+ * {@link http://www.di-mgt.com.au/cryptopad.html http://www.di-mgt.com.au/cryptopad.html}\r
+ *\r
+ * An alternative to padding is to, separately, send the length of the file. This is what SSH, in fact, does.\r
+ * strlen($plaintext) will still need to be a multiple of 8, however, arbitrary values can be added to make it that\r
+ * length.\r
+ *\r
+ * @see Crypt_DES::decrypt()\r
+ * @access public\r
+ * @param String $plaintext\r
+ */\r
+ function encrypt($plaintext)\r
+ {\r
+ if ($this->paddable) {\r
+ $plaintext = $this->_pad($plaintext);\r
+ }\r
+\r
+ if ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) {\r
+ if ($this->enchanged) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->keys, $this->encryptIV);\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->keys, "\0\0\0\0\0\0\0\0");\r
+ }\r
+ $this->enchanged = false;\r
+ }\r
+\r
+ if ($this->mode != 'ncfb' || !$this->continuousBuffer) {\r
+ $ciphertext = mcrypt_generic($this->enmcrypt, $plaintext);\r
+ } else {\r
+ $iv = &$this->encryptIV;\r
+ $pos = &$this->enbuffer['pos'];\r
+ $len = strlen($plaintext);\r
+ $ciphertext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 8 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $plaintext;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ $this->enbuffer['enmcrypt_init'] = true;\r
+ }\r
+ if ($len >= 8) {\r
+ if ($this->enbuffer['enmcrypt_init'] === false || $len > 600) {\r
+ if ($this->enbuffer['enmcrypt_init'] === true) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->keys, $iv);\r
+ $this->enbuffer['enmcrypt_init'] = false;\r
+ }\r
+ $ciphertext.= mcrypt_generic($this->enmcrypt, substr($plaintext, $i, $len - $len % 8));\r
+ $iv = substr($ciphertext, -8);\r
+ $len%= 8;\r
+ } else {\r
+ while ($len >= 8) {\r
+ $iv = mcrypt_generic($this->ecb, $iv) ^ substr($plaintext, $i, 8);\r
+ $ciphertext.= $iv;\r
+ $len-= 8;\r
+ $i+= 8;\r
+ }\r
+ }\r
+ } \r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $block = $iv ^ substr($plaintext, -$len);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ }\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->keys, $this->encryptIV);\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ if (!is_array($this->keys)) {\r
+ $this->keys = $this->_prepareKey("\0\0\0\0\0\0\0\0");\r
+ }\r
+\r
+ if ($this->use_inline_crypt) {\r
+ $inline = $this->inline_crypt;\r
+ return $inline('encrypt', $this, $plaintext);\r
+ }\r
+\r
+ $buffer = &$this->enbuffer;\r
+ $continuousBuffer = $this->continuousBuffer;\r
+ $ciphertext = '';\r
+ switch ($this->mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $ciphertext.= $this->_processBlock(substr($plaintext, $i, 8), CRYPT_DES_ENCRYPT);\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CBC:\r
+ $xor = $this->encryptIV;\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ $block = $this->_processBlock($block ^ $xor, CRYPT_DES_ENCRYPT);\r
+ $xor = $block;\r
+ $ciphertext.= $block;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ $xor = $this->encryptIV;\r
+ if (strlen($buffer['encrypted'])) {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ if (strlen($block) > strlen($buffer['encrypted'])) {\r
+ $buffer['encrypted'].= $this->_processBlock($this->_generate_xor($xor), CRYPT_DES_ENCRYPT);\r
+ }\r
+ $key = $this->_string_shift($buffer['encrypted']);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ $key = $this->_processBlock($this->_generate_xor($xor), CRYPT_DES_ENCRYPT);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ if ($start = strlen($plaintext) & 7) {\r
+ $buffer['encrypted'] = substr($key, $start) . $buffer['encrypted'];\r
+ }\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CFB:\r
+ if ($this->continuousBuffer) {\r
+ $iv = &$this->encryptIV;\r
+ $pos = &$buffer['pos'];\r
+ } else {\r
+ $iv = $this->encryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($plaintext);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 8 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $plaintext;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ }\r
+ while ($len >= 8) {\r
+ $iv = $this->_processBlock($iv, CRYPT_DES_ENCRYPT) ^ substr($plaintext, $i, 8);\r
+ $ciphertext.= $iv;\r
+ $len-= 8;\r
+ $i+= 8;\r
+ }\r
+ if ($len) {\r
+ $iv = $this->_processBlock($iv, CRYPT_DES_ENCRYPT);\r
+ $block = $iv ^ substr($plaintext, $i);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ case CRYPT_DES_MODE_OFB:\r
+ $xor = $this->encryptIV;\r
+ if (strlen($buffer['xor'])) {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ if (strlen($block) > strlen($buffer['xor'])) {\r
+ $xor = $this->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $buffer['xor'].= $xor;\r
+ }\r
+ $key = $this->_string_shift($buffer['xor']);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $xor = $this->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $ciphertext.= substr($plaintext, $i, 8) ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ if ($start = strlen($plaintext) & 7) {\r
+ $buffer['xor'] = substr($key, $start) . $buffer['xor'];\r
+ }\r
+ }\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ /**\r
+ * Decrypts a message.\r
+ *\r
+ * If strlen($ciphertext) is not a multiple of 8, null bytes will be added to the end of the string until it is.\r
+ *\r
+ * @see Crypt_DES::encrypt()\r
+ * @access public\r
+ * @param String $ciphertext\r
+ */\r
+ function decrypt($ciphertext)\r
+ {\r
+ if ($this->paddable) {\r
+ // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :\r
+ // "The data is padded with "\0" to make sure the length of the data is n * blocksize."\r
+ $ciphertext = str_pad($ciphertext, (strlen($ciphertext) + 7) & 0xFFFFFFF8, chr(0));\r
+ }\r
+\r
+ if ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) {\r
+ if ($this->dechanged) {\r
+ mcrypt_generic_init($this->demcrypt, $this->keys, $this->decryptIV);\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->keys, "\0\0\0\0\0\0\0\0");\r
+ }\r
+ $this->dechanged = false;\r
+ }\r
+\r
+ if ($this->mode != 'ncfb' || !$this->continuousBuffer) {\r
+ $plaintext = mdecrypt_generic($this->demcrypt, $ciphertext);\r
+ } else {\r
+ $iv = &$this->decryptIV;\r
+ $pos = &$this->debuffer['pos'];\r
+ $len = strlen($ciphertext);\r
+ $plaintext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 8 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $ciphertext;\r
+ $iv = substr_replace($iv, substr($ciphertext, 0, $i), $orig_pos, $i);\r
+ }\r
+ if ($len >= 8) {\r
+ $cb = substr($ciphertext, $i, $len - $len % 8);\r
+ $plaintext.= mcrypt_generic($this->ecb, $iv . $cb) ^ $cb;\r
+ $iv = substr($cb, -8);\r
+ $len%= 8;\r
+ }\r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $plaintext.= $iv ^ substr($ciphertext, -$len);\r
+ $iv = substr_replace($iv, substr($ciphertext, -$len), 0, $len);\r
+ $pos = $len;\r
+ }\r
+ return $plaintext;\r
+ }\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->demcrypt, $this->keys, $this->decryptIV);\r
+ }\r
+\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ if (!is_array($this->keys)) {\r
+ $this->keys = $this->_prepareKey("\0\0\0\0\0\0\0\0");\r
+ }\r
+\r
+ if ($this->use_inline_crypt) {\r
+ $inline = $this->inline_crypt;\r
+ return $inline('decrypt', $this, $ciphertext);\r
+ }\r
+\r
+ $buffer = &$this->debuffer;\r
+ $continuousBuffer = $this->continuousBuffer;\r
+ $plaintext = '';\r
+ switch ($this->mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $plaintext.= $this->_processBlock(substr($ciphertext, $i, 8), CRYPT_DES_DECRYPT);\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CBC:\r
+ $xor = $this->decryptIV;\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ $plaintext.= $this->_processBlock($block, CRYPT_DES_DECRYPT) ^ $xor;\r
+ $xor = $block;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ $xor = $this->decryptIV;\r
+ if (strlen($buffer['ciphertext'])) {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ if (strlen($block) > strlen($buffer['ciphertext'])) {\r
+ $buffer['ciphertext'].= $this->_processBlock($this->_generate_xor($xor), CRYPT_DES_ENCRYPT);\r
+ }\r
+ $key = $this->_string_shift($buffer['ciphertext']);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ $key = $this->_processBlock($this->_generate_xor($xor), CRYPT_DES_ENCRYPT);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ if ($start = strlen($ciphertext) % 8) {\r
+ $buffer['ciphertext'] = substr($key, $start) . $buffer['ciphertext'];\r
+ }\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CFB:\r
+ if ($this->continuousBuffer) {\r
+ $iv = &$this->decryptIV;\r
+ $pos = &$buffer['pos'];\r
+ } else {\r
+ $iv = $this->decryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($ciphertext);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 8 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $ciphertext;\r
+ $iv = substr_replace($iv, substr($ciphertext, 0, $i), $orig_pos, $i);\r
+ }\r
+ while ($len >= 8) {\r
+ $iv = $this->_processBlock($iv, CRYPT_DES_ENCRYPT);\r
+ $cb = substr($ciphertext, $i, 8);\r
+ $plaintext.= $iv ^ $cb;\r
+ $iv = $cb;\r
+ $len-= 8;\r
+ $i+= 8;\r
+ }\r
+ if ($len) {\r
+ $iv = $this->_processBlock($iv, CRYPT_DES_ENCRYPT);\r
+ $plaintext.= $iv ^ substr($ciphertext, $i);\r
+ $iv = substr_replace($iv, substr($ciphertext, $i), 0, $len);\r
+ $pos = $len;\r
+ }\r
+ return $plaintext;\r
+ case CRYPT_DES_MODE_OFB:\r
+ $xor = $this->decryptIV;\r
+ if (strlen($buffer['xor'])) {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ if (strlen($block) > strlen($buffer['xor'])) {\r
+ $xor = $this->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $buffer['xor'].= $xor;\r
+ }\r
+ $key = $this->_string_shift($buffer['xor']);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $xor = $this->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $plaintext.= substr($ciphertext, $i, 8) ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ if ($start = strlen($ciphertext) % 8) {\r
+ $buffer['xor'] = substr($key, $start) . $buffer['xor'];\r
+ }\r
+ }\r
+ }\r
+\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive "packets" as if they are a continuous buffer.\r
+ *\r
+ * Say you have a 16-byte plaintext $plaintext. Using the default behavior, the two following code snippets\r
+ * will yield different outputs:\r
+ *\r
+ * <code>\r
+ * echo $des->encrypt(substr($plaintext, 0, 8));\r
+ * echo $des->encrypt(substr($plaintext, 8, 8));\r
+ * </code>\r
+ * <code>\r
+ * echo $des->encrypt($plaintext);\r
+ * </code>\r
+ *\r
+ * The solution is to enable the continuous buffer. Although this will resolve the above discrepancy, it creates\r
+ * another, as demonstrated with the following:\r
+ *\r
+ * <code>\r
+ * $des->encrypt(substr($plaintext, 0, 8));\r
+ * echo $des->decrypt($des->encrypt(substr($plaintext, 8, 8)));\r
+ * </code>\r
+ * <code>\r
+ * echo $des->decrypt($des->encrypt(substr($plaintext, 8, 8)));\r
+ * </code>\r
+ *\r
+ * With the continuous buffer disabled, these would yield the same output. With it enabled, they yield different\r
+ * outputs. The reason is due to the fact that the initialization vector's change after every encryption /\r
+ * decryption round when the continuous buffer is enabled. When it's disabled, they remain constant.\r
+ *\r
+ * Put another way, when the continuous buffer is enabled, the state of the Crypt_DES() object changes after each\r
+ * encryption / decryption round, whereas otherwise, it'd remain constant. For this reason, it's recommended that\r
+ * continuous buffers not be used. They do offer better security and are, in fact, sometimes required (SSH uses them),\r
+ * however, they are also less intuitive and more likely to cause you problems.\r
+ *\r
+ * @see Crypt_DES::disableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function enableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = true;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive packets as if they are a discontinuous buffer.\r
+ *\r
+ * The default behavior.\r
+ *\r
+ * @see Crypt_DES::enableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function disableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = false;\r
+ $this->encryptIV = $this->iv;\r
+ $this->decryptIV = $this->iv;\r
+ $this->enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0, 'enmcrypt_init' => true);\r
+ $this->debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0, 'demcrypt_init' => true);\r
+\r
+ if (CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->keys, $this->iv);\r
+ mcrypt_generic_init($this->demcrypt, $this->keys, $this->iv);\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Pad "packets".\r
+ *\r
+ * DES works by encrypting eight bytes at a time. If you ever need to encrypt or decrypt something that's not\r
+ * a multiple of eight, it becomes necessary to pad the input so that it's length is a multiple of eight.\r
+ *\r
+ * Padding is enabled by default. Sometimes, however, it is undesirable to pad strings. Such is the case in SSH1,\r
+ * where "packets" are padded with random bytes before being encrypted. Unpad these packets and you risk stripping\r
+ * away characters that shouldn't be stripped away. (SSH knows how many bytes are added because the length is\r
+ * transmitted separately)\r
+ *\r
+ * @see Crypt_DES::disablePadding()\r
+ * @access public\r
+ */\r
+ function enablePadding()\r
+ {\r
+ $this->padding = true;\r
+ }\r
+\r
+ /**\r
+ * Do not pad packets.\r
+ *\r
+ * @see Crypt_DES::enablePadding()\r
+ * @access public\r
+ */\r
+ function disablePadding()\r
+ {\r
+ $this->padding = false;\r
+ }\r
+\r
+ /**\r
+ * Pads a string\r
+ *\r
+ * Pads a string using the RSA PKCS padding standards so that its length is a multiple of the blocksize (8).\r
+ * 8 - (strlen($text) & 7) bytes are added, each of which is equal to chr(8 - (strlen($text) & 7)\r
+ *\r
+ * If padding is disabled and $text is not a multiple of the blocksize, the string will be padded regardless\r
+ * and padding will, hence forth, be enabled.\r
+ *\r
+ * @see Crypt_DES::_unpad()\r
+ * @access private\r
+ */\r
+ function _pad($text)\r
+ {\r
+ $length = strlen($text);\r
+\r
+ if (!$this->padding) {\r
+ if (($length & 7) == 0) {\r
+ return $text;\r
+ } else {\r
+ user_error("The plaintext's length ($length) is not a multiple of the block size (8)");\r
+ $this->padding = true;\r
+ }\r
+ }\r
+\r
+ $pad = 8 - ($length & 7);\r
+ return str_pad($text, $length + $pad, chr($pad));\r
+ }\r
+\r
+ /**\r
+ * Unpads a string\r
+ *\r
+ * If padding is enabled and the reported padding length is invalid the encryption key will be assumed to be wrong\r
+ * and false will be returned.\r
+ *\r
+ * @see Crypt_DES::_pad()\r
+ * @access private\r
+ */\r
+ function _unpad($text)\r
+ {\r
+ if (!$this->padding) {\r
+ return $text;\r
+ }\r
+\r
+ $length = ord($text[strlen($text) - 1]);\r
+\r
+ if (!$length || $length > 8) {\r
+ return false;\r
+ }\r
+\r
+ return substr($text, 0, -$length);\r
+ }\r
+\r
+ /**\r
+ * Encrypts or decrypts a 64-bit block\r
+ *\r
+ * $mode should be either CRYPT_DES_ENCRYPT or CRYPT_DES_DECRYPT. See\r
+ * {@link http://en.wikipedia.org/wiki/Image:Feistel.png Feistel.png} to get a general\r
+ * idea of what this function does.\r
+ *\r
+ * @access private\r
+ * @param String $block\r
+ * @param Integer $mode\r
+ * @return String\r
+ */\r
+ function _processBlock($block, $mode)\r
+ {\r
+ $shuffle = $this->shuffle;\r
+ $invipmap = $this->invipmap;\r
+ $ipmap = $this->ipmap;\r
+ $sbox1 = $this->sbox1;\r
+ $sbox2 = $this->sbox2;\r
+ $sbox3 = $this->sbox3;\r
+ $sbox4 = $this->sbox4;\r
+ $sbox5 = $this->sbox5;\r
+ $sbox6 = $this->sbox6;\r
+ $sbox7 = $this->sbox7;\r
+ $sbox8 = $this->sbox8;\r
+ $keys = $this->keys[$mode];\r
+\r
+ // Do the initial IP permutation.\r
+ $t = unpack('Nl/Nr', $block);\r
+ list($l, $r) = array($t['l'], $t['r']);\r
+ $block = ($shuffle[$ipmap[$r & 0xFF]] & "\x80\x80\x80\x80\x80\x80\x80\x80") |\r
+ ($shuffle[$ipmap[($r >> 8) & 0xFF]] & "\x40\x40\x40\x40\x40\x40\x40\x40") |\r
+ ($shuffle[$ipmap[($r >> 16) & 0xFF]] & "\x20\x20\x20\x20\x20\x20\x20\x20") |\r
+ ($shuffle[$ipmap[($r >> 24) & 0xFF]] & "\x10\x10\x10\x10\x10\x10\x10\x10") |\r
+ ($shuffle[$ipmap[$l & 0xFF]] & "\x08\x08\x08\x08\x08\x08\x08\x08") |\r
+ ($shuffle[$ipmap[($l >> 8) & 0xFF]] & "\x04\x04\x04\x04\x04\x04\x04\x04") |\r
+ ($shuffle[$ipmap[($l >> 16) & 0xFF]] & "\x02\x02\x02\x02\x02\x02\x02\x02") |\r
+ ($shuffle[$ipmap[($l >> 24) & 0xFF]] & "\x01\x01\x01\x01\x01\x01\x01\x01");\r
+\r
+ // Extract L0 and R0.\r
+ $t = unpack('Nl/Nr', $block);\r
+ list($l, $r) = array($t['l'], $t['r']);\r
+\r
+ // Perform the 16 steps.\r
+ for ($i = 0; $i < 16; $i++) {\r
+ // start of "the Feistel (F) function" - see the following URL:\r
+ // http://en.wikipedia.org/wiki/Image:Data_Encryption_Standard_InfoBox_Diagram.png\r
+ // Merge key schedule.\r
+ $b1 = (($r >> 3) & 0x1FFFFFFF) ^ ($r << 29) ^ $keys[$i][0];\r
+ $b2 = (($r >> 31) & 0x00000001) ^ ($r << 1) ^ $keys[$i][1];\r
+\r
+ // S-box indexing.\r
+ $t = $sbox1[($b1 >> 24) & 0x3F] ^ $sbox2[($b2 >> 24) & 0x3F] ^\r
+ $sbox3[($b1 >> 16) & 0x3F] ^ $sbox4[($b2 >> 16) & 0x3F] ^\r
+ $sbox5[($b1 >> 8) & 0x3F] ^ $sbox6[($b2 >> 8) & 0x3F] ^\r
+ $sbox7[$b1 & 0x3F] ^ $sbox8[$b2 & 0x3F] ^ $l;\r
+ // end of "the Feistel (F) function"\r
+\r
+ $l = $r;\r
+ $r = $t;\r
+ }\r
+\r
+ // Perform the inverse IP permutation.\r
+ return ($shuffle[$invipmap[($l >> 24) & 0xFF]] & "\x80\x80\x80\x80\x80\x80\x80\x80") |\r
+ ($shuffle[$invipmap[($r >> 24) & 0xFF]] & "\x40\x40\x40\x40\x40\x40\x40\x40") |\r
+ ($shuffle[$invipmap[($l >> 16) & 0xFF]] & "\x20\x20\x20\x20\x20\x20\x20\x20") |\r
+ ($shuffle[$invipmap[($r >> 16) & 0xFF]] & "\x10\x10\x10\x10\x10\x10\x10\x10") |\r
+ ($shuffle[$invipmap[($l >> 8) & 0xFF]] & "\x08\x08\x08\x08\x08\x08\x08\x08") |\r
+ ($shuffle[$invipmap[($r >> 8) & 0xFF]] & "\x04\x04\x04\x04\x04\x04\x04\x04") |\r
+ ($shuffle[$invipmap[$l & 0xFF]] & "\x02\x02\x02\x02\x02\x02\x02\x02") |\r
+ ($shuffle[$invipmap[$r & 0xFF]] & "\x01\x01\x01\x01\x01\x01\x01\x01");\r
+ }\r
+\r
+ /**\r
+ * Creates the key schedule.\r
+ *\r
+ * @access private\r
+ * @param String $key\r
+ * @return Array\r
+ */\r
+ function _prepareKey($key)\r
+ {\r
+ static $shifts = array( // number of key bits shifted per round\r
+ 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1\r
+ );\r
+\r
+ static $pc1map = array(\r
+ 0x00, 0x00, 0x08, 0x08, 0x04, 0x04, 0x0C, 0x0C,\r
+ 0x02, 0x02, 0x0A, 0x0A, 0x06, 0x06, 0x0E, 0x0E,\r
+ 0x10, 0x10, 0x18, 0x18, 0x14, 0x14, 0x1C, 0x1C,\r
+ 0x12, 0x12, 0x1A, 0x1A, 0x16, 0x16, 0x1E, 0x1E,\r
+ 0x20, 0x20, 0x28, 0x28, 0x24, 0x24, 0x2C, 0x2C,\r
+ 0x22, 0x22, 0x2A, 0x2A, 0x26, 0x26, 0x2E, 0x2E,\r
+ 0x30, 0x30, 0x38, 0x38, 0x34, 0x34, 0x3C, 0x3C,\r
+ 0x32, 0x32, 0x3A, 0x3A, 0x36, 0x36, 0x3E, 0x3E,\r
+ 0x40, 0x40, 0x48, 0x48, 0x44, 0x44, 0x4C, 0x4C,\r
+ 0x42, 0x42, 0x4A, 0x4A, 0x46, 0x46, 0x4E, 0x4E,\r
+ 0x50, 0x50, 0x58, 0x58, 0x54, 0x54, 0x5C, 0x5C,\r
+ 0x52, 0x52, 0x5A, 0x5A, 0x56, 0x56, 0x5E, 0x5E,\r
+ 0x60, 0x60, 0x68, 0x68, 0x64, 0x64, 0x6C, 0x6C,\r
+ 0x62, 0x62, 0x6A, 0x6A, 0x66, 0x66, 0x6E, 0x6E,\r
+ 0x70, 0x70, 0x78, 0x78, 0x74, 0x74, 0x7C, 0x7C,\r
+ 0x72, 0x72, 0x7A, 0x7A, 0x76, 0x76, 0x7E, 0x7E,\r
+ 0x80, 0x80, 0x88, 0x88, 0x84, 0x84, 0x8C, 0x8C,\r
+ 0x82, 0x82, 0x8A, 0x8A, 0x86, 0x86, 0x8E, 0x8E,\r
+ 0x90, 0x90, 0x98, 0x98, 0x94, 0x94, 0x9C, 0x9C,\r
+ 0x92, 0x92, 0x9A, 0x9A, 0x96, 0x96, 0x9E, 0x9E,\r
+ 0xA0, 0xA0, 0xA8, 0xA8, 0xA4, 0xA4, 0xAC, 0xAC,\r
+ 0xA2, 0xA2, 0xAA, 0xAA, 0xA6, 0xA6, 0xAE, 0xAE,\r
+ 0xB0, 0xB0, 0xB8, 0xB8, 0xB4, 0xB4, 0xBC, 0xBC,\r
+ 0xB2, 0xB2, 0xBA, 0xBA, 0xB6, 0xB6, 0xBE, 0xBE,\r
+ 0xC0, 0xC0, 0xC8, 0xC8, 0xC4, 0xC4, 0xCC, 0xCC,\r
+ 0xC2, 0xC2, 0xCA, 0xCA, 0xC6, 0xC6, 0xCE, 0xCE,\r
+ 0xD0, 0xD0, 0xD8, 0xD8, 0xD4, 0xD4, 0xDC, 0xDC,\r
+ 0xD2, 0xD2, 0xDA, 0xDA, 0xD6, 0xD6, 0xDE, 0xDE,\r
+ 0xE0, 0xE0, 0xE8, 0xE8, 0xE4, 0xE4, 0xEC, 0xEC,\r
+ 0xE2, 0xE2, 0xEA, 0xEA, 0xE6, 0xE6, 0xEE, 0xEE,\r
+ 0xF0, 0xF0, 0xF8, 0xF8, 0xF4, 0xF4, 0xFC, 0xFC,\r
+ 0xF2, 0xF2, 0xFA, 0xFA, 0xF6, 0xF6, 0xFE, 0xFE\r
+ );\r
+\r
+ // Mapping tables for the PC-2 transformation.\r
+ static $pc2mapc1 = array(\r
+ 0x00000000, 0x00000400, 0x00200000, 0x00200400,\r
+ 0x00000001, 0x00000401, 0x00200001, 0x00200401,\r
+ 0x02000000, 0x02000400, 0x02200000, 0x02200400,\r
+ 0x02000001, 0x02000401, 0x02200001, 0x02200401\r
+ );\r
+ static $pc2mapc2 = array(\r
+ 0x00000000, 0x00000800, 0x08000000, 0x08000800,\r
+ 0x00010000, 0x00010800, 0x08010000, 0x08010800,\r
+ 0x00000000, 0x00000800, 0x08000000, 0x08000800,\r
+ 0x00010000, 0x00010800, 0x08010000, 0x08010800,\r
+ 0x00000100, 0x00000900, 0x08000100, 0x08000900,\r
+ 0x00010100, 0x00010900, 0x08010100, 0x08010900,\r
+ 0x00000100, 0x00000900, 0x08000100, 0x08000900,\r
+ 0x00010100, 0x00010900, 0x08010100, 0x08010900,\r
+ 0x00000010, 0x00000810, 0x08000010, 0x08000810,\r
+ 0x00010010, 0x00010810, 0x08010010, 0x08010810,\r
+ 0x00000010, 0x00000810, 0x08000010, 0x08000810,\r
+ 0x00010010, 0x00010810, 0x08010010, 0x08010810,\r
+ 0x00000110, 0x00000910, 0x08000110, 0x08000910,\r
+ 0x00010110, 0x00010910, 0x08010110, 0x08010910,\r
+ 0x00000110, 0x00000910, 0x08000110, 0x08000910,\r
+ 0x00010110, 0x00010910, 0x08010110, 0x08010910,\r
+ 0x00040000, 0x00040800, 0x08040000, 0x08040800,\r
+ 0x00050000, 0x00050800, 0x08050000, 0x08050800,\r
+ 0x00040000, 0x00040800, 0x08040000, 0x08040800,\r
+ 0x00050000, 0x00050800, 0x08050000, 0x08050800,\r
+ 0x00040100, 0x00040900, 0x08040100, 0x08040900,\r
+ 0x00050100, 0x00050900, 0x08050100, 0x08050900,\r
+ 0x00040100, 0x00040900, 0x08040100, 0x08040900,\r
+ 0x00050100, 0x00050900, 0x08050100, 0x08050900,\r
+ 0x00040010, 0x00040810, 0x08040010, 0x08040810,\r
+ 0x00050010, 0x00050810, 0x08050010, 0x08050810,\r
+ 0x00040010, 0x00040810, 0x08040010, 0x08040810,\r
+ 0x00050010, 0x00050810, 0x08050010, 0x08050810,\r
+ 0x00040110, 0x00040910, 0x08040110, 0x08040910,\r
+ 0x00050110, 0x00050910, 0x08050110, 0x08050910,\r
+ 0x00040110, 0x00040910, 0x08040110, 0x08040910,\r
+ 0x00050110, 0x00050910, 0x08050110, 0x08050910,\r
+ 0x01000000, 0x01000800, 0x09000000, 0x09000800,\r
+ 0x01010000, 0x01010800, 0x09010000, 0x09010800,\r
+ 0x01000000, 0x01000800, 0x09000000, 0x09000800,\r
+ 0x01010000, 0x01010800, 0x09010000, 0x09010800,\r
+ 0x01000100, 0x01000900, 0x09000100, 0x09000900,\r
+ 0x01010100, 0x01010900, 0x09010100, 0x09010900,\r
+ 0x01000100, 0x01000900, 0x09000100, 0x09000900,\r
+ 0x01010100, 0x01010900, 0x09010100, 0x09010900,\r
+ 0x01000010, 0x01000810, 0x09000010, 0x09000810,\r
+ 0x01010010, 0x01010810, 0x09010010, 0x09010810,\r
+ 0x01000010, 0x01000810, 0x09000010, 0x09000810,\r
+ 0x01010010, 0x01010810, 0x09010010, 0x09010810,\r
+ 0x01000110, 0x01000910, 0x09000110, 0x09000910,\r
+ 0x01010110, 0x01010910, 0x09010110, 0x09010910,\r
+ 0x01000110, 0x01000910, 0x09000110, 0x09000910,\r
+ 0x01010110, 0x01010910, 0x09010110, 0x09010910,\r
+ 0x01040000, 0x01040800, 0x09040000, 0x09040800,\r
+ 0x01050000, 0x01050800, 0x09050000, 0x09050800,\r
+ 0x01040000, 0x01040800, 0x09040000, 0x09040800,\r
+ 0x01050000, 0x01050800, 0x09050000, 0x09050800,\r
+ 0x01040100, 0x01040900, 0x09040100, 0x09040900,\r
+ 0x01050100, 0x01050900, 0x09050100, 0x09050900,\r
+ 0x01040100, 0x01040900, 0x09040100, 0x09040900,\r
+ 0x01050100, 0x01050900, 0x09050100, 0x09050900,\r
+ 0x01040010, 0x01040810, 0x09040010, 0x09040810,\r
+ 0x01050010, 0x01050810, 0x09050010, 0x09050810,\r
+ 0x01040010, 0x01040810, 0x09040010, 0x09040810,\r
+ 0x01050010, 0x01050810, 0x09050010, 0x09050810,\r
+ 0x01040110, 0x01040910, 0x09040110, 0x09040910,\r
+ 0x01050110, 0x01050910, 0x09050110, 0x09050910,\r
+ 0x01040110, 0x01040910, 0x09040110, 0x09040910,\r
+ 0x01050110, 0x01050910, 0x09050110, 0x09050910\r
+ );\r
+ static $pc2mapc3 = array(\r
+ 0x00000000, 0x00000004, 0x00001000, 0x00001004,\r
+ 0x00000000, 0x00000004, 0x00001000, 0x00001004,\r
+ 0x10000000, 0x10000004, 0x10001000, 0x10001004,\r
+ 0x10000000, 0x10000004, 0x10001000, 0x10001004,\r
+ 0x00000020, 0x00000024, 0x00001020, 0x00001024,\r
+ 0x00000020, 0x00000024, 0x00001020, 0x00001024,\r
+ 0x10000020, 0x10000024, 0x10001020, 0x10001024,\r
+ 0x10000020, 0x10000024, 0x10001020, 0x10001024,\r
+ 0x00080000, 0x00080004, 0x00081000, 0x00081004,\r
+ 0x00080000, 0x00080004, 0x00081000, 0x00081004,\r
+ 0x10080000, 0x10080004, 0x10081000, 0x10081004,\r
+ 0x10080000, 0x10080004, 0x10081000, 0x10081004,\r
+ 0x00080020, 0x00080024, 0x00081020, 0x00081024,\r
+ 0x00080020, 0x00080024, 0x00081020, 0x00081024,\r
+ 0x10080020, 0x10080024, 0x10081020, 0x10081024,\r
+ 0x10080020, 0x10080024, 0x10081020, 0x10081024,\r
+ 0x20000000, 0x20000004, 0x20001000, 0x20001004,\r
+ 0x20000000, 0x20000004, 0x20001000, 0x20001004,\r
+ 0x30000000, 0x30000004, 0x30001000, 0x30001004,\r
+ 0x30000000, 0x30000004, 0x30001000, 0x30001004,\r
+ 0x20000020, 0x20000024, 0x20001020, 0x20001024,\r
+ 0x20000020, 0x20000024, 0x20001020, 0x20001024,\r
+ 0x30000020, 0x30000024, 0x30001020, 0x30001024,\r
+ 0x30000020, 0x30000024, 0x30001020, 0x30001024,\r
+ 0x20080000, 0x20080004, 0x20081000, 0x20081004,\r
+ 0x20080000, 0x20080004, 0x20081000, 0x20081004,\r
+ 0x30080000, 0x30080004, 0x30081000, 0x30081004,\r
+ 0x30080000, 0x30080004, 0x30081000, 0x30081004,\r
+ 0x20080020, 0x20080024, 0x20081020, 0x20081024,\r
+ 0x20080020, 0x20080024, 0x20081020, 0x20081024,\r
+ 0x30080020, 0x30080024, 0x30081020, 0x30081024,\r
+ 0x30080020, 0x30080024, 0x30081020, 0x30081024,\r
+ 0x00000002, 0x00000006, 0x00001002, 0x00001006,\r
+ 0x00000002, 0x00000006, 0x00001002, 0x00001006,\r
+ 0x10000002, 0x10000006, 0x10001002, 0x10001006,\r
+ 0x10000002, 0x10000006, 0x10001002, 0x10001006,\r
+ 0x00000022, 0x00000026, 0x00001022, 0x00001026,\r
+ 0x00000022, 0x00000026, 0x00001022, 0x00001026,\r
+ 0x10000022, 0x10000026, 0x10001022, 0x10001026,\r
+ 0x10000022, 0x10000026, 0x10001022, 0x10001026,\r
+ 0x00080002, 0x00080006, 0x00081002, 0x00081006,\r
+ 0x00080002, 0x00080006, 0x00081002, 0x00081006,\r
+ 0x10080002, 0x10080006, 0x10081002, 0x10081006,\r
+ 0x10080002, 0x10080006, 0x10081002, 0x10081006,\r
+ 0x00080022, 0x00080026, 0x00081022, 0x00081026,\r
+ 0x00080022, 0x00080026, 0x00081022, 0x00081026,\r
+ 0x10080022, 0x10080026, 0x10081022, 0x10081026,\r
+ 0x10080022, 0x10080026, 0x10081022, 0x10081026,\r
+ 0x20000002, 0x20000006, 0x20001002, 0x20001006,\r
+ 0x20000002, 0x20000006, 0x20001002, 0x20001006,\r
+ 0x30000002, 0x30000006, 0x30001002, 0x30001006,\r
+ 0x30000002, 0x30000006, 0x30001002, 0x30001006,\r
+ 0x20000022, 0x20000026, 0x20001022, 0x20001026,\r
+ 0x20000022, 0x20000026, 0x20001022, 0x20001026,\r
+ 0x30000022, 0x30000026, 0x30001022, 0x30001026,\r
+ 0x30000022, 0x30000026, 0x30001022, 0x30001026,\r
+ 0x20080002, 0x20080006, 0x20081002, 0x20081006,\r
+ 0x20080002, 0x20080006, 0x20081002, 0x20081006,\r
+ 0x30080002, 0x30080006, 0x30081002, 0x30081006,\r
+ 0x30080002, 0x30080006, 0x30081002, 0x30081006,\r
+ 0x20080022, 0x20080026, 0x20081022, 0x20081026,\r
+ 0x20080022, 0x20080026, 0x20081022, 0x20081026,\r
+ 0x30080022, 0x30080026, 0x30081022, 0x30081026,\r
+ 0x30080022, 0x30080026, 0x30081022, 0x30081026\r
+ );\r
+ static $pc2mapc4 = array(\r
+ 0x00000000, 0x00100000, 0x00000008, 0x00100008,\r
+ 0x00000200, 0x00100200, 0x00000208, 0x00100208,\r
+ 0x00000000, 0x00100000, 0x00000008, 0x00100008,\r
+ 0x00000200, 0x00100200, 0x00000208, 0x00100208,\r
+ 0x04000000, 0x04100000, 0x04000008, 0x04100008,\r
+ 0x04000200, 0x04100200, 0x04000208, 0x04100208,\r
+ 0x04000000, 0x04100000, 0x04000008, 0x04100008,\r
+ 0x04000200, 0x04100200, 0x04000208, 0x04100208,\r
+ 0x00002000, 0x00102000, 0x00002008, 0x00102008,\r
+ 0x00002200, 0x00102200, 0x00002208, 0x00102208,\r
+ 0x00002000, 0x00102000, 0x00002008, 0x00102008,\r
+ 0x00002200, 0x00102200, 0x00002208, 0x00102208,\r
+ 0x04002000, 0x04102000, 0x04002008, 0x04102008,\r
+ 0x04002200, 0x04102200, 0x04002208, 0x04102208,\r
+ 0x04002000, 0x04102000, 0x04002008, 0x04102008,\r
+ 0x04002200, 0x04102200, 0x04002208, 0x04102208,\r
+ 0x00000000, 0x00100000, 0x00000008, 0x00100008,\r
+ 0x00000200, 0x00100200, 0x00000208, 0x00100208,\r
+ 0x00000000, 0x00100000, 0x00000008, 0x00100008,\r
+ 0x00000200, 0x00100200, 0x00000208, 0x00100208,\r
+ 0x04000000, 0x04100000, 0x04000008, 0x04100008,\r
+ 0x04000200, 0x04100200, 0x04000208, 0x04100208,\r
+ 0x04000000, 0x04100000, 0x04000008, 0x04100008,\r
+ 0x04000200, 0x04100200, 0x04000208, 0x04100208,\r
+ 0x00002000, 0x00102000, 0x00002008, 0x00102008,\r
+ 0x00002200, 0x00102200, 0x00002208, 0x00102208,\r
+ 0x00002000, 0x00102000, 0x00002008, 0x00102008,\r
+ 0x00002200, 0x00102200, 0x00002208, 0x00102208,\r
+ 0x04002000, 0x04102000, 0x04002008, 0x04102008,\r
+ 0x04002200, 0x04102200, 0x04002208, 0x04102208,\r
+ 0x04002000, 0x04102000, 0x04002008, 0x04102008,\r
+ 0x04002200, 0x04102200, 0x04002208, 0x04102208,\r
+ 0x00020000, 0x00120000, 0x00020008, 0x00120008,\r
+ 0x00020200, 0x00120200, 0x00020208, 0x00120208,\r
+ 0x00020000, 0x00120000, 0x00020008, 0x00120008,\r
+ 0x00020200, 0x00120200, 0x00020208, 0x00120208,\r
+ 0x04020000, 0x04120000, 0x04020008, 0x04120008,\r
+ 0x04020200, 0x04120200, 0x04020208, 0x04120208,\r
+ 0x04020000, 0x04120000, 0x04020008, 0x04120008,\r
+ 0x04020200, 0x04120200, 0x04020208, 0x04120208,\r
+ 0x00022000, 0x00122000, 0x00022008, 0x00122008,\r
+ 0x00022200, 0x00122200, 0x00022208, 0x00122208,\r
+ 0x00022000, 0x00122000, 0x00022008, 0x00122008,\r
+ 0x00022200, 0x00122200, 0x00022208, 0x00122208,\r
+ 0x04022000, 0x04122000, 0x04022008, 0x04122008,\r
+ 0x04022200, 0x04122200, 0x04022208, 0x04122208,\r
+ 0x04022000, 0x04122000, 0x04022008, 0x04122008,\r
+ 0x04022200, 0x04122200, 0x04022208, 0x04122208,\r
+ 0x00020000, 0x00120000, 0x00020008, 0x00120008,\r
+ 0x00020200, 0x00120200, 0x00020208, 0x00120208,\r
+ 0x00020000, 0x00120000, 0x00020008, 0x00120008,\r
+ 0x00020200, 0x00120200, 0x00020208, 0x00120208,\r
+ 0x04020000, 0x04120000, 0x04020008, 0x04120008,\r
+ 0x04020200, 0x04120200, 0x04020208, 0x04120208,\r
+ 0x04020000, 0x04120000, 0x04020008, 0x04120008,\r
+ 0x04020200, 0x04120200, 0x04020208, 0x04120208,\r
+ 0x00022000, 0x00122000, 0x00022008, 0x00122008,\r
+ 0x00022200, 0x00122200, 0x00022208, 0x00122208,\r
+ 0x00022000, 0x00122000, 0x00022008, 0x00122008,\r
+ 0x00022200, 0x00122200, 0x00022208, 0x00122208,\r
+ 0x04022000, 0x04122000, 0x04022008, 0x04122008,\r
+ 0x04022200, 0x04122200, 0x04022208, 0x04122208,\r
+ 0x04022000, 0x04122000, 0x04022008, 0x04122008,\r
+ 0x04022200, 0x04122200, 0x04022208, 0x04122208\r
+ );\r
+ static $pc2mapd1 = array(\r
+ 0x00000000, 0x00000001, 0x08000000, 0x08000001,\r
+ 0x00200000, 0x00200001, 0x08200000, 0x08200001,\r
+ 0x00000002, 0x00000003, 0x08000002, 0x08000003,\r
+ 0x00200002, 0x00200003, 0x08200002, 0x08200003\r
+ );\r
+ static $pc2mapd2 = array(\r
+ 0x00000000, 0x00100000, 0x00000800, 0x00100800,\r
+ 0x00000000, 0x00100000, 0x00000800, 0x00100800,\r
+ 0x04000000, 0x04100000, 0x04000800, 0x04100800,\r
+ 0x04000000, 0x04100000, 0x04000800, 0x04100800,\r
+ 0x00000004, 0x00100004, 0x00000804, 0x00100804,\r
+ 0x00000004, 0x00100004, 0x00000804, 0x00100804,\r
+ 0x04000004, 0x04100004, 0x04000804, 0x04100804,\r
+ 0x04000004, 0x04100004, 0x04000804, 0x04100804,\r
+ 0x00000000, 0x00100000, 0x00000800, 0x00100800,\r
+ 0x00000000, 0x00100000, 0x00000800, 0x00100800,\r
+ 0x04000000, 0x04100000, 0x04000800, 0x04100800,\r
+ 0x04000000, 0x04100000, 0x04000800, 0x04100800,\r
+ 0x00000004, 0x00100004, 0x00000804, 0x00100804,\r
+ 0x00000004, 0x00100004, 0x00000804, 0x00100804,\r
+ 0x04000004, 0x04100004, 0x04000804, 0x04100804,\r
+ 0x04000004, 0x04100004, 0x04000804, 0x04100804,\r
+ 0x00000200, 0x00100200, 0x00000A00, 0x00100A00,\r
+ 0x00000200, 0x00100200, 0x00000A00, 0x00100A00,\r
+ 0x04000200, 0x04100200, 0x04000A00, 0x04100A00,\r
+ 0x04000200, 0x04100200, 0x04000A00, 0x04100A00,\r
+ 0x00000204, 0x00100204, 0x00000A04, 0x00100A04,\r
+ 0x00000204, 0x00100204, 0x00000A04, 0x00100A04,\r
+ 0x04000204, 0x04100204, 0x04000A04, 0x04100A04,\r
+ 0x04000204, 0x04100204, 0x04000A04, 0x04100A04,\r
+ 0x00000200, 0x00100200, 0x00000A00, 0x00100A00,\r
+ 0x00000200, 0x00100200, 0x00000A00, 0x00100A00,\r
+ 0x04000200, 0x04100200, 0x04000A00, 0x04100A00,\r
+ 0x04000200, 0x04100200, 0x04000A00, 0x04100A00,\r
+ 0x00000204, 0x00100204, 0x00000A04, 0x00100A04,\r
+ 0x00000204, 0x00100204, 0x00000A04, 0x00100A04,\r
+ 0x04000204, 0x04100204, 0x04000A04, 0x04100A04,\r
+ 0x04000204, 0x04100204, 0x04000A04, 0x04100A04,\r
+ 0x00020000, 0x00120000, 0x00020800, 0x00120800,\r
+ 0x00020000, 0x00120000, 0x00020800, 0x00120800,\r
+ 0x04020000, 0x04120000, 0x04020800, 0x04120800,\r
+ 0x04020000, 0x04120000, 0x04020800, 0x04120800,\r
+ 0x00020004, 0x00120004, 0x00020804, 0x00120804,\r
+ 0x00020004, 0x00120004, 0x00020804, 0x00120804,\r
+ 0x04020004, 0x04120004, 0x04020804, 0x04120804,\r
+ 0x04020004, 0x04120004, 0x04020804, 0x04120804,\r
+ 0x00020000, 0x00120000, 0x00020800, 0x00120800,\r
+ 0x00020000, 0x00120000, 0x00020800, 0x00120800,\r
+ 0x04020000, 0x04120000, 0x04020800, 0x04120800,\r
+ 0x04020000, 0x04120000, 0x04020800, 0x04120800,\r
+ 0x00020004, 0x00120004, 0x00020804, 0x00120804,\r
+ 0x00020004, 0x00120004, 0x00020804, 0x00120804,\r
+ 0x04020004, 0x04120004, 0x04020804, 0x04120804,\r
+ 0x04020004, 0x04120004, 0x04020804, 0x04120804,\r
+ 0x00020200, 0x00120200, 0x00020A00, 0x00120A00,\r
+ 0x00020200, 0x00120200, 0x00020A00, 0x00120A00,\r
+ 0x04020200, 0x04120200, 0x04020A00, 0x04120A00,\r
+ 0x04020200, 0x04120200, 0x04020A00, 0x04120A00,\r
+ 0x00020204, 0x00120204, 0x00020A04, 0x00120A04,\r
+ 0x00020204, 0x00120204, 0x00020A04, 0x00120A04,\r
+ 0x04020204, 0x04120204, 0x04020A04, 0x04120A04,\r
+ 0x04020204, 0x04120204, 0x04020A04, 0x04120A04,\r
+ 0x00020200, 0x00120200, 0x00020A00, 0x00120A00,\r
+ 0x00020200, 0x00120200, 0x00020A00, 0x00120A00,\r
+ 0x04020200, 0x04120200, 0x04020A00, 0x04120A00,\r
+ 0x04020200, 0x04120200, 0x04020A00, 0x04120A00,\r
+ 0x00020204, 0x00120204, 0x00020A04, 0x00120A04,\r
+ 0x00020204, 0x00120204, 0x00020A04, 0x00120A04,\r
+ 0x04020204, 0x04120204, 0x04020A04, 0x04120A04,\r
+ 0x04020204, 0x04120204, 0x04020A04, 0x04120A04\r
+ );\r
+ static $pc2mapd3 = array(\r
+ 0x00000000, 0x00010000, 0x02000000, 0x02010000,\r
+ 0x00000020, 0x00010020, 0x02000020, 0x02010020,\r
+ 0x00040000, 0x00050000, 0x02040000, 0x02050000,\r
+ 0x00040020, 0x00050020, 0x02040020, 0x02050020,\r
+ 0x00002000, 0x00012000, 0x02002000, 0x02012000,\r
+ 0x00002020, 0x00012020, 0x02002020, 0x02012020,\r
+ 0x00042000, 0x00052000, 0x02042000, 0x02052000,\r
+ 0x00042020, 0x00052020, 0x02042020, 0x02052020,\r
+ 0x00000000, 0x00010000, 0x02000000, 0x02010000,\r
+ 0x00000020, 0x00010020, 0x02000020, 0x02010020,\r
+ 0x00040000, 0x00050000, 0x02040000, 0x02050000,\r
+ 0x00040020, 0x00050020, 0x02040020, 0x02050020,\r
+ 0x00002000, 0x00012000, 0x02002000, 0x02012000,\r
+ 0x00002020, 0x00012020, 0x02002020, 0x02012020,\r
+ 0x00042000, 0x00052000, 0x02042000, 0x02052000,\r
+ 0x00042020, 0x00052020, 0x02042020, 0x02052020,\r
+ 0x00000010, 0x00010010, 0x02000010, 0x02010010,\r
+ 0x00000030, 0x00010030, 0x02000030, 0x02010030,\r
+ 0x00040010, 0x00050010, 0x02040010, 0x02050010,\r
+ 0x00040030, 0x00050030, 0x02040030, 0x02050030,\r
+ 0x00002010, 0x00012010, 0x02002010, 0x02012010,\r
+ 0x00002030, 0x00012030, 0x02002030, 0x02012030,\r
+ 0x00042010, 0x00052010, 0x02042010, 0x02052010,\r
+ 0x00042030, 0x00052030, 0x02042030, 0x02052030,\r
+ 0x00000010, 0x00010010, 0x02000010, 0x02010010,\r
+ 0x00000030, 0x00010030, 0x02000030, 0x02010030,\r
+ 0x00040010, 0x00050010, 0x02040010, 0x02050010,\r
+ 0x00040030, 0x00050030, 0x02040030, 0x02050030,\r
+ 0x00002010, 0x00012010, 0x02002010, 0x02012010,\r
+ 0x00002030, 0x00012030, 0x02002030, 0x02012030,\r
+ 0x00042010, 0x00052010, 0x02042010, 0x02052010,\r
+ 0x00042030, 0x00052030, 0x02042030, 0x02052030,\r
+ 0x20000000, 0x20010000, 0x22000000, 0x22010000,\r
+ 0x20000020, 0x20010020, 0x22000020, 0x22010020,\r
+ 0x20040000, 0x20050000, 0x22040000, 0x22050000,\r
+ 0x20040020, 0x20050020, 0x22040020, 0x22050020,\r
+ 0x20002000, 0x20012000, 0x22002000, 0x22012000,\r
+ 0x20002020, 0x20012020, 0x22002020, 0x22012020,\r
+ 0x20042000, 0x20052000, 0x22042000, 0x22052000,\r
+ 0x20042020, 0x20052020, 0x22042020, 0x22052020,\r
+ 0x20000000, 0x20010000, 0x22000000, 0x22010000,\r
+ 0x20000020, 0x20010020, 0x22000020, 0x22010020,\r
+ 0x20040000, 0x20050000, 0x22040000, 0x22050000,\r
+ 0x20040020, 0x20050020, 0x22040020, 0x22050020,\r
+ 0x20002000, 0x20012000, 0x22002000, 0x22012000,\r
+ 0x20002020, 0x20012020, 0x22002020, 0x22012020,\r
+ 0x20042000, 0x20052000, 0x22042000, 0x22052000,\r
+ 0x20042020, 0x20052020, 0x22042020, 0x22052020,\r
+ 0x20000010, 0x20010010, 0x22000010, 0x22010010,\r
+ 0x20000030, 0x20010030, 0x22000030, 0x22010030,\r
+ 0x20040010, 0x20050010, 0x22040010, 0x22050010,\r
+ 0x20040030, 0x20050030, 0x22040030, 0x22050030,\r
+ 0x20002010, 0x20012010, 0x22002010, 0x22012010,\r
+ 0x20002030, 0x20012030, 0x22002030, 0x22012030,\r
+ 0x20042010, 0x20052010, 0x22042010, 0x22052010,\r
+ 0x20042030, 0x20052030, 0x22042030, 0x22052030,\r
+ 0x20000010, 0x20010010, 0x22000010, 0x22010010,\r
+ 0x20000030, 0x20010030, 0x22000030, 0x22010030,\r
+ 0x20040010, 0x20050010, 0x22040010, 0x22050010,\r
+ 0x20040030, 0x20050030, 0x22040030, 0x22050030,\r
+ 0x20002010, 0x20012010, 0x22002010, 0x22012010,\r
+ 0x20002030, 0x20012030, 0x22002030, 0x22012030,\r
+ 0x20042010, 0x20052010, 0x22042010, 0x22052010,\r
+ 0x20042030, 0x20052030, 0x22042030, 0x22052030\r
+ );\r
+ static $pc2mapd4 = array(\r
+ 0x00000000, 0x00000400, 0x01000000, 0x01000400,\r
+ 0x00000000, 0x00000400, 0x01000000, 0x01000400,\r
+ 0x00000100, 0x00000500, 0x01000100, 0x01000500,\r
+ 0x00000100, 0x00000500, 0x01000100, 0x01000500,\r
+ 0x10000000, 0x10000400, 0x11000000, 0x11000400,\r
+ 0x10000000, 0x10000400, 0x11000000, 0x11000400,\r
+ 0x10000100, 0x10000500, 0x11000100, 0x11000500,\r
+ 0x10000100, 0x10000500, 0x11000100, 0x11000500,\r
+ 0x00080000, 0x00080400, 0x01080000, 0x01080400,\r
+ 0x00080000, 0x00080400, 0x01080000, 0x01080400,\r
+ 0x00080100, 0x00080500, 0x01080100, 0x01080500,\r
+ 0x00080100, 0x00080500, 0x01080100, 0x01080500,\r
+ 0x10080000, 0x10080400, 0x11080000, 0x11080400,\r
+ 0x10080000, 0x10080400, 0x11080000, 0x11080400,\r
+ 0x10080100, 0x10080500, 0x11080100, 0x11080500,\r
+ 0x10080100, 0x10080500, 0x11080100, 0x11080500,\r
+ 0x00000008, 0x00000408, 0x01000008, 0x01000408,\r
+ 0x00000008, 0x00000408, 0x01000008, 0x01000408,\r
+ 0x00000108, 0x00000508, 0x01000108, 0x01000508,\r
+ 0x00000108, 0x00000508, 0x01000108, 0x01000508,\r
+ 0x10000008, 0x10000408, 0x11000008, 0x11000408,\r
+ 0x10000008, 0x10000408, 0x11000008, 0x11000408,\r
+ 0x10000108, 0x10000508, 0x11000108, 0x11000508,\r
+ 0x10000108, 0x10000508, 0x11000108, 0x11000508,\r
+ 0x00080008, 0x00080408, 0x01080008, 0x01080408,\r
+ 0x00080008, 0x00080408, 0x01080008, 0x01080408,\r
+ 0x00080108, 0x00080508, 0x01080108, 0x01080508,\r
+ 0x00080108, 0x00080508, 0x01080108, 0x01080508,\r
+ 0x10080008, 0x10080408, 0x11080008, 0x11080408,\r
+ 0x10080008, 0x10080408, 0x11080008, 0x11080408,\r
+ 0x10080108, 0x10080508, 0x11080108, 0x11080508,\r
+ 0x10080108, 0x10080508, 0x11080108, 0x11080508,\r
+ 0x00001000, 0x00001400, 0x01001000, 0x01001400,\r
+ 0x00001000, 0x00001400, 0x01001000, 0x01001400,\r
+ 0x00001100, 0x00001500, 0x01001100, 0x01001500,\r
+ 0x00001100, 0x00001500, 0x01001100, 0x01001500,\r
+ 0x10001000, 0x10001400, 0x11001000, 0x11001400,\r
+ 0x10001000, 0x10001400, 0x11001000, 0x11001400,\r
+ 0x10001100, 0x10001500, 0x11001100, 0x11001500,\r
+ 0x10001100, 0x10001500, 0x11001100, 0x11001500,\r
+ 0x00081000, 0x00081400, 0x01081000, 0x01081400,\r
+ 0x00081000, 0x00081400, 0x01081000, 0x01081400,\r
+ 0x00081100, 0x00081500, 0x01081100, 0x01081500,\r
+ 0x00081100, 0x00081500, 0x01081100, 0x01081500,\r
+ 0x10081000, 0x10081400, 0x11081000, 0x11081400,\r
+ 0x10081000, 0x10081400, 0x11081000, 0x11081400,\r
+ 0x10081100, 0x10081500, 0x11081100, 0x11081500,\r
+ 0x10081100, 0x10081500, 0x11081100, 0x11081500,\r
+ 0x00001008, 0x00001408, 0x01001008, 0x01001408,\r
+ 0x00001008, 0x00001408, 0x01001008, 0x01001408,\r
+ 0x00001108, 0x00001508, 0x01001108, 0x01001508,\r
+ 0x00001108, 0x00001508, 0x01001108, 0x01001508,\r
+ 0x10001008, 0x10001408, 0x11001008, 0x11001408,\r
+ 0x10001008, 0x10001408, 0x11001008, 0x11001408,\r
+ 0x10001108, 0x10001508, 0x11001108, 0x11001508,\r
+ 0x10001108, 0x10001508, 0x11001108, 0x11001508,\r
+ 0x00081008, 0x00081408, 0x01081008, 0x01081408,\r
+ 0x00081008, 0x00081408, 0x01081008, 0x01081408,\r
+ 0x00081108, 0x00081508, 0x01081108, 0x01081508,\r
+ 0x00081108, 0x00081508, 0x01081108, 0x01081508,\r
+ 0x10081008, 0x10081408, 0x11081008, 0x11081408,\r
+ 0x10081008, 0x10081408, 0x11081008, 0x11081408,\r
+ 0x10081108, 0x10081508, 0x11081108, 0x11081508,\r
+ 0x10081108, 0x10081508, 0x11081108, 0x11081508\r
+ );\r
+\r
+ // pad the key and remove extra characters as appropriate.\r
+ $key = str_pad(substr($key, 0, 8), 8, chr(0));\r
+\r
+ // Perform the PC/1 transformation and compute C and D.\r
+ $t = unpack('Nl/Nr', $key);\r
+ list($l, $r) = array($t['l'], $t['r']);\r
+ $key = ($this->shuffle[$pc1map[$r & 0xFF]] & "\x80\x80\x80\x80\x80\x80\x80\x00") |\r
+ ($this->shuffle[$pc1map[($r >> 8) & 0xFF]] & "\x40\x40\x40\x40\x40\x40\x40\x00") |\r
+ ($this->shuffle[$pc1map[($r >> 16) & 0xFF]] & "\x20\x20\x20\x20\x20\x20\x20\x00") |\r
+ ($this->shuffle[$pc1map[($r >> 24) & 0xFF]] & "\x10\x10\x10\x10\x10\x10\x10\x00") |\r
+ ($this->shuffle[$pc1map[$l & 0xFF]] & "\x08\x08\x08\x08\x08\x08\x08\x00") |\r
+ ($this->shuffle[$pc1map[($l >> 8) & 0xFF]] & "\x04\x04\x04\x04\x04\x04\x04\x00") |\r
+ ($this->shuffle[$pc1map[($l >> 16) & 0xFF]] & "\x02\x02\x02\x02\x02\x02\x02\x00") |\r
+ ($this->shuffle[$pc1map[($l >> 24) & 0xFF]] & "\x01\x01\x01\x01\x01\x01\x01\x00");\r
+ $key = unpack('Nc/Nd', $key);\r
+ $c = ($key['c'] >> 4) & 0x0FFFFFFF;\r
+ $d = (($key['d'] >> 4) & 0x0FFFFFF0) | ($key['c'] & 0x0F);\r
+\r
+ $keys = array();\r
+ for ($i = 0; $i < 16; $i++) {\r
+ $c <<= $shifts[$i];\r
+ $c = ($c | ($c >> 28)) & 0x0FFFFFFF;\r
+ $d <<= $shifts[$i];\r
+ $d = ($d | ($d >> 28)) & 0x0FFFFFFF;\r
+\r
+ // Perform the PC-2 transformation.\r
+ $cp = $pc2mapc1[$c >> 24] | $pc2mapc2[($c >> 16) & 0xFF] |\r
+ $pc2mapc3[($c >> 8) & 0xFF] | $pc2mapc4[$c & 0xFF];\r
+ $dp = $pc2mapd1[$d >> 24] | $pc2mapd2[($d >> 16) & 0xFF] |\r
+ $pc2mapd3[($d >> 8) & 0xFF] | $pc2mapd4[$d & 0xFF];\r
+\r
+ // Reorder: odd bytes/even bytes. Push the result in key schedule.\r
+ $keys[] = array(\r
+ ($cp & 0xFF000000) | (($cp << 8) & 0x00FF0000) |\r
+ (($dp >> 16) & 0x0000FF00) | (($dp >> 8) & 0x000000FF),\r
+ (($cp << 8) & 0xFF000000) | (($cp << 16) & 0x00FF0000) |\r
+ (($dp >> 8) & 0x0000FF00) | ($dp & 0x000000FF)\r
+ );\r
+ }\r
+\r
+ $keys = array(\r
+ CRYPT_DES_ENCRYPT => $keys,\r
+ CRYPT_DES_DECRYPT => array_reverse($keys),\r
+ CRYPT_DES_ENCRYPT_1DIM => array(),\r
+ CRYPT_DES_DECRYPT_1DIM => array()\r
+ );\r
+\r
+ // Generate 1-dim arrays for inline en/decrypting\r
+ for ($i = 0; $i < 16; ++$i) {\r
+ $keys[CRYPT_DES_ENCRYPT_1DIM][] = $keys[CRYPT_DES_ENCRYPT][$i][0];\r
+ $keys[CRYPT_DES_ENCRYPT_1DIM][] = $keys[CRYPT_DES_ENCRYPT][$i][1];\r
+ $keys[CRYPT_DES_DECRYPT_1DIM][] = $keys[CRYPT_DES_DECRYPT][$i][0];\r
+ $keys[CRYPT_DES_DECRYPT_1DIM][] = $keys[CRYPT_DES_DECRYPT][$i][1];\r
+ }\r
+\r
+ return $keys;\r
+ }\r
+\r
+ /**\r
+ * String Shift\r
+ *\r
+ * Inspired by array_shift\r
+ *\r
+ * @param String $string\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _string_shift(&$string)\r
+ {\r
+ $substr = substr($string, 0, 8);\r
+ $string = substr($string, 8);\r
+ return $substr;\r
+ }\r
+\r
+ /**\r
+ * Creates performance-optimized function for de/encrypt(), storing it in $this->inline_crypt\r
+ *\r
+ * @param optional Integer $des_rounds (1 = DES[default], 3 = TribleDES)\r
+ * @access private\r
+ */\r
+ function inline_crypt_setup($des_rounds = 1)\r
+ {\r
+ $lambda_functions =& Crypt_DES::get_lambda_functions();\r
+ $block_size = 8;\r
+ $mode = $this->mode;\r
+\r
+ $code_hash = "$mode,$des_rounds";\r
+\r
+ if (!isset($lambda_functions[$code_hash])) {\r
+ // Generating encrypt code:\r
+ $ki = -1;\r
+ $init_cryptBlock = '\r
+ $shuffle = $self->shuffle;\r
+ $invipmap = $self->invipmap;\r
+ $ipmap = $self->ipmap;\r
+ $sbox1 = $self->sbox1;\r
+ $sbox2 = $self->sbox2;\r
+ $sbox3 = $self->sbox3;\r
+ $sbox4 = $self->sbox4;\r
+ $sbox5 = $self->sbox5;\r
+ $sbox6 = $self->sbox6;\r
+ $sbox7 = $self->sbox7;\r
+ $sbox8 = $self->sbox8;\r
+ ';\r
+\r
+ $_cryptBlock = '$in = unpack("N*", $in);'."\n";\r
+ // Do the initial IP permutation.\r
+ $_cryptBlock .= '\r
+ $l = $in[1];\r
+ $r = $in[2];\r
+ $in = unpack("N*",\r
+ ($shuffle[$ipmap[ $r & 0xFF]] & "\x80\x80\x80\x80\x80\x80\x80\x80") |\r
+ ($shuffle[$ipmap[($r >> 8) & 0xFF]] & "\x40\x40\x40\x40\x40\x40\x40\x40") |\r
+ ($shuffle[$ipmap[($r >> 16) & 0xFF]] & "\x20\x20\x20\x20\x20\x20\x20\x20") |\r
+ ($shuffle[$ipmap[($r >> 24) & 0xFF]] & "\x10\x10\x10\x10\x10\x10\x10\x10") |\r
+ ($shuffle[$ipmap[ $l & 0xFF]] & "\x08\x08\x08\x08\x08\x08\x08\x08") |\r
+ ($shuffle[$ipmap[($l >> 8) & 0xFF]] & "\x04\x04\x04\x04\x04\x04\x04\x04") |\r
+ ($shuffle[$ipmap[($l >> 16) & 0xFF]] & "\x02\x02\x02\x02\x02\x02\x02\x02") |\r
+ ($shuffle[$ipmap[($l >> 24) & 0xFF]] & "\x01\x01\x01\x01\x01\x01\x01\x01")\r
+ );\r
+\r
+ '.'' /* Extract L0 and R0 */ .'\r
+ $l = $in[1];\r
+ $r = $in[2];\r
+ ';\r
+\r
+ $l = 'l';\r
+ $r = 'r';\r
+ for ($des_round = 0; $des_round < $des_rounds; ++$des_round) {\r
+ // Perform the 16 steps.\r
+ // start of "the Feistel (F) function" - see the following URL:\r
+ // http://en.wikipedia.org/wiki/Image:Data_Encryption_Standard_InfoBox_Diagram.png\r
+ // Merge key schedule.\r
+ for ($i = 0; $i < 8; ++$i) {\r
+ $_cryptBlock .= '\r
+ $b1 = (($' . $r . ' >> 3) & 0x1FFFFFFF) ^ ($' . $r . ' << 29) ^ $k_'.(++$ki).';\r
+ $b2 = (($' . $r . ' >> 31) & 0x00000001) ^ ($' . $r . ' << 1) ^ $k_'.(++$ki).';\r
+ $' . $l . ' = $sbox1[($b1 >> 24) & 0x3F] ^ $sbox2[($b2 >> 24) & 0x3F] ^\r
+ $sbox3[($b1 >> 16) & 0x3F] ^ $sbox4[($b2 >> 16) & 0x3F] ^\r
+ $sbox5[($b1 >> 8) & 0x3F] ^ $sbox6[($b2 >> 8) & 0x3F] ^\r
+ $sbox7[ $b1 & 0x3F] ^ $sbox8[ $b2 & 0x3F] ^ $' . $l . ';\r
+\r
+ $b1 = (($' . $l . ' >> 3) & 0x1FFFFFFF) ^ ($' . $l . ' << 29) ^ $k_'.(++$ki).';\r
+ $b2 = (($' . $l . ' >> 31) & 0x00000001) ^ ($' . $l . ' << 1) ^ $k_'.(++$ki).';\r
+ $' . $r . ' = $sbox1[($b1 >> 24) & 0x3F] ^ $sbox2[($b2 >> 24) & 0x3F] ^\r
+ $sbox3[($b1 >> 16) & 0x3F] ^ $sbox4[($b2 >> 16) & 0x3F] ^\r
+ $sbox5[($b1 >> 8) & 0x3F] ^ $sbox6[($b2 >> 8) & 0x3F] ^\r
+ $sbox7[ $b1 & 0x3F] ^ $sbox8[ $b2 & 0x3F] ^ $' . $r . ';\r
+ ';\r
+ }\r
+\r
+ // Last step should not permute L & R.\r
+ $t = $l;\r
+ $l = $r;\r
+ $r = $t;\r
+ }\r
+\r
+ // Perform the inverse IP permutation.\r
+ $_cryptBlock .= '$in = (\r
+ ($shuffle[$invipmap[($' . $r . ' >> 24) & 0xFF]] & "\x80\x80\x80\x80\x80\x80\x80\x80") |\r
+ ($shuffle[$invipmap[($' . $l . ' >> 24) & 0xFF]] & "\x40\x40\x40\x40\x40\x40\x40\x40") |\r
+ ($shuffle[$invipmap[($' . $r . ' >> 16) & 0xFF]] & "\x20\x20\x20\x20\x20\x20\x20\x20") |\r
+ ($shuffle[$invipmap[($' . $l . ' >> 16) & 0xFF]] & "\x10\x10\x10\x10\x10\x10\x10\x10") |\r
+ ($shuffle[$invipmap[($' . $r . ' >> 8) & 0xFF]] & "\x08\x08\x08\x08\x08\x08\x08\x08") |\r
+ ($shuffle[$invipmap[($' . $l . ' >> 8) & 0xFF]] & "\x04\x04\x04\x04\x04\x04\x04\x04") |\r
+ ($shuffle[$invipmap[ $' . $r . ' & 0xFF]] & "\x02\x02\x02\x02\x02\x02\x02\x02") |\r
+ ($shuffle[$invipmap[ $' . $l . ' & 0xFF]] & "\x01\x01\x01\x01\x01\x01\x01\x01")\r
+ );\r
+ ';\r
+\r
+ // Generating mode of operation code:\r
+ switch ($mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ $encrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_ENCRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.');\r
+ '.$_cryptBlock.'\r
+ $ciphertext.= $in;\r
+ }\r
+ \r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_DECRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.');\r
+ '.$_cryptBlock.'\r
+ $plaintext.= $in;\r
+ }\r
+\r
+ return $self->_unpad($plaintext);\r
+ ';\r
+ break;\r
+ case CRYPT_DES_MODE_CBC:\r
+ $encrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_ENCRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+\r
+ $in = $self->encryptIV;\r
+\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.') ^ $in;\r
+ '.$_cryptBlock.'\r
+ $ciphertext.= $in;\r
+ }\r
+\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $in;\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_DECRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+\r
+ $iv = $self->decryptIV;\r
+\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = $block = substr($text, $i, '.$block_size.');\r
+ '.$_cryptBlock.'\r
+ $plaintext.= $in ^ $iv;\r
+ $iv = $block;\r
+ }\r
+\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $iv;\r
+ }\r
+\r
+ return $self->_unpad($plaintext);\r
+ ';\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ $encrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_ENCRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+ $xor = $self->encryptIV;\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if (strlen($buffer["encrypted"])) {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["encrypted"])) {\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_cryptBlock.'\r
+ $buffer["encrypted"].= $in;\r
+ }\r
+ $key = $self->_string_shift($buffer["encrypted"]);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_cryptBlock.'\r
+ $key = $in;\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $xor;\r
+ if ($start = $plaintext_len % '.$block_size.') {\r
+ $buffer["encrypted"] = substr($key, $start) . $buffer["encrypted"];\r
+ }\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_ENCRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+ $xor = $self->decryptIV;\r
+ $buffer = &$self->debuffer;\r
+\r
+ if (strlen($buffer["ciphertext"])) {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["ciphertext"])) {\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_cryptBlock.'\r
+ $buffer["ciphertext"].= $in;\r
+ }\r
+ $key = $self->_string_shift($buffer["ciphertext"]);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_cryptBlock.'\r
+ $key = $in;\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $xor;\r
+ if ($start = $ciphertext_len % '.$block_size.') {\r
+ $buffer["ciphertext"] = substr($key, $start) . $buffer["ciphertext"];\r
+ }\r
+ }\r
+ \r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ case CRYPT_DES_MODE_CFB:\r
+ $encrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_ENCRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $ciphertext = "";\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if ($self->continuousBuffer) {\r
+ $iv = &$self->encryptIV;\r
+ $pos = &$buffer["pos"];\r
+ } else {\r
+ $iv = $self->encryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($text);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = '.$block_size.' - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $text;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ }\r
+ while ($len >= '.$block_size.') {\r
+ $in = $iv;\r
+ '.$_cryptBlock.';\r
+ $iv = $in ^ substr($text, $i, '.$block_size.');\r
+ $ciphertext.= $iv;\r
+ $len-= '.$block_size.';\r
+ $i+= '.$block_size.';\r
+ }\r
+ if ($len) {\r
+ $in = $iv;\r
+ '.$_cryptBlock.'\r
+ $iv = $in;\r
+ $block = $iv ^ substr($text, $i);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_ENCRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $plaintext = "";\r
+ $buffer = &$self->debuffer;\r
+\r
+ if ($self->continuousBuffer) {\r
+ $iv = &$self->decryptIV;\r
+ $pos = &$buffer["pos"];\r
+ } else {\r
+ $iv = $self->decryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($text);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = '.$block_size.' - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $text;\r
+ $iv = substr_replace($iv, substr($text, 0, $i), $orig_pos, $i);\r
+ }\r
+ while ($len >= '.$block_size.') {\r
+ $in = $iv;\r
+ '.$_cryptBlock.'\r
+ $iv = $in;\r
+ $cb = substr($text, $i, '.$block_size.');\r
+ $plaintext.= $iv ^ $cb;\r
+ $iv = $cb;\r
+ $len-= '.$block_size.';\r
+ $i+= '.$block_size.';\r
+ }\r
+ if ($len) {\r
+ $in = $iv;\r
+ '.$_cryptBlock.'\r
+ $iv = $in;\r
+ $plaintext.= $iv ^ substr($text, $i);\r
+ $iv = substr_replace($iv, substr($text, $i), 0, $len);\r
+ $pos = $len;\r
+ }\r
+\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ case CRYPT_DES_MODE_OFB:\r
+ $encrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_ENCRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+ $xor = $self->encryptIV;\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if (strlen($buffer["xor"])) {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["xor"])) {\r
+ $in = $xor;\r
+ '.$_cryptBlock.'\r
+ $xor = $in;\r
+ $buffer["xor"].= $xor;\r
+ }\r
+ $key = $self->_string_shift($buffer["xor"]);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = $xor;\r
+ '.$_cryptBlock.'\r
+ $xor = $in;\r
+ $ciphertext.= substr($text, $i, '.$block_size.') ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $xor;\r
+ if ($start = $plaintext_len % '.$block_size.') {\r
+ $buffer["xor"] = substr($key, $start) . $buffer["xor"];\r
+ }\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_cryptBlock . '\r
+ extract($self->keys[CRYPT_DES_ENCRYPT_1DIM], EXTR_PREFIX_ALL, "k");\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+ $xor = $self->decryptIV;\r
+ $buffer = &$self->debuffer;\r
+\r
+ if (strlen($buffer["xor"])) {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["xor"])) {\r
+ $in = $xor;\r
+ '.$_cryptBlock.'\r
+ $xor = $in;\r
+ $buffer["xor"].= $xor;\r
+ }\r
+ $key = $self->_string_shift($buffer["xor"]);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = $xor;\r
+ '.$_cryptBlock.'\r
+ $xor = $in;\r
+ $plaintext.= substr($text, $i, '.$block_size.') ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $xor;\r
+ if ($start = $ciphertext_len % '.$block_size.') {\r
+ $buffer["xor"] = substr($key, $start) . $buffer["xor"];\r
+ }\r
+ }\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ }\r
+ $lambda_functions[$code_hash] = create_function('$action, &$self, $text', 'if ($action == "encrypt") { '.$encrypt.' } else { '.$decrypt.' }');\r
+ }\r
+ $this->inline_crypt = $lambda_functions[$code_hash];\r
+ }\r
+\r
+ /**\r
+ * Holds the lambda_functions table (classwide)\r
+ *\r
+ * @see inline_crypt_setup()\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function &get_lambda_functions()\r
+ {\r
+ static $functions = array();\r
+ return $functions;\r
+ }\r
+}\r
+\r
+// vim: ts=4:sw=4:et:\r
+// vim6: fdl=1:\r
-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Pure-PHP implementations of keyed-hash message authentication codes (HMACs) and various cryptographic hashing functions.
- *
- * Uses hash() or mhash() if available and an internal implementation, otherwise. Currently supports the following:
- *
- * md2, md5, md5-96, sha1, sha1-96, sha256, sha384, and sha512
- *
- * If {@link Crypt_Hash::setKey() setKey()} is called, {@link Crypt_Hash::hash() hash()} will return the HMAC as opposed to
- * the hash. If no valid algorithm is provided, sha1 will be used.
- *
- * PHP versions 4 and 5
- *
- * {@internal The variable names are the same as those in
- * {@link http://tools.ietf.org/html/rfc2104#section-2 RFC2104}.}}
- *
- * Here's a short example of how to use this library:
- * <code>
- * <?php
- * include('Crypt/Hash.php');
- *
- * $hash = new Crypt_Hash('sha1');
- *
- * $hash->setKey('abcdefg');
- *
- * echo base64_encode($hash->hash('abcdefg'));
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Crypt
- * @package Crypt_Hash
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMVII Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: Hash.php,v 1.6 2009/11/23 23:37:07 terrafrost Exp $
- * @link http://phpseclib.sourceforge.net
- */
-
-/**#@+
- * @access private
- * @see Crypt_Hash::Crypt_Hash()
- */
-/**
- * Toggles the internal implementation
- */
-define('CRYPT_HASH_MODE_INTERNAL', 1);
-/**
- * Toggles the mhash() implementation, which has been deprecated on PHP 5.3.0+.
- */
-define('CRYPT_HASH_MODE_MHASH', 2);
-/**
- * Toggles the hash() implementation, which works on PHP 5.1.2+.
- */
-define('CRYPT_HASH_MODE_HASH', 3);
-/**#@-*/
-
-/**
- * Pure-PHP implementations of keyed-hash message authentication codes (HMACs) and various cryptographic hashing functions.
- *
- * @author Jim Wigginton <terrafrost@php.net>
- * @version 0.1.0
- * @access public
- * @package Crypt_Hash
- */
-class Crypt_Hash {
- /**
- * Byte-length of compression blocks / key (Internal HMAC)
- *
- * @see Crypt_Hash::setAlgorithm()
- * @var Integer
- * @access private
- */
- var $b;
-
- /**
- * Byte-length of hash output (Internal HMAC)
- *
- * @see Crypt_Hash::setHash()
- * @var Integer
- * @access private
- */
- var $l = false;
-
- /**
- * Hash Algorithm
- *
- * @see Crypt_Hash::setHash()
- * @var String
- * @access private
- */
- var $hash;
-
- /**
- * Key
- *
- * @see Crypt_Hash::setKey()
- * @var String
- * @access private
- */
- var $key = '';
-
- /**
- * Outer XOR (Internal HMAC)
- *
- * @see Crypt_Hash::setKey()
- * @var String
- * @access private
- */
- var $opad;
-
- /**
- * Inner XOR (Internal HMAC)
- *
- * @see Crypt_Hash::setKey()
- * @var String
- * @access private
- */
- var $ipad;
-
- /**
- * Default Constructor.
- *
- * @param optional String $hash
- * @return Crypt_Hash
- * @access public
- */
- function Crypt_Hash($hash = 'sha1')
- {
- if ( !defined('CRYPT_HASH_MODE') ) {
- switch (true) {
- case extension_loaded('hash'):
- define('CRYPT_HASH_MODE', CRYPT_HASH_MODE_HASH);
- break;
- case extension_loaded('mhash'):
- define('CRYPT_HASH_MODE', CRYPT_HASH_MODE_MHASH);
- break;
- default:
- define('CRYPT_HASH_MODE', CRYPT_HASH_MODE_INTERNAL);
- }
- }
-
- $this->setHash($hash);
- }
-
- /**
- * Sets the key for HMACs
- *
- * Keys can be of any length.
- *
- * @access public
- * @param String $key
- */
- function setKey($key)
- {
- $this->key = $key;
- }
-
- /**
- * Sets the hash function.
- *
- * @access public
- * @param String $hash
- */
- function setHash($hash)
- {
- switch ($hash) {
- case 'md5-96':
- case 'sha1-96':
- $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':
- $mode = CRYPT_HASH_MODE_INTERNAL;
- break;
- case 'sha384':
- case 'sha512':
- $mode = CRYPT_HASH_MODE == CRYPT_HASH_MODE_MHASH ? CRYPT_HASH_MODE_INTERNAL : CRYPT_HASH_MODE;
- break;
- default:
- $mode = CRYPT_HASH_MODE;
- }
-
- switch ( $mode ) {
- case CRYPT_HASH_MODE_MHASH:
- switch ($hash) {
- case 'md5':
- case 'md5-96':
- $this->hash = MHASH_MD5;
- break;
- case 'sha256':
- $this->hash = MHASH_SHA256;
- break;
- case 'sha1':
- case 'sha1-96':
- default:
- $this->hash = MHASH_SHA1;
- }
- return;
- case CRYPT_HASH_MODE_HASH:
- switch ($hash) {
- case 'md5':
- case 'md5-96':
- $this->hash = 'md5';
- return;
- case 'sha256':
- case 'sha384':
- case 'sha512':
- $this->hash = $hash;
- return;
- case 'sha1':
- case 'sha1-96':
- default:
- $this->hash = 'sha1';
- }
- return;
- }
-
- switch ($hash) {
- case 'md2':
- $this->b = 16;
- $this->hash = array($this, '_md2');
- break;
- case 'md5':
- case 'md5-96':
- $this->b = 64;
- $this->hash = array($this, '_md5');
- break;
- case 'sha256':
- $this->b = 64;
- $this->hash = array($this, '_sha256');
- break;
- case 'sha384':
- case 'sha512':
- $this->b = 128;
- $this->hash = array($this, '_sha512');
- break;
- case 'sha1':
- case 'sha1-96':
- default:
- $this->b = 64;
- $this->hash = array($this, '_sha1');
- }
-
- $this->ipad = str_repeat(chr(0x36), $this->b);
- $this->opad = str_repeat(chr(0x5C), $this->b);
- }
-
- /**
- * Compute the HMAC.
- *
- * @access public
- * @param String $text
- * @return String
- */
- function hash($text)
- {
- $mode = is_array($this->hash) ? CRYPT_HASH_MODE_INTERNAL : CRYPT_HASH_MODE;
-
- if (!empty($this->key)) {
- switch ( $mode ) {
- case CRYPT_HASH_MODE_MHASH:
- $output = mhash($this->hash, $text, $this->key);
- break;
- case CRYPT_HASH_MODE_HASH:
- $output = hash_hmac($this->hash, $text, $this->key, true);
- break;
- case CRYPT_HASH_MODE_INTERNAL:
- /* "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."
-
- -- http://tools.ietf.org/html/rfc2104#section-2 */
- $key = strlen($this->key) > $this->b ? call_user_func($this->$hash, $this->key) : $this->key;
-
- $key = str_pad($key, $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 ( $mode ) {
- case CRYPT_HASH_MODE_MHASH:
- $output = mhash($this->hash, $text);
- break;
- case CRYPT_HASH_MODE_HASH:
- $output = hash($this->hash, $text, true);
- break;
- case CRYPT_HASH_MODE_INTERNAL:
- $output = call_user_func($this->hash, $text);
- }
- }
-
- return substr($output, 0, $this->l);
- }
-
- /**
- * Returns the hash length (in bytes)
- *
- * @access private
- * @return Integer
- */
- function getLength()
- {
- return $this->l;
- }
-
- /**
- * Wrapper for MD5
- *
- * @access private
- * @param String $text
- */
- function _md5($m)
- {
- return pack('H*', md5($m));
- }
-
- /**
- * Wrapper for SHA1
- *
- * @access private
- * @param String $text
- */
- 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 $text
- */
- 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++) {
- $c[$j] = chr($s[ord($m[$i + $j] ^ $l)]);
- $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 $text
- */
- 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++) {
- $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);
- $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 $text
- */
- function _sha512($m)
- {
- if (!class_exists('Math_BigInteger')) {
- require_once('Math/BigInteger.php');
- }
-
- 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 Math_BigInteger($init384[$i], 16);
- $init384[$i]->setPrecision(64);
- $init512[$i] = new Math_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 Math_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 Math_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)
- // (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 Integer $int
- * @param Integer $amt
- * @see _sha256()
- * @return Integer
- */
- function _rightRotate($int, $amt)
- {
- $invamt = 32 - $amt;
- $mask = (1 << $invamt) - 1;
- return (($int << $invamt) & 0xFFFFFFFF) | (($int >> $amt) & $mask);
- }
-
- /**
- * Right Shift
- *
- * @access private
- * @param Integer $int
- * @param Integer $amt
- * @see _sha256()
- * @return Integer
- */
- function _rightShift($int, $amt)
- {
- $mask = (1 << (32 - $amt)) - 1;
- return ($int >> $amt) & $mask;
- }
-
- /**
- * Not
- *
- * @access private
- * @param Integer $int
- * @see _sha256()
- * @return Integer
- */
- 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. Math_BigInteger() could be used but this should be faster.
- *
- * @param String $string
- * @param optional Integer $index
- * @return String
- * @see _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;
- }
-
- return fmod($result, $mod);
- }
-
- /**
- * String Shift
- *
- * Inspired by array_shift
- *
- * @param String $string
- * @param optional Integer $index
- * @return String
- * @access private
- */
- function _string_shift(&$string, $index = 1)
- {
- $substr = substr($string, 0, $index);
- $string = substr($string, $index);
- return $substr;
- }
-}
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP implementations of keyed-hash message authentication codes (HMACs) and various cryptographic hashing functions.\r
+ *\r
+ * Uses hash() or mhash() if available and an internal implementation, otherwise. Currently supports the following:\r
+ *\r
+ * md2, md5, md5-96, sha1, sha1-96, sha256, sha384, and sha512\r
+ *\r
+ * If {@link Crypt_Hash::setKey() setKey()} is called, {@link Crypt_Hash::hash() hash()} will return the HMAC as opposed to\r
+ * the hash. If no valid algorithm is provided, sha1 will be used.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * {@internal The variable names are the same as those in \r
+ * {@link http://tools.ietf.org/html/rfc2104#section-2 RFC2104}.}}\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/Hash.php');\r
+ *\r
+ * $hash = new Crypt_Hash('sha1');\r
+ *\r
+ * $hash->setKey('abcdefg');\r
+ *\r
+ * echo base64_encode($hash->hash('abcdefg'));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_Hash\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMVII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_Hash::Crypt_Hash()\r
+ */\r
+/**\r
+ * Toggles the internal implementation\r
+ */\r
+define('CRYPT_HASH_MODE_INTERNAL', 1);\r
+/**\r
+ * Toggles the mhash() implementation, which has been deprecated on PHP 5.3.0+.\r
+ */\r
+define('CRYPT_HASH_MODE_MHASH', 2);\r
+/**\r
+ * Toggles the hash() implementation, which works on PHP 5.1.2+.\r
+ */\r
+define('CRYPT_HASH_MODE_HASH', 3);\r
+/**#@-*/\r
+\r
+/**\r
+ * Pure-PHP implementations of keyed-hash message authentication codes (HMACs) and various cryptographic hashing functions.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @version 0.1.0\r
+ * @access public\r
+ * @package Crypt_Hash\r
+ */\r
+class Crypt_Hash {\r
+ /**\r
+ * Byte-length of compression blocks / key (Internal HMAC)\r
+ *\r
+ * @see Crypt_Hash::setAlgorithm()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $b;\r
+\r
+ /**\r
+ * Byte-length of hash output (Internal HMAC)\r
+ *\r
+ * @see Crypt_Hash::setHash()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $l = false;\r
+\r
+ /**\r
+ * Hash Algorithm\r
+ *\r
+ * @see Crypt_Hash::setHash()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $hash;\r
+\r
+ /**\r
+ * Key\r
+ *\r
+ * @see Crypt_Hash::setKey()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $key = false;\r
+\r
+ /**\r
+ * Outer XOR (Internal HMAC)\r
+ *\r
+ * @see Crypt_Hash::setKey()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $opad;\r
+\r
+ /**\r
+ * Inner XOR (Internal HMAC)\r
+ *\r
+ * @see Crypt_Hash::setKey()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $ipad;\r
+\r
+ /**\r
+ * Default Constructor.\r
+ *\r
+ * @param optional String $hash\r
+ * @return Crypt_Hash\r
+ * @access public\r
+ */\r
+ function Crypt_Hash($hash = 'sha1')\r
+ {\r
+ if ( !defined('CRYPT_HASH_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('hash'):\r
+ define('CRYPT_HASH_MODE', CRYPT_HASH_MODE_HASH);\r
+ break;\r
+ case extension_loaded('mhash'):\r
+ define('CRYPT_HASH_MODE', CRYPT_HASH_MODE_MHASH);\r
+ break;\r
+ default:\r
+ define('CRYPT_HASH_MODE', CRYPT_HASH_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ $this->setHash($hash);\r
+ }\r
+\r
+ /**\r
+ * Sets the key for HMACs\r
+ *\r
+ * Keys can be of any length.\r
+ *\r
+ * @access public\r
+ * @param optional String $key\r
+ */\r
+ function setKey($key = false)\r
+ {\r
+ $this->key = $key;\r
+ }\r
+\r
+ /**\r
+ * Sets the hash function.\r
+ *\r
+ * @access public\r
+ * @param String $hash\r
+ */\r
+ function setHash($hash)\r
+ {\r
+ $hash = strtolower($hash);\r
+ switch ($hash) {\r
+ case 'md5-96':\r
+ case 'sha1-96':\r
+ $this->l = 12; // 96 / 8 = 12\r
+ break;\r
+ case 'md2':\r
+ case 'md5':\r
+ $this->l = 16;\r
+ break;\r
+ case 'sha1':\r
+ $this->l = 20;\r
+ break;\r
+ case 'sha256':\r
+ $this->l = 32;\r
+ break;\r
+ case 'sha384':\r
+ $this->l = 48;\r
+ break;\r
+ case 'sha512':\r
+ $this->l = 64;\r
+ }\r
+\r
+ switch ($hash) {\r
+ case 'md2':\r
+ $mode = CRYPT_HASH_MODE == CRYPT_HASH_MODE_HASH && in_array('md2', hash_algos()) ?\r
+ CRYPT_HASH_MODE_HASH : CRYPT_HASH_MODE_INTERNAL;\r
+ break;\r
+ case 'sha384':\r
+ case 'sha512':\r
+ $mode = CRYPT_HASH_MODE == CRYPT_HASH_MODE_MHASH ? CRYPT_HASH_MODE_INTERNAL : CRYPT_HASH_MODE;\r
+ break;\r
+ default:\r
+ $mode = CRYPT_HASH_MODE;\r
+ }\r
+\r
+ switch ( $mode ) {\r
+ case CRYPT_HASH_MODE_MHASH:\r
+ switch ($hash) {\r
+ case 'md5':\r
+ case 'md5-96':\r
+ $this->hash = MHASH_MD5;\r
+ break;\r
+ case 'sha256':\r
+ $this->hash = MHASH_SHA256;\r
+ break;\r
+ case 'sha1':\r
+ case 'sha1-96':\r
+ default:\r
+ $this->hash = MHASH_SHA1;\r
+ }\r
+ return;\r
+ case CRYPT_HASH_MODE_HASH:\r
+ switch ($hash) {\r
+ case 'md5':\r
+ case 'md5-96':\r
+ $this->hash = 'md5';\r
+ return;\r
+ case 'md2':\r
+ case 'sha256':\r
+ case 'sha384':\r
+ case 'sha512':\r
+ $this->hash = $hash;\r
+ return;\r
+ case 'sha1':\r
+ case 'sha1-96':\r
+ default:\r
+ $this->hash = 'sha1';\r
+ }\r
+ return;\r
+ }\r
+\r
+ switch ($hash) {\r
+ case 'md2':\r
+ $this->b = 16;\r
+ $this->hash = array($this, '_md2');\r
+ break;\r
+ case 'md5':\r
+ case 'md5-96':\r
+ $this->b = 64;\r
+ $this->hash = array($this, '_md5');\r
+ break;\r
+ case 'sha256':\r
+ $this->b = 64;\r
+ $this->hash = array($this, '_sha256');\r
+ break;\r
+ case 'sha384':\r
+ case 'sha512':\r
+ $this->b = 128;\r
+ $this->hash = array($this, '_sha512');\r
+ break;\r
+ case 'sha1':\r
+ case 'sha1-96':\r
+ default:\r
+ $this->b = 64;\r
+ $this->hash = array($this, '_sha1');\r
+ }\r
+\r
+ $this->ipad = str_repeat(chr(0x36), $this->b);\r
+ $this->opad = str_repeat(chr(0x5C), $this->b);\r
+ }\r
+\r
+ /**\r
+ * Compute the HMAC.\r
+ *\r
+ * @access public\r
+ * @param String $text\r
+ * @return String\r
+ */\r
+ function hash($text)\r
+ {\r
+ $mode = is_array($this->hash) ? CRYPT_HASH_MODE_INTERNAL : CRYPT_HASH_MODE;\r
+\r
+ if (!empty($this->key) || is_string($this->key)) {\r
+ switch ( $mode ) {\r
+ case CRYPT_HASH_MODE_MHASH:\r
+ $output = mhash($this->hash, $text, $this->key);\r
+ break;\r
+ case CRYPT_HASH_MODE_HASH:\r
+ $output = hash_hmac($this->hash, $text, $this->key, true);\r
+ break;\r
+ case CRYPT_HASH_MODE_INTERNAL:\r
+ /* "Applications that use keys longer than B bytes will first hash the key using H and then use the\r
+ resultant L byte string as the actual key to HMAC."\r
+\r
+ -- http://tools.ietf.org/html/rfc2104#section-2 */\r
+ $key = strlen($this->key) > $this->b ? call_user_func($this->hash, $this->key) : $this->key;\r
+\r
+ $key = str_pad($key, $this->b, chr(0)); // step 1\r
+ $temp = $this->ipad ^ $key; // step 2\r
+ $temp .= $text; // step 3\r
+ $temp = call_user_func($this->hash, $temp); // step 4\r
+ $output = $this->opad ^ $key; // step 5\r
+ $output.= $temp; // step 6\r
+ $output = call_user_func($this->hash, $output); // step 7\r
+ }\r
+ } else {\r
+ switch ( $mode ) {\r
+ case CRYPT_HASH_MODE_MHASH:\r
+ $output = mhash($this->hash, $text);\r
+ break;\r
+ case CRYPT_HASH_MODE_HASH:\r
+ $output = hash($this->hash, $text, true);\r
+ break;\r
+ case CRYPT_HASH_MODE_INTERNAL:\r
+ $output = call_user_func($this->hash, $text);\r
+ }\r
+ }\r
+\r
+ return substr($output, 0, $this->l);\r
+ }\r
+\r
+ /**\r
+ * Returns the hash length (in bytes)\r
+ *\r
+ * @access public\r
+ * @return Integer\r
+ */\r
+ function getLength()\r
+ {\r
+ return $this->l;\r
+ }\r
+\r
+ /**\r
+ * Wrapper for MD5\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ */\r
+ function _md5($m)\r
+ {\r
+ return pack('H*', md5($m));\r
+ }\r
+\r
+ /**\r
+ * Wrapper for SHA1\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ */\r
+ function _sha1($m)\r
+ {\r
+ return pack('H*', sha1($m));\r
+ }\r
+\r
+ /**\r
+ * Pure-PHP implementation of MD2\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc1319 RFC1319}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ */\r
+ function _md2($m)\r
+ {\r
+ static $s = array(\r
+ 41, 46, 67, 201, 162, 216, 124, 1, 61, 54, 84, 161, 236, 240, 6,\r
+ 19, 98, 167, 5, 243, 192, 199, 115, 140, 152, 147, 43, 217, 188,\r
+ 76, 130, 202, 30, 155, 87, 60, 253, 212, 224, 22, 103, 66, 111, 24,\r
+ 138, 23, 229, 18, 190, 78, 196, 214, 218, 158, 222, 73, 160, 251,\r
+ 245, 142, 187, 47, 238, 122, 169, 104, 121, 145, 21, 178, 7, 63,\r
+ 148, 194, 16, 137, 11, 34, 95, 33, 128, 127, 93, 154, 90, 144, 50,\r
+ 39, 53, 62, 204, 231, 191, 247, 151, 3, 255, 25, 48, 179, 72, 165,\r
+ 181, 209, 215, 94, 146, 42, 172, 86, 170, 198, 79, 184, 56, 210,\r
+ 150, 164, 125, 182, 118, 252, 107, 226, 156, 116, 4, 241, 69, 157,\r
+ 112, 89, 100, 113, 135, 32, 134, 91, 207, 101, 230, 45, 168, 2, 27,\r
+ 96, 37, 173, 174, 176, 185, 246, 28, 70, 97, 105, 52, 64, 126, 15,\r
+ 85, 71, 163, 35, 221, 81, 175, 58, 195, 92, 249, 206, 186, 197,\r
+ 234, 38, 44, 83, 13, 110, 133, 40, 132, 9, 211, 223, 205, 244, 65,\r
+ 129, 77, 82, 106, 220, 55, 200, 108, 193, 171, 250, 36, 225, 123,\r
+ 8, 12, 189, 177, 74, 120, 136, 149, 139, 227, 99, 232, 109, 233,\r
+ 203, 213, 254, 59, 0, 29, 57, 242, 239, 183, 14, 102, 88, 208, 228,\r
+ 166, 119, 114, 248, 235, 117, 75, 10, 49, 68, 80, 180, 143, 237,\r
+ 31, 26, 219, 153, 141, 51, 159, 17, 131, 20\r
+ );\r
+\r
+ // Step 1. Append Padding Bytes\r
+ $pad = 16 - (strlen($m) & 0xF);\r
+ $m.= str_repeat(chr($pad), $pad);\r
+\r
+ $length = strlen($m);\r
+\r
+ // Step 2. Append Checksum\r
+ $c = str_repeat(chr(0), 16);\r
+ $l = chr(0);\r
+ for ($i = 0; $i < $length; $i+= 16) {\r
+ for ($j = 0; $j < 16; $j++) {\r
+ // RFC1319 incorrectly states that C[j] should be set to S[c xor L]\r
+ //$c[$j] = chr($s[ord($m[$i + $j] ^ $l)]);\r
+ // 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]\r
+ $c[$j] = chr($s[ord($m[$i + $j] ^ $l)] ^ ord($c[$j]));\r
+ $l = $c[$j];\r
+ }\r
+ }\r
+ $m.= $c;\r
+\r
+ $length+= 16;\r
+\r
+ // Step 3. Initialize MD Buffer\r
+ $x = str_repeat(chr(0), 48);\r
+\r
+ // Step 4. Process Message in 16-Byte Blocks\r
+ for ($i = 0; $i < $length; $i+= 16) {\r
+ for ($j = 0; $j < 16; $j++) {\r
+ $x[$j + 16] = $m[$i + $j];\r
+ $x[$j + 32] = $x[$j + 16] ^ $x[$j];\r
+ }\r
+ $t = chr(0);\r
+ for ($j = 0; $j < 18; $j++) {\r
+ for ($k = 0; $k < 48; $k++) {\r
+ $x[$k] = $t = $x[$k] ^ chr($s[ord($t)]);\r
+ //$t = $x[$k] = $x[$k] ^ chr($s[ord($t)]);\r
+ }\r
+ $t = chr(ord($t) + $j);\r
+ }\r
+ }\r
+\r
+ // Step 5. Output\r
+ return substr($x, 0, 16);\r
+ }\r
+\r
+ /**\r
+ * Pure-PHP implementation of SHA256\r
+ *\r
+ * 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}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ */\r
+ function _sha256($m)\r
+ {\r
+ if (extension_loaded('suhosin')) {\r
+ return pack('H*', sha256($m));\r
+ }\r
+\r
+ // Initialize variables\r
+ $hash = array(\r
+ 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\r
+ );\r
+ // Initialize table of round constants\r
+ // (first 32 bits of the fractional parts of the cube roots of the first 64 primes 2..311)\r
+ static $k = array(\r
+ 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5, 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\r
+ 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3, 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\r
+ 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc, 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\r
+ 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7, 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\r
+ 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13, 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\r
+ 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3, 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\r
+ 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5, 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\r
+ 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208, 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\r
+ );\r
+\r
+ // Pre-processing\r
+ $length = strlen($m);\r
+ // to round to nearest 56 mod 64, we'll add 64 - (length + (64 - 56)) % 64\r
+ $m.= str_repeat(chr(0), 64 - (($length + 8) & 0x3F));\r
+ $m[$length] = chr(0x80);\r
+ // we don't support hashing strings 512MB long\r
+ $m.= pack('N2', 0, $length << 3);\r
+\r
+ // Process the message in successive 512-bit chunks\r
+ $chunks = str_split($m, 64);\r
+ foreach ($chunks as $chunk) {\r
+ $w = array();\r
+ for ($i = 0; $i < 16; $i++) {\r
+ extract(unpack('Ntemp', $this->_string_shift($chunk, 4)));\r
+ $w[] = $temp;\r
+ }\r
+\r
+ // Extend the sixteen 32-bit words into sixty-four 32-bit words\r
+ for ($i = 16; $i < 64; $i++) {\r
+ $s0 = $this->_rightRotate($w[$i - 15], 7) ^\r
+ $this->_rightRotate($w[$i - 15], 18) ^\r
+ $this->_rightShift( $w[$i - 15], 3);\r
+ $s1 = $this->_rightRotate($w[$i - 2], 17) ^\r
+ $this->_rightRotate($w[$i - 2], 19) ^\r
+ $this->_rightShift( $w[$i - 2], 10);\r
+ $w[$i] = $this->_add($w[$i - 16], $s0, $w[$i - 7], $s1);\r
+\r
+ }\r
+\r
+ // Initialize hash value for this chunk\r
+ list($a, $b, $c, $d, $e, $f, $g, $h) = $hash;\r
+\r
+ // Main loop\r
+ for ($i = 0; $i < 64; $i++) {\r
+ $s0 = $this->_rightRotate($a, 2) ^\r
+ $this->_rightRotate($a, 13) ^\r
+ $this->_rightRotate($a, 22);\r
+ $maj = ($a & $b) ^\r
+ ($a & $c) ^\r
+ ($b & $c);\r
+ $t2 = $this->_add($s0, $maj);\r
+\r
+ $s1 = $this->_rightRotate($e, 6) ^\r
+ $this->_rightRotate($e, 11) ^\r
+ $this->_rightRotate($e, 25);\r
+ $ch = ($e & $f) ^\r
+ ($this->_not($e) & $g);\r
+ $t1 = $this->_add($h, $s1, $ch, $k[$i], $w[$i]);\r
+\r
+ $h = $g;\r
+ $g = $f;\r
+ $f = $e;\r
+ $e = $this->_add($d, $t1);\r
+ $d = $c;\r
+ $c = $b;\r
+ $b = $a;\r
+ $a = $this->_add($t1, $t2);\r
+ }\r
+\r
+ // Add this chunk's hash to result so far\r
+ $hash = array(\r
+ $this->_add($hash[0], $a),\r
+ $this->_add($hash[1], $b),\r
+ $this->_add($hash[2], $c),\r
+ $this->_add($hash[3], $d),\r
+ $this->_add($hash[4], $e),\r
+ $this->_add($hash[5], $f),\r
+ $this->_add($hash[6], $g),\r
+ $this->_add($hash[7], $h)\r
+ );\r
+ }\r
+\r
+ // Produce the final hash value (big-endian)\r
+ return pack('N8', $hash[0], $hash[1], $hash[2], $hash[3], $hash[4], $hash[5], $hash[6], $hash[7]);\r
+ }\r
+\r
+ /**\r
+ * Pure-PHP implementation of SHA384 and SHA512\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ */\r
+ function _sha512($m)\r
+ {\r
+ if (!class_exists('Math_BigInteger')) {\r
+ require_once('Math/BigInteger.php');\r
+ }\r
+\r
+ static $init384, $init512, $k;\r
+\r
+ if (!isset($k)) {\r
+ // Initialize variables\r
+ $init384 = array( // initial values for SHA384\r
+ 'cbbb9d5dc1059ed8', '629a292a367cd507', '9159015a3070dd17', '152fecd8f70e5939', \r
+ '67332667ffc00b31', '8eb44a8768581511', 'db0c2e0d64f98fa7', '47b5481dbefa4fa4'\r
+ );\r
+ $init512 = array( // initial values for SHA512\r
+ '6a09e667f3bcc908', 'bb67ae8584caa73b', '3c6ef372fe94f82b', 'a54ff53a5f1d36f1', \r
+ '510e527fade682d1', '9b05688c2b3e6c1f', '1f83d9abfb41bd6b', '5be0cd19137e2179'\r
+ );\r
+\r
+ for ($i = 0; $i < 8; $i++) {\r
+ $init384[$i] = new Math_BigInteger($init384[$i], 16);\r
+ $init384[$i]->setPrecision(64);\r
+ $init512[$i] = new Math_BigInteger($init512[$i], 16);\r
+ $init512[$i]->setPrecision(64);\r
+ }\r
+\r
+ // Initialize table of round constants\r
+ // (first 64 bits of the fractional parts of the cube roots of the first 80 primes 2..409)\r
+ $k = array(\r
+ '428a2f98d728ae22', '7137449123ef65cd', 'b5c0fbcfec4d3b2f', 'e9b5dba58189dbbc',\r
+ '3956c25bf348b538', '59f111f1b605d019', '923f82a4af194f9b', 'ab1c5ed5da6d8118',\r
+ 'd807aa98a3030242', '12835b0145706fbe', '243185be4ee4b28c', '550c7dc3d5ffb4e2',\r
+ '72be5d74f27b896f', '80deb1fe3b1696b1', '9bdc06a725c71235', 'c19bf174cf692694',\r
+ 'e49b69c19ef14ad2', 'efbe4786384f25e3', '0fc19dc68b8cd5b5', '240ca1cc77ac9c65',\r
+ '2de92c6f592b0275', '4a7484aa6ea6e483', '5cb0a9dcbd41fbd4', '76f988da831153b5',\r
+ '983e5152ee66dfab', 'a831c66d2db43210', 'b00327c898fb213f', 'bf597fc7beef0ee4',\r
+ 'c6e00bf33da88fc2', 'd5a79147930aa725', '06ca6351e003826f', '142929670a0e6e70',\r
+ '27b70a8546d22ffc', '2e1b21385c26c926', '4d2c6dfc5ac42aed', '53380d139d95b3df',\r
+ '650a73548baf63de', '766a0abb3c77b2a8', '81c2c92e47edaee6', '92722c851482353b',\r
+ 'a2bfe8a14cf10364', 'a81a664bbc423001', 'c24b8b70d0f89791', 'c76c51a30654be30',\r
+ 'd192e819d6ef5218', 'd69906245565a910', 'f40e35855771202a', '106aa07032bbd1b8',\r
+ '19a4c116b8d2d0c8', '1e376c085141ab53', '2748774cdf8eeb99', '34b0bcb5e19b48a8',\r
+ '391c0cb3c5c95a63', '4ed8aa4ae3418acb', '5b9cca4f7763e373', '682e6ff3d6b2b8a3',\r
+ '748f82ee5defb2fc', '78a5636f43172f60', '84c87814a1f0ab72', '8cc702081a6439ec',\r
+ '90befffa23631e28', 'a4506cebde82bde9', 'bef9a3f7b2c67915', 'c67178f2e372532b',\r
+ 'ca273eceea26619c', 'd186b8c721c0c207', 'eada7dd6cde0eb1e', 'f57d4f7fee6ed178',\r
+ '06f067aa72176fba', '0a637dc5a2c898a6', '113f9804bef90dae', '1b710b35131c471b',\r
+ '28db77f523047d84', '32caab7b40c72493', '3c9ebe0a15c9bebc', '431d67c49c100d4c',\r
+ '4cc5d4becb3e42b6', '597f299cfc657e2a', '5fcb6fab3ad6faec', '6c44198c4a475817'\r
+ );\r
+\r
+ for ($i = 0; $i < 80; $i++) {\r
+ $k[$i] = new Math_BigInteger($k[$i], 16);\r
+ }\r
+ }\r
+\r
+ $hash = $this->l == 48 ? $init384 : $init512;\r
+\r
+ // Pre-processing\r
+ $length = strlen($m);\r
+ // to round to nearest 112 mod 128, we'll add 128 - (length + (128 - 112)) % 128\r
+ $m.= str_repeat(chr(0), 128 - (($length + 16) & 0x7F));\r
+ $m[$length] = chr(0x80);\r
+ // we don't support hashing strings 512MB long\r
+ $m.= pack('N4', 0, 0, 0, $length << 3);\r
+\r
+ // Process the message in successive 1024-bit chunks\r
+ $chunks = str_split($m, 128);\r
+ foreach ($chunks as $chunk) {\r
+ $w = array();\r
+ for ($i = 0; $i < 16; $i++) {\r
+ $temp = new Math_BigInteger($this->_string_shift($chunk, 8), 256);\r
+ $temp->setPrecision(64);\r
+ $w[] = $temp;\r
+ }\r
+\r
+ // Extend the sixteen 32-bit words into eighty 32-bit words\r
+ for ($i = 16; $i < 80; $i++) {\r
+ $temp = array(\r
+ $w[$i - 15]->bitwise_rightRotate(1),\r
+ $w[$i - 15]->bitwise_rightRotate(8),\r
+ $w[$i - 15]->bitwise_rightShift(7)\r
+ );\r
+ $s0 = $temp[0]->bitwise_xor($temp[1]);\r
+ $s0 = $s0->bitwise_xor($temp[2]);\r
+ $temp = array(\r
+ $w[$i - 2]->bitwise_rightRotate(19),\r
+ $w[$i - 2]->bitwise_rightRotate(61),\r
+ $w[$i - 2]->bitwise_rightShift(6)\r
+ );\r
+ $s1 = $temp[0]->bitwise_xor($temp[1]);\r
+ $s1 = $s1->bitwise_xor($temp[2]);\r
+ $w[$i] = $w[$i - 16]->copy();\r
+ $w[$i] = $w[$i]->add($s0);\r
+ $w[$i] = $w[$i]->add($w[$i - 7]);\r
+ $w[$i] = $w[$i]->add($s1);\r
+ }\r
+\r
+ // Initialize hash value for this chunk\r
+ $a = $hash[0]->copy();\r
+ $b = $hash[1]->copy();\r
+ $c = $hash[2]->copy();\r
+ $d = $hash[3]->copy();\r
+ $e = $hash[4]->copy();\r
+ $f = $hash[5]->copy();\r
+ $g = $hash[6]->copy();\r
+ $h = $hash[7]->copy();\r
+\r
+ // Main loop\r
+ for ($i = 0; $i < 80; $i++) {\r
+ $temp = array(\r
+ $a->bitwise_rightRotate(28),\r
+ $a->bitwise_rightRotate(34),\r
+ $a->bitwise_rightRotate(39)\r
+ );\r
+ $s0 = $temp[0]->bitwise_xor($temp[1]);\r
+ $s0 = $s0->bitwise_xor($temp[2]);\r
+ $temp = array(\r
+ $a->bitwise_and($b),\r
+ $a->bitwise_and($c),\r
+ $b->bitwise_and($c)\r
+ );\r
+ $maj = $temp[0]->bitwise_xor($temp[1]);\r
+ $maj = $maj->bitwise_xor($temp[2]);\r
+ $t2 = $s0->add($maj);\r
+\r
+ $temp = array(\r
+ $e->bitwise_rightRotate(14),\r
+ $e->bitwise_rightRotate(18),\r
+ $e->bitwise_rightRotate(41)\r
+ );\r
+ $s1 = $temp[0]->bitwise_xor($temp[1]);\r
+ $s1 = $s1->bitwise_xor($temp[2]);\r
+ $temp = array(\r
+ $e->bitwise_and($f),\r
+ $g->bitwise_and($e->bitwise_not())\r
+ );\r
+ $ch = $temp[0]->bitwise_xor($temp[1]);\r
+ $t1 = $h->add($s1);\r
+ $t1 = $t1->add($ch);\r
+ $t1 = $t1->add($k[$i]);\r
+ $t1 = $t1->add($w[$i]);\r
+\r
+ $h = $g->copy();\r
+ $g = $f->copy();\r
+ $f = $e->copy();\r
+ $e = $d->add($t1);\r
+ $d = $c->copy();\r
+ $c = $b->copy();\r
+ $b = $a->copy();\r
+ $a = $t1->add($t2);\r
+ }\r
+\r
+ // Add this chunk's hash to result so far\r
+ $hash = array(\r
+ $hash[0]->add($a),\r
+ $hash[1]->add($b),\r
+ $hash[2]->add($c),\r
+ $hash[3]->add($d),\r
+ $hash[4]->add($e),\r
+ $hash[5]->add($f),\r
+ $hash[6]->add($g),\r
+ $hash[7]->add($h)\r
+ );\r
+ }\r
+\r
+ // Produce the final hash value (big-endian)\r
+ // (Crypt_Hash::hash() trims the output for hashes but not for HMACs. as such, we trim the output here)\r
+ $temp = $hash[0]->toBytes() . $hash[1]->toBytes() . $hash[2]->toBytes() . $hash[3]->toBytes() .\r
+ $hash[4]->toBytes() . $hash[5]->toBytes();\r
+ if ($this->l != 48) {\r
+ $temp.= $hash[6]->toBytes() . $hash[7]->toBytes();\r
+ }\r
+\r
+ return $temp;\r
+ }\r
+\r
+ /**\r
+ * Right Rotate\r
+ *\r
+ * @access private\r
+ * @param Integer $int\r
+ * @param Integer $amt\r
+ * @see _sha256()\r
+ * @return Integer\r
+ */\r
+ function _rightRotate($int, $amt)\r
+ {\r
+ $invamt = 32 - $amt;\r
+ $mask = (1 << $invamt) - 1;\r
+ return (($int << $invamt) & 0xFFFFFFFF) | (($int >> $amt) & $mask);\r
+ }\r
+\r
+ /**\r
+ * Right Shift\r
+ *\r
+ * @access private\r
+ * @param Integer $int\r
+ * @param Integer $amt\r
+ * @see _sha256()\r
+ * @return Integer\r
+ */\r
+ function _rightShift($int, $amt)\r
+ {\r
+ $mask = (1 << (32 - $amt)) - 1;\r
+ return ($int >> $amt) & $mask;\r
+ }\r
+\r
+ /**\r
+ * Not\r
+ *\r
+ * @access private\r
+ * @param Integer $int\r
+ * @see _sha256()\r
+ * @return Integer\r
+ */\r
+ function _not($int)\r
+ {\r
+ return ~$int & 0xFFFFFFFF;\r
+ }\r
+\r
+ /**\r
+ * Add\r
+ *\r
+ * _sha256() adds multiple unsigned 32-bit integers. Since PHP doesn't support unsigned integers and since the\r
+ * possibility of overflow exists, care has to be taken. Math_BigInteger() could be used but this should be faster.\r
+ *\r
+ * @param Integer $...\r
+ * @return Integer\r
+ * @see _sha256()\r
+ * @access private\r
+ */\r
+ function _add()\r
+ {\r
+ static $mod;\r
+ if (!isset($mod)) {\r
+ $mod = pow(2, 32);\r
+ }\r
+\r
+ $result = 0;\r
+ $arguments = func_get_args();\r
+ foreach ($arguments as $argument) {\r
+ $result+= $argument < 0 ? ($argument & 0x7FFFFFFF) + 0x80000000 : $argument;\r
+ }\r
+\r
+ return fmod($result, $mod);\r
+ }\r
+\r
+ /**\r
+ * String Shift\r
+ *\r
+ * Inspired by array_shift\r
+ *\r
+ * @param String $string\r
+ * @param optional Integer $index\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _string_shift(&$string, $index = 1)\r
+ {\r
+ $substr = substr($string, 0, $index);\r
+ $string = substr($string, $index);\r
+ return $substr;\r
+ }\r
+}\r
-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Pure-PHP implementation of RC4.
- *
- * Uses mcrypt, if available, and an internal implementation, otherwise.
- *
- * PHP versions 4 and 5
- *
- * Useful resources are as follows:
- *
- * - {@link http://www.mozilla.org/projects/security/pki/nss/draft-kaukonen-cipher-arcfour-03.txt ARCFOUR Algorithm}
- * - {@link http://en.wikipedia.org/wiki/RC4 - Wikipedia: RC4}
- *
- * RC4 is also known as ARCFOUR or ARC4. The reason is elaborated upon at Wikipedia. This class is named RC4 and not
- * ARCFOUR or ARC4 because RC4 is how it is refered to in the SSH1 specification.
- *
- * Here's a short example of how to use this library:
- * <code>
- * <?php
- * include('Crypt/RC4.php');
- *
- * $rc4 = new Crypt_RC4();
- *
- * $rc4->setKey('abcdefgh');
- *
- * $size = 10 * 1024;
- * $plaintext = '';
- * for ($i = 0; $i < $size; $i++) {
- * $plaintext.= 'a';
- * }
- *
- * echo $rc4->decrypt($rc4->encrypt($plaintext));
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Crypt
- * @package Crypt_RC4
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMVII Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: RC4.php,v 1.8 2009/06/09 04:00:38 terrafrost Exp $
- * @link http://phpseclib.sourceforge.net
- */
-
-/**#@+
- * @access private
- * @see Crypt_RC4::Crypt_RC4()
- */
-/**
- * Toggles the internal implementation
- */
-define('CRYPT_RC4_MODE_INTERNAL', 1);
-/**
- * Toggles the mcrypt implementation
- */
-define('CRYPT_RC4_MODE_MCRYPT', 2);
-/**#@-*/
-
-/**#@+
- * @access private
- * @see Crypt_RC4::_crypt()
- */
-define('CRYPT_RC4_ENCRYPT', 0);
-define('CRYPT_RC4_DECRYPT', 1);
-/**#@-*/
-
-/**
- * Pure-PHP implementation of RC4.
- *
- * @author Jim Wigginton <terrafrost@php.net>
- * @version 0.1.0
- * @access public
- * @package Crypt_RC4
- */
-class Crypt_RC4 {
- /**
- * The Key
- *
- * @see Crypt_RC4::setKey()
- * @var String
- * @access private
- */
- var $key = "\0";
-
- /**
- * The Key Stream for encryption
- *
- * If CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT, this will be equal to the mcrypt object
- *
- * @see Crypt_RC4::setKey()
- * @var Array
- * @access private
- */
- var $encryptStream = false;
-
- /**
- * The Key Stream for decryption
- *
- * If CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT, this will be equal to the mcrypt object
- *
- * @see Crypt_RC4::setKey()
- * @var Array
- * @access private
- */
- var $decryptStream = false;
-
- /**
- * The $i and $j indexes for encryption
- *
- * @see Crypt_RC4::_crypt()
- * @var Integer
- * @access private
- */
- var $encryptIndex = 0;
-
- /**
- * The $i and $j indexes for decryption
- *
- * @see Crypt_RC4::_crypt()
- * @var Integer
- * @access private
- */
- var $decryptIndex = 0;
-
- /**
- * MCrypt parameters
- *
- * @see Crypt_RC4::setMCrypt()
- * @var Array
- * @access private
- */
- var $mcrypt = array('', '');
-
- /**
- * The Encryption Algorithm
- *
- * Only used if CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT. Only possible values are MCRYPT_RC4 or MCRYPT_ARCFOUR.
- *
- * @see Crypt_RC4::Crypt_RC4()
- * @var Integer
- * @access private
- */
- var $mode;
-
- /**
- * Default Constructor.
- *
- * Determines whether or not the mcrypt extension should be used.
- *
- * @param optional Integer $mode
- * @return Crypt_RC4
- * @access public
- */
- function Crypt_RC4()
- {
- if ( !defined('CRYPT_RC4_MODE') ) {
- switch (true) {
- case extension_loaded('mcrypt') && (defined('MCRYPT_ARCFOUR') || defined('MCRYPT_RC4')):
- // i'd check to see if rc4 was supported, by doing in_array('arcfour', mcrypt_list_algorithms('')),
- // but since that can be changed after the object has been created, there doesn't seem to be
- // a lot of point...
- define('CRYPT_RC4_MODE', CRYPT_RC4_MODE_MCRYPT);
- break;
- default:
- define('CRYPT_RC4_MODE', CRYPT_RC4_MODE_INTERNAL);
- }
- }
-
- switch ( CRYPT_RC4_MODE ) {
- case CRYPT_RC4_MODE_MCRYPT:
- switch (true) {
- case defined('MCRYPT_ARCFOUR'):
- $this->mode = MCRYPT_ARCFOUR;
- break;
- case defined('MCRYPT_RC4');
- $this->mode = MCRYPT_RC4;
- }
- }
- }
-
- /**
- * Sets the key.
- *
- * Keys can be between 1 and 256 bytes long. If they are longer then 256 bytes, the first 256 bytes will
- * be used. If no key is explicitly set, it'll be assumed to be a single null byte.
- *
- * @access public
- * @param String $key
- */
- function setKey($key)
- {
- $this->key = $key;
-
- if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT ) {
- return;
- }
-
- $keyLength = strlen($key);
- $keyStream = array();
- for ($i = 0; $i < 256; $i++) {
- $keyStream[$i] = $i;
- }
- $j = 0;
- for ($i = 0; $i < 256; $i++) {
- $j = ($j + $keyStream[$i] + ord($key[$i % $keyLength])) & 255;
- $temp = $keyStream[$i];
- $keyStream[$i] = $keyStream[$j];
- $keyStream[$j] = $temp;
- }
-
- $this->encryptIndex = $this->decryptIndex = array(0, 0);
- $this->encryptStream = $this->decryptStream = $keyStream;
- }
-
- /**
- * Dummy function.
- *
- * Some protocols, such as WEP, prepend an "initialization vector" to the key, effectively creating a new key [1].
- * If you need to use an initialization vector in this manner, feel free to prepend it to the key, yourself, before
- * calling setKey().
- *
- * [1] WEP's initialization vectors (IV's) are used in a somewhat insecure way. Since, in that protocol,
- * the IV's are relatively easy to predict, an attack described by
- * {@link http://www.drizzle.com/~aboba/IEEE/rc4_ksaproc.pdf Scott Fluhrer, Itsik Mantin, and Adi Shamir}
- * can be used to quickly guess at the rest of the key. The following links elaborate:
- *
- * {@link http://www.rsa.com/rsalabs/node.asp?id=2009 http://www.rsa.com/rsalabs/node.asp?id=2009}
- * {@link http://en.wikipedia.org/wiki/Related_key_attack http://en.wikipedia.org/wiki/Related_key_attack}
- *
- * @param String $iv
- * @see Crypt_RC4::setKey()
- * @access public
- */
- function setIV($iv)
- {
- }
-
- /**
- * Sets MCrypt parameters. (optional)
- *
- * If MCrypt is being used, empty strings will be used, unless otherwise specified.
- *
- * @link http://php.net/function.mcrypt-module-open#function.mcrypt-module-open
- * @access public
- * @param optional Integer $algorithm_directory
- * @param optional Integer $mode_directory
- */
- function setMCrypt($algorithm_directory = '', $mode_directory = '')
- {
- if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT ) {
- $this->mcrypt = array($algorithm_directory, $mode_directory);
- $this->_closeMCrypt();
- }
- }
-
- /**
- * Encrypts a message.
- *
- * @see Crypt_RC4::_crypt()
- * @access public
- * @param String $plaintext
- */
- function encrypt($plaintext)
- {
- return $this->_crypt($plaintext, CRYPT_RC4_ENCRYPT);
- }
-
- /**
- * Decrypts a message.
- *
- * $this->decrypt($this->encrypt($plaintext)) == $this->encrypt($this->encrypt($plaintext)).
- * Atleast if the continuous buffer is disabled.
- *
- * @see Crypt_RC4::_crypt()
- * @access public
- * @param String $ciphertext
- */
- function decrypt($ciphertext)
- {
- return $this->_crypt($ciphertext, CRYPT_RC4_DECRYPT);
- }
-
- /**
- * Encrypts or decrypts a message.
- *
- * @see Crypt_RC4::encrypt()
- * @see Crypt_RC4::decrypt()
- * @access private
- * @param String $text
- * @param Integer $mode
- */
- function _crypt($text, $mode)
- {
- if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT ) {
- $keyStream = $mode == CRYPT_RC4_ENCRYPT ? 'encryptStream' : 'decryptStream';
-
- if ($this->$keyStream === false) {
- $this->$keyStream = mcrypt_module_open($this->mode, $this->mcrypt[0], MCRYPT_MODE_STREAM, $this->mcrypt[1]);
- mcrypt_generic_init($this->$keyStream, $this->key, '');
- } else if (!$this->continuousBuffer) {
- mcrypt_generic_init($this->$keyStream, $this->key, '');
- }
- $newText = mcrypt_generic($this->$keyStream, $text);
- if (!$this->continuousBuffer) {
- mcrypt_generic_deinit($this->$keyStream);
- }
-
- return $newText;
- }
-
- if ($this->encryptStream === false) {
- $this->setKey($this->key);
- }
-
- switch ($mode) {
- case CRYPT_RC4_ENCRYPT:
- $keyStream = $this->encryptStream;
- list($i, $j) = $this->encryptIndex;
- break;
- case CRYPT_RC4_DECRYPT:
- $keyStream = $this->decryptStream;
- list($i, $j) = $this->decryptIndex;
- }
-
- $newText = '';
- for ($k = 0; $k < strlen($text); $k++) {
- $i = ($i + 1) & 255;
- $j = ($j + $keyStream[$i]) & 255;
- $temp = $keyStream[$i];
- $keyStream[$i] = $keyStream[$j];
- $keyStream[$j] = $temp;
- $temp = $keyStream[($keyStream[$i] + $keyStream[$j]) & 255];
- $newText.= chr(ord($text[$k]) ^ $temp);
- }
-
- if ($this->continuousBuffer) {
- switch ($mode) {
- case CRYPT_RC4_ENCRYPT:
- $this->encryptStream = $keyStream;
- $this->encryptIndex = array($i, $j);
- break;
- case CRYPT_RC4_DECRYPT:
- $this->decryptStream = $keyStream;
- $this->decryptIndex = array($i, $j);
- }
- }
-
- return $newText;
- }
-
- /**
- * Treat consecutive "packets" as if they are a continuous buffer.
- *
- * Say you have a 16-byte plaintext $plaintext. Using the default behavior, the two following code snippets
- * will yield different outputs:
- *
- * <code>
- * echo $rc4->encrypt(substr($plaintext, 0, 8));
- * echo $rc4->encrypt(substr($plaintext, 8, 8));
- * </code>
- * <code>
- * echo $rc4->encrypt($plaintext);
- * </code>
- *
- * The solution is to enable the continuous buffer. Although this will resolve the above discrepancy, it creates
- * another, as demonstrated with the following:
- *
- * <code>
- * $rc4->encrypt(substr($plaintext, 0, 8));
- * echo $rc4->decrypt($des->encrypt(substr($plaintext, 8, 8)));
- * </code>
- * <code>
- * echo $rc4->decrypt($des->encrypt(substr($plaintext, 8, 8)));
- * </code>
- *
- * With the continuous buffer disabled, these would yield the same output. With it enabled, they yield different
- * outputs. The reason is due to the fact that the initialization vector's change after every encryption /
- * decryption round when the continuous buffer is enabled. When it's disabled, they remain constant.
- *
- * Put another way, when the continuous buffer is enabled, the state of the Crypt_DES() object changes after each
- * encryption / decryption round, whereas otherwise, it'd remain constant. For this reason, it's recommended that
- * continuous buffers not be used. They do offer better security and are, in fact, sometimes required (SSH uses them),
- * however, they are also less intuitive and more likely to cause you problems.
- *
- * @see Crypt_RC4::disableContinuousBuffer()
- * @access public
- */
- function enableContinuousBuffer()
- {
- $this->continuousBuffer = true;
- }
-
- /**
- * Treat consecutive packets as if they are a discontinuous buffer.
- *
- * The default behavior.
- *
- * @see Crypt_RC4::enableContinuousBuffer()
- * @access public
- */
- function disableContinuousBuffer()
- {
- if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_INTERNAL ) {
- $this->encryptIndex = $this->decryptIndex = array(0, 0);
- $this->setKey($this->key);
- }
-
- $this->continuousBuffer = false;
- }
-
- /**
- * Dummy function.
- *
- * Since RC4 is a stream cipher and not a block cipher, no padding is necessary. The only reason this function is
- * included is so that you can switch between a block cipher and a stream cipher transparently.
- *
- * @see Crypt_RC4::disablePadding()
- * @access public
- */
- function enablePadding()
- {
- }
-
- /**
- * Dummy function.
- *
- * @see Crypt_RC4::enablePadding()
- * @access public
- */
- function disablePadding()
- {
- }
-
- /**
- * Class destructor.
- *
- * Will be called, automatically, if you're using PHP5. If you're using PHP4, call it yourself. Only really
- * needs to be called if mcrypt is being used.
- *
- * @access public
- */
- function __destruct()
- {
- if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT ) {
- $this->_closeMCrypt();
- }
- }
-
- /**
- * Properly close the MCrypt objects.
- *
- * @access prviate
- */
- function _closeMCrypt()
- {
- if ( $this->encryptStream !== false ) {
- if ( $this->continuousBuffer ) {
- mcrypt_generic_deinit($this->encryptStream);
- }
-
- mcrypt_module_close($this->encryptStream);
-
- $this->encryptStream = false;
- }
-
- if ( $this->decryptStream !== false ) {
- if ( $this->continuousBuffer ) {
- mcrypt_generic_deinit($this->decryptStream);
- }
-
- mcrypt_module_close($this->decryptStream);
-
- $this->decryptStream = false;
- }
- }
-}
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP implementation of RC4.\r
+ *\r
+ * Uses mcrypt, if available, and an internal implementation, otherwise.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * Useful resources are as follows:\r
+ *\r
+ * - {@link http://www.mozilla.org/projects/security/pki/nss/draft-kaukonen-cipher-arcfour-03.txt ARCFOUR Algorithm}\r
+ * - {@link http://en.wikipedia.org/wiki/RC4 - Wikipedia: RC4}\r
+ *\r
+ * RC4 is also known as ARCFOUR or ARC4. The reason is elaborated upon at Wikipedia. This class is named RC4 and not\r
+ * ARCFOUR or ARC4 because RC4 is how it is referred to in the SSH1 specification.\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/RC4.php');\r
+ *\r
+ * $rc4 = new Crypt_RC4();\r
+ *\r
+ * $rc4->setKey('abcdefgh');\r
+ *\r
+ * $size = 10 * 1024;\r
+ * $plaintext = '';\r
+ * for ($i = 0; $i < $size; $i++) {\r
+ * $plaintext.= 'a';\r
+ * }\r
+ *\r
+ * echo $rc4->decrypt($rc4->encrypt($plaintext));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_RC4\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMVII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_RC4::Crypt_RC4()\r
+ */\r
+/**\r
+ * Toggles the internal implementation\r
+ */\r
+define('CRYPT_RC4_MODE_INTERNAL', 1);\r
+/**\r
+ * Toggles the mcrypt implementation\r
+ */\r
+define('CRYPT_RC4_MODE_MCRYPT', 2);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_RC4::_crypt()\r
+ */\r
+define('CRYPT_RC4_ENCRYPT', 0);\r
+define('CRYPT_RC4_DECRYPT', 1);\r
+/**#@-*/\r
+\r
+/**\r
+ * Pure-PHP implementation of RC4.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @version 0.1.0\r
+ * @access public\r
+ * @package Crypt_RC4\r
+ */\r
+class Crypt_RC4 {\r
+ /**\r
+ * The Key\r
+ *\r
+ * @see Crypt_RC4::setKey()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $key = "\0";\r
+\r
+ /**\r
+ * The Key Stream for encryption\r
+ *\r
+ * If CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT, this will be equal to the mcrypt object\r
+ *\r
+ * @see Crypt_RC4::setKey()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $encryptStream = false;\r
+\r
+ /**\r
+ * The Key Stream for decryption\r
+ *\r
+ * If CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT, this will be equal to the mcrypt object\r
+ *\r
+ * @see Crypt_RC4::setKey()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $decryptStream = false;\r
+\r
+ /**\r
+ * The $i and $j indexes for encryption\r
+ *\r
+ * @see Crypt_RC4::_crypt()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $encryptIndex = 0;\r
+\r
+ /**\r
+ * The $i and $j indexes for decryption\r
+ *\r
+ * @see Crypt_RC4::_crypt()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $decryptIndex = 0;\r
+\r
+ /**\r
+ * The Encryption Algorithm\r
+ *\r
+ * Only used if CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT. Only possible values are MCRYPT_RC4 or MCRYPT_ARCFOUR.\r
+ *\r
+ * @see Crypt_RC4::Crypt_RC4()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $mode;\r
+\r
+ /**\r
+ * Continuous Buffer status\r
+ *\r
+ * @see Crypt_RC4::enableContinuousBuffer()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $continuousBuffer = false;\r
+\r
+ /**\r
+ * Default Constructor.\r
+ *\r
+ * Determines whether or not the mcrypt extension should be used.\r
+ *\r
+ * @return Crypt_RC4\r
+ * @access public\r
+ */\r
+ function Crypt_RC4()\r
+ {\r
+ if ( !defined('CRYPT_RC4_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('mcrypt') && (defined('MCRYPT_ARCFOUR') || defined('MCRYPT_RC4')) && in_array('arcfour', mcrypt_list_algorithms()):\r
+ define('CRYPT_RC4_MODE', CRYPT_RC4_MODE_MCRYPT);\r
+ break;\r
+ default:\r
+ define('CRYPT_RC4_MODE', CRYPT_RC4_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ switch ( CRYPT_RC4_MODE ) {\r
+ case CRYPT_RC4_MODE_MCRYPT:\r
+ switch (true) {\r
+ case defined('MCRYPT_ARCFOUR'):\r
+ $this->mode = MCRYPT_ARCFOUR;\r
+ break;\r
+ case defined('MCRYPT_RC4');\r
+ $this->mode = MCRYPT_RC4;\r
+ }\r
+ $this->encryptStream = mcrypt_module_open($this->mode, '', MCRYPT_MODE_STREAM, '');\r
+ $this->decryptStream = mcrypt_module_open($this->mode, '', MCRYPT_MODE_STREAM, '');\r
+\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Sets the key.\r
+ *\r
+ * Keys can be between 1 and 256 bytes long. If they are longer then 256 bytes, the first 256 bytes will\r
+ * be used. If no key is explicitly set, it'll be assumed to be a single null byte.\r
+ *\r
+ * @access public\r
+ * @param String $key\r
+ */\r
+ function setKey($key)\r
+ {\r
+ $this->key = $key;\r
+\r
+ if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT ) {\r
+ mcrypt_generic_init($this->encryptStream, $this->key, '');\r
+ mcrypt_generic_init($this->decryptStream, $this->key, '');\r
+ return;\r
+ }\r
+\r
+ $keyLength = strlen($key);\r
+ $keyStream = array();\r
+ for ($i = 0; $i < 256; $i++) {\r
+ $keyStream[$i] = $i;\r
+ }\r
+ $j = 0;\r
+ for ($i = 0; $i < 256; $i++) {\r
+ $j = ($j + $keyStream[$i] + ord($key[$i % $keyLength])) & 255;\r
+ $temp = $keyStream[$i];\r
+ $keyStream[$i] = $keyStream[$j];\r
+ $keyStream[$j] = $temp;\r
+ }\r
+\r
+ $this->encryptIndex = $this->decryptIndex = array(0, 0);\r
+ $this->encryptStream = $this->decryptStream = $keyStream;\r
+ }\r
+\r
+ /**\r
+ * Sets the password.\r
+ *\r
+ * Depending on what $method is set to, setPassword()'s (optional) parameters are as follows:\r
+ * {@link http://en.wikipedia.org/wiki/PBKDF2 pbkdf2}:\r
+ * $hash, $salt, $count, $dkLen\r
+ *\r
+ * @param String $password\r
+ * @param optional String $method\r
+ * @access public\r
+ */\r
+ function setPassword($password, $method = 'pbkdf2')\r
+ {\r
+ $key = '';\r
+\r
+ switch ($method) {\r
+ default: // 'pbkdf2'\r
+ list(, , $hash, $salt, $count) = func_get_args();\r
+ if (!isset($hash)) {\r
+ $hash = 'sha1';\r
+ }\r
+ // WPA and WPA2 use the SSID as the salt\r
+ if (!isset($salt)) {\r
+ $salt = 'phpseclib/salt';\r
+ }\r
+ // RFC2898#section-4.2 uses 1,000 iterations by default\r
+ // WPA and WPA2 use 4,096.\r
+ if (!isset($count)) {\r
+ $count = 1000;\r
+ }\r
+ if (!isset($dkLen)) {\r
+ $dkLen = 128;\r
+ }\r
+\r
+ if (!class_exists('Crypt_Hash')) {\r
+ require_once('Crypt/Hash.php');\r
+ }\r
+\r
+ $i = 1;\r
+ while (strlen($key) < $dkLen) {\r
+ //$dk.= $this->_pbkdf($password, $salt, $count, $i++);\r
+ $hmac = new Crypt_Hash();\r
+ $hmac->setHash($hash);\r
+ $hmac->setKey($password);\r
+ $f = $u = $hmac->hash($salt . pack('N', $i++));\r
+ for ($j = 2; $j <= $count; $j++) {\r
+ $u = $hmac->hash($u);\r
+ $f^= $u;\r
+ }\r
+ $key.= $f;\r
+ }\r
+ }\r
+\r
+ $this->setKey(substr($key, 0, $dkLen));\r
+ }\r
+\r
+ /**\r
+ * Dummy function.\r
+ *\r
+ * Some protocols, such as WEP, prepend an "initialization vector" to the key, effectively creating a new key [1].\r
+ * If you need to use an initialization vector in this manner, feel free to prepend it to the key, yourself, before\r
+ * calling setKey().\r
+ *\r
+ * [1] WEP's initialization vectors (IV's) are used in a somewhat insecure way. Since, in that protocol,\r
+ * the IV's are relatively easy to predict, an attack described by\r
+ * {@link http://www.drizzle.com/~aboba/IEEE/rc4_ksaproc.pdf Scott Fluhrer, Itsik Mantin, and Adi Shamir}\r
+ * can be used to quickly guess at the rest of the key. The following links elaborate:\r
+ *\r
+ * {@link http://www.rsa.com/rsalabs/node.asp?id=2009 http://www.rsa.com/rsalabs/node.asp?id=2009}\r
+ * {@link http://en.wikipedia.org/wiki/Related_key_attack http://en.wikipedia.org/wiki/Related_key_attack}\r
+ *\r
+ * @param String $iv\r
+ * @see Crypt_RC4::setKey()\r
+ * @access public\r
+ */\r
+ function setIV($iv)\r
+ {\r
+ }\r
+\r
+ /**\r
+ * Encrypts a message.\r
+ *\r
+ * @see Crypt_RC4::_crypt()\r
+ * @access public\r
+ * @param String $plaintext\r
+ */\r
+ function encrypt($plaintext)\r
+ {\r
+ return $this->_crypt($plaintext, CRYPT_RC4_ENCRYPT);\r
+ }\r
+\r
+ /**\r
+ * Decrypts a message.\r
+ *\r
+ * $this->decrypt($this->encrypt($plaintext)) == $this->encrypt($this->encrypt($plaintext)).\r
+ * Atleast if the continuous buffer is disabled.\r
+ *\r
+ * @see Crypt_RC4::_crypt()\r
+ * @access public\r
+ * @param String $ciphertext\r
+ */\r
+ function decrypt($ciphertext)\r
+ {\r
+ return $this->_crypt($ciphertext, CRYPT_RC4_DECRYPT);\r
+ }\r
+\r
+ /**\r
+ * Encrypts or decrypts a message.\r
+ *\r
+ * @see Crypt_RC4::encrypt()\r
+ * @see Crypt_RC4::decrypt()\r
+ * @access private\r
+ * @param String $text\r
+ * @param Integer $mode\r
+ */\r
+ function _crypt($text, $mode)\r
+ {\r
+ if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT ) {\r
+ $keyStream = $mode == CRYPT_RC4_ENCRYPT ? 'encryptStream' : 'decryptStream';\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->$keyStream, $this->key, '');\r
+ }\r
+\r
+ return mcrypt_generic($this->$keyStream, $text);\r
+ }\r
+\r
+ if ($this->encryptStream === false) {\r
+ $this->setKey($this->key);\r
+ }\r
+\r
+ switch ($mode) {\r
+ case CRYPT_RC4_ENCRYPT:\r
+ $keyStream = $this->encryptStream;\r
+ list($i, $j) = $this->encryptIndex;\r
+ break;\r
+ case CRYPT_RC4_DECRYPT:\r
+ $keyStream = $this->decryptStream;\r
+ list($i, $j) = $this->decryptIndex;\r
+ }\r
+\r
+ $newText = '';\r
+ for ($k = 0; $k < strlen($text); $k++) {\r
+ $i = ($i + 1) & 255;\r
+ $j = ($j + $keyStream[$i]) & 255;\r
+ $temp = $keyStream[$i];\r
+ $keyStream[$i] = $keyStream[$j];\r
+ $keyStream[$j] = $temp;\r
+ $temp = $keyStream[($keyStream[$i] + $keyStream[$j]) & 255];\r
+ $newText.= chr(ord($text[$k]) ^ $temp);\r
+ }\r
+\r
+ if ($this->continuousBuffer) {\r
+ switch ($mode) {\r
+ case CRYPT_RC4_ENCRYPT:\r
+ $this->encryptStream = $keyStream;\r
+ $this->encryptIndex = array($i, $j);\r
+ break;\r
+ case CRYPT_RC4_DECRYPT:\r
+ $this->decryptStream = $keyStream;\r
+ $this->decryptIndex = array($i, $j);\r
+ }\r
+ }\r
+\r
+ return $newText;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive "packets" as if they are a continuous buffer.\r
+ *\r
+ * Say you have a 16-byte plaintext $plaintext. Using the default behavior, the two following code snippets\r
+ * will yield different outputs:\r
+ *\r
+ * <code>\r
+ * echo $rc4->encrypt(substr($plaintext, 0, 8));\r
+ * echo $rc4->encrypt(substr($plaintext, 8, 8));\r
+ * </code>\r
+ * <code>\r
+ * echo $rc4->encrypt($plaintext);\r
+ * </code>\r
+ *\r
+ * The solution is to enable the continuous buffer. Although this will resolve the above discrepancy, it creates\r
+ * another, as demonstrated with the following:\r
+ *\r
+ * <code>\r
+ * $rc4->encrypt(substr($plaintext, 0, 8));\r
+ * echo $rc4->decrypt($des->encrypt(substr($plaintext, 8, 8)));\r
+ * </code>\r
+ * <code>\r
+ * echo $rc4->decrypt($des->encrypt(substr($plaintext, 8, 8)));\r
+ * </code>\r
+ *\r
+ * With the continuous buffer disabled, these would yield the same output. With it enabled, they yield different\r
+ * outputs. The reason is due to the fact that the initialization vector's change after every encryption /\r
+ * decryption round when the continuous buffer is enabled. When it's disabled, they remain constant.\r
+ *\r
+ * Put another way, when the continuous buffer is enabled, the state of the Crypt_DES() object changes after each\r
+ * encryption / decryption round, whereas otherwise, it'd remain constant. For this reason, it's recommended that\r
+ * continuous buffers not be used. They do offer better security and are, in fact, sometimes required (SSH uses them),\r
+ * however, they are also less intuitive and more likely to cause you problems.\r
+ *\r
+ * @see Crypt_RC4::disableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function enableContinuousBuffer()\r
+ {\r
+ if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_MCRYPT ) {\r
+ mcrypt_generic_init($this->encryptStream, $this->key, '');\r
+ mcrypt_generic_init($this->decryptStream, $this->key, '');\r
+ }\r
+\r
+ $this->continuousBuffer = true;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive packets as if they are a discontinuous buffer.\r
+ *\r
+ * The default behavior.\r
+ *\r
+ * @see Crypt_RC4::enableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function disableContinuousBuffer()\r
+ {\r
+ if ( CRYPT_RC4_MODE == CRYPT_RC4_MODE_INTERNAL ) {\r
+ $this->encryptIndex = $this->decryptIndex = array(0, 0);\r
+ $this->encryptStream = $this->decryptStream = false;\r
+ }\r
+\r
+ $this->continuousBuffer = false;\r
+ }\r
+\r
+ /**\r
+ * Dummy function.\r
+ *\r
+ * Since RC4 is a stream cipher and not a block cipher, no padding is necessary. The only reason this function is\r
+ * included is so that you can switch between a block cipher and a stream cipher transparently.\r
+ *\r
+ * @see Crypt_RC4::disablePadding()\r
+ * @access public\r
+ */\r
+ function enablePadding()\r
+ {\r
+ }\r
+\r
+ /**\r
+ * Dummy function.\r
+ *\r
+ * @see Crypt_RC4::enablePadding()\r
+ * @access public\r
+ */\r
+ function disablePadding()\r
+ {\r
+ }\r
+}\r
+\r
+// vim: ts=4:sw=4:et:\r
+// vim6: fdl=1:\r
-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Pure-PHP PKCS#1 (v2.1) compliant implementation of RSA.
- *
- * PHP versions 4 and 5
- *
- * Here's an example of how to encrypt and decrypt text with this library:
- * <code>
- * <?php
- * include('Crypt/RSA.php');
- *
- * $rsa = new Crypt_RSA();
- * extract($rsa->createKey());
- *
- * $plaintext = 'terrafrost';
- *
- * $rsa->loadKey($privatekey);
- * $ciphertext = $rsa->encrypt($plaintext);
- *
- * $rsa->loadKey($publickey);
- * echo $rsa->decrypt($ciphertext);
- * ?>
- * </code>
- *
- * Here's an example of how to create signatures and verify signatures with this library:
- * <code>
- * <?php
- * include('Crypt/RSA.php');
- *
- * $rsa = new Crypt_RSA();
- * extract($rsa->createKey());
- *
- * $plaintext = 'terrafrost';
- *
- * $rsa->loadKey($privatekey);
- * $signature = $rsa->sign($plaintext);
- *
- * $rsa->loadKey($publickey);
- * echo $rsa->verify($plaintext, $signature) ? 'verified' : 'unverified';
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Crypt
- * @package Crypt_RSA
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMIX Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: RSA.php,v 1.14 2010/03/01 17:28:19 terrafrost Exp $
- * @link http://phpseclib.sourceforge.net
- */
-
-/**
- * Include Math_BigInteger
- */
-require_once('Math/BigInteger.php');
-
-/**
- * Include Crypt_Random
- */
-require_once('Crypt/Random.php');
-
-/**
- * Include Crypt_Hash
- */
-require_once('Crypt/Hash.php');
-
-/**#@+
- * @access public
- * @see Crypt_RSA::encrypt()
- * @see Crypt_RSA::decrypt()
- */
-/**
- * Use {@link http://en.wikipedia.org/wiki/Optimal_Asymmetric_Encryption_Padding Optimal Asymmetric Encryption Padding}
- * (OAEP) for encryption / decryption.
- *
- * Uses sha1 by default.
- *
- * @see Crypt_RSA::setHash()
- * @see Crypt_RSA::setMGFHash()
- */
-define('CRYPT_RSA_ENCRYPTION_OAEP', 1);
-/**
- * Use PKCS#1 padding.
- *
- * Although CRYPT_RSA_ENCRYPTION_OAEP offers more security, including PKCS#1 padding is necessary for purposes of backwards
- * compatability with protocols (like SSH-1) written before OAEP's introduction.
- */
-define('CRYPT_RSA_ENCRYPTION_PKCS1', 2);
-/**#@-*/
-
-/**#@+
- * @access public
- * @see Crypt_RSA::sign()
- * @see Crypt_RSA::verify()
- * @see Crypt_RSA::setHash()
- */
-/**
- * Use the Probabilistic Signature Scheme for signing
- *
- * Uses sha1 by default.
- *
- * @see Crypt_RSA::setSaltLength()
- * @see Crypt_RSA::setMGFHash()
- */
-define('CRYPT_RSA_SIGNATURE_PSS', 1);
-/**
- * Use the PKCS#1 scheme by default.
- *
- * Although CRYPT_RSA_SIGNATURE_PSS offers more security, including PKCS#1 signing is necessary for purposes of backwards
- * compatability with protocols (like SSH-2) written before PSS's introduction.
- */
-define('CRYPT_RSA_SIGNATURE_PKCS1', 2);
-/**#@-*/
-
-/**#@+
- * @access private
- * @see Crypt_RSA::createKey()
- */
-/**
- * ASN1 Integer
- */
-define('CRYPT_RSA_ASN1_INTEGER', 2);
-/**
- * ASN1 Sequence (with the constucted bit set)
- */
-define('CRYPT_RSA_ASN1_SEQUENCE', 48);
-/**#@-*/
-
-/**#@+
- * @access private
- * @see Crypt_RSA::Crypt_RSA()
- */
-/**
- * To use the pure-PHP implementation
- */
-define('CRYPT_RSA_MODE_INTERNAL', 1);
-/**
- * To use the OpenSSL library
- *
- * (if enabled; otherwise, the internal implementation will be used)
- */
-define('CRYPT_RSA_MODE_OPENSSL', 2);
-/**#@-*/
-
-/**#@+
- * @access public
- * @see Crypt_RSA::createKey()
- * @see Crypt_RSA::setPrivateKeyFormat()
- */
-/**
- * PKCS#1 formatted private key
- *
- * Used by OpenSSH
- */
-define('CRYPT_RSA_PRIVATE_FORMAT_PKCS1', 0);
-/**#@-*/
-
-/**#@+
- * @access public
- * @see Crypt_RSA::createKey()
- * @see Crypt_RSA::setPublicKeyFormat()
- */
-/**
- * Raw public key
- *
- * An array containing two Math_BigInteger objects.
- *
- * The exponent can be indexed with any of the following:
- *
- * 0, e, exponent, publicExponent
- *
- * The modulus can be indexed with any of the following:
- *
- * 1, n, modulo, modulus
- */
-define('CRYPT_RSA_PUBLIC_FORMAT_RAW', 1);
-/**
- * PKCS#1 formatted public key
- */
-define('CRYPT_RSA_PUBLIC_FORMAT_PKCS1', 2);
-/**
- * OpenSSH formatted public key
- *
- * Place in $HOME/.ssh/authorized_keys
- */
-define('CRYPT_RSA_PUBLIC_FORMAT_OPENSSH', 3);
-/**#@-*/
-
-/**
- * Pure-PHP PKCS#1 compliant implementation of RSA.
- *
- * @author Jim Wigginton <terrafrost@php.net>
- * @version 0.1.0
- * @access public
- * @package Crypt_RSA
- */
-class Crypt_RSA {
- /**
- * Precomputed Zero
- *
- * @var Array
- * @access private
- */
- var $zero;
-
- /**
- * Precomputed One
- *
- * @var Array
- * @access private
- */
- var $one;
-
- /**
- * Private Key Format
- *
- * @var Integer
- * @access private
- */
- var $privateKeyFormat = CRYPT_RSA_PRIVATE_FORMAT_PKCS1;
-
- /**
- * Public Key Format
- *
- * @var Integer
- * @access public
- */
- var $publicKeyFormat = CRYPT_RSA_PUBLIC_FORMAT_PKCS1;
-
- /**
- * Modulus (ie. n)
- *
- * @var Math_BigInteger
- * @access private
- */
- var $modulus;
-
- /**
- * Modulus length
- *
- * @var Math_BigInteger
- * @access private
- */
- var $k;
-
- /**
- * Exponent (ie. e or d)
- *
- * @var Math_BigInteger
- * @access private
- */
- var $exponent;
-
- /**
- * Primes for Chinese Remainder Theorem (ie. p and q)
- *
- * @var Array
- * @access private
- */
- var $primes;
-
- /**
- * Exponents for Chinese Remainder Theorem (ie. dP and dQ)
- *
- * @var Array
- * @access private
- */
- var $exponents;
-
- /**
- * Coefficients for Chinese Remainder Theorem (ie. qInv)
- *
- * @var Array
- * @access private
- */
- var $coefficients;
-
- /**
- * Hash name
- *
- * @var String
- * @access private
- */
- var $hashName;
-
- /**
- * Hash function
- *
- * @var Crypt_Hash
- * @access private
- */
- var $hash;
-
- /**
- * Length of hash function output
- *
- * @var Integer
- * @access private
- */
- var $hLen;
-
- /**
- * Length of salt
- *
- * @var Integer
- * @access private
- */
- var $sLen;
-
- /**
- * Hash function for the Mask Generation Function
- *
- * @var Crypt_Hash
- * @access private
- */
- var $mgfHash;
-
- /**
- * Length of MGF hash function output
- *
- * @var Integer
- * @access private
- */
- var $mgfHLen;
-
- /**
- * Encryption mode
- *
- * @var Integer
- * @access private
- */
- var $encryptionMode = CRYPT_RSA_ENCRYPTION_OAEP;
-
- /**
- * Signature mode
- *
- * @var Integer
- * @access private
- */
- var $signatureMode = CRYPT_RSA_SIGNATURE_PSS;
-
- /**
- * Public Exponent
- *
- * @var Mixed
- * @access private
- */
- var $publicExponent = false;
-
- /**
- * Password
- *
- * @var String
- * @access private
- */
- var $password = '';
-
- /**
- * The constructor
- *
- * If you want to make use of the openssl extension, you'll need to set the mode manually, yourself. The reason
- * 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.
- *
- * @return Crypt_RSA
- * @access public
- */
- function Crypt_RSA()
- {
- if ( !defined('CRYPT_RSA_MODE') ) {
- switch (true) {
- //case extension_loaded('openssl') && version_compare(PHP_VERSION, '4.2.0', '>='):
- // define('CRYPT_RSA_MODE', CRYPT_RSA_MODE_OPENSSL);
- // break;
- default:
- define('CRYPT_RSA_MODE', CRYPT_RSA_MODE_INTERNAL);
- }
- }
-
- $this->zero = new Math_BigInteger();
- $this->one = new Math_BigInteger(1);
-
- $this->hash = new Crypt_Hash('sha1');
- $this->hLen = $this->hash->getLength();
- $this->hashName = 'sha1';
- $this->mgfHash = new Crypt_Hash('sha1');
- $this->mgfHLen = $this->mgfHash->getLength();
- }
-
- /**
- * Create public / private key pair
- *
- * Returns an array with the following three elements:
- * - 'privatekey': The private key.
- * - 'publickey': The public key.
- * - 'partialkey': A partially computed key (if the execution time exceeded $timeout).
- * Will need to be passed back to Crypt_RSA::createKey() as the third parameter for further processing.
- *
- * @access public
- * @param optional Integer $bits
- * @param optional Integer $timeout
- * @param optional Math_BigInteger $p
- */
- function createKey($bits = 1024, $timeout = false, $partial = array())
- {
- if ( CRYPT_RSA_MODE == CRYPT_RSA_MODE_OPENSSL ) {
- $rsa = openssl_pkey_new(array('private_key_bits' => $bits));
- openssl_pkey_export($rsa, $privatekey);
- $publickey = openssl_pkey_get_details($rsa);
- $publickey = $publickey['key'];
-
- if ($this->privateKeyFormat != CRYPT_RSA_PRIVATE_FORMAT_PKCS1) {
- $privatekey = call_user_func_array(array($this, '_convertPrivateKey'), array_values($this->_parseKey($privatekey, CRYPT_RSA_PRIVATE_FORMAT_PKCS1)));
- $publickey = call_user_func_array(array($this, '_convertPublicKey'), array_values($this->_parseKey($publickey, CRYPT_RSA_PUBLIC_FORMAT_PKCS1)));
- }
-
- return array(
- 'privatekey' => $privatekey,
- 'publickey' => $publickey,
- 'partialkey' => false
- );
- }
-
- static $e;
- if (!isset($e)) {
- if (!defined('CRYPT_RSA_EXPONENT')) {
- // http://en.wikipedia.org/wiki/65537_%28number%29
- define('CRYPT_RSA_EXPONENT', '65537');
- }
- if (!defined('CRYPT_RSA_COMMENT')) {
- define('CRYPT_RSA_COMMENT', 'phpseclib-generated-key');
- }
- // per <http://cseweb.ucsd.edu/~hovav/dist/survey.pdf#page=5>, this number ought not result in primes smaller
- // than 256 bits.
- if (!defined('CRYPT_RSA_SMALLEST_PRIME')) {
- define('CRYPT_RSA_SMALLEST_PRIME', 4096);
- }
-
- $e = new Math_BigInteger(CRYPT_RSA_EXPONENT);
- }
-
- extract($this->_generateMinMax($bits));
- $absoluteMin = $min;
- $temp = $bits >> 1;
- if ($temp > CRYPT_RSA_SMALLEST_PRIME) {
- $num_primes = floor($bits / CRYPT_RSA_SMALLEST_PRIME);
- $temp = CRYPT_RSA_SMALLEST_PRIME;
- } else {
- $num_primes = 2;
- }
- extract($this->_generateMinMax($temp + $bits % $temp));
- $finalMax = $max;
- extract($this->_generateMinMax($temp));
-
- $generator = new Math_BigInteger();
- $generator->setRandomGenerator('crypt_random');
-
- $n = $this->one->copy();
- if (!empty($partial)) {
- extract(unserialize($partial));
- } else {
- $exponents = $coefficients = $primes = array();
- $lcm = array(
- 'top' => $this->one->copy(),
- 'bottom' => false
- );
- }
-
- $start = time();
- $i0 = count($primes) + 1;
-
- do {
- for ($i = $i0; $i <= $num_primes; $i++) {
- if ($timeout !== false) {
- $timeout-= time() - $start;
- $start = time();
- if ($timeout <= 0) {
- return serialize(array(
- 'privatekey' => '',
- 'publickey' => '',
- 'partialkey' => array(
- 'primes' => $primes,
- 'coefficients' => $coefficients,
- 'lcm' => $lcm,
- 'exponents' => $exponents
- )
- ));
- }
- }
-
- if ($i == $num_primes) {
- list($min, $temp) = $absoluteMin->divide($n);
- if (!$temp->equals($this->zero)) {
- $min = $min->add($this->one); // ie. ceil()
- }
- $primes[$i] = $generator->randomPrime($min, $finalMax, $timeout);
- } else {
- $primes[$i] = $generator->randomPrime($min, $max, $timeout);
- }
-
- if ($primes[$i] === false) { // if we've reached the timeout
- return array(
- 'privatekey' => '',
- 'publickey' => '',
- 'partialkey' => empty($primes) ? '' : serialize(array(
- 'primes' => array_slice($primes, 0, $i - 1),
- 'coefficients' => $coefficients,
- 'lcm' => $lcm,
- 'exponents' => $exponents
- ))
- );
- }
-
- // the first coefficient is calculated differently from the rest
- // ie. instead of being $primes[1]->modInverse($primes[2]), it's $primes[2]->modInverse($primes[1])
- if ($i > 2) {
- $coefficients[$i] = $n->modInverse($primes[$i]);
- }
-
- $n = $n->multiply($primes[$i]);
-
- $temp = $primes[$i]->subtract($this->one);
-
- // textbook RSA implementations use Euler's totient function instead of the least common multiple.
- // see http://en.wikipedia.org/wiki/Euler%27s_totient_function
- $lcm['top'] = $lcm['top']->multiply($temp);
- $lcm['bottom'] = $lcm['bottom'] === false ? $temp : $lcm['bottom']->gcd($temp);
-
- $exponents[$i] = $e->modInverse($temp);
- }
-
- list($lcm) = $lcm['top']->divide($lcm['bottom']);
- $gcd = $lcm->gcd($e);
- $i0 = 1;
- } while (!$gcd->equals($this->one));
-
- $d = $e->modInverse($lcm);
-
- $coefficients[2] = $primes[2]->modInverse($primes[1]);
-
- // from <http://tools.ietf.org/html/rfc3447#appendix-A.1.2>:
- // RSAPrivateKey ::= SEQUENCE {
- // version Version,
- // modulus INTEGER, -- n
- // publicExponent INTEGER, -- e
- // privateExponent INTEGER, -- d
- // prime1 INTEGER, -- p
- // prime2 INTEGER, -- q
- // exponent1 INTEGER, -- d mod (p-1)
- // exponent2 INTEGER, -- d mod (q-1)
- // coefficient INTEGER, -- (inverse of q) mod p
- // otherPrimeInfos OtherPrimeInfos OPTIONAL
- // }
-
- return array(
- 'privatekey' => $this->_convertPrivateKey($n, $e, $d, $primes, $exponents, $coefficients),
- 'publickey' => $this->_convertPublicKey($n, $e),
- 'partialkey' => false
- );
- }
-
- /**
- * Convert a private key to the appropriate format.
- *
- * @access private
- * @see setPrivateKeyFormat()
- * @param String $RSAPrivateKey
- * @return String
- */
- function _convertPrivateKey($n, $e, $d, $primes, $exponents, $coefficients)
- {
- $num_primes = count($primes);
- $raw = array(
- 'version' => $num_primes == 2 ? chr(0) : chr(1), // two-prime vs. multi
- 'modulus' => $n->toBytes(true),
- 'publicExponent' => $e->toBytes(true),
- 'privateExponent' => $d->toBytes(true),
- 'prime1' => $primes[1]->toBytes(true),
- 'prime2' => $primes[2]->toBytes(true),
- 'exponent1' => $exponents[1]->toBytes(true),
- 'exponent2' => $exponents[2]->toBytes(true),
- 'coefficient' => $coefficients[2]->toBytes(true)
- );
-
- // if the format in question does not support multi-prime rsa and multi-prime rsa was used,
- // call _convertPublicKey() instead.
- switch ($this->privateKeyFormat) {
- default: // eg. CRYPT_RSA_PRIVATE_FORMAT_PKCS1
- $components = array();
- foreach ($raw as $name => $value) {
- $components[$name] = pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($value)), $value);
- }
-
- $RSAPrivateKey = implode('', $components);
-
- if ($num_primes > 2) {
- $OtherPrimeInfos = '';
- for ($i = 3; $i <= $num_primes; $i++) {
- // OtherPrimeInfos ::= SEQUENCE SIZE(1..MAX) OF OtherPrimeInfo
- //
- // OtherPrimeInfo ::= SEQUENCE {
- // prime INTEGER, -- ri
- // exponent INTEGER, -- di
- // coefficient INTEGER -- ti
- // }
- $OtherPrimeInfo = pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($primes[$i]->toBytes(true))), $primes[$i]->toBytes(true));
- $OtherPrimeInfo.= pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($exponents[$i]->toBytes(true))), $exponents[$i]->toBytes(true));
- $OtherPrimeInfo.= pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($coefficients[$i]->toBytes(true))), $coefficients[$i]->toBytes(true));
- $OtherPrimeInfos.= pack('Ca*a*', CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($OtherPrimeInfo)), $OtherPrimeInfo);
- }
- $RSAPrivateKey.= pack('Ca*a*', CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($OtherPrimeInfos)), $OtherPrimeInfos);
- }
-
- $RSAPrivateKey = pack('Ca*a*', CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($RSAPrivateKey)), $RSAPrivateKey);
-
- if (!empty($this->password)) {
- $iv = $this->_random(8);
- $symkey = pack('H*', md5($this->password . $iv)); // symkey is short for symmetric key
- $symkey.= substr(pack('H*', md5($symkey . $this->password . $iv)), 0, 8);
- if (!class_exists('Crypt_TripleDES')) {
- require_once('Crypt/TripleDES.php');
- }
- $des = new Crypt_TripleDES();
- $des->setKey($symkey);
- $des->setIV($iv);
- $iv = strtoupper(bin2hex($iv));
- $RSAPrivateKey = "-----BEGIN RSA PRIVATE KEY-----\r\n" .
- "Proc-Type: 4,ENCRYPTED\r\n" .
- "DEK-Info: DES-EDE3-CBC,$iv\r\n" .
- "\r\n" .
- chunk_split(base64_encode($des->encrypt($RSAPrivateKey))) .
- '-----END RSA PRIVATE KEY-----';
- } else {
- $RSAPrivateKey = "-----BEGIN RSA PRIVATE KEY-----\r\n" .
- chunk_split(base64_encode($RSAPrivateKey)) .
- '-----END RSA PRIVATE KEY-----';
- }
-
- return $RSAPrivateKey;
- }
- }
-
- /**
- * Convert a public key to the appropriate format
- *
- * @access private
- * @see setPublicKeyFormat()
- * @param String $RSAPrivateKey
- * @return String
- */
- function _convertPublicKey($n, $e)
- {
- $modulus = $n->toBytes(true);
- $publicExponent = $e->toBytes(true);
-
- switch ($this->publicKeyFormat) {
- case CRYPT_RSA_PUBLIC_FORMAT_RAW:
- return array('e' => $e->copy(), 'n' => $n->copy());
- case CRYPT_RSA_PUBLIC_FORMAT_OPENSSH:
- // from <http://tools.ietf.org/html/rfc4253#page-15>:
- // string "ssh-rsa"
- // mpint e
- // mpint n
- $RSAPublicKey = pack('Na*Na*Na*', strlen('ssh-rsa'), 'ssh-rsa', strlen($publicExponent), $publicExponent, strlen($modulus), $modulus);
- $RSAPublicKey = 'ssh-rsa ' . base64_encode($RSAPublicKey) . ' ' . CRYPT_RSA_COMMENT;
-
- return $RSAPublicKey;
- default: // eg. CRYPT_RSA_PUBLIC_FORMAT_PKCS1
- // from <http://tools.ietf.org/html/rfc3447#appendix-A.1.1>:
- // RSAPublicKey ::= SEQUENCE {
- // modulus INTEGER, -- n
- // publicExponent INTEGER -- e
- // }
- $components = array(
- 'modulus' => pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($modulus)), $modulus),
- 'publicExponent' => pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($publicExponent)), $publicExponent)
- );
-
- $RSAPublicKey = pack('Ca*a*a*',
- CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($components['modulus']) + strlen($components['publicExponent'])),
- $components['modulus'], $components['publicExponent']
- );
-
- $RSAPublicKey = "-----BEGIN PUBLIC KEY-----\r\n" .
- chunk_split(base64_encode($RSAPublicKey)) .
- '-----END PUBLIC KEY-----';
-
- return $RSAPublicKey;
- }
- }
-
- /**
- * Break a public or private key down into its constituant components
- *
- * @access private
- * @see _convertPublicKey()
- * @see _convertPrivateKey()
- * @param String $key
- * @param Integer $type
- * @return Array
- */
- function _parseKey($key, $type)
- {
- switch ($type) {
- case CRYPT_RSA_PUBLIC_FORMAT_RAW:
- if (!is_array($key)) {
- return false;
- }
- $components = array();
- switch (true) {
- case isset($key['e']):
- $components['publicExponent'] = $key['e']->copy();
- break;
- case isset($key['exponent']):
- $components['publicExponent'] = $key['exponent']->copy();
- break;
- case isset($key['publicExponent']):
- $components['publicExponent'] = $key['publicExponent']->copy();
- break;
- case isset($key[0]):
- $components['publicExponent'] = $key[0]->copy();
- }
- switch (true) {
- case isset($key['n']):
- $components['modulus'] = $key['n']->copy();
- break;
- case isset($key['modulo']):
- $components['modulus'] = $key['modulo']->copy();
- break;
- case isset($key['modulus']):
- $components['modulus'] = $key['modulus']->copy();
- break;
- case isset($key[1]):
- $components['modulus'] = $key[1]->copy();
- }
- return $components;
- case CRYPT_RSA_PRIVATE_FORMAT_PKCS1:
- case CRYPT_RSA_PUBLIC_FORMAT_PKCS1:
- /* Although PKCS#1 proposes a format that public and private keys can use, encrypting them is
- "outside the scope" of PKCS#1. PKCS#1 then refers you to PKCS#12 and PKCS#15 if you're wanting to
- protect private keys, however, that's not what OpenSSL* does. OpenSSL protects private keys by adding
- two new "fields" to the key - DEK-Info and Proc-Type. These fields are discussed here:
-
- http://tools.ietf.org/html/rfc1421#section-4.6.1.1
- http://tools.ietf.org/html/rfc1421#section-4.6.1.3
-
- DES-EDE3-CBC as an algorithm, however, is not discussed anywhere, near as I can tell.
- DES-CBC and DES-EDE are discussed in RFC1423, however, DES-EDE3-CBC isn't, nor is its key derivation
- function. As is, the definitive authority on this encoding scheme isn't the IETF but rather OpenSSL's
- own implementation. ie. the implementation *is* the standard and any bugs that may exist in that
- implementation are part of the standard, as well.
-
- * OpenSSL is the de facto standard. It's utilized by OpenSSH and other projects */
- if (preg_match('#DEK-Info: (.+),(.+)#', $key, $matches)) {
- $iv = pack('H*', trim($matches[2]));
- $symkey = pack('H*', md5($this->password . $iv)); // symkey is short for symmetric key
- $symkey.= substr(pack('H*', md5($symkey . $this->password . $iv)), 0, 8);
- $ciphertext = preg_replace('#.+(\r|\n|\r\n)\1|[\r\n]|-.+-#s', '', $key);
- $ciphertext = preg_match('#^[a-zA-Z\d/+]*={0,2}$#', $ciphertext) ? base64_decode($ciphertext) : false;
- if ($ciphertext === false) {
- $ciphertext = $key;
- }
- switch ($matches[1]) {
- case 'DES-EDE3-CBC':
- if (!class_exists('Crypt_TripleDES')) {
- require_once('Crypt/TripleDES.php');
- }
- $crypto = new Crypt_TripleDES();
- break;
- case 'DES-CBC':
- if (!class_exists('Crypt_DES')) {
- require_once('Crypt/DES.php');
- }
- $crypto = new Crypt_DES();
- break;
- default:
- return false;
- }
- $crypto->setKey($symkey);
- $crypto->setIV($iv);
- $decoded = $crypto->decrypt($ciphertext);
- } else {
- $decoded = preg_replace('#-.+-|[\r\n]#', '', $key);
- $decoded = preg_match('#^[a-zA-Z\d/+]*={0,2}$#', $decoded) ? base64_decode($decoded) : false;
- }
-
- if ($decoded !== false) {
- $key = $decoded;
- }
-
- $components = array();
-
- if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_SEQUENCE) {
- return false;
- }
- if ($this->_decodeLength($key) != strlen($key)) {
- return false;
- }
-
- $tag = ord($this->_string_shift($key));
- if ($tag == CRYPT_RSA_ASN1_SEQUENCE) {
- /* intended for keys for which OpenSSL's asn1parse returns the following:
-
- 0:d=0 hl=4 l= 290 cons: SEQUENCE
- 4:d=1 hl=2 l= 13 cons: SEQUENCE
- 6:d=2 hl=2 l= 9 prim: OBJECT :rsaEncryption
- 17:d=2 hl=2 l= 0 prim: NULL
- 19:d=1 hl=4 l= 271 prim: BIT STRING */
- $this->_string_shift($key, $this->_decodeLength($key));
- $this->_string_shift($key); // skip over the BIT STRING tag
- $this->_decodeLength($key); // skip over the BIT 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 teh 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)
- $this->_string_shift($key);
- if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_SEQUENCE) {
- return false;
- }
- if ($this->_decodeLength($key) != strlen($key)) {
- return false;
- }
- $tag = ord($this->_string_shift($key));
- }
- if ($tag != CRYPT_RSA_ASN1_INTEGER) {
- return false;
- }
-
- $length = $this->_decodeLength($key);
- $temp = $this->_string_shift($key, $length);
- if (strlen($temp) != 1 || ord($temp) > 2) {
- $components['modulus'] = new Math_BigInteger($temp, -256);
- $this->_string_shift($key); // skip over CRYPT_RSA_ASN1_INTEGER
- $length = $this->_decodeLength($key);
- $components[$type == CRYPT_RSA_PUBLIC_FORMAT_PKCS1 ? 'publicExponent' : 'privateExponent'] = new Math_BigInteger($this->_string_shift($key, $length), -256);
-
- return $components;
- }
- if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_INTEGER) {
- return false;
- }
- $length = $this->_decodeLength($key);
- $components['modulus'] = new Math_BigInteger($this->_string_shift($key, $length), -256);
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['publicExponent'] = new Math_BigInteger($this->_string_shift($key, $length), -256);
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['privateExponent'] = new Math_BigInteger($this->_string_shift($key, $length), -256);
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['primes'] = array(1 => new Math_BigInteger($this->_string_shift($key, $length), -256));
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['primes'][] = new Math_BigInteger($this->_string_shift($key, $length), -256);
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['exponents'] = array(1 => new Math_BigInteger($this->_string_shift($key, $length), -256));
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['exponents'][] = new Math_BigInteger($this->_string_shift($key, $length), -256);
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['coefficients'] = array(2 => new Math_BigInteger($this->_string_shift($key, $length), -256));
-
- if (!empty($key)) {
- if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_SEQUENCE) {
- return false;
- }
- $this->_decodeLength($key);
- while (!empty($key)) {
- if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_SEQUENCE) {
- return false;
- }
- $this->_decodeLength($key);
- $key = substr($key, 1);
- $length = $this->_decodeLength($key);
- $components['primes'][] = new Math_BigInteger($this->_string_shift($key, $length), -256);
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['exponents'][] = new Math_BigInteger($this->_string_shift($key, $length), -256);
- $this->_string_shift($key);
- $length = $this->_decodeLength($key);
- $components['coefficients'][] = new Math_BigInteger($this->_string_shift($key, $length), -256);
- }
- }
-
- return $components;
- case CRYPT_RSA_PUBLIC_FORMAT_OPENSSH:
- $key = base64_decode(preg_replace('#^ssh-rsa | .+$#', '', $key));
- if ($key === false) {
- return false;
- }
-
- $cleanup = substr($key, 0, 11) == "\0\0\0\7ssh-rsa";
-
- extract(unpack('Nlength', $this->_string_shift($key, 4)));
- $publicExponent = new Math_BigInteger($this->_string_shift($key, $length), -256);
- extract(unpack('Nlength', $this->_string_shift($key, 4)));
- $modulus = new Math_BigInteger($this->_string_shift($key, $length), -256);
-
- if ($cleanup && strlen($key)) {
- extract(unpack('Nlength', $this->_string_shift($key, 4)));
- return array(
- 'modulus' => new Math_BigInteger($this->_string_shift($key, $length), -256),
- 'publicExponent' => $modulus
- );
- } else {
- return array(
- 'modulus' => $modulus,
- 'publicExponent' => $publicExponent
- );
- }
- }
- }
-
- /**
- * 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 $key
- * @param Integer $type optional
- */
- function loadKey($key, $type = CRYPT_RSA_PRIVATE_FORMAT_PKCS1)
- {
- $components = $this->_parseKey($key, $type);
- if ($components === false) {
- return false;
- }
-
- $this->modulus = $components['modulus'];
- $this->k = strlen($this->modulus->toBytes());
- $this->exponent = isset($components['privateExponent']) ? $components['privateExponent'] : $components['publicExponent'];
- if (isset($components['primes'])) {
- $this->primes = $components['primes'];
- $this->exponents = $components['exponents'];
- $this->coefficients = $components['coefficients'];
- $this->publicExponent = $components['publicExponent'];
- } else {
- $this->primes = array();
- $this->exponents = array();
- $this->coefficients = array();
- $this->publicExponent = false;
- }
-
- return true;
- }
-
- /**
- * Sets the password
- *
- * Private keys can be encrypted with a password. To unset the password, pass in the empty string or false.
- * Or rather, pass in $password such that empty($password) is true.
- *
- * @see createKey()
- * @see loadKey()
- * @access public
- * @param String $password
- */
- function setPassword($password)
- {
- $this->password = $password;
- }
-
- /**
- * Defines the public key
- *
- * Some private key formats define the public exponent and some don't. Those that don't define it are problematic when
- * used in certain contexts. For example, in SSH-2, RSA authentication works by sending the public key along with a
- * message signed by the private key to the server. The SSH-2 server looks the public key up in an index of public keys
- * and if it's present then proceeds to verify the signature. Problem is, if your private key doesn't include the public
- * exponent this won't work unless you manually add the public exponent.
- *
- * Do note that when a new key is loaded the index will be cleared.
- *
- * Returns true on success, false on failure
- *
- * @see getPublicKey()
- * @access public
- * @param String $key
- * @param Integer $type optional
- * @return Boolean
- */
- function setPublicKey($key, $type = CRYPT_RSA_PUBLIC_FORMAT_PKCS1)
- {
- $components = $this->_parseKey($key, $type);
- if (empty($this->modulus) || !$this->modulus->equals($components['modulus'])) {
- return false;
- }
- $this->publicExponent = $components['publicExponent'];
- }
-
- /**
- * Returns the public key
- *
- * The public key is only returned under two circumstances - if the private key had the public key embedded within it
- * or if the public key was set via setPublicKey(). If the currently loaded key is supposed to be the public key this
- * function won't return it since this library, for the most part, doesn't distinguish between public and private keys.
- *
- * @see getPublicKey()
- * @access public
- * @param String $key
- * @param Integer $type optional
- */
- function getPublicKey($type = CRYPT_RSA_PUBLIC_FORMAT_PKCS1)
- {
- if (empty($this->modulus) || empty($this->publicExponent)) {
- return false;
- }
-
- $oldFormat = $this->publicKeyFormat;
- $this->publicKeyFormat = $type;
- $temp = $this->_convertPublicKey($this->modulus, $this->publicExponent);
- $this->publicKeyFormat = $oldFormat;
- return $temp;
- }
-
- /**
- * Generates the smallest and largest numbers requiring $bits bits
- *
- * @access private
- * @param Integer $bits
- * @return Array
- */
- function _generateMinMax($bits)
- {
- $bytes = $bits >> 3;
- $min = str_repeat(chr(0), $bytes);
- $max = str_repeat(chr(0xFF), $bytes);
- $msb = $bits & 7;
- if ($msb) {
- $min = chr(1 << ($msb - 1)) . $min;
- $max = chr((1 << $msb) - 1) . $max;
- } else {
- $min[0] = chr(0x80);
- }
-
- return array(
- 'min' => new Math_BigInteger($min, 256),
- 'max' => new Math_BigInteger($max, 256)
- );
- }
-
- /**
- * 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 § 8.1.3} for more information.
- *
- * @access private
- * @param String $string
- * @return Integer
- */
- 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;
- }
-
- /**
- * DER-encode 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 § 8.1.3} for more information.
- *
- * @access private
- * @param Integer $length
- * @return String
- */
- function _encodeLength($length)
- {
- if ($length <= 0x7F) {
- return chr($length);
- }
-
- $temp = ltrim(pack('N', $length), chr(0));
- return pack('Ca*', 0x80 | strlen($temp), $temp);
- }
-
- /**
- * String Shift
- *
- * Inspired by array_shift
- *
- * @param String $string
- * @param optional Integer $index
- * @return String
- * @access private
- */
- function _string_shift(&$string, $index = 1)
- {
- $substr = substr($string, 0, $index);
- $string = substr($string, $index);
- return $substr;
- }
-
- /**
- * Determines the private key format
- *
- * @see createKey()
- * @access public
- * @param Integer $format
- */
- function setPrivateKeyFormat($format)
- {
- $this->privateKeyFormat = $format;
- }
-
- /**
- * Determines the public key format
- *
- * @see createKey()
- * @access public
- * @param Integer $format
- */
- function setPublicKeyFormat($format)
- {
- $this->publicKeyFormat = $format;
- }
-
- /**
- * Determines which hashing function should be used
- *
- * Used with signature production / verification and (if the encryption mode is CRYPT_RSA_ENCRYPTION_OAEP) encryption and
- * decryption. If $hash isn't supported, sha1 is used.
- *
- * @access public
- * @param String $hash
- */
- function setHash($hash)
- {
- // Crypt_Hash supports algorithms that PKCS#1 doesn't support. md5-96 and sha1-96, for example.
- switch ($hash) {
- case 'md2':
- case 'md5':
- case 'sha1':
- case 'sha256':
- case 'sha384':
- case 'sha512':
- $this->hash = new Crypt_Hash($hash);
- $this->hashName = $hash;
- break;
- default:
- $this->hash = new Crypt_Hash('sha1');
- $this->hashName = 'sha1';
- }
- $this->hLen = $this->hash->getLength();
- }
-
- /**
- * Determines which hashing function should be used for the mask generation function
- *
- * The mask generation function is used by CRYPT_RSA_ENCRYPTION_OAEP and CRYPT_RSA_SIGNATURE_PSS and although it's
- * best if Hash and MGFHash are set to the same thing this is not a requirement.
- *
- * @access public
- * @param String $hash
- */
- function setMGFHash($hash)
- {
- // Crypt_Hash supports algorithms that PKCS#1 doesn't support. md5-96 and sha1-96, for example.
- switch ($hash) {
- case 'md2':
- case 'md5':
- case 'sha1':
- case 'sha256':
- case 'sha384':
- case 'sha512':
- $this->mgfHash = new Crypt_Hash($hash);
- break;
- default:
- $this->mgfHash = new Crypt_Hash('sha1');
- }
- $this->mgfHLen = $this->mgfHash->getLength();
- }
-
- /**
- * Determines the salt length
- *
- * To quote from {@link http://tools.ietf.org/html/rfc3447#page-38 RFC3447#page-38}:
- *
- * Typical salt lengths in octets are hLen (the length of the output
- * of the hash function Hash) and 0.
- *
- * @access public
- * @param Integer $format
- */
- function setSaltLength($sLen)
- {
- $this->sLen = $sLen;
- }
-
- /**
- * Generates a random string x bytes long
- *
- * @access public
- * @param Integer $bytes
- * @param optional Integer $nonzero
- * @return String
- */
- function _random($bytes, $nonzero = false)
- {
- $temp = '';
- if ($nonzero) {
- for ($i = 0; $i < $bytes; $i++) {
- $temp.= chr(crypt_random(1, 255));
- }
- } else {
- $ints = ($bytes + 1) >> 2;
- for ($i = 0; $i < $ints; $i++) {
- $temp.= pack('N', crypt_random());
- }
- $temp = substr($temp, 0, $bytes);
- }
- return $temp;
- }
-
- /**
- * Integer-to-Octet-String primitive
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-4.1 RFC3447#section-4.1}.
- *
- * @access private
- * @param Math_BigInteger $x
- * @param Integer $xLen
- * @return String
- */
- function _i2osp($x, $xLen)
- {
- $x = $x->toBytes();
- if (strlen($x) > $xLen) {
- user_error('Integer too large', E_USER_NOTICE);
- 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 String $x
- * @return Math_BigInteger
- */
- function _os2ip($x)
- {
- return new Math_BigInteger($x, 256);
- }
-
- /**
- * Exponentiate with or without Chinese Remainder Theorem
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-5.1.1 RFC3447#section-5.1.2}.
- *
- * @access private
- * @param Math_BigInteger $x
- * @return Math_BigInteger
- */
- function _exponentiate($x)
- {
- if (empty($this->primes) || empty($this->coefficients) || empty($this->exponents)) {
- return $x->modPow($this->exponent, $this->modulus);
- }
-
- $num_primes = count($this->primes);
-
- if (defined('CRYPT_RSA_DISABLE_BLINDING')) {
- $m_i = array(
- 1 => $x->modPow($this->exponents[1], $this->primes[1]),
- 2 => $x->modPow($this->exponents[2], $this->primes[2])
- );
- $h = $m_i[1]->subtract($m_i[2]);
- $h = $h->multiply($this->coefficients[2]);
- list(, $h) = $h->divide($this->primes[1]);
- $m = $m_i[2]->add($h->multiply($this->primes[2]));
-
- $r = $this->primes[1];
- for ($i = 3; $i <= $num_primes; $i++) {
- $m_i = $x->modPow($this->exponents[$i], $this->primes[$i]);
-
- $r = $r->multiply($this->primes[$i - 1]);
-
- $h = $m_i->subtract($m);
- $h = $h->multiply($this->coefficients[$i]);
- list(, $h) = $h->divide($this->primes[$i]);
-
- $m = $m->add($r->multiply($h));
- }
- } else {
- $smallest = $this->primes[1];
- for ($i = 2; $i <= $num_primes; $i++) {
- if ($smallest->compare($this->primes[$i]) > 0) {
- $smallest = $this->primes[$i];
- }
- }
-
- $one = new Math_BigInteger(1);
- $one->setRandomGenerator('crypt_random');
-
- $r = $one->random($one, $smallest->subtract($one));
-
- $m_i = array(
- 1 => $this->_blind($x, $r, 1),
- 2 => $this->_blind($x, $r, 2)
- );
- $h = $m_i[1]->subtract($m_i[2]);
- $h = $h->multiply($this->coefficients[2]);
- list(, $h) = $h->divide($this->primes[1]);
- $m = $m_i[2]->add($h->multiply($this->primes[2]));
-
- $r = $this->primes[1];
- for ($i = 3; $i <= $num_primes; $i++) {
- $m_i = $this->_blind($x, $r, $i);
-
- $r = $r->multiply($this->primes[$i - 1]);
-
- $h = $m_i->subtract($m);
- $h = $h->multiply($this->coefficients[$i]);
- list(, $h) = $h->divide($this->primes[$i]);
-
- $m = $m->add($r->multiply($h));
- }
- }
-
- return $m;
- }
-
- /**
- * Performs RSA Blinding
- *
- * Protects against timing attacks by employing RSA Blinding.
- * Returns $x->modPow($this->exponents[$i], $this->primes[$i])
- *
- * @access private
- * @param Math_BigInteger $x
- * @param Math_BigInteger $r
- * @param Integer $i
- * @return Math_BigInteger
- */
- function _blind($x, $r, $i)
- {
- $x = $x->multiply($r->modPow($this->publicExponent, $this->primes[$i]));
-
- $x = $x->modPow($this->exponents[$i], $this->primes[$i]);
-
- $r = $r->modInverse($this->primes[$i]);
- $x = $x->multiply($r);
- list(, $x) = $x->divide($this->primes[$i]);
-
- return $x;
- }
-
- /**
- * RSAEP
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-5.1.1 RFC3447#section-5.1.1}.
- *
- * @access private
- * @param Math_BigInteger $m
- * @return Math_BigInteger
- */
- function _rsaep($m)
- {
- if ($m->compare($this->zero) < 0 || $m->compare($this->modulus) > 0) {
- user_error('Message representative out of range', E_USER_NOTICE);
- return false;
- }
- return $this->_exponentiate($m);
- }
-
- /**
- * RSADP
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-5.1.2 RFC3447#section-5.1.2}.
- *
- * @access private
- * @param Math_BigInteger $c
- * @return Math_BigInteger
- */
- function _rsadp($c)
- {
- if ($c->compare($this->zero) < 0 || $c->compare($this->modulus) > 0) {
- user_error('Ciphertext representative out of range', E_USER_NOTICE);
- return false;
- }
- return $this->_exponentiate($c);
- }
-
- /**
- * RSASP1
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-5.2.1 RFC3447#section-5.2.1}.
- *
- * @access private
- * @param Math_BigInteger $m
- * @return Math_BigInteger
- */
- function _rsasp1($m)
- {
- if ($m->compare($this->zero) < 0 || $m->compare($this->modulus) > 0) {
- user_error('Message representative out of range', E_USER_NOTICE);
- return false;
- }
- return $this->_exponentiate($m);
- }
-
- /**
- * RSAVP1
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-5.2.2 RFC3447#section-5.2.2}.
- *
- * @access private
- * @param Math_BigInteger $s
- * @return Math_BigInteger
- */
- function _rsavp1($s)
- {
- if ($s->compare($this->zero) < 0 || $s->compare($this->modulus) > 0) {
- user_error('Signature representative out of range', E_USER_NOTICE);
- return false;
- }
- return $this->_exponentiate($s);
- }
-
- /**
- * MGF1
- *
- * See {@link http://tools.ietf.org/html/rfc3447#appendix-B.2.1 RFC3447#appendix-B.2.1}.
- *
- * @access private
- * @param String $mgfSeed
- * @param Integer $mgfLen
- * @return String
- */
- function _mgf1($mgfSeed, $maskLen)
- {
- // if $maskLen would yield strings larger than 4GB, PKCS#1 suggests a "Mask too long" error be output.
-
- $t = '';
- $count = ceil($maskLen / $this->mgfHLen);
- for ($i = 0; $i < $count; $i++) {
- $c = pack('N', $i);
- $t.= $this->mgfHash->hash($mgfSeed . $c);
- }
-
- return substr($t, 0, $maskLen);
- }
-
- /**
- * RSAES-OAEP-ENCRYPT
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-7.1.1 RFC3447#section-7.1.1} and
- * {http://en.wikipedia.org/wiki/Optimal_Asymmetric_Encryption_Padding OAES}.
- *
- * @access private
- * @param String $m
- * @param String $l
- * @return String
- */
- function _rsaes_oaep_encrypt($m, $l = '')
- {
- $mLen = strlen($m);
-
- // Length checking
-
- // if $l is larger than two million terrabytes and you're using sha1, PKCS#1 suggests a "Label too long" error
- // be output.
-
- if ($mLen > $this->k - 2 * $this->hLen - 2) {
- user_error('Message too long', E_USER_NOTICE);
- return false;
- }
-
- // EME-OAEP encoding
-
- $lHash = $this->hash->hash($l);
- $ps = str_repeat(chr(0), $this->k - $mLen - 2 * $this->hLen - 2);
- $db = $lHash . $ps . chr(1) . $m;
- $seed = $this->_random($this->hLen);
- $dbMask = $this->_mgf1($seed, $this->k - $this->hLen - 1);
- $maskedDB = $db ^ $dbMask;
- $seedMask = $this->_mgf1($maskedDB, $this->hLen);
- $maskedSeed = $seed ^ $seedMask;
- $em = chr(0) . $maskedSeed . $maskedDB;
-
- // RSA encryption
-
- $m = $this->_os2ip($em);
- $c = $this->_rsaep($m);
- $c = $this->_i2osp($c, $this->k);
-
- // Output the ciphertext C
-
- return $c;
- }
-
- /**
- * RSAES-OAEP-DECRYPT
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-7.1.2 RFC3447#section-7.1.2}. The fact that the error
- * messages aren't distinguishable from one another hinders debugging, but, to quote from RFC3447#section-7.1.2:
- *
- * Note. Care must be taken to ensure that an opponent cannot
- * distinguish the different error conditions in Step 3.g, whether by
- * error message or timing, or, more generally, learn partial
- * information about the encoded message EM. Otherwise an opponent may
- * be able to obtain useful information about the decryption of the
- * ciphertext C, leading to a chosen-ciphertext attack such as the one
- * observed by Manger [36].
- *
- * As for $l... to quote from {@link http://tools.ietf.org/html/rfc3447#page-17 RFC3447#page-17}:
- *
- * Both the encryption and the decryption operations of RSAES-OAEP take
- * the value of a label L as input. In this version of PKCS #1, L is
- * the empty string; other uses of the label are outside the scope of
- * this document.
- *
- * @access private
- * @param String $c
- * @param String $l
- * @return String
- */
- function _rsaes_oaep_decrypt($c, $l = '')
- {
- // Length checking
-
- // if $l is larger than two million terrabytes and you're using sha1, PKCS#1 suggests a "Label too long" error
- // be output.
-
- if (strlen($c) != $this->k || $this->k < 2 * $this->hLen + 2) {
- user_error('Decryption error', E_USER_NOTICE);
- return false;
- }
-
- // RSA decryption
-
- $c = $this->_os2ip($c);
- $m = $this->_rsadp($c);
- if ($m === false) {
- user_error('Decryption error', E_USER_NOTICE);
- return false;
- }
- $em = $this->_i2osp($m, $this->k);
-
- // EME-OAEP decoding
-
- $lHash = $this->hash->hash($l);
- $y = ord($em[0]);
- $maskedSeed = substr($em, 1, $this->hLen);
- $maskedDB = substr($em, $this->hLen + 1);
- $seedMask = $this->_mgf1($maskedDB, $this->hLen);
- $seed = $maskedSeed ^ $seedMask;
- $dbMask = $this->_mgf1($seed, $this->k - $this->hLen - 1);
- $db = $maskedDB ^ $dbMask;
- $lHash2 = substr($db, 0, $this->hLen);
- $m = substr($db, $this->hLen);
- if ($lHash != $lHash2) {
- user_error('Decryption error', E_USER_NOTICE);
- return false;
- }
- $m = ltrim($m, chr(0));
- if (ord($m[0]) != 1) {
- user_error('Decryption error', E_USER_NOTICE);
- return false;
- }
-
- // Output the message M
-
- return substr($m, 1);
- }
-
- /**
- * RSAES-PKCS1-V1_5-ENCRYPT
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-7.2.1 RFC3447#section-7.2.1}.
- *
- * @access private
- * @param String $m
- * @return String
- */
- function _rsaes_pkcs1_v1_5_encrypt($m)
- {
- $mLen = strlen($m);
-
- // Length checking
-
- if ($mLen > $this->k - 11) {
- user_error('Message too long', E_USER_NOTICE);
- return false;
- }
-
- // EME-PKCS1-v1_5 encoding
-
- $ps = $this->_random($this->k - $mLen - 3, true);
- $em = chr(0) . chr(2) . $ps . chr(0) . $m;
-
- // RSA encryption
- $m = $this->_os2ip($em);
- $c = $this->_rsaep($m);
- $c = $this->_i2osp($c, $this->k);
-
- // Output the ciphertext C
-
- return $c;
- }
-
- /**
- * RSAES-PKCS1-V1_5-DECRYPT
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-7.2.2 RFC3447#section-7.2.2}.
- *
- * @access private
- * @param String $c
- * @return String
- */
- function _rsaes_pkcs1_v1_5_decrypt($c)
- {
- // Length checking
-
- if (strlen($c) != $this->k) { // or if k < 11
- user_error('Decryption error', E_USER_NOTICE);
- return false;
- }
-
- // RSA decryption
-
- $c = $this->_os2ip($c);
- $m = $this->_rsadp($c);
- if ($m === false) {
- user_error('Decryption error', E_USER_NOTICE);
- return false;
- }
- $em = $this->_i2osp($m, $this->k);
-
- // EME-PKCS1-v1_5 decoding
-
- if (ord($em[0]) != 0 || ord($em[1]) != 2) {
- user_error('Decryption error', E_USER_NOTICE);
- return false;
- }
-
- $ps = substr($em, 2, strpos($em, chr(0), 2) - 2);
- $m = substr($em, strlen($ps) + 3);
-
- if (strlen($ps) < 8) {
- user_error('Decryption error', E_USER_NOTICE);
- return false;
- }
-
- // Output M
-
- return $m;
- }
-
- /**
- * EMSA-PSS-ENCODE
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-9.1.1 RFC3447#section-9.1.1}.
- *
- * @access private
- * @param String $m
- * @param Integer $emBits
- */
- function _emsa_pss_encode($m, $emBits)
- {
- // if $m is larger than two million terrabytes and you're using sha1, PKCS#1 suggests a "Label too long" error
- // be output.
-
- $emLen = ($emBits + 1) >> 3; // ie. ceil($emBits / 8)
- $sLen = $this->sLen == false ? $this->hLen : $this->sLen;
-
- $mHash = $this->hash->hash($m);
- if ($emLen < $this->hLen + $sLen + 2) {
- user_error('Encoding error', E_USER_NOTICE);
- return false;
- }
-
- $salt = $this->_random($sLen);
- $m2 = "\0\0\0\0\0\0\0\0" . $mHash . $salt;
- $h = $this->hash->hash($m2);
- $ps = str_repeat(chr(0), $emLen - $sLen - $this->hLen - 2);
- $db = $ps . chr(1) . $salt;
- $dbMask = $this->_mgf1($h, $emLen - $this->hLen - 1);
- $maskedDB = $db ^ $dbMask;
- $maskedDB[0] = ~chr(0xFF << ($emBits & 7)) & $maskedDB[0];
- $em = $maskedDB . $h . chr(0xBC);
-
- return $em;
- }
-
- /**
- * EMSA-PSS-VERIFY
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-9.1.2 RFC3447#section-9.1.2}.
- *
- * @access private
- * @param String $m
- * @param String $em
- * @param Integer $emBits
- * @return String
- */
- function _emsa_pss_verify($m, $em, $emBits)
- {
- // if $m is larger than two million terrabytes and you're using sha1, PKCS#1 suggests a "Label too long" error
- // be output.
-
- $emLen = ($emBits + 1) >> 3; // ie. ceil($emBits / 8);
- $sLen = $this->sLen == false ? $this->hLen : $this->sLen;
-
- $mHash = $this->hash->hash($m);
- if ($emLen < $this->hLen + $sLen + 2) {
- return false;
- }
-
- if ($em[strlen($em) - 1] != chr(0xBC)) {
- return false;
- }
-
- $maskedDB = substr($em, 0, $em - $this->hLen - 1);
- $h = substr($em, $em - $this->hLen - 1, $this->hLen);
- $temp = chr(0xFF << ($emBits & 7));
- if ((~$maskedDB[0] & $temp) != $temp) {
- return false;
- }
- $dbMask = $this->_mgf1($h, $emLen - $this->hLen - 1);
- $db = $maskedDB ^ $dbMask;
- $db[0] = ~chr(0xFF << ($emBits & 7)) & $db[0];
- $temp = $emLen - $this->hLen - $sLen - 2;
- if (substr($db, 0, $temp) != str_repeat(chr(0), $temp) || ord($db[$temp]) != 1) {
- return false;
- }
- $salt = substr($db, $temp + 1); // should be $sLen long
- $m2 = "\0\0\0\0\0\0\0\0" . $mHash . $salt;
- $h2 = $this->hash->hash($m2);
- return $h == $h2;
- }
-
- /**
- * RSASSA-PSS-SIGN
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-8.1.1 RFC3447#section-8.1.1}.
- *
- * @access private
- * @param String $m
- * @return String
- */
- function _rsassa_pss_sign($m)
- {
- // EMSA-PSS encoding
-
- $em = $this->_emsa_pss_encode($m, 8 * $this->k - 1);
-
- // RSA signature
-
- $m = $this->_os2ip($em);
- $s = $this->_rsasp1($m);
- $s = $this->_i2osp($s, $this->k);
-
- // Output the signature S
-
- return $s;
- }
-
- /**
- * RSASSA-PSS-VERIFY
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-8.1.2 RFC3447#section-8.1.2}.
- *
- * @access private
- * @param String $m
- * @param String $s
- * @return String
- */
- function _rsassa_pss_verify($m, $s)
- {
- // Length checking
-
- if (strlen($s) != $this->k) {
- user_error('Invalid signature', E_USER_NOTICE);
- return false;
- }
-
- // RSA verification
-
- $modBits = 8 * $this->k;
-
- $s2 = $this->_os2ip($s);
- $m2 = $this->_rsavp1($s2);
- if ($m2 === false) {
- user_error('Invalid signature', E_USER_NOTICE);
- return false;
- }
- $em = $this->_i2osp($m2, $modBits >> 3);
- if ($em === false) {
- user_error('Invalid signature', E_USER_NOTICE);
- return false;
- }
-
- // EMSA-PSS verification
-
- return $this->_emsa_pss_verify($m, $em, $modBits - 1);
- }
-
- /**
- * 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 Integer $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', E_USER_NOTICE);
- return false;
- }
-
- $ps = str_repeat(chr(0xFF), $emLen - $tLen - 3);
-
- $em = "\0\1$ps\0$t";
-
- return $em;
- }
-
- /**
- * RSASSA-PKCS1-V1_5-SIGN
- *
- * See {@link http://tools.ietf.org/html/rfc3447#section-8.2.1 RFC3447#section-8.2.1}.
- *
- * @access private
- * @param String $m
- * @return String
- */
- function _rsassa_pkcs1_v1_5_sign($m)
- {
- // EMSA-PKCS1-v1_5 encoding
-
- $em = $this->_emsa_pkcs1_v1_5_encode($m, $this->k);
- if ($em === false) {
- user_error('RSA modulus too short', E_USER_NOTICE);
- return false;
- }
-
- // RSA signature
-
- $m = $this->_os2ip($em);
- $s = $this->_rsasp1($m);
- $s = $this->_i2osp($s, $this->k);
-
- // Output the signature S
-
- return $s;
- }
-
- /**
- * 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
- * @return String
- */
- function _rsassa_pkcs1_v1_5_verify($m, $s)
- {
- // Length checking
-
- if (strlen($s) != $this->k) {
- user_error('Invalid signature', E_USER_NOTICE);
- return false;
- }
-
- // RSA verification
-
- $s = $this->_os2ip($s);
- $m2 = $this->_rsavp1($s);
- if ($m2 === false) {
- user_error('Invalid signature', E_USER_NOTICE);
- return false;
- }
- $em = $this->_i2osp($m2, $this->k);
- if ($em === false) {
- user_error('Invalid signature', E_USER_NOTICE);
- return false;
- }
-
- // EMSA-PKCS1-v1_5 encoding
-
- $em2 = $this->_emsa_pkcs1_v1_5_encode($m, $this->k);
- if ($em2 === false) {
- user_error('RSA modulus too short', E_USER_NOTICE);
- return false;
- }
-
- // Compare
-
- return $em === $em2;
- }
-
- /**
- * Set Encryption Mode
- *
- * Valid values include CRYPT_RSA_ENCRYPTION_OAEP and CRYPT_RSA_ENCRYPTION_PKCS1.
- *
- * @access public
- * @param Integer $mode
- */
- function setEncryptionMode($mode)
- {
- $this->encryptionMode = $mode;
- }
-
- /**
- * Set Signature Mode
- *
- * Valid values include CRYPT_RSA_SIGNATURE_PSS and CRYPT_RSA_SIGNATURE_PKCS1
- *
- * @access public
- * @param Integer $mode
- */
- function setSignatureMode($mode)
- {
- $this->signatureMode = $mode;
- }
-
- /**
- * Encryption
- *
- * Both CRYPT_RSA_ENCRYPTION_OAEP and CRYPT_RSA_ENCRYPTION_PKCS1 both place limits on how long $plaintext can be.
- * If $plaintext exceeds those limits it will be broken up so that it does and the resultant ciphertext's will
- * be concatenated together.
- *
- * @see decrypt()
- * @access public
- * @param String $plaintext
- * @return String
- */
- function encrypt($plaintext)
- {
- switch ($this->encryptionMode) {
- case CRYPT_RSA_ENCRYPTION_PKCS1:
- $length = $this->k - 11;
- if ($length <= 0) {
- return false;
- }
-
- $plaintext = str_split($plaintext, $length);
- $ciphertext = '';
- foreach ($plaintext as $m) {
- $ciphertext.= $this->_rsaes_pkcs1_v1_5_encrypt($m);
- }
- return $ciphertext;
- //case CRYPT_RSA_ENCRYPTION_OAEP:
- default:
- $length = $this->k - 2 * $this->hLen - 2;
- if ($length <= 0) {
- return false;
- }
-
- $plaintext = str_split($plaintext, $length);
- $ciphertext = '';
- foreach ($plaintext as $m) {
- $ciphertext.= $this->_rsaes_oaep_encrypt($m);
- }
- return $ciphertext;
- }
- }
-
- /**
- * Decryption
- *
- * @see encrypt()
- * @access public
- * @param String $plaintext
- * @return String
- */
- function decrypt($ciphertext)
- {
- if ($this->k <= 0) {
- return false;
- }
-
- $ciphertext = str_split($ciphertext, $this->k);
- $plaintext = '';
-
- switch ($this->encryptionMode) {
- case CRYPT_RSA_ENCRYPTION_PKCS1:
- $decrypt = '_rsaes_pkcs1_v1_5_decrypt';
- break;
- //case CRYPT_RSA_ENCRYPTION_OAEP:
- default:
- $decrypt = '_rsaes_oaep_decrypt';
- }
-
- foreach ($ciphertext as $c) {
- $temp = $this->$decrypt($c);
- if ($temp === false) {
- return false;
- }
- $plaintext.= $temp;
- }
-
- return $plaintext;
- }
-
- /**
- * Create a signature
- *
- * @see verify()
- * @access public
- * @param String $message
- * @return String
- */
- function sign($message)
- {
- if (empty($this->modulus) || empty($this->exponent)) {
- return false;
- }
-
- switch ($this->signatureMode) {
- case CRYPT_RSA_SIGNATURE_PKCS1:
- return $this->_rsassa_pkcs1_v1_5_sign($message);
- //case CRYPT_RSA_SIGNATURE_PSS:
- default:
- return $this->_rsassa_pss_sign($message);
- }
- }
-
- /**
- * Verifies a signature
- *
- * @see sign()
- * @access public
- * @param String $message
- * @param String $signature
- * @return Boolean
- */
- function verify($message, $signature)
- {
- if (empty($this->modulus) || empty($this->exponent)) {
- return false;
- }
-
- switch ($this->signatureMode) {
- case CRYPT_RSA_SIGNATURE_PKCS1:
- return $this->_rsassa_pkcs1_v1_5_verify($message, $signature);
- //case CRYPT_RSA_SIGNATURE_PSS:
- default:
- return $this->_rsassa_pss_verify($message, $signature);
- }
- }
-}
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP PKCS#1 (v2.1) compliant implementation of RSA.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * Here's an example of how to encrypt and decrypt text with this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/RSA.php');\r
+ *\r
+ * $rsa = new Crypt_RSA();\r
+ * extract($rsa->createKey());\r
+ *\r
+ * $plaintext = 'terrafrost';\r
+ *\r
+ * $rsa->loadKey($privatekey);\r
+ * $ciphertext = $rsa->encrypt($plaintext);\r
+ *\r
+ * $rsa->loadKey($publickey);\r
+ * echo $rsa->decrypt($ciphertext);\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * Here's an example of how to create signatures and verify signatures with this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/RSA.php');\r
+ *\r
+ * $rsa = new Crypt_RSA();\r
+ * extract($rsa->createKey());\r
+ *\r
+ * $plaintext = 'terrafrost';\r
+ *\r
+ * $rsa->loadKey($privatekey);\r
+ * $signature = $rsa->sign($plaintext);\r
+ *\r
+ * $rsa->loadKey($publickey);\r
+ * echo $rsa->verify($plaintext, $signature) ? 'verified' : 'unverified';\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_RSA\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMIX Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**\r
+ * Include Crypt_Random\r
+ */\r
+// the class_exists() will only be called if the crypt_random_string function hasn't been defined and\r
+// will trigger a call to __autoload() if you're wanting to auto-load classes\r
+// call function_exists() a second time to stop the require_once from being called outside\r
+// of the auto loader\r
+if (!function_exists('crypt_random_string')) {\r
+ require_once('Random.php');\r
+}\r
+\r
+/**\r
+ * Include Crypt_Hash\r
+ */\r
+if (!class_exists('Crypt_Hash')) {\r
+ require_once('Hash.php');\r
+}\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_RSA::encrypt()\r
+ * @see Crypt_RSA::decrypt()\r
+ */\r
+/**\r
+ * Use {@link http://en.wikipedia.org/wiki/Optimal_Asymmetric_Encryption_Padding Optimal Asymmetric Encryption Padding}\r
+ * (OAEP) for encryption / decryption.\r
+ *\r
+ * Uses sha1 by default.\r
+ *\r
+ * @see Crypt_RSA::setHash()\r
+ * @see Crypt_RSA::setMGFHash()\r
+ */\r
+define('CRYPT_RSA_ENCRYPTION_OAEP', 1);\r
+/**\r
+ * Use PKCS#1 padding.\r
+ *\r
+ * Although CRYPT_RSA_ENCRYPTION_OAEP offers more security, including PKCS#1 padding is necessary for purposes of backwards\r
+ * compatability with protocols (like SSH-1) written before OAEP's introduction.\r
+ */\r
+define('CRYPT_RSA_ENCRYPTION_PKCS1', 2);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_RSA::sign()\r
+ * @see Crypt_RSA::verify()\r
+ * @see Crypt_RSA::setHash()\r
+ */\r
+/**\r
+ * Use the Probabilistic Signature Scheme for signing\r
+ *\r
+ * Uses sha1 by default.\r
+ *\r
+ * @see Crypt_RSA::setSaltLength()\r
+ * @see Crypt_RSA::setMGFHash()\r
+ */\r
+define('CRYPT_RSA_SIGNATURE_PSS', 1);\r
+/**\r
+ * Use the PKCS#1 scheme by default.\r
+ *\r
+ * Although CRYPT_RSA_SIGNATURE_PSS offers more security, including PKCS#1 signing is necessary for purposes of backwards\r
+ * compatability with protocols (like SSH-2) written before PSS's introduction.\r
+ */\r
+define('CRYPT_RSA_SIGNATURE_PKCS1', 2);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_RSA::createKey()\r
+ */\r
+/**\r
+ * ASN1 Integer\r
+ */\r
+define('CRYPT_RSA_ASN1_INTEGER', 2);\r
+/**\r
+ * ASN1 Bit String\r
+ */\r
+define('CRYPT_RSA_ASN1_BITSTRING', 3); \r
+/**\r
+ * ASN1 Sequence (with the constucted bit set)\r
+ */\r
+define('CRYPT_RSA_ASN1_SEQUENCE', 48);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_RSA::Crypt_RSA()\r
+ */\r
+/**\r
+ * To use the pure-PHP implementation\r
+ */\r
+define('CRYPT_RSA_MODE_INTERNAL', 1);\r
+/**\r
+ * To use the OpenSSL library\r
+ *\r
+ * (if enabled; otherwise, the internal implementation will be used)\r
+ */\r
+define('CRYPT_RSA_MODE_OPENSSL', 2);\r
+/**#@-*/\r
+\r
+/**\r
+ * Default openSSL configuration file.\r
+ */\r
+define('CRYPT_RSA_OPENSSL_CONFIG', dirname(__FILE__) . '/../openssl.cnf');\r
+\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_RSA::createKey()\r
+ * @see Crypt_RSA::setPrivateKeyFormat()\r
+ */\r
+/**\r
+ * PKCS#1 formatted private key\r
+ *\r
+ * Used by OpenSSH\r
+ */\r
+define('CRYPT_RSA_PRIVATE_FORMAT_PKCS1', 0);\r
+/**\r
+ * PuTTY formatted private key\r
+ */\r
+define('CRYPT_RSA_PRIVATE_FORMAT_PUTTY', 1);\r
+/**\r
+ * XML formatted private key\r
+ */\r
+define('CRYPT_RSA_PRIVATE_FORMAT_XML', 2);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_RSA::createKey()\r
+ * @see Crypt_RSA::setPublicKeyFormat()\r
+ */\r
+/**\r
+ * Raw public key\r
+ *\r
+ * An array containing two Math_BigInteger objects.\r
+ *\r
+ * The exponent can be indexed with any of the following:\r
+ *\r
+ * 0, e, exponent, publicExponent\r
+ *\r
+ * The modulus can be indexed with any of the following:\r
+ *\r
+ * 1, n, modulo, modulus\r
+ */\r
+define('CRYPT_RSA_PUBLIC_FORMAT_RAW', 3);\r
+/**\r
+ * PKCS#1 formatted public key (raw)\r
+ *\r
+ * Used by File/X509.php\r
+ */\r
+define('CRYPT_RSA_PUBLIC_FORMAT_PKCS1_RAW', 4);\r
+/**\r
+ * XML formatted public key\r
+ */\r
+define('CRYPT_RSA_PUBLIC_FORMAT_XML', 5);\r
+/**\r
+ * OpenSSH formatted public key\r
+ *\r
+ * Place in $HOME/.ssh/authorized_keys\r
+ */\r
+define('CRYPT_RSA_PUBLIC_FORMAT_OPENSSH', 6);\r
+/**\r
+ * PKCS#1 formatted public key (encapsulated)\r
+ *\r
+ * Used by PHP's openssl_public_encrypt() and openssl's rsautl (when -pubin is set)\r
+ */\r
+define('CRYPT_RSA_PUBLIC_FORMAT_PKCS1', 7);\r
+/**#@-*/\r
+\r
+/**\r
+ * Pure-PHP PKCS#1 compliant implementation of RSA.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @version 0.1.0\r
+ * @access public\r
+ * @package Crypt_RSA\r
+ */\r
+class Crypt_RSA {\r
+ /**\r
+ * Precomputed Zero\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $zero;\r
+\r
+ /**\r
+ * Precomputed One\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $one;\r
+\r
+ /**\r
+ * Private Key Format\r
+ *\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $privateKeyFormat = CRYPT_RSA_PRIVATE_FORMAT_PKCS1;\r
+\r
+ /**\r
+ * Public Key Format\r
+ *\r
+ * @var Integer\r
+ * @access public\r
+ */\r
+ var $publicKeyFormat = CRYPT_RSA_PUBLIC_FORMAT_PKCS1;\r
+\r
+ /**\r
+ * Modulus (ie. n)\r
+ *\r
+ * @var Math_BigInteger\r
+ * @access private\r
+ */\r
+ var $modulus;\r
+\r
+ /**\r
+ * Modulus length\r
+ *\r
+ * @var Math_BigInteger\r
+ * @access private\r
+ */\r
+ var $k;\r
+\r
+ /**\r
+ * Exponent (ie. e or d)\r
+ *\r
+ * @var Math_BigInteger\r
+ * @access private\r
+ */\r
+ var $exponent;\r
+\r
+ /**\r
+ * Primes for Chinese Remainder Theorem (ie. p and q)\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $primes;\r
+\r
+ /**\r
+ * Exponents for Chinese Remainder Theorem (ie. dP and dQ)\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $exponents;\r
+\r
+ /**\r
+ * Coefficients for Chinese Remainder Theorem (ie. qInv)\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $coefficients;\r
+\r
+ /**\r
+ * Hash name\r
+ *\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $hashName;\r
+\r
+ /**\r
+ * Hash function\r
+ *\r
+ * @var Crypt_Hash\r
+ * @access private\r
+ */\r
+ var $hash;\r
+\r
+ /**\r
+ * Length of hash function output\r
+ *\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $hLen;\r
+\r
+ /**\r
+ * Length of salt\r
+ *\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $sLen;\r
+\r
+ /**\r
+ * Hash function for the Mask Generation Function\r
+ *\r
+ * @var Crypt_Hash\r
+ * @access private\r
+ */\r
+ var $mgfHash;\r
+\r
+ /**\r
+ * Length of MGF hash function output\r
+ *\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $mgfHLen;\r
+\r
+ /**\r
+ * Encryption mode\r
+ *\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $encryptionMode = CRYPT_RSA_ENCRYPTION_OAEP;\r
+\r
+ /**\r
+ * Signature mode\r
+ *\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $signatureMode = CRYPT_RSA_SIGNATURE_PSS;\r
+\r
+ /**\r
+ * Public Exponent\r
+ *\r
+ * @var Mixed\r
+ * @access private\r
+ */\r
+ var $publicExponent = false;\r
+\r
+ /**\r
+ * Password\r
+ *\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $password = false;\r
+\r
+ /**\r
+ * Components\r
+ *\r
+ * For use with parsing XML formatted keys. PHP's XML Parser functions use utilized - instead of PHP's DOM functions -\r
+ * because PHP's XML Parser functions work on PHP4 whereas PHP's DOM functions - although surperior - don't.\r
+ *\r
+ * @see Crypt_RSA::_start_element_handler()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $components = array();\r
+\r
+ /**\r
+ * Current String\r
+ *\r
+ * For use with parsing XML formatted keys.\r
+ *\r
+ * @see Crypt_RSA::_character_handler()\r
+ * @see Crypt_RSA::_stop_element_handler()\r
+ * @var Mixed\r
+ * @access private\r
+ */\r
+ var $current;\r
+\r
+ /**\r
+ * OpenSSL configuration file name.\r
+ *\r
+ * Set to NULL to use system configuration file.\r
+ * @see Crypt_RSA::createKey()\r
+ * @var Mixed\r
+ * @Access public\r
+ */\r
+ var $configFile;\r
+\r
+ /**\r
+ * Public key comment field.\r
+ *\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $comment = 'phpseclib-generated-key';\r
+\r
+ /**\r
+ * The constructor\r
+ *\r
+ * If you want to make use of the openssl extension, you'll need to set the mode manually, yourself. The reason\r
+ * Crypt_RSA doesn't do it is because OpenSSL doesn't fail gracefully. openssl_pkey_new(), in particular, requires\r
+ * openssl.cnf be present somewhere and, unfortunately, the only real way to find out is too late.\r
+ *\r
+ * @return Crypt_RSA\r
+ * @access public\r
+ */\r
+ function Crypt_RSA()\r
+ {\r
+ if (!class_exists('Math_BigInteger')) {\r
+ require_once('Math/BigInteger.php');\r
+ }\r
+\r
+ $this->configFile = CRYPT_RSA_OPENSSL_CONFIG;\r
+\r
+ if ( !defined('CRYPT_RSA_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('openssl') && version_compare(PHP_VERSION, '4.2.0', '>=') && file_exists($this->configFile):\r
+ define('CRYPT_RSA_MODE', CRYPT_RSA_MODE_OPENSSL);\r
+ break;\r
+ default:\r
+ define('CRYPT_RSA_MODE', CRYPT_RSA_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ $this->zero = new Math_BigInteger();\r
+ $this->one = new Math_BigInteger(1);\r
+\r
+ $this->hash = new Crypt_Hash('sha1');\r
+ $this->hLen = $this->hash->getLength();\r
+ $this->hashName = 'sha1';\r
+ $this->mgfHash = new Crypt_Hash('sha1');\r
+ $this->mgfHLen = $this->mgfHash->getLength();\r
+ }\r
+\r
+ /**\r
+ * Create public / private key pair\r
+ *\r
+ * Returns an array with the following three elements:\r
+ * - 'privatekey': The private key.\r
+ * - 'publickey': The public key.\r
+ * - 'partialkey': A partially computed key (if the execution time exceeded $timeout).\r
+ * Will need to be passed back to Crypt_RSA::createKey() as the third parameter for further processing.\r
+ *\r
+ * @access public\r
+ * @param optional Integer $bits\r
+ * @param optional Integer $timeout\r
+ * @param optional Math_BigInteger $p\r
+ */\r
+ function createKey($bits = 1024, $timeout = false, $partial = array())\r
+ {\r
+ if (!defined('CRYPT_RSA_EXPONENT')) {\r
+ // http://en.wikipedia.org/wiki/65537_%28number%29\r
+ define('CRYPT_RSA_EXPONENT', '65537');\r
+ }\r
+ // per <http://cseweb.ucsd.edu/~hovav/dist/survey.pdf#page=5>, this number ought not result in primes smaller\r
+ // than 256 bits. as a consequence if the key you're trying to create is 1024 bits and you've set CRYPT_RSA_SMALLEST_PRIME\r
+ // to 384 bits then you're going to get a 384 bit prime and a 640 bit prime (384 + 1024 % 384). at least if\r
+ // CRYPT_RSA_MODE is set to CRYPT_RSA_MODE_INTERNAL. if CRYPT_RSA_MODE is set to CRYPT_RSA_MODE_OPENSSL then\r
+ // CRYPT_RSA_SMALLEST_PRIME is ignored (ie. multi-prime RSA support is more intended as a way to speed up RSA key\r
+ // generation when there's a chance neither gmp nor OpenSSL are installed)\r
+ if (!defined('CRYPT_RSA_SMALLEST_PRIME')) {\r
+ define('CRYPT_RSA_SMALLEST_PRIME', 4096);\r
+ }\r
+\r
+ // OpenSSL uses 65537 as the exponent and requires RSA keys be 384 bits minimum\r
+ if ( CRYPT_RSA_MODE == CRYPT_RSA_MODE_OPENSSL && $bits >= 384 && CRYPT_RSA_EXPONENT == 65537) {\r
+ $config = array();\r
+ if (isset($this->configFile)) {\r
+ $config['config'] = $this->configFile;\r
+ }\r
+ $rsa = openssl_pkey_new(array('private_key_bits' => $bits) + $config);\r
+ openssl_pkey_export($rsa, $privatekey, NULL, $config);\r
+ $publickey = openssl_pkey_get_details($rsa);\r
+ $publickey = $publickey['key'];\r
+\r
+ $privatekey = call_user_func_array(array($this, '_convertPrivateKey'), array_values($this->_parseKey($privatekey, CRYPT_RSA_PRIVATE_FORMAT_PKCS1)));\r
+ $publickey = call_user_func_array(array($this, '_convertPublicKey'), array_values($this->_parseKey($publickey, CRYPT_RSA_PUBLIC_FORMAT_PKCS1)));\r
+\r
+ // clear the buffer of error strings stemming from a minimalistic openssl.cnf\r
+ while (openssl_error_string() !== false);\r
+\r
+ return array(\r
+ 'privatekey' => $privatekey,\r
+ 'publickey' => $publickey,\r
+ 'partialkey' => false\r
+ );\r
+ }\r
+\r
+ static $e;\r
+ if (!isset($e)) {\r
+ $e = new Math_BigInteger(CRYPT_RSA_EXPONENT);\r
+ }\r
+\r
+ extract($this->_generateMinMax($bits));\r
+ $absoluteMin = $min;\r
+ $temp = $bits >> 1; // divide by two to see how many bits P and Q would be\r
+ if ($temp > CRYPT_RSA_SMALLEST_PRIME) {\r
+ $num_primes = floor($bits / CRYPT_RSA_SMALLEST_PRIME);\r
+ $temp = CRYPT_RSA_SMALLEST_PRIME;\r
+ } else {\r
+ $num_primes = 2;\r
+ }\r
+ extract($this->_generateMinMax($temp + $bits % $temp));\r
+ $finalMax = $max;\r
+ extract($this->_generateMinMax($temp));\r
+\r
+ $generator = new Math_BigInteger();\r
+\r
+ $n = $this->one->copy();\r
+ if (!empty($partial)) {\r
+ extract(unserialize($partial));\r
+ } else {\r
+ $exponents = $coefficients = $primes = array();\r
+ $lcm = array(\r
+ 'top' => $this->one->copy(),\r
+ 'bottom' => false\r
+ );\r
+ }\r
+\r
+ $start = time();\r
+ $i0 = count($primes) + 1;\r
+\r
+ do {\r
+ for ($i = $i0; $i <= $num_primes; $i++) {\r
+ if ($timeout !== false) {\r
+ $timeout-= time() - $start;\r
+ $start = time();\r
+ if ($timeout <= 0) {\r
+ return array(\r
+ 'privatekey' => '',\r
+ 'publickey' => '',\r
+ 'partialkey' => serialize(array(\r
+ 'primes' => $primes,\r
+ 'coefficients' => $coefficients,\r
+ 'lcm' => $lcm,\r
+ 'exponents' => $exponents\r
+ ))\r
+ );\r
+ }\r
+ }\r
+\r
+ if ($i == $num_primes) {\r
+ list($min, $temp) = $absoluteMin->divide($n);\r
+ if (!$temp->equals($this->zero)) {\r
+ $min = $min->add($this->one); // ie. ceil()\r
+ }\r
+ $primes[$i] = $generator->randomPrime($min, $finalMax, $timeout);\r
+ } else {\r
+ $primes[$i] = $generator->randomPrime($min, $max, $timeout);\r
+ }\r
+\r
+ if ($primes[$i] === false) { // if we've reached the timeout\r
+ if (count($primes) > 1) {\r
+ $partialkey = '';\r
+ } else {\r
+ array_pop($primes);\r
+ $partialkey = serialize(array(\r
+ 'primes' => $primes,\r
+ 'coefficients' => $coefficients,\r
+ 'lcm' => $lcm,\r
+ 'exponents' => $exponents\r
+ ));\r
+ }\r
+\r
+ return array(\r
+ 'privatekey' => '',\r
+ 'publickey' => '',\r
+ 'partialkey' => $partialkey\r
+ );\r
+ }\r
+\r
+ // the first coefficient is calculated differently from the rest\r
+ // ie. instead of being $primes[1]->modInverse($primes[2]), it's $primes[2]->modInverse($primes[1])\r
+ if ($i > 2) {\r
+ $coefficients[$i] = $n->modInverse($primes[$i]);\r
+ }\r
+\r
+ $n = $n->multiply($primes[$i]);\r
+\r
+ $temp = $primes[$i]->subtract($this->one);\r
+\r
+ // textbook RSA implementations use Euler's totient function instead of the least common multiple.\r
+ // see http://en.wikipedia.org/wiki/Euler%27s_totient_function\r
+ $lcm['top'] = $lcm['top']->multiply($temp);\r
+ $lcm['bottom'] = $lcm['bottom'] === false ? $temp : $lcm['bottom']->gcd($temp);\r
+\r
+ $exponents[$i] = $e->modInverse($temp);\r
+ }\r
+\r
+ list($lcm) = $lcm['top']->divide($lcm['bottom']);\r
+ $gcd = $lcm->gcd($e);\r
+ $i0 = 1;\r
+ } while (!$gcd->equals($this->one));\r
+\r
+ $d = $e->modInverse($lcm);\r
+\r
+ $coefficients[2] = $primes[2]->modInverse($primes[1]);\r
+\r
+ // from <http://tools.ietf.org/html/rfc3447#appendix-A.1.2>:\r
+ // RSAPrivateKey ::= SEQUENCE {\r
+ // version Version,\r
+ // modulus INTEGER, -- n\r
+ // publicExponent INTEGER, -- e\r
+ // privateExponent INTEGER, -- d\r
+ // prime1 INTEGER, -- p\r
+ // prime2 INTEGER, -- q\r
+ // exponent1 INTEGER, -- d mod (p-1)\r
+ // exponent2 INTEGER, -- d mod (q-1)\r
+ // coefficient INTEGER, -- (inverse of q) mod p\r
+ // otherPrimeInfos OtherPrimeInfos OPTIONAL\r
+ // }\r
+\r
+ return array(\r
+ 'privatekey' => $this->_convertPrivateKey($n, $e, $d, $primes, $exponents, $coefficients),\r
+ 'publickey' => $this->_convertPublicKey($n, $e),\r
+ 'partialkey' => false\r
+ );\r
+ }\r
+\r
+ /**\r
+ * Convert a private key to the appropriate format.\r
+ *\r
+ * @access private\r
+ * @see setPrivateKeyFormat()\r
+ * @param String $RSAPrivateKey\r
+ * @return String\r
+ */\r
+ function _convertPrivateKey($n, $e, $d, $primes, $exponents, $coefficients)\r
+ {\r
+ $num_primes = count($primes);\r
+ $raw = array(\r
+ 'version' => $num_primes == 2 ? chr(0) : chr(1), // two-prime vs. multi\r
+ 'modulus' => $n->toBytes(true),\r
+ 'publicExponent' => $e->toBytes(true),\r
+ 'privateExponent' => $d->toBytes(true),\r
+ 'prime1' => $primes[1]->toBytes(true),\r
+ 'prime2' => $primes[2]->toBytes(true),\r
+ 'exponent1' => $exponents[1]->toBytes(true),\r
+ 'exponent2' => $exponents[2]->toBytes(true),\r
+ 'coefficient' => $coefficients[2]->toBytes(true)\r
+ );\r
+\r
+ // if the format in question does not support multi-prime rsa and multi-prime rsa was used,\r
+ // call _convertPublicKey() instead.\r
+ switch ($this->privateKeyFormat) {\r
+ case CRYPT_RSA_PRIVATE_FORMAT_XML:\r
+ if ($num_primes != 2) {\r
+ return false;\r
+ }\r
+ return "<RSAKeyValue>\r\n" .\r
+ ' <Modulus>' . base64_encode($raw['modulus']) . "</Modulus>\r\n" .\r
+ ' <Exponent>' . base64_encode($raw['publicExponent']) . "</Exponent>\r\n" .\r
+ ' <P>' . base64_encode($raw['prime1']) . "</P>\r\n" .\r
+ ' <Q>' . base64_encode($raw['prime2']) . "</Q>\r\n" .\r
+ ' <DP>' . base64_encode($raw['exponent1']) . "</DP>\r\n" .\r
+ ' <DQ>' . base64_encode($raw['exponent2']) . "</DQ>\r\n" .\r
+ ' <InverseQ>' . base64_encode($raw['coefficient']) . "</InverseQ>\r\n" .\r
+ ' <D>' . base64_encode($raw['privateExponent']) . "</D>\r\n" .\r
+ '</RSAKeyValue>';\r
+ break;\r
+ case CRYPT_RSA_PRIVATE_FORMAT_PUTTY:\r
+ if ($num_primes != 2) {\r
+ return false;\r
+ }\r
+ $key = "PuTTY-User-Key-File-2: ssh-rsa\r\nEncryption: ";\r
+ $encryption = (!empty($this->password) || is_string($this->password)) ? 'aes256-cbc' : 'none';\r
+ $key.= $encryption;\r
+ $key.= "\r\nComment: " . $this->comment . "\r\n";\r
+ $public = pack('Na*Na*Na*',\r
+ strlen('ssh-rsa'), 'ssh-rsa', strlen($raw['publicExponent']), $raw['publicExponent'], strlen($raw['modulus']), $raw['modulus']\r
+ );\r
+ $source = pack('Na*Na*Na*Na*',\r
+ strlen('ssh-rsa'), 'ssh-rsa', strlen($encryption), $encryption,\r
+ strlen($this->comment), $this->comment, strlen($public), $public\r
+ );\r
+ $public = base64_encode($public);\r
+ $key.= "Public-Lines: " . ((strlen($public) + 32) >> 6) . "\r\n";\r
+ $key.= chunk_split($public, 64);\r
+ $private = pack('Na*Na*Na*Na*',\r
+ strlen($raw['privateExponent']), $raw['privateExponent'], strlen($raw['prime1']), $raw['prime1'],\r
+ strlen($raw['prime2']), $raw['prime2'], strlen($raw['coefficient']), $raw['coefficient']\r
+ );\r
+ if (empty($this->password) && !is_string($this->password)) {\r
+ $source.= pack('Na*', strlen($private), $private);\r
+ $hashkey = 'putty-private-key-file-mac-key';\r
+ } else {\r
+ $private.= crypt_random_string(16 - (strlen($private) & 15));\r
+ $source.= pack('Na*', strlen($private), $private);\r
+ if (!class_exists('Crypt_AES')) {\r
+ require_once('Crypt/AES.php');\r
+ }\r
+ $sequence = 0;\r
+ $symkey = '';\r
+ while (strlen($symkey) < 32) {\r
+ $temp = pack('Na*', $sequence++, $this->password);\r
+ $symkey.= pack('H*', sha1($temp));\r
+ }\r
+ $symkey = substr($symkey, 0, 32);\r
+ $crypto = new Crypt_AES();\r
+\r
+ $crypto->setKey($symkey);\r
+ $crypto->disablePadding();\r
+ $private = $crypto->encrypt($private);\r
+ $hashkey = 'putty-private-key-file-mac-key' . $this->password;\r
+ }\r
+\r
+ $private = base64_encode($private);\r
+ $key.= 'Private-Lines: ' . ((strlen($private) + 32) >> 6) . "\r\n";\r
+ $key.= chunk_split($private, 64);\r
+ if (!class_exists('Crypt_Hash')) {\r
+ require_once('Crypt/Hash.php');\r
+ }\r
+ $hash = new Crypt_Hash('sha1');\r
+ $hash->setKey(pack('H*', sha1($hashkey)));\r
+ $key.= 'Private-MAC: ' . bin2hex($hash->hash($source)) . "\r\n";\r
+\r
+ return $key;\r
+ default: // eg. CRYPT_RSA_PRIVATE_FORMAT_PKCS1\r
+ $components = array();\r
+ foreach ($raw as $name => $value) {\r
+ $components[$name] = pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($value)), $value);\r
+ }\r
+\r
+ $RSAPrivateKey = implode('', $components);\r
+\r
+ if ($num_primes > 2) {\r
+ $OtherPrimeInfos = '';\r
+ for ($i = 3; $i <= $num_primes; $i++) {\r
+ // OtherPrimeInfos ::= SEQUENCE SIZE(1..MAX) OF OtherPrimeInfo\r
+ //\r
+ // OtherPrimeInfo ::= SEQUENCE {\r
+ // prime INTEGER, -- ri\r
+ // exponent INTEGER, -- di\r
+ // coefficient INTEGER -- ti\r
+ // }\r
+ $OtherPrimeInfo = pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($primes[$i]->toBytes(true))), $primes[$i]->toBytes(true));\r
+ $OtherPrimeInfo.= pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($exponents[$i]->toBytes(true))), $exponents[$i]->toBytes(true));\r
+ $OtherPrimeInfo.= pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($coefficients[$i]->toBytes(true))), $coefficients[$i]->toBytes(true));\r
+ $OtherPrimeInfos.= pack('Ca*a*', CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($OtherPrimeInfo)), $OtherPrimeInfo);\r
+ }\r
+ $RSAPrivateKey.= pack('Ca*a*', CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($OtherPrimeInfos)), $OtherPrimeInfos);\r
+ }\r
+\r
+ $RSAPrivateKey = pack('Ca*a*', CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($RSAPrivateKey)), $RSAPrivateKey);\r
+\r
+ if (!empty($this->password) || is_string($this->password)) {\r
+ $iv = crypt_random_string(8);\r
+ $symkey = pack('H*', md5($this->password . $iv)); // symkey is short for symmetric key\r
+ $symkey.= substr(pack('H*', md5($symkey . $this->password . $iv)), 0, 8);\r
+ if (!class_exists('Crypt_TripleDES')) {\r
+ require_once('Crypt/TripleDES.php');\r
+ }\r
+ $des = new Crypt_TripleDES();\r
+ $des->setKey($symkey);\r
+ $des->setIV($iv);\r
+ $iv = strtoupper(bin2hex($iv));\r
+ $RSAPrivateKey = "-----BEGIN RSA PRIVATE KEY-----\r\n" .\r
+ "Proc-Type: 4,ENCRYPTED\r\n" .\r
+ "DEK-Info: DES-EDE3-CBC,$iv\r\n" .\r
+ "\r\n" .\r
+ chunk_split(base64_encode($des->encrypt($RSAPrivateKey)), 64) .\r
+ '-----END RSA PRIVATE KEY-----';\r
+ } else {\r
+ $RSAPrivateKey = "-----BEGIN RSA PRIVATE KEY-----\r\n" .\r
+ chunk_split(base64_encode($RSAPrivateKey), 64) .\r
+ '-----END RSA PRIVATE KEY-----';\r
+ }\r
+\r
+ return $RSAPrivateKey;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Convert a public key to the appropriate format\r
+ *\r
+ * @access private\r
+ * @see setPublicKeyFormat()\r
+ * @param String $RSAPrivateKey\r
+ * @return String\r
+ */\r
+ function _convertPublicKey($n, $e)\r
+ {\r
+ $modulus = $n->toBytes(true);\r
+ $publicExponent = $e->toBytes(true);\r
+\r
+ switch ($this->publicKeyFormat) {\r
+ case CRYPT_RSA_PUBLIC_FORMAT_RAW:\r
+ return array('e' => $e->copy(), 'n' => $n->copy());\r
+ case CRYPT_RSA_PUBLIC_FORMAT_XML:\r
+ return "<RSAKeyValue>\r\n" .\r
+ ' <Modulus>' . base64_encode($modulus) . "</Modulus>\r\n" .\r
+ ' <Exponent>' . base64_encode($publicExponent) . "</Exponent>\r\n" .\r
+ '</RSAKeyValue>';\r
+ break;\r
+ case CRYPT_RSA_PUBLIC_FORMAT_OPENSSH:\r
+ // from <http://tools.ietf.org/html/rfc4253#page-15>:\r
+ // string "ssh-rsa"\r
+ // mpint e\r
+ // mpint n\r
+ $RSAPublicKey = pack('Na*Na*Na*', strlen('ssh-rsa'), 'ssh-rsa', strlen($publicExponent), $publicExponent, strlen($modulus), $modulus);\r
+ $RSAPublicKey = 'ssh-rsa ' . base64_encode($RSAPublicKey) . ' ' . $this->comment;\r
+\r
+ return $RSAPublicKey;\r
+ default: // eg. CRYPT_RSA_PUBLIC_FORMAT_PKCS1_RAW or CRYPT_RSA_PUBLIC_FORMAT_PKCS1\r
+ // from <http://tools.ietf.org/html/rfc3447#appendix-A.1.1>:\r
+ // RSAPublicKey ::= SEQUENCE {\r
+ // modulus INTEGER, -- n\r
+ // publicExponent INTEGER -- e\r
+ // }\r
+ $components = array(\r
+ 'modulus' => pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($modulus)), $modulus),\r
+ 'publicExponent' => pack('Ca*a*', CRYPT_RSA_ASN1_INTEGER, $this->_encodeLength(strlen($publicExponent)), $publicExponent)\r
+ );\r
+\r
+ $RSAPublicKey = pack('Ca*a*a*',\r
+ CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($components['modulus']) + strlen($components['publicExponent'])),\r
+ $components['modulus'], $components['publicExponent']\r
+ );\r
+\r
+ if ($this->publicKeyFormat == CRYPT_RSA_PUBLIC_FORMAT_PKCS1) {\r
+ // sequence(oid(1.2.840.113549.1.1.1), null)) = rsaEncryption.\r
+ $rsaOID = pack('H*', '300d06092a864886f70d0101010500'); // hex version of MA0GCSqGSIb3DQEBAQUA\r
+ $RSAPublicKey = chr(0) . $RSAPublicKey;\r
+ $RSAPublicKey = chr(3) . $this->_encodeLength(strlen($RSAPublicKey)) . $RSAPublicKey;\r
+\r
+ $RSAPublicKey = pack('Ca*a*',\r
+ CRYPT_RSA_ASN1_SEQUENCE, $this->_encodeLength(strlen($rsaOID . $RSAPublicKey)), $rsaOID . $RSAPublicKey\r
+ );\r
+ }\r
+\r
+ $RSAPublicKey = "-----BEGIN PUBLIC KEY-----\r\n" .\r
+ chunk_split(base64_encode($RSAPublicKey), 64) .\r
+ '-----END PUBLIC KEY-----';\r
+\r
+ return $RSAPublicKey;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Break a public or private key down into its constituant components\r
+ *\r
+ * @access private\r
+ * @see _convertPublicKey()\r
+ * @see _convertPrivateKey()\r
+ * @param String $key\r
+ * @param Integer $type\r
+ * @return Array\r
+ */\r
+ function _parseKey($key, $type)\r
+ {\r
+ if ($type != CRYPT_RSA_PUBLIC_FORMAT_RAW && !is_string($key)) {\r
+ return false;\r
+ }\r
+\r
+ switch ($type) {\r
+ case CRYPT_RSA_PUBLIC_FORMAT_RAW:\r
+ if (!is_array($key)) {\r
+ return false;\r
+ }\r
+ $components = array();\r
+ switch (true) {\r
+ case isset($key['e']):\r
+ $components['publicExponent'] = $key['e']->copy();\r
+ break;\r
+ case isset($key['exponent']):\r
+ $components['publicExponent'] = $key['exponent']->copy();\r
+ break;\r
+ case isset($key['publicExponent']):\r
+ $components['publicExponent'] = $key['publicExponent']->copy();\r
+ break;\r
+ case isset($key[0]):\r
+ $components['publicExponent'] = $key[0]->copy();\r
+ }\r
+ switch (true) {\r
+ case isset($key['n']):\r
+ $components['modulus'] = $key['n']->copy();\r
+ break;\r
+ case isset($key['modulo']):\r
+ $components['modulus'] = $key['modulo']->copy();\r
+ break;\r
+ case isset($key['modulus']):\r
+ $components['modulus'] = $key['modulus']->copy();\r
+ break;\r
+ case isset($key[1]):\r
+ $components['modulus'] = $key[1]->copy();\r
+ }\r
+ return isset($components['modulus']) && isset($components['publicExponent']) ? $components : false;\r
+ case CRYPT_RSA_PRIVATE_FORMAT_PKCS1:\r
+ case CRYPT_RSA_PUBLIC_FORMAT_PKCS1:\r
+ /* Although PKCS#1 proposes a format that public and private keys can use, encrypting them is\r
+ "outside the scope" of PKCS#1. PKCS#1 then refers you to PKCS#12 and PKCS#15 if you're wanting to\r
+ protect private keys, however, that's not what OpenSSL* does. OpenSSL protects private keys by adding\r
+ two new "fields" to the key - DEK-Info and Proc-Type. These fields are discussed here:\r
+\r
+ http://tools.ietf.org/html/rfc1421#section-4.6.1.1\r
+ http://tools.ietf.org/html/rfc1421#section-4.6.1.3\r
+\r
+ DES-EDE3-CBC as an algorithm, however, is not discussed anywhere, near as I can tell.\r
+ DES-CBC and DES-EDE are discussed in RFC1423, however, DES-EDE3-CBC isn't, nor is its key derivation\r
+ function. As is, the definitive authority on this encoding scheme isn't the IETF but rather OpenSSL's\r
+ own implementation. ie. the implementation *is* the standard and any bugs that may exist in that \r
+ implementation are part of the standard, as well.\r
+\r
+ * OpenSSL is the de facto standard. It's utilized by OpenSSH and other projects */\r
+ if (preg_match('#DEK-Info: (.+),(.+)#', $key, $matches)) {\r
+ $iv = pack('H*', trim($matches[2]));\r
+ $symkey = pack('H*', md5($this->password . substr($iv, 0, 8))); // symkey is short for symmetric key\r
+ $symkey.= pack('H*', md5($symkey . $this->password . substr($iv, 0, 8)));\r
+ $ciphertext = preg_replace('#.+(\r|\n|\r\n)\1|[\r\n]|-.+-| #s', '', $key);\r
+ $ciphertext = preg_match('#^[a-zA-Z\d/+]*={0,2}$#', $ciphertext) ? base64_decode($ciphertext) : false;\r
+ if ($ciphertext === false) {\r
+ $ciphertext = $key;\r
+ }\r
+ switch ($matches[1]) {\r
+ case 'AES-256-CBC':\r
+ if (!class_exists('Crypt_AES')) {\r
+ require_once('Crypt/AES.php');\r
+ }\r
+ $crypto = new Crypt_AES();\r
+ break;\r
+ case 'AES-128-CBC':\r
+ if (!class_exists('Crypt_AES')) {\r
+ require_once('Crypt/AES.php');\r
+ }\r
+ $symkey = substr($symkey, 0, 16);\r
+ $crypto = new Crypt_AES();\r
+ break;\r
+ case 'DES-EDE3-CFB':\r
+ if (!class_exists('Crypt_TripleDES')) {\r
+ require_once('Crypt/TripleDES.php');\r
+ }\r
+ $crypto = new Crypt_TripleDES(CRYPT_DES_MODE_CFB);\r
+ break;\r
+ case 'DES-EDE3-CBC':\r
+ if (!class_exists('Crypt_TripleDES')) {\r
+ require_once('Crypt/TripleDES.php');\r
+ }\r
+ $symkey = substr($symkey, 0, 24);\r
+ $crypto = new Crypt_TripleDES();\r
+ break;\r
+ case 'DES-CBC':\r
+ if (!class_exists('Crypt_DES')) {\r
+ require_once('Crypt/DES.php');\r
+ }\r
+ $crypto = new Crypt_DES();\r
+ break;\r
+ default:\r
+ return false;\r
+ }\r
+ $crypto->setKey($symkey);\r
+ $crypto->setIV($iv);\r
+ $decoded = $crypto->decrypt($ciphertext);\r
+ } else {\r
+ $decoded = preg_replace('#-.+-|[\r\n]| #', '', $key);\r
+ $decoded = preg_match('#^[a-zA-Z\d/+]*={0,2}$#', $decoded) ? base64_decode($decoded) : false;\r
+ }\r
+\r
+ if ($decoded !== false) {\r
+ $key = $decoded;\r
+ }\r
+\r
+ $components = array();\r
+\r
+ if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_SEQUENCE) {\r
+ return false;\r
+ }\r
+ if ($this->_decodeLength($key) != strlen($key)) {\r
+ return false;\r
+ }\r
+\r
+ $tag = ord($this->_string_shift($key));\r
+ /* intended for keys for which OpenSSL's asn1parse returns the following:\r
+\r
+ 0:d=0 hl=4 l= 631 cons: SEQUENCE\r
+ 4:d=1 hl=2 l= 1 prim: INTEGER :00\r
+ 7:d=1 hl=2 l= 13 cons: SEQUENCE\r
+ 9:d=2 hl=2 l= 9 prim: OBJECT :rsaEncryption\r
+ 20:d=2 hl=2 l= 0 prim: NULL\r
+ 22:d=1 hl=4 l= 609 prim: OCTET STRING */\r
+\r
+ if ($tag == CRYPT_RSA_ASN1_INTEGER && substr($key, 0, 3) == "\x01\x00\x30") {\r
+ $this->_string_shift($key, 3);\r
+ $tag = CRYPT_RSA_ASN1_SEQUENCE;\r
+ }\r
+\r
+ if ($tag == CRYPT_RSA_ASN1_SEQUENCE) {\r
+ /* intended for keys for which OpenSSL's asn1parse returns the following:\r
+\r
+ 0:d=0 hl=4 l= 290 cons: SEQUENCE\r
+ 4:d=1 hl=2 l= 13 cons: SEQUENCE\r
+ 6:d=2 hl=2 l= 9 prim: OBJECT :rsaEncryption\r
+ 17:d=2 hl=2 l= 0 prim: NULL\r
+ 19:d=1 hl=4 l= 271 prim: BIT STRING */\r
+ $this->_string_shift($key, $this->_decodeLength($key));\r
+ $tag = ord($this->_string_shift($key)); // skip over the BIT STRING / OCTET STRING tag\r
+ $this->_decodeLength($key); // skip over the BIT STRING / OCTET STRING length\r
+ // "The initial octet shall encode, as an unsigned binary integer wtih bit 1 as the least significant bit, the number of\r
+ // unused bits in the final subsequent octet. The number shall be in the range zero to seven."\r
+ // -- http://www.itu.int/ITU-T/studygroups/com17/languages/X.690-0207.pdf (section 8.6.2.2)\r
+ if ($tag == CRYPT_RSA_ASN1_BITSTRING) {\r
+ $this->_string_shift($key);\r
+ }\r
+ if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_SEQUENCE) {\r
+ return false;\r
+ }\r
+ if ($this->_decodeLength($key) != strlen($key)) {\r
+ return false;\r
+ }\r
+ $tag = ord($this->_string_shift($key));\r
+ }\r
+ if ($tag != CRYPT_RSA_ASN1_INTEGER) {\r
+ return false;\r
+ }\r
+\r
+ $length = $this->_decodeLength($key);\r
+ $temp = $this->_string_shift($key, $length);\r
+ if (strlen($temp) != 1 || ord($temp) > 2) {\r
+ $components['modulus'] = new Math_BigInteger($temp, 256);\r
+ $this->_string_shift($key); // skip over CRYPT_RSA_ASN1_INTEGER\r
+ $length = $this->_decodeLength($key);\r
+ $components[$type == CRYPT_RSA_PUBLIC_FORMAT_PKCS1 ? 'publicExponent' : 'privateExponent'] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+\r
+ return $components;\r
+ }\r
+ if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_INTEGER) {\r
+ return false;\r
+ }\r
+ $length = $this->_decodeLength($key);\r
+ $components['modulus'] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['publicExponent'] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['privateExponent'] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['primes'] = array(1 => new Math_BigInteger($this->_string_shift($key, $length), 256));\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['primes'][] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['exponents'] = array(1 => new Math_BigInteger($this->_string_shift($key, $length), 256));\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['exponents'][] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['coefficients'] = array(2 => new Math_BigInteger($this->_string_shift($key, $length), 256));\r
+\r
+ if (!empty($key)) {\r
+ if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_SEQUENCE) {\r
+ return false;\r
+ }\r
+ $this->_decodeLength($key);\r
+ while (!empty($key)) {\r
+ if (ord($this->_string_shift($key)) != CRYPT_RSA_ASN1_SEQUENCE) {\r
+ return false;\r
+ }\r
+ $this->_decodeLength($key);\r
+ $key = substr($key, 1);\r
+ $length = $this->_decodeLength($key);\r
+ $components['primes'][] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['exponents'][] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+ $this->_string_shift($key);\r
+ $length = $this->_decodeLength($key);\r
+ $components['coefficients'][] = new Math_BigInteger($this->_string_shift($key, $length), 256);\r
+ }\r
+ }\r
+\r
+ return $components;\r
+ case CRYPT_RSA_PUBLIC_FORMAT_OPENSSH:\r
+ $parts = explode(' ', $key, 3);\r
+\r
+ $key = isset($parts[1]) ? base64_decode($parts[1]) : false;\r
+ if ($key === false) {\r
+ return false;\r
+ }\r
+\r
+ $comment = isset($parts[2]) ? $parts[2] : false;\r
+\r
+ $cleanup = substr($key, 0, 11) == "\0\0\0\7ssh-rsa";\r
+\r
+ if (strlen($key) <= 4) {\r
+ return false;\r
+ }\r
+ extract(unpack('Nlength', $this->_string_shift($key, 4)));\r
+ $publicExponent = new Math_BigInteger($this->_string_shift($key, $length), -256);\r
+ if (strlen($key) <= 4) {\r
+ return false;\r
+ }\r
+ extract(unpack('Nlength', $this->_string_shift($key, 4)));\r
+ $modulus = new Math_BigInteger($this->_string_shift($key, $length), -256);\r
+\r
+ if ($cleanup && strlen($key)) {\r
+ if (strlen($key) <= 4) {\r
+ return false;\r
+ }\r
+ extract(unpack('Nlength', $this->_string_shift($key, 4)));\r
+ $realModulus = new Math_BigInteger($this->_string_shift($key, $length), -256);\r
+ return strlen($key) ? false : array(\r
+ 'modulus' => $realModulus,\r
+ 'publicExponent' => $modulus,\r
+ 'comment' => $comment\r
+ );\r
+ } else {\r
+ return strlen($key) ? false : array(\r
+ 'modulus' => $modulus,\r
+ 'publicExponent' => $publicExponent,\r
+ 'comment' => $comment\r
+ );\r
+ }\r
+ // http://www.w3.org/TR/xmldsig-core/#sec-RSAKeyValue\r
+ // http://en.wikipedia.org/wiki/XML_Signature\r
+ case CRYPT_RSA_PRIVATE_FORMAT_XML:\r
+ case CRYPT_RSA_PUBLIC_FORMAT_XML:\r
+ $this->components = array();\r
+\r
+ $xml = xml_parser_create('UTF-8');\r
+ xml_set_object($xml, $this);\r
+ xml_set_element_handler($xml, '_start_element_handler', '_stop_element_handler');\r
+ xml_set_character_data_handler($xml, '_data_handler');\r
+ // add <xml></xml> to account for "dangling" tags like <BitStrength>...</BitStrength> that are sometimes added\r
+ if (!xml_parse($xml, '<xml>' . $key . '</xml>')) {\r
+ return false;\r
+ }\r
+\r
+ return isset($this->components['modulus']) && isset($this->components['publicExponent']) ? $this->components : false;\r
+ // from PuTTY's SSHPUBK.C\r
+ case CRYPT_RSA_PRIVATE_FORMAT_PUTTY:\r
+ $components = array();\r
+ $key = preg_split('#\r\n|\r|\n#', $key);\r
+ $type = trim(preg_replace('#PuTTY-User-Key-File-2: (.+)#', '$1', $key[0]));\r
+ if ($type != 'ssh-rsa') {\r
+ return false;\r
+ }\r
+ $encryption = trim(preg_replace('#Encryption: (.+)#', '$1', $key[1]));\r
+ $comment = trim(preg_replace('#Comment: (.+)#', '$1', $key[2]));\r
+\r
+ $publicLength = trim(preg_replace('#Public-Lines: (\d+)#', '$1', $key[3]));\r
+ $public = base64_decode(implode('', array_map('trim', array_slice($key, 4, $publicLength))));\r
+ $public = substr($public, 11);\r
+ extract(unpack('Nlength', $this->_string_shift($public, 4)));\r
+ $components['publicExponent'] = new Math_BigInteger($this->_string_shift($public, $length), -256);\r
+ extract(unpack('Nlength', $this->_string_shift($public, 4)));\r
+ $components['modulus'] = new Math_BigInteger($this->_string_shift($public, $length), -256);\r
+\r
+ $privateLength = trim(preg_replace('#Private-Lines: (\d+)#', '$1', $key[$publicLength + 4]));\r
+ $private = base64_decode(implode('', array_map('trim', array_slice($key, $publicLength + 5, $privateLength))));\r
+\r
+ switch ($encryption) {\r
+ case 'aes256-cbc':\r
+ if (!class_exists('Crypt_AES')) {\r
+ require_once('Crypt/AES.php');\r
+ }\r
+ $symkey = '';\r
+ $sequence = 0;\r
+ while (strlen($symkey) < 32) {\r
+ $temp = pack('Na*', $sequence++, $this->password);\r
+ $symkey.= pack('H*', sha1($temp));\r
+ }\r
+ $symkey = substr($symkey, 0, 32);\r
+ $crypto = new Crypt_AES();\r
+ }\r
+\r
+ if ($encryption != 'none') {\r
+ $crypto->setKey($symkey);\r
+ $crypto->disablePadding();\r
+ $private = $crypto->decrypt($private);\r
+ if ($private === false) {\r
+ return false;\r
+ }\r
+ }\r
+\r
+ extract(unpack('Nlength', $this->_string_shift($private, 4)));\r
+ if (strlen($private) < $length) {\r
+ return false;\r
+ }\r
+ $components['privateExponent'] = new Math_BigInteger($this->_string_shift($private, $length), -256);\r
+ extract(unpack('Nlength', $this->_string_shift($private, 4)));\r
+ if (strlen($private) < $length) {\r
+ return false;\r
+ }\r
+ $components['primes'] = array(1 => new Math_BigInteger($this->_string_shift($private, $length), -256));\r
+ extract(unpack('Nlength', $this->_string_shift($private, 4)));\r
+ if (strlen($private) < $length) {\r
+ return false;\r
+ }\r
+ $components['primes'][] = new Math_BigInteger($this->_string_shift($private, $length), -256);\r
+\r
+ $temp = $components['primes'][1]->subtract($this->one);\r
+ $components['exponents'] = array(1 => $components['publicExponent']->modInverse($temp));\r
+ $temp = $components['primes'][2]->subtract($this->one);\r
+ $components['exponents'][] = $components['publicExponent']->modInverse($temp);\r
+\r
+ extract(unpack('Nlength', $this->_string_shift($private, 4)));\r
+ if (strlen($private) < $length) {\r
+ return false;\r
+ }\r
+ $components['coefficients'] = array(2 => new Math_BigInteger($this->_string_shift($private, $length), -256));\r
+\r
+ return $components;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Returns the key size\r
+ *\r
+ * More specifically, this returns the size of the modulo in bits.\r
+ *\r
+ * @access public\r
+ * @return Integer\r
+ */\r
+ function getSize()\r
+ {\r
+ return !isset($this->modulus) ? 0 : strlen($this->modulus->toBits());\r
+ }\r
+\r
+ /**\r
+ * Start Element Handler\r
+ *\r
+ * Called by xml_set_element_handler()\r
+ *\r
+ * @access private\r
+ * @param Resource $parser\r
+ * @param String $name\r
+ * @param Array $attribs\r
+ */\r
+ function _start_element_handler($parser, $name, $attribs)\r
+ {\r
+ //$name = strtoupper($name);\r
+ switch ($name) {\r
+ case 'MODULUS':\r
+ $this->current = &$this->components['modulus'];\r
+ break;\r
+ case 'EXPONENT':\r
+ $this->current = &$this->components['publicExponent'];\r
+ break;\r
+ case 'P':\r
+ $this->current = &$this->components['primes'][1];\r
+ break;\r
+ case 'Q':\r
+ $this->current = &$this->components['primes'][2];\r
+ break;\r
+ case 'DP':\r
+ $this->current = &$this->components['exponents'][1];\r
+ break;\r
+ case 'DQ':\r
+ $this->current = &$this->components['exponents'][2];\r
+ break;\r
+ case 'INVERSEQ':\r
+ $this->current = &$this->components['coefficients'][2];\r
+ break;\r
+ case 'D':\r
+ $this->current = &$this->components['privateExponent'];\r
+ break;\r
+ default:\r
+ unset($this->current);\r
+ }\r
+ $this->current = '';\r
+ }\r
+\r
+ /**\r
+ * Stop Element Handler\r
+ *\r
+ * Called by xml_set_element_handler()\r
+ *\r
+ * @access private\r
+ * @param Resource $parser\r
+ * @param String $name\r
+ */\r
+ function _stop_element_handler($parser, $name)\r
+ {\r
+ //$name = strtoupper($name);\r
+ if ($name == 'RSAKEYVALUE') {\r
+ return;\r
+ }\r
+ $this->current = new Math_BigInteger(base64_decode($this->current), 256);\r
+ }\r
+\r
+ /**\r
+ * Data Handler\r
+ *\r
+ * Called by xml_set_character_data_handler()\r
+ *\r
+ * @access private\r
+ * @param Resource $parser\r
+ * @param String $data\r
+ */\r
+ function _data_handler($parser, $data)\r
+ {\r
+ if (!isset($this->current) || is_object($this->current)) {\r
+ return;\r
+ }\r
+ $this->current.= trim($data);\r
+ }\r
+\r
+ /**\r
+ * Loads a public or private key\r
+ *\r
+ * Returns true on success and false on failure (ie. an incorrect password was provided or the key was malformed)\r
+ *\r
+ * @access public\r
+ * @param String $key\r
+ * @param Integer $type optional\r
+ */\r
+ function loadKey($key, $type = false)\r
+ {\r
+ if ($type === false) {\r
+ $types = array(\r
+ CRYPT_RSA_PUBLIC_FORMAT_RAW,\r
+ CRYPT_RSA_PRIVATE_FORMAT_PKCS1,\r
+ CRYPT_RSA_PRIVATE_FORMAT_XML,\r
+ CRYPT_RSA_PRIVATE_FORMAT_PUTTY,\r
+ CRYPT_RSA_PUBLIC_FORMAT_OPENSSH\r
+ );\r
+ foreach ($types as $type) {\r
+ $components = $this->_parseKey($key, $type);\r
+ if ($components !== false) {\r
+ break;\r
+ }\r
+ }\r
+ \r
+ } else {\r
+ $components = $this->_parseKey($key, $type);\r
+ }\r
+\r
+ if ($components === false) {\r
+ return false;\r
+ }\r
+\r
+ if (isset($components['comment']) && $components['comment'] !== false) {\r
+ $this->comment = $components['comment'];\r
+ }\r
+ $this->modulus = $components['modulus'];\r
+ $this->k = strlen($this->modulus->toBytes());\r
+ $this->exponent = isset($components['privateExponent']) ? $components['privateExponent'] : $components['publicExponent'];\r
+ if (isset($components['primes'])) {\r
+ $this->primes = $components['primes'];\r
+ $this->exponents = $components['exponents'];\r
+ $this->coefficients = $components['coefficients'];\r
+ $this->publicExponent = $components['publicExponent'];\r
+ } else {\r
+ $this->primes = array();\r
+ $this->exponents = array();\r
+ $this->coefficients = array();\r
+ $this->publicExponent = false;\r
+ }\r
+\r
+ return true;\r
+ }\r
+\r
+ /**\r
+ * Sets the password\r
+ *\r
+ * Private keys can be encrypted with a password. To unset the password, pass in the empty string or false.\r
+ * Or rather, pass in $password such that empty($password) && !is_string($password) is true.\r
+ *\r
+ * @see createKey()\r
+ * @see loadKey()\r
+ * @access public\r
+ * @param String $password\r
+ */\r
+ function setPassword($password = false)\r
+ {\r
+ $this->password = $password;\r
+ }\r
+\r
+ /**\r
+ * Defines the public key\r
+ *\r
+ * Some private key formats define the public exponent and some don't. Those that don't define it are problematic when\r
+ * used in certain contexts. For example, in SSH-2, RSA authentication works by sending the public key along with a\r
+ * message signed by the private key to the server. The SSH-2 server looks the public key up in an index of public keys\r
+ * and if it's present then proceeds to verify the signature. Problem is, if your private key doesn't include the public\r
+ * exponent this won't work unless you manually add the public exponent.\r
+ *\r
+ * Do note that when a new key is loaded the index will be cleared.\r
+ *\r
+ * Returns true on success, false on failure\r
+ *\r
+ * @see getPublicKey()\r
+ * @access public\r
+ * @param String $key optional\r
+ * @param Integer $type optional\r
+ * @return Boolean\r
+ */\r
+ function setPublicKey($key = false, $type = false)\r
+ {\r
+ if ($key === false && !empty($this->modulus)) {\r
+ $this->publicExponent = $this->exponent;\r
+ return true;\r
+ }\r
+\r
+ if ($type === false) {\r
+ $types = array(\r
+ CRYPT_RSA_PUBLIC_FORMAT_RAW,\r
+ CRYPT_RSA_PUBLIC_FORMAT_PKCS1,\r
+ CRYPT_RSA_PUBLIC_FORMAT_XML,\r
+ CRYPT_RSA_PUBLIC_FORMAT_OPENSSH\r
+ );\r
+ foreach ($types as $type) {\r
+ $components = $this->_parseKey($key, $type);\r
+ if ($components !== false) {\r
+ break;\r
+ }\r
+ }\r
+ } else {\r
+ $components = $this->_parseKey($key, $type);\r
+ }\r
+\r
+ if ($components === false) {\r
+ return false;\r
+ }\r
+\r
+ if (empty($this->modulus) || !$this->modulus->equals($components['modulus'])) {\r
+ $this->modulus = $components['modulus'];\r
+ $this->exponent = $this->publicExponent = $components['publicExponent'];\r
+ return true;\r
+ }\r
+\r
+ $this->publicExponent = $components['publicExponent'];\r
+\r
+ return true;\r
+ }\r
+\r
+ /**\r
+ * Returns the public key\r
+ *\r
+ * The public key is only returned under two circumstances - if the private key had the public key embedded within it\r
+ * or if the public key was set via setPublicKey(). If the currently loaded key is supposed to be the public key this\r
+ * function won't return it since this library, for the most part, doesn't distinguish between public and private keys.\r
+ *\r
+ * @see getPublicKey()\r
+ * @access public\r
+ * @param String $key\r
+ * @param Integer $type optional\r
+ */\r
+ function getPublicKey($type = CRYPT_RSA_PUBLIC_FORMAT_PKCS1)\r
+ {\r
+ if (empty($this->modulus) || empty($this->publicExponent)) {\r
+ return false;\r
+ }\r
+\r
+ $oldFormat = $this->publicKeyFormat;\r
+ $this->publicKeyFormat = $type;\r
+ $temp = $this->_convertPublicKey($this->modulus, $this->publicExponent);\r
+ $this->publicKeyFormat = $oldFormat;\r
+ return $temp;\r
+ }\r
+\r
+ /**\r
+ * Returns the private key\r
+ *\r
+ * The private key is only returned if the currently loaded key contains the constituent prime numbers.\r
+ *\r
+ * @see getPublicKey()\r
+ * @access public\r
+ * @param String $key\r
+ * @param Integer $type optional\r
+ */\r
+ function getPrivateKey($type = CRYPT_RSA_PUBLIC_FORMAT_PKCS1)\r
+ {\r
+ if (empty($this->primes)) {\r
+ return false;\r
+ }\r
+\r
+ $oldFormat = $this->privateKeyFormat;\r
+ $this->privateKeyFormat = $type;\r
+ $temp = $this->_convertPrivateKey($this->modulus, $this->publicExponent, $this->exponent, $this->primes, $this->exponents, $this->coefficients);\r
+ $this->privateKeyFormat = $oldFormat;\r
+ return $temp;\r
+ }\r
+\r
+ /**\r
+ * Returns a minimalistic private key\r
+ *\r
+ * Returns the private key without the prime number constituants. Structurally identical to a public key that\r
+ * hasn't been set as the public key\r
+ *\r
+ * @see getPrivateKey()\r
+ * @access private\r
+ * @param String $key\r
+ * @param Integer $type optional\r
+ */\r
+ function _getPrivatePublicKey($mode = CRYPT_RSA_PUBLIC_FORMAT_PKCS1)\r
+ {\r
+ if (empty($this->modulus) || empty($this->exponent)) {\r
+ return false;\r
+ }\r
+\r
+ $oldFormat = $this->publicKeyFormat;\r
+ $this->publicKeyFormat = $mode;\r
+ $temp = $this->_convertPublicKey($this->modulus, $this->exponent);\r
+ $this->publicKeyFormat = $oldFormat;\r
+ return $temp;\r
+ }\r
+\r
+ /**\r
+ * __toString() magic method\r
+ *\r
+ * @access public\r
+ */\r
+ function __toString()\r
+ {\r
+ $key = $this->getPrivateKey($this->privateKeyFormat);\r
+ if ($key !== false) {\r
+ return $key;\r
+ }\r
+ $key = $this->_getPrivatePublicKey($this->publicKeyFormat);\r
+ return $key !== false ? $key : '';\r
+ }\r
+\r
+ /**\r
+ * Generates the smallest and largest numbers requiring $bits bits\r
+ *\r
+ * @access private\r
+ * @param Integer $bits\r
+ * @return Array\r
+ */\r
+ function _generateMinMax($bits)\r
+ {\r
+ $bytes = $bits >> 3;\r
+ $min = str_repeat(chr(0), $bytes);\r
+ $max = str_repeat(chr(0xFF), $bytes);\r
+ $msb = $bits & 7;\r
+ if ($msb) {\r
+ $min = chr(1 << ($msb - 1)) . $min;\r
+ $max = chr((1 << $msb) - 1) . $max;\r
+ } else {\r
+ $min[0] = chr(0x80);\r
+ }\r
+\r
+ return array(\r
+ 'min' => new Math_BigInteger($min, 256),\r
+ 'max' => new Math_BigInteger($max, 256)\r
+ );\r
+ }\r
+\r
+ /**\r
+ * DER-decode the length\r
+ *\r
+ * DER supports lengths up to (2**8)**127, however, we'll only support lengths up to (2**8)**4. See\r
+ * {@link http://itu.int/ITU-T/studygroups/com17/languages/X.690-0207.pdf#p=13 X.690 paragraph 8.1.3} for more information.\r
+ *\r
+ * @access private\r
+ * @param String $string\r
+ * @return Integer\r
+ */\r
+ function _decodeLength(&$string)\r
+ {\r
+ $length = ord($this->_string_shift($string));\r
+ if ( $length & 0x80 ) { // definite length, long form\r
+ $length&= 0x7F;\r
+ $temp = $this->_string_shift($string, $length);\r
+ list(, $length) = unpack('N', substr(str_pad($temp, 4, chr(0), STR_PAD_LEFT), -4));\r
+ }\r
+ return $length;\r
+ }\r
+\r
+ /**\r
+ * DER-encode the length\r
+ *\r
+ * DER supports lengths up to (2**8)**127, however, we'll only support lengths up to (2**8)**4. See\r
+ * {@link http://itu.int/ITU-T/studygroups/com17/languages/X.690-0207.pdf#p=13 X.690 paragraph 8.1.3} for more information.\r
+ *\r
+ * @access private\r
+ * @param Integer $length\r
+ * @return String\r
+ */\r
+ function _encodeLength($length)\r
+ {\r
+ if ($length <= 0x7F) {\r
+ return chr($length);\r
+ }\r
+\r
+ $temp = ltrim(pack('N', $length), chr(0));\r
+ return pack('Ca*', 0x80 | strlen($temp), $temp);\r
+ }\r
+\r
+ /**\r
+ * String Shift\r
+ *\r
+ * Inspired by array_shift\r
+ *\r
+ * @param String $string\r
+ * @param optional Integer $index\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _string_shift(&$string, $index = 1)\r
+ {\r
+ $substr = substr($string, 0, $index);\r
+ $string = substr($string, $index);\r
+ return $substr;\r
+ }\r
+\r
+ /**\r
+ * Determines the private key format\r
+ *\r
+ * @see createKey()\r
+ * @access public\r
+ * @param Integer $format\r
+ */\r
+ function setPrivateKeyFormat($format)\r
+ {\r
+ $this->privateKeyFormat = $format;\r
+ }\r
+\r
+ /**\r
+ * Determines the public key format\r
+ *\r
+ * @see createKey()\r
+ * @access public\r
+ * @param Integer $format\r
+ */\r
+ function setPublicKeyFormat($format)\r
+ {\r
+ $this->publicKeyFormat = $format;\r
+ }\r
+\r
+ /**\r
+ * Determines which hashing function should be used\r
+ *\r
+ * Used with signature production / verification and (if the encryption mode is CRYPT_RSA_ENCRYPTION_OAEP) encryption and\r
+ * decryption. If $hash isn't supported, sha1 is used.\r
+ *\r
+ * @access public\r
+ * @param String $hash\r
+ */\r
+ function setHash($hash)\r
+ {\r
+ // Crypt_Hash supports algorithms that PKCS#1 doesn't support. md5-96 and sha1-96, for example.\r
+ switch ($hash) {\r
+ case 'md2':\r
+ case 'md5':\r
+ case 'sha1':\r
+ case 'sha256':\r
+ case 'sha384':\r
+ case 'sha512':\r
+ $this->hash = new Crypt_Hash($hash);\r
+ $this->hashName = $hash;\r
+ break;\r
+ default:\r
+ $this->hash = new Crypt_Hash('sha1');\r
+ $this->hashName = 'sha1';\r
+ }\r
+ $this->hLen = $this->hash->getLength();\r
+ }\r
+\r
+ /**\r
+ * Determines which hashing function should be used for the mask generation function\r
+ *\r
+ * The mask generation function is used by CRYPT_RSA_ENCRYPTION_OAEP and CRYPT_RSA_SIGNATURE_PSS and although it's\r
+ * best if Hash and MGFHash are set to the same thing this is not a requirement.\r
+ *\r
+ * @access public\r
+ * @param String $hash\r
+ */\r
+ function setMGFHash($hash)\r
+ {\r
+ // Crypt_Hash supports algorithms that PKCS#1 doesn't support. md5-96 and sha1-96, for example.\r
+ switch ($hash) {\r
+ case 'md2':\r
+ case 'md5':\r
+ case 'sha1':\r
+ case 'sha256':\r
+ case 'sha384':\r
+ case 'sha512':\r
+ $this->mgfHash = new Crypt_Hash($hash);\r
+ break;\r
+ default:\r
+ $this->mgfHash = new Crypt_Hash('sha1');\r
+ }\r
+ $this->mgfHLen = $this->mgfHash->getLength();\r
+ }\r
+\r
+ /**\r
+ * Determines the salt length\r
+ *\r
+ * To quote from {@link http://tools.ietf.org/html/rfc3447#page-38 RFC3447#page-38}:\r
+ *\r
+ * Typical salt lengths in octets are hLen (the length of the output\r
+ * of the hash function Hash) and 0.\r
+ *\r
+ * @access public\r
+ * @param Integer $format\r
+ */\r
+ function setSaltLength($sLen)\r
+ {\r
+ $this->sLen = $sLen;\r
+ }\r
+\r
+ /**\r
+ * Integer-to-Octet-String primitive\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-4.1 RFC3447#section-4.1}.\r
+ *\r
+ * @access private\r
+ * @param Math_BigInteger $x\r
+ * @param Integer $xLen\r
+ * @return String\r
+ */\r
+ function _i2osp($x, $xLen)\r
+ {\r
+ $x = $x->toBytes();\r
+ if (strlen($x) > $xLen) {\r
+ user_error('Integer too large');\r
+ return false;\r
+ }\r
+ return str_pad($x, $xLen, chr(0), STR_PAD_LEFT);\r
+ }\r
+\r
+ /**\r
+ * Octet-String-to-Integer primitive\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-4.2 RFC3447#section-4.2}.\r
+ *\r
+ * @access private\r
+ * @param String $x\r
+ * @return Math_BigInteger\r
+ */\r
+ function _os2ip($x)\r
+ {\r
+ return new Math_BigInteger($x, 256);\r
+ }\r
+\r
+ /**\r
+ * Exponentiate with or without Chinese Remainder Theorem\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-5.1.1 RFC3447#section-5.1.2}.\r
+ *\r
+ * @access private\r
+ * @param Math_BigInteger $x\r
+ * @return Math_BigInteger\r
+ */\r
+ function _exponentiate($x)\r
+ {\r
+ if (empty($this->primes) || empty($this->coefficients) || empty($this->exponents)) {\r
+ return $x->modPow($this->exponent, $this->modulus);\r
+ }\r
+\r
+ $num_primes = count($this->primes);\r
+\r
+ if (defined('CRYPT_RSA_DISABLE_BLINDING')) {\r
+ $m_i = array(\r
+ 1 => $x->modPow($this->exponents[1], $this->primes[1]),\r
+ 2 => $x->modPow($this->exponents[2], $this->primes[2])\r
+ );\r
+ $h = $m_i[1]->subtract($m_i[2]);\r
+ $h = $h->multiply($this->coefficients[2]);\r
+ list(, $h) = $h->divide($this->primes[1]);\r
+ $m = $m_i[2]->add($h->multiply($this->primes[2]));\r
+\r
+ $r = $this->primes[1];\r
+ for ($i = 3; $i <= $num_primes; $i++) {\r
+ $m_i = $x->modPow($this->exponents[$i], $this->primes[$i]);\r
+\r
+ $r = $r->multiply($this->primes[$i - 1]);\r
+\r
+ $h = $m_i->subtract($m);\r
+ $h = $h->multiply($this->coefficients[$i]);\r
+ list(, $h) = $h->divide($this->primes[$i]);\r
+\r
+ $m = $m->add($r->multiply($h));\r
+ }\r
+ } else {\r
+ $smallest = $this->primes[1];\r
+ for ($i = 2; $i <= $num_primes; $i++) {\r
+ if ($smallest->compare($this->primes[$i]) > 0) {\r
+ $smallest = $this->primes[$i];\r
+ }\r
+ }\r
+\r
+ $one = new Math_BigInteger(1);\r
+\r
+ $r = $one->random($one, $smallest->subtract($one));\r
+\r
+ $m_i = array(\r
+ 1 => $this->_blind($x, $r, 1),\r
+ 2 => $this->_blind($x, $r, 2)\r
+ );\r
+ $h = $m_i[1]->subtract($m_i[2]);\r
+ $h = $h->multiply($this->coefficients[2]);\r
+ list(, $h) = $h->divide($this->primes[1]);\r
+ $m = $m_i[2]->add($h->multiply($this->primes[2]));\r
+\r
+ $r = $this->primes[1];\r
+ for ($i = 3; $i <= $num_primes; $i++) {\r
+ $m_i = $this->_blind($x, $r, $i);\r
+\r
+ $r = $r->multiply($this->primes[$i - 1]);\r
+\r
+ $h = $m_i->subtract($m);\r
+ $h = $h->multiply($this->coefficients[$i]);\r
+ list(, $h) = $h->divide($this->primes[$i]);\r
+\r
+ $m = $m->add($r->multiply($h));\r
+ }\r
+ }\r
+\r
+ return $m;\r
+ }\r
+\r
+ /**\r
+ * Performs RSA Blinding\r
+ *\r
+ * Protects against timing attacks by employing RSA Blinding.\r
+ * Returns $x->modPow($this->exponents[$i], $this->primes[$i])\r
+ *\r
+ * @access private\r
+ * @param Math_BigInteger $x\r
+ * @param Math_BigInteger $r\r
+ * @param Integer $i\r
+ * @return Math_BigInteger\r
+ */\r
+ function _blind($x, $r, $i)\r
+ {\r
+ $x = $x->multiply($r->modPow($this->publicExponent, $this->primes[$i]));\r
+ $x = $x->modPow($this->exponents[$i], $this->primes[$i]);\r
+\r
+ $r = $r->modInverse($this->primes[$i]);\r
+ $x = $x->multiply($r);\r
+ list(, $x) = $x->divide($this->primes[$i]);\r
+\r
+ return $x;\r
+ }\r
+\r
+ /**\r
+ * Performs blinded RSA equality testing\r
+ *\r
+ * Protects against a particular type of timing attack described.\r
+ *\r
+ * See {@link http://codahale.com/a-lesson-in-timing-attacks/ A Lesson In Timing Attacks (or, Don't use MessageDigest.isEquals)}\r
+ *\r
+ * Thanks for the heads up singpolyma!\r
+ *\r
+ * @access private\r
+ * @param String $x\r
+ * @param String $y\r
+ * @return Boolean\r
+ */\r
+ function _equals($x, $y)\r
+ {\r
+ if (strlen($x) != strlen($y)) {\r
+ return false;\r
+ }\r
+\r
+ $result = 0;\r
+ for ($i = 0; $i < strlen($x); $i++) {\r
+ $result |= ord($x[$i]) ^ ord($y[$i]);\r
+ }\r
+\r
+ return $result == 0;\r
+ }\r
+\r
+ /**\r
+ * RSAEP\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-5.1.1 RFC3447#section-5.1.1}.\r
+ *\r
+ * @access private\r
+ * @param Math_BigInteger $m\r
+ * @return Math_BigInteger\r
+ */\r
+ function _rsaep($m)\r
+ {\r
+ if ($m->compare($this->zero) < 0 || $m->compare($this->modulus) > 0) {\r
+ user_error('Message representative out of range');\r
+ return false;\r
+ }\r
+ return $this->_exponentiate($m);\r
+ }\r
+\r
+ /**\r
+ * RSADP\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-5.1.2 RFC3447#section-5.1.2}.\r
+ *\r
+ * @access private\r
+ * @param Math_BigInteger $c\r
+ * @return Math_BigInteger\r
+ */\r
+ function _rsadp($c)\r
+ {\r
+ if ($c->compare($this->zero) < 0 || $c->compare($this->modulus) > 0) {\r
+ user_error('Ciphertext representative out of range');\r
+ return false;\r
+ }\r
+ return $this->_exponentiate($c);\r
+ }\r
+\r
+ /**\r
+ * RSASP1\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-5.2.1 RFC3447#section-5.2.1}.\r
+ *\r
+ * @access private\r
+ * @param Math_BigInteger $m\r
+ * @return Math_BigInteger\r
+ */\r
+ function _rsasp1($m)\r
+ {\r
+ if ($m->compare($this->zero) < 0 || $m->compare($this->modulus) > 0) {\r
+ user_error('Message representative out of range');\r
+ return false;\r
+ }\r
+ return $this->_exponentiate($m);\r
+ }\r
+\r
+ /**\r
+ * RSAVP1\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-5.2.2 RFC3447#section-5.2.2}.\r
+ *\r
+ * @access private\r
+ * @param Math_BigInteger $s\r
+ * @return Math_BigInteger\r
+ */\r
+ function _rsavp1($s)\r
+ {\r
+ if ($s->compare($this->zero) < 0 || $s->compare($this->modulus) > 0) {\r
+ user_error('Signature representative out of range');\r
+ return false;\r
+ }\r
+ return $this->_exponentiate($s);\r
+ }\r
+\r
+ /**\r
+ * MGF1\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#appendix-B.2.1 RFC3447#appendix-B.2.1}.\r
+ *\r
+ * @access private\r
+ * @param String $mgfSeed\r
+ * @param Integer $mgfLen\r
+ * @return String\r
+ */\r
+ function _mgf1($mgfSeed, $maskLen)\r
+ {\r
+ // if $maskLen would yield strings larger than 4GB, PKCS#1 suggests a "Mask too long" error be output.\r
+\r
+ $t = '';\r
+ $count = ceil($maskLen / $this->mgfHLen);\r
+ for ($i = 0; $i < $count; $i++) {\r
+ $c = pack('N', $i);\r
+ $t.= $this->mgfHash->hash($mgfSeed . $c);\r
+ }\r
+\r
+ return substr($t, 0, $maskLen);\r
+ }\r
+\r
+ /**\r
+ * RSAES-OAEP-ENCRYPT\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-7.1.1 RFC3447#section-7.1.1} and\r
+ * {http://en.wikipedia.org/wiki/Optimal_Asymmetric_Encryption_Padding OAES}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @param String $l\r
+ * @return String\r
+ */\r
+ function _rsaes_oaep_encrypt($m, $l = '')\r
+ {\r
+ $mLen = strlen($m);\r
+\r
+ // Length checking\r
+\r
+ // if $l is larger than two million terrabytes and you're using sha1, PKCS#1 suggests a "Label too long" error\r
+ // be output.\r
+\r
+ if ($mLen > $this->k - 2 * $this->hLen - 2) {\r
+ user_error('Message too long');\r
+ return false;\r
+ }\r
+\r
+ // EME-OAEP encoding\r
+\r
+ $lHash = $this->hash->hash($l);\r
+ $ps = str_repeat(chr(0), $this->k - $mLen - 2 * $this->hLen - 2);\r
+ $db = $lHash . $ps . chr(1) . $m;\r
+ $seed = crypt_random_string($this->hLen);\r
+ $dbMask = $this->_mgf1($seed, $this->k - $this->hLen - 1);\r
+ $maskedDB = $db ^ $dbMask;\r
+ $seedMask = $this->_mgf1($maskedDB, $this->hLen);\r
+ $maskedSeed = $seed ^ $seedMask;\r
+ $em = chr(0) . $maskedSeed . $maskedDB;\r
+\r
+ // RSA encryption\r
+\r
+ $m = $this->_os2ip($em);\r
+ $c = $this->_rsaep($m);\r
+ $c = $this->_i2osp($c, $this->k);\r
+\r
+ // Output the ciphertext C\r
+\r
+ return $c;\r
+ }\r
+\r
+ /**\r
+ * RSAES-OAEP-DECRYPT\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-7.1.2 RFC3447#section-7.1.2}. The fact that the error\r
+ * messages aren't distinguishable from one another hinders debugging, but, to quote from RFC3447#section-7.1.2:\r
+ * \r
+ * Note. Care must be taken to ensure that an opponent cannot\r
+ * distinguish the different error conditions in Step 3.g, whether by\r
+ * error message or timing, or, more generally, learn partial\r
+ * information about the encoded message EM. Otherwise an opponent may\r
+ * be able to obtain useful information about the decryption of the\r
+ * ciphertext C, leading to a chosen-ciphertext attack such as the one\r
+ * observed by Manger [36].\r
+ *\r
+ * As for $l... to quote from {@link http://tools.ietf.org/html/rfc3447#page-17 RFC3447#page-17}:\r
+ *\r
+ * Both the encryption and the decryption operations of RSAES-OAEP take\r
+ * the value of a label L as input. In this version of PKCS #1, L is\r
+ * the empty string; other uses of the label are outside the scope of\r
+ * this document.\r
+ *\r
+ * @access private\r
+ * @param String $c\r
+ * @param String $l\r
+ * @return String\r
+ */\r
+ function _rsaes_oaep_decrypt($c, $l = '')\r
+ {\r
+ // Length checking\r
+\r
+ // if $l is larger than two million terrabytes and you're using sha1, PKCS#1 suggests a "Label too long" error\r
+ // be output.\r
+\r
+ if (strlen($c) != $this->k || $this->k < 2 * $this->hLen + 2) {\r
+ user_error('Decryption error');\r
+ return false;\r
+ }\r
+\r
+ // RSA decryption\r
+\r
+ $c = $this->_os2ip($c);\r
+ $m = $this->_rsadp($c);\r
+ if ($m === false) {\r
+ user_error('Decryption error');\r
+ return false;\r
+ }\r
+ $em = $this->_i2osp($m, $this->k);\r
+\r
+ // EME-OAEP decoding\r
+\r
+ $lHash = $this->hash->hash($l);\r
+ $y = ord($em[0]);\r
+ $maskedSeed = substr($em, 1, $this->hLen);\r
+ $maskedDB = substr($em, $this->hLen + 1);\r
+ $seedMask = $this->_mgf1($maskedDB, $this->hLen);\r
+ $seed = $maskedSeed ^ $seedMask;\r
+ $dbMask = $this->_mgf1($seed, $this->k - $this->hLen - 1);\r
+ $db = $maskedDB ^ $dbMask;\r
+ $lHash2 = substr($db, 0, $this->hLen);\r
+ $m = substr($db, $this->hLen);\r
+ if ($lHash != $lHash2) {\r
+ user_error('Decryption error');\r
+ return false;\r
+ }\r
+ $m = ltrim($m, chr(0));\r
+ if (ord($m[0]) != 1) {\r
+ user_error('Decryption error');\r
+ return false;\r
+ }\r
+\r
+ // Output the message M\r
+\r
+ return substr($m, 1);\r
+ }\r
+\r
+ /**\r
+ * RSAES-PKCS1-V1_5-ENCRYPT\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-7.2.1 RFC3447#section-7.2.1}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @return String\r
+ */\r
+ function _rsaes_pkcs1_v1_5_encrypt($m)\r
+ {\r
+ $mLen = strlen($m);\r
+\r
+ // Length checking\r
+\r
+ if ($mLen > $this->k - 11) {\r
+ user_error('Message too long');\r
+ return false;\r
+ }\r
+\r
+ // EME-PKCS1-v1_5 encoding\r
+\r
+ $psLen = $this->k - $mLen - 3;\r
+ $ps = '';\r
+ while (strlen($ps) != $psLen) {\r
+ $temp = crypt_random_string($psLen - strlen($ps));\r
+ $temp = str_replace("\x00", '', $temp);\r
+ $ps.= $temp;\r
+ }\r
+ $type = 2;\r
+ // see the comments of _rsaes_pkcs1_v1_5_decrypt() to understand why this is being done\r
+ if (defined('CRYPT_RSA_PKCS15_COMPAT') && (!isset($this->publicExponent) || $this->exponent !== $this->publicExponent)) {\r
+ $type = 1;\r
+ // "The padding string PS shall consist of k-3-||D|| octets. ... for block type 01, they shall have value FF"\r
+ $ps = str_repeat("\xFF", $psLen);\r
+ }\r
+ $em = chr(0) . chr($type) . $ps . chr(0) . $m;\r
+\r
+ // RSA encryption\r
+ $m = $this->_os2ip($em);\r
+ $c = $this->_rsaep($m);\r
+ $c = $this->_i2osp($c, $this->k);\r
+\r
+ // Output the ciphertext C\r
+\r
+ return $c;\r
+ }\r
+\r
+ /**\r
+ * RSAES-PKCS1-V1_5-DECRYPT\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-7.2.2 RFC3447#section-7.2.2}.\r
+ *\r
+ * For compatability purposes, this function departs slightly from the description given in RFC3447.\r
+ * The reason being that RFC2313#section-8.1 (PKCS#1 v1.5) states that ciphertext's encrypted by the\r
+ * private key should have the second byte set to either 0 or 1 and that ciphertext's encrypted by the\r
+ * public key should have the second byte set to 2. In RFC3447 (PKCS#1 v2.1), the second byte is supposed\r
+ * to be 2 regardless of which key is used. For compatability purposes, we'll just check to make sure the\r
+ * second byte is 2 or less. If it is, we'll accept the decrypted string as valid.\r
+ *\r
+ * As a consequence of this, a private key encrypted ciphertext produced with Crypt_RSA may not decrypt\r
+ * with a strictly PKCS#1 v1.5 compliant RSA implementation. Public key encrypted ciphertext's should but\r
+ * not private key encrypted ciphertext's.\r
+ *\r
+ * @access private\r
+ * @param String $c\r
+ * @return String\r
+ */\r
+ function _rsaes_pkcs1_v1_5_decrypt($c)\r
+ {\r
+ // Length checking\r
+\r
+ if (strlen($c) != $this->k) { // or if k < 11\r
+ user_error('Decryption error');\r
+ return false;\r
+ }\r
+\r
+ // RSA decryption\r
+\r
+ $c = $this->_os2ip($c);\r
+ $m = $this->_rsadp($c);\r
+\r
+ if ($m === false) {\r
+ user_error('Decryption error');\r
+ return false;\r
+ }\r
+ $em = $this->_i2osp($m, $this->k);\r
+\r
+ // EME-PKCS1-v1_5 decoding\r
+\r
+ if (ord($em[0]) != 0 || ord($em[1]) > 2) {\r
+ user_error('Decryption error');\r
+ return false;\r
+ }\r
+\r
+ $ps = substr($em, 2, strpos($em, chr(0), 2) - 2);\r
+ $m = substr($em, strlen($ps) + 3);\r
+\r
+ if (strlen($ps) < 8) {\r
+ user_error('Decryption error');\r
+ return false;\r
+ }\r
+\r
+ // Output M\r
+\r
+ return $m;\r
+ }\r
+\r
+ /**\r
+ * EMSA-PSS-ENCODE\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-9.1.1 RFC3447#section-9.1.1}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @param Integer $emBits\r
+ */\r
+ function _emsa_pss_encode($m, $emBits)\r
+ {\r
+ // if $m is larger than two million terrabytes and you're using sha1, PKCS#1 suggests a "Label too long" error\r
+ // be output.\r
+\r
+ $emLen = ($emBits + 1) >> 3; // ie. ceil($emBits / 8)\r
+ $sLen = $this->sLen == false ? $this->hLen : $this->sLen;\r
+\r
+ $mHash = $this->hash->hash($m);\r
+ if ($emLen < $this->hLen + $sLen + 2) {\r
+ user_error('Encoding error');\r
+ return false;\r
+ }\r
+\r
+ $salt = crypt_random_string($sLen);\r
+ $m2 = "\0\0\0\0\0\0\0\0" . $mHash . $salt;\r
+ $h = $this->hash->hash($m2);\r
+ $ps = str_repeat(chr(0), $emLen - $sLen - $this->hLen - 2);\r
+ $db = $ps . chr(1) . $salt;\r
+ $dbMask = $this->_mgf1($h, $emLen - $this->hLen - 1);\r
+ $maskedDB = $db ^ $dbMask;\r
+ $maskedDB[0] = ~chr(0xFF << ($emBits & 7)) & $maskedDB[0];\r
+ $em = $maskedDB . $h . chr(0xBC);\r
+\r
+ return $em;\r
+ }\r
+\r
+ /**\r
+ * EMSA-PSS-VERIFY\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-9.1.2 RFC3447#section-9.1.2}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @param String $em\r
+ * @param Integer $emBits\r
+ * @return String\r
+ */\r
+ function _emsa_pss_verify($m, $em, $emBits)\r
+ {\r
+ // if $m is larger than two million terrabytes and you're using sha1, PKCS#1 suggests a "Label too long" error\r
+ // be output.\r
+\r
+ $emLen = ($emBits + 1) >> 3; // ie. ceil($emBits / 8);\r
+ $sLen = $this->sLen == false ? $this->hLen : $this->sLen;\r
+\r
+ $mHash = $this->hash->hash($m);\r
+ if ($emLen < $this->hLen + $sLen + 2) {\r
+ return false;\r
+ }\r
+\r
+ if ($em[strlen($em) - 1] != chr(0xBC)) {\r
+ return false;\r
+ }\r
+\r
+ $maskedDB = substr($em, 0, -$this->hLen - 1);\r
+ $h = substr($em, -$this->hLen - 1, $this->hLen);\r
+ $temp = chr(0xFF << ($emBits & 7));\r
+ if ((~$maskedDB[0] & $temp) != $temp) {\r
+ return false;\r
+ }\r
+ $dbMask = $this->_mgf1($h, $emLen - $this->hLen - 1);\r
+ $db = $maskedDB ^ $dbMask;\r
+ $db[0] = ~chr(0xFF << ($emBits & 7)) & $db[0];\r
+ $temp = $emLen - $this->hLen - $sLen - 2;\r
+ if (substr($db, 0, $temp) != str_repeat(chr(0), $temp) || ord($db[$temp]) != 1) {\r
+ return false;\r
+ }\r
+ $salt = substr($db, $temp + 1); // should be $sLen long\r
+ $m2 = "\0\0\0\0\0\0\0\0" . $mHash . $salt;\r
+ $h2 = $this->hash->hash($m2);\r
+ return $this->_equals($h, $h2);\r
+ }\r
+\r
+ /**\r
+ * RSASSA-PSS-SIGN\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-8.1.1 RFC3447#section-8.1.1}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @return String\r
+ */\r
+ function _rsassa_pss_sign($m)\r
+ {\r
+ // EMSA-PSS encoding\r
+\r
+ $em = $this->_emsa_pss_encode($m, 8 * $this->k - 1);\r
+\r
+ // RSA signature\r
+\r
+ $m = $this->_os2ip($em);\r
+ $s = $this->_rsasp1($m);\r
+ $s = $this->_i2osp($s, $this->k);\r
+\r
+ // Output the signature S\r
+\r
+ return $s;\r
+ }\r
+\r
+ /**\r
+ * RSASSA-PSS-VERIFY\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-8.1.2 RFC3447#section-8.1.2}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @param String $s\r
+ * @return String\r
+ */\r
+ function _rsassa_pss_verify($m, $s)\r
+ {\r
+ // Length checking\r
+\r
+ if (strlen($s) != $this->k) {\r
+ user_error('Invalid signature');\r
+ return false;\r
+ }\r
+\r
+ // RSA verification\r
+\r
+ $modBits = 8 * $this->k;\r
+\r
+ $s2 = $this->_os2ip($s);\r
+ $m2 = $this->_rsavp1($s2);\r
+ if ($m2 === false) {\r
+ user_error('Invalid signature');\r
+ return false;\r
+ }\r
+ $em = $this->_i2osp($m2, $modBits >> 3);\r
+ if ($em === false) {\r
+ user_error('Invalid signature');\r
+ return false;\r
+ }\r
+\r
+ // EMSA-PSS verification\r
+\r
+ return $this->_emsa_pss_verify($m, $em, $modBits - 1);\r
+ }\r
+\r
+ /**\r
+ * EMSA-PKCS1-V1_5-ENCODE\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-9.2 RFC3447#section-9.2}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @param Integer $emLen\r
+ * @return String\r
+ */\r
+ function _emsa_pkcs1_v1_5_encode($m, $emLen)\r
+ {\r
+ $h = $this->hash->hash($m);\r
+ if ($h === false) {\r
+ return false;\r
+ }\r
+\r
+ // see http://tools.ietf.org/html/rfc3447#page-43\r
+ switch ($this->hashName) {\r
+ case 'md2':\r
+ $t = pack('H*', '3020300c06082a864886f70d020205000410');\r
+ break;\r
+ case 'md5':\r
+ $t = pack('H*', '3020300c06082a864886f70d020505000410');\r
+ break;\r
+ case 'sha1':\r
+ $t = pack('H*', '3021300906052b0e03021a05000414');\r
+ break;\r
+ case 'sha256':\r
+ $t = pack('H*', '3031300d060960864801650304020105000420');\r
+ break;\r
+ case 'sha384':\r
+ $t = pack('H*', '3041300d060960864801650304020205000430');\r
+ break;\r
+ case 'sha512':\r
+ $t = pack('H*', '3051300d060960864801650304020305000440');\r
+ }\r
+ $t.= $h;\r
+ $tLen = strlen($t);\r
+\r
+ if ($emLen < $tLen + 11) {\r
+ user_error('Intended encoded message length too short');\r
+ return false;\r
+ }\r
+\r
+ $ps = str_repeat(chr(0xFF), $emLen - $tLen - 3);\r
+\r
+ $em = "\0\1$ps\0$t";\r
+\r
+ return $em;\r
+ }\r
+\r
+ /**\r
+ * RSASSA-PKCS1-V1_5-SIGN\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-8.2.1 RFC3447#section-8.2.1}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @return String\r
+ */\r
+ function _rsassa_pkcs1_v1_5_sign($m)\r
+ {\r
+ // EMSA-PKCS1-v1_5 encoding\r
+\r
+ $em = $this->_emsa_pkcs1_v1_5_encode($m, $this->k);\r
+ if ($em === false) {\r
+ user_error('RSA modulus too short');\r
+ return false;\r
+ }\r
+\r
+ // RSA signature\r
+\r
+ $m = $this->_os2ip($em);\r
+ $s = $this->_rsasp1($m);\r
+ $s = $this->_i2osp($s, $this->k);\r
+\r
+ // Output the signature S\r
+\r
+ return $s;\r
+ }\r
+\r
+ /**\r
+ * RSASSA-PKCS1-V1_5-VERIFY\r
+ *\r
+ * See {@link http://tools.ietf.org/html/rfc3447#section-8.2.2 RFC3447#section-8.2.2}.\r
+ *\r
+ * @access private\r
+ * @param String $m\r
+ * @return String\r
+ */\r
+ function _rsassa_pkcs1_v1_5_verify($m, $s)\r
+ {\r
+ // Length checking\r
+\r
+ if (strlen($s) != $this->k) {\r
+ user_error('Invalid signature');\r
+ return false;\r
+ }\r
+\r
+ // RSA verification\r
+\r
+ $s = $this->_os2ip($s);\r
+ $m2 = $this->_rsavp1($s);\r
+ if ($m2 === false) {\r
+ user_error('Invalid signature');\r
+ return false;\r
+ }\r
+ $em = $this->_i2osp($m2, $this->k);\r
+ if ($em === false) {\r
+ user_error('Invalid signature');\r
+ return false;\r
+ }\r
+\r
+ // EMSA-PKCS1-v1_5 encoding\r
+\r
+ $em2 = $this->_emsa_pkcs1_v1_5_encode($m, $this->k);\r
+ if ($em2 === false) {\r
+ user_error('RSA modulus too short');\r
+ return false;\r
+ }\r
+\r
+ // Compare\r
+ return $this->_equals($em, $em2);\r
+ }\r
+\r
+ /**\r
+ * Set Encryption Mode\r
+ *\r
+ * Valid values include CRYPT_RSA_ENCRYPTION_OAEP and CRYPT_RSA_ENCRYPTION_PKCS1.\r
+ *\r
+ * @access public\r
+ * @param Integer $mode\r
+ */\r
+ function setEncryptionMode($mode)\r
+ {\r
+ $this->encryptionMode = $mode;\r
+ }\r
+\r
+ /**\r
+ * Set Signature Mode\r
+ *\r
+ * Valid values include CRYPT_RSA_SIGNATURE_PSS and CRYPT_RSA_SIGNATURE_PKCS1\r
+ *\r
+ * @access public\r
+ * @param Integer $mode\r
+ */\r
+ function setSignatureMode($mode)\r
+ {\r
+ $this->signatureMode = $mode;\r
+ }\r
+\r
+ /**\r
+ * Set public key comment.\r
+ *\r
+ * @access public\r
+ * @param String $comment\r
+ */\r
+ function setComment($comment)\r
+ {\r
+ $this->comment = $comment;\r
+ }\r
+\r
+ /**\r
+ * Get public key comment.\r
+ *\r
+ * @access public\r
+ * @return String\r
+ */\r
+ function getComment()\r
+ {\r
+ return $this->comment;\r
+ }\r
+\r
+ /**\r
+ * Encryption\r
+ *\r
+ * Both CRYPT_RSA_ENCRYPTION_OAEP and CRYPT_RSA_ENCRYPTION_PKCS1 both place limits on how long $plaintext can be.\r
+ * If $plaintext exceeds those limits it will be broken up so that it does and the resultant ciphertext's will\r
+ * be concatenated together.\r
+ *\r
+ * @see decrypt()\r
+ * @access public\r
+ * @param String $plaintext\r
+ * @return String\r
+ */\r
+ function encrypt($plaintext)\r
+ {\r
+ switch ($this->encryptionMode) {\r
+ case CRYPT_RSA_ENCRYPTION_PKCS1:\r
+ $length = $this->k - 11;\r
+ if ($length <= 0) {\r
+ return false;\r
+ }\r
+\r
+ $plaintext = str_split($plaintext, $length);\r
+ $ciphertext = '';\r
+ foreach ($plaintext as $m) {\r
+ $ciphertext.= $this->_rsaes_pkcs1_v1_5_encrypt($m);\r
+ }\r
+ return $ciphertext;\r
+ //case CRYPT_RSA_ENCRYPTION_OAEP:\r
+ default:\r
+ $length = $this->k - 2 * $this->hLen - 2;\r
+ if ($length <= 0) {\r
+ return false;\r
+ }\r
+\r
+ $plaintext = str_split($plaintext, $length);\r
+ $ciphertext = '';\r
+ foreach ($plaintext as $m) {\r
+ $ciphertext.= $this->_rsaes_oaep_encrypt($m);\r
+ }\r
+ return $ciphertext;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Decryption\r
+ *\r
+ * @see encrypt()\r
+ * @access public\r
+ * @param String $plaintext\r
+ * @return String\r
+ */\r
+ function decrypt($ciphertext)\r
+ {\r
+ if ($this->k <= 0) {\r
+ return false;\r
+ }\r
+\r
+ $ciphertext = str_split($ciphertext, $this->k);\r
+ $ciphertext[count($ciphertext) - 1] = str_pad($ciphertext[count($ciphertext) - 1], $this->k, chr(0), STR_PAD_LEFT);\r
+\r
+ $plaintext = '';\r
+\r
+ switch ($this->encryptionMode) {\r
+ case CRYPT_RSA_ENCRYPTION_PKCS1:\r
+ $decrypt = '_rsaes_pkcs1_v1_5_decrypt';\r
+ break;\r
+ //case CRYPT_RSA_ENCRYPTION_OAEP:\r
+ default:\r
+ $decrypt = '_rsaes_oaep_decrypt';\r
+ }\r
+\r
+ foreach ($ciphertext as $c) {\r
+ $temp = $this->$decrypt($c);\r
+ if ($temp === false) {\r
+ return false;\r
+ }\r
+ $plaintext.= $temp;\r
+ }\r
+\r
+ return $plaintext;\r
+ }\r
+\r
+ /**\r
+ * Create a signature\r
+ *\r
+ * @see verify()\r
+ * @access public\r
+ * @param String $message\r
+ * @return String\r
+ */\r
+ function sign($message)\r
+ {\r
+ if (empty($this->modulus) || empty($this->exponent)) {\r
+ return false;\r
+ }\r
+\r
+ switch ($this->signatureMode) {\r
+ case CRYPT_RSA_SIGNATURE_PKCS1:\r
+ return $this->_rsassa_pkcs1_v1_5_sign($message);\r
+ //case CRYPT_RSA_SIGNATURE_PSS:\r
+ default:\r
+ return $this->_rsassa_pss_sign($message);\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Verifies a signature\r
+ *\r
+ * @see sign()\r
+ * @access public\r
+ * @param String $message\r
+ * @param String $signature\r
+ * @return Boolean\r
+ */\r
+ function verify($message, $signature)\r
+ {\r
+ if (empty($this->modulus) || empty($this->exponent)) {\r
+ return false;\r
+ }\r
+\r
+ switch ($this->signatureMode) {\r
+ case CRYPT_RSA_SIGNATURE_PKCS1:\r
+ return $this->_rsassa_pkcs1_v1_5_verify($message, $signature);\r
+ //case CRYPT_RSA_SIGNATURE_PSS:\r
+ default:\r
+ return $this->_rsassa_pss_verify($message, $signature);\r
+ }\r
+ }\r
+}\r
-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Random Number Generator
- *
- * PHP versions 4 and 5
- *
- * Here's a short example of how to use this library:
- * <code>
- * <?php
- * include('Crypt/Random.php');
- *
- * echo crypt_random();
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Crypt
- * @package Crypt_Random
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMVII Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: Random.php,v 1.6 2010/02/28 05:28:38 terrafrost Exp $
- * @link http://phpseclib.sourceforge.net
- */
-
-/**
- * Generate a random value.
- *
- * On 32-bit machines, the largest distance that can exist between $min and $max is 2**31.
- * If $min and $max are farther apart than that then the last ($max - range) numbers.
- *
- * Depending on how this is being used, it may be worth while to write a replacement. For example,
- * a PHP-based web app that stores its data in an SQL database can collect more entropy than this function
- * can.
- *
- * @param optional Integer $min
- * @param optional Integer $max
- * @return Integer
- * @access public
- */
-function crypt_random($min = 0, $max = 0x7FFFFFFF)
-{
- if ($min == $max) {
- return $min;
- }
-
- // see http://en.wikipedia.org/wiki//dev/random
- if (file_exists('/dev/urandom')) {
- $fp = fopen('/dev/urandom', 'rb');
- extract(unpack('Nrandom', fread($fp, 4)));
- fclose($fp);
-
- // say $min = 0 and $max = 3. if we didn't do abs() then we could have stuff like this:
- // -4 % 3 + 0 = -1, even though -1 < $min
- return abs($random) % ($max - $min) + $min;
- }
-
- /* Prior to PHP 4.2.0, mt_srand() had to be called before mt_rand() could be called.
- Prior to PHP 5.2.6, mt_rand()'s automatic seeding was subpar, as elaborated here:
-
- http://www.suspekt.org/2008/08/17/mt_srand-and-not-so-random-numbers/
-
- The seeding routine is pretty much ripped from PHP's own internal GENERATE_SEED() macro:
-
- http://svn.php.net/viewvc/php/php-src/branches/PHP_5_3_2/ext/standard/php_rand.h?view=markup */
- if (version_compare(PHP_VERSION, '5.2.5', '<=')) {
- static $seeded;
- if (!isset($seeded)) {
- $seeded = true;
- mt_srand(fmod(time() * getmypid(), 0x7FFFFFFF) ^ fmod(1000000 * lcg_value(), 0x7FFFFFFF));
- }
- }
-
- static $crypto;
-
- // The CSPRNG's Yarrow and Fortuna periodically reseed. This function can be reseeded by hitting F5
- // in the browser and reloading the page.
-
- if (!isset($crypto)) {
- $key = $iv = '';
- for ($i = 0; $i < 8; $i++) {
- $key.= pack('n', mt_rand(0, 0xFFFF));
- $iv .= pack('n', mt_rand(0, 0xFFFF));
- }
- switch (true) {
- case class_exists('Crypt_AES'):
- $crypto = new Crypt_AES(CRYPT_AES_MODE_CTR);
- break;
- case class_exists('Crypt_TripleDES'):
- $crypto = new Crypt_TripleDES(CRYPT_DES_MODE_CTR);
- break;
- case class_exists('Crypt_DES'):
- $crypto = new Crypt_DES(CRYPT_DES_MODE_CTR);
- break;
- case class_exists('Crypt_RC4'):
- $crypto = new Crypt_RC4();
- break;
- default:
- extract(unpack('Nrandom', pack('H*', sha1(mt_rand(0, 0x7FFFFFFF)))));
- return abs($random) % ($max - $min) + $min;
- }
- $crypto->setKey($key);
- $crypto->setIV($iv);
- }
-
- extract(unpack('Nrandom', $crypto->encrypt("\0\0\0\0")));
- return abs($random) % ($max - $min) + $min;
-}
-?>
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Random Number Generator\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/Random.php');\r
+ *\r
+ * echo bin2hex(crypt_random_string(8));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_Random\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMVII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**\r
+ * "Is Windows" test\r
+ *\r
+ * @access private\r
+ */\r
+define('CRYPT_RANDOM_IS_WINDOWS', strtoupper(substr(PHP_OS, 0, 3)) === 'WIN');\r
+\r
+/**\r
+ * Generate a random string.\r
+ *\r
+ * Although microoptimizations are generally discouraged as they impair readability this function is ripe with\r
+ * microoptimizations because this function has the potential of being called a huge number of times.\r
+ * eg. for RSA key generation.\r
+ *\r
+ * @param Integer $length\r
+ * @return String\r
+ * @access public\r
+ */\r
+function crypt_random_string($length)\r
+{\r
+ if (CRYPT_RANDOM_IS_WINDOWS) {\r
+ // method 1. prior to PHP 5.3 this would call rand() on windows hence the function_exists('class_alias') call.\r
+ // ie. class_alias is a function that was introduced in PHP 5.3\r
+ if (function_exists('mcrypt_create_iv') && function_exists('class_alias')) {\r
+ return mcrypt_create_iv($length);\r
+ }\r
+ // method 2. openssl_random_pseudo_bytes was introduced in PHP 5.3.0 but prior to PHP 5.3.4 there was,\r
+ // to quote <http://php.net/ChangeLog-5.php#5.3.4>, "possible blocking behavior". as of 5.3.4\r
+ // openssl_random_pseudo_bytes and mcrypt_create_iv do the exact same thing on Windows. ie. they both\r
+ // call php_win32_get_random_bytes():\r
+ //\r
+ // https://github.com/php/php-src/blob/7014a0eb6d1611151a286c0ff4f2238f92c120d6/ext/openssl/openssl.c#L5008\r
+ // https://github.com/php/php-src/blob/7014a0eb6d1611151a286c0ff4f2238f92c120d6/ext/mcrypt/mcrypt.c#L1392\r
+ //\r
+ // php_win32_get_random_bytes() is defined thusly:\r
+ //\r
+ // https://github.com/php/php-src/blob/7014a0eb6d1611151a286c0ff4f2238f92c120d6/win32/winutil.c#L80\r
+ //\r
+ // we're calling it, all the same, in the off chance that the mcrypt extension is not available\r
+ if (function_exists('openssl_random_pseudo_bytes') && version_compare(PHP_VERSION, '5.3.4', '>=')) {\r
+ return openssl_random_pseudo_bytes($length);\r
+ }\r
+ } else {\r
+ // method 1. the fastest\r
+ if (function_exists('openssl_random_pseudo_bytes')) {\r
+ return openssl_random_pseudo_bytes($length);\r
+ }\r
+ // method 2\r
+ static $fp = true;\r
+ if ($fp === true) {\r
+ // warning's will be output unles the error suppression operator is used. errors such as\r
+ // "open_basedir restriction in effect", "Permission denied", "No such file or directory", etc.\r
+ $fp = @fopen('/dev/urandom', 'rb');\r
+ }\r
+ if ($fp !== true && $fp !== false) { // surprisingly faster than !is_bool() or is_resource()\r
+ return fread($fp, $length);\r
+ }\r
+ // method 3. pretty much does the same thing as method 2 per the following url:\r
+ // https://github.com/php/php-src/blob/7014a0eb6d1611151a286c0ff4f2238f92c120d6/ext/mcrypt/mcrypt.c#L1391\r
+ // surprisingly slower than method 2. maybe that's because mcrypt_create_iv does a bunch of error checking that we're\r
+ // not doing. regardless, this'll only be called if this PHP script couldn't open /dev/urandom due to open_basedir\r
+ // restrictions or some such\r
+ if (function_exists('mcrypt_create_iv')) {\r
+ return mcrypt_create_iv($length, MCRYPT_DEV_URANDOM);\r
+ }\r
+ }\r
+ // at this point we have no choice but to use a pure-PHP CSPRNG\r
+\r
+ // cascade entropy across multiple PHP instances by fixing the session and collecting all\r
+ // environmental variables, including the previous session data and the current session\r
+ // data.\r
+ //\r
+ // mt_rand seeds itself by looking at the PID and the time, both of which are (relatively)\r
+ // easy to guess at. linux uses mouse clicks, keyboard timings, etc, as entropy sources, but\r
+ // PHP isn't low level to be able to use those as sources and on a web server there's not likely\r
+ // going to be a ton of keyboard or mouse action. web servers do have one thing that we can use\r
+ // however. a ton of people visiting the website. obviously you don't want to base your seeding\r
+ // soley on parameters a potential attacker sends but (1) not everything in $_SERVER is controlled\r
+ // by the user and (2) this isn't just looking at the data sent by the current user - it's based\r
+ // on the data sent by all users. one user requests the page and a hash of their info is saved.\r
+ // another user visits the page and the serialization of their data is utilized along with the\r
+ // server envirnment stuff and a hash of the previous http request data (which itself utilizes\r
+ // a hash of the session data before that). certainly an attacker should be assumed to have\r
+ // full control over his own http requests. he, however, is not going to have control over\r
+ // everyone's http requests.\r
+ static $crypto = false, $v;\r
+ if ($crypto === false) {\r
+ // save old session data\r
+ $old_session_id = session_id();\r
+ $old_use_cookies = ini_get('session.use_cookies');\r
+ $old_session_cache_limiter = session_cache_limiter();\r
+ if (isset($_SESSION)) {\r
+ $_OLD_SESSION = $_SESSION;\r
+ }\r
+ if ($old_session_id != '') {\r
+ session_write_close();\r
+ }\r
+\r
+ session_id(1);\r
+ ini_set('session.use_cookies', 0);\r
+ session_cache_limiter('');\r
+ session_start();\r
+\r
+ $v = $seed = $_SESSION['seed'] = pack('H*', sha1(\r
+ serialize($_SERVER) .\r
+ serialize($_POST) .\r
+ serialize($_GET) .\r
+ serialize($_COOKIE) .\r
+ serialize($GLOBALS) .\r
+ serialize($_SESSION) .\r
+ serialize($_OLD_SESSION)\r
+ ));\r
+ if (!isset($_SESSION['count'])) {\r
+ $_SESSION['count'] = 0;\r
+ }\r
+ $_SESSION['count']++;\r
+\r
+ session_write_close();\r
+\r
+ // restore old session data\r
+ if ($old_session_id != '') {\r
+ session_id($old_session_id);\r
+ session_start();\r
+ ini_set('session.use_cookies', $old_use_cookies);\r
+ session_cache_limiter($old_session_cache_limiter);\r
+ } else {\r
+ if (isset($_OLD_SESSION)) {\r
+ $_SESSION = $_OLD_SESSION;\r
+ unset($_OLD_SESSION);\r
+ } else {\r
+ unset($_SESSION);\r
+ }\r
+ }\r
+\r
+ // in SSH2 a shared secret and an exchange hash are generated through the key exchange process.\r
+ // the IV client to server is the hash of that "nonce" with the letter A and for the encryption key it's the letter C.\r
+ // if the hash doesn't produce enough a key or an IV that's long enough concat successive hashes of the\r
+ // original hash and the current hash. we'll be emulating that. for more info see the following URL:\r
+ //\r
+ // http://tools.ietf.org/html/rfc4253#section-7.2\r
+ //\r
+ // see the is_string($crypto) part for an example of how to expand the keys\r
+ $key = pack('H*', sha1($seed . 'A'));\r
+ $iv = pack('H*', sha1($seed . 'C'));\r
+\r
+ // ciphers are used as per the nist.gov link below. also, see this link:\r
+ //\r
+ // http://en.wikipedia.org/wiki/Cryptographically_secure_pseudorandom_number_generator#Designs_based_on_cryptographic_primitives\r
+ switch (true) {\r
+ case class_exists('Crypt_AES'):\r
+ $crypto = new Crypt_AES(CRYPT_AES_MODE_CTR);\r
+ break;\r
+ case class_exists('Crypt_TripleDES'):\r
+ $crypto = new Crypt_TripleDES(CRYPT_DES_MODE_CTR);\r
+ break;\r
+ case class_exists('Crypt_DES'):\r
+ $crypto = new Crypt_DES(CRYPT_DES_MODE_CTR);\r
+ break;\r
+ case class_exists('Crypt_RC4'):\r
+ $crypto = new Crypt_RC4();\r
+ break;\r
+ default:\r
+ $crypto = $seed;\r
+ return crypt_random_string($length);\r
+ }\r
+\r
+ $crypto->setKey($key);\r
+ $crypto->setIV($iv);\r
+ $crypto->enableContinuousBuffer();\r
+ }\r
+\r
+ if (is_string($crypto)) {\r
+ // the following is based off of ANSI X9.31:\r
+ //\r
+ // http://csrc.nist.gov/groups/STM/cavp/documents/rng/931rngext.pdf\r
+ //\r
+ // OpenSSL uses that same standard for it's random numbers:\r
+ //\r
+ // http://www.opensource.apple.com/source/OpenSSL/OpenSSL-38/openssl/fips-1.0/rand/fips_rand.c\r
+ // (do a search for "ANS X9.31 A.2.4")\r
+ //\r
+ // ANSI X9.31 recommends ciphers be used and phpseclib does use them if they're available (see\r
+ // later on in the code) but if they're not we'll use sha1\r
+ $result = '';\r
+ while (strlen($result) < $length) { // each loop adds 20 bytes\r
+ // microtime() isn't packed as "densely" as it could be but then neither is that the idea.\r
+ // the idea is simply to ensure that each "block" has a unique element to it.\r
+ $i = pack('H*', sha1(microtime()));\r
+ $r = pack('H*', sha1($i ^ $v));\r
+ $v = pack('H*', sha1($r ^ $i));\r
+ $result.= $r;\r
+ }\r
+ return substr($result, 0, $length);\r
+ }\r
+\r
+ //return $crypto->encrypt(str_repeat("\0", $length));\r
+\r
+ $result = '';\r
+ while (strlen($result) < $length) {\r
+ $i = $crypto->encrypt(microtime());\r
+ $r = $crypto->encrypt($i ^ $v);\r
+ $v = $crypto->encrypt($r ^ $i);\r
+ $result.= $r;\r
+ }\r
+ return substr($result, 0, $length);\r
+}\r
-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Pure-PHP implementation of Rijndael.
- *
- * Does not use mcrypt, even when available, for reasons that are explained below.
- *
- * PHP versions 4 and 5
- *
- * If {@link Crypt_Rijndael::setBlockLength() setBlockLength()} isn't called, it'll be assumed to be 128 bits. If
- * {@link Crypt_Rijndael::setKeyLength() setKeyLength()} isn't called, it'll be calculated from
- * {@link Crypt_Rijndael::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 160-bits and 160 bits will be the key length until
- * {@link Crypt_Rijndael::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.
- *
- * {@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('Crypt/Rijndael.php');
- *
- * $rijndael = new Crypt_Rijndael();
- *
- * $rijndael->setKey('abcdefghijklmnop');
- *
- * $size = 10 * 1024;
- * $plaintext = '';
- * for ($i = 0; $i < $size; $i++) {
- * $plaintext.= 'a';
- * }
- *
- * echo $rijndael->decrypt($rijndael->encrypt($plaintext));
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Crypt
- * @package Crypt_Rijndael
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMVIII Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: Rijndael.php,v 1.12 2010/02/09 06:10:26 terrafrost Exp $
- * @link http://phpseclib.sourceforge.net
- */
-
-/**#@+
- * @access public
- * @see Crypt_Rijndael::encrypt()
- * @see Crypt_Rijndael::decrypt()
- */
-/**
- * Encrypt / decrypt using the Counter mode.
- *
- * Set to -1 since that's what Crypt/Random.php uses to index the CTR mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Counter_.28CTR.29
- */
-define('CRYPT_RIJNDAEL_MODE_CTR', -1);
-/**
- * Encrypt / decrypt using the Electronic Code Book mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Electronic_codebook_.28ECB.29
- */
-define('CRYPT_RIJNDAEL_MODE_ECB', 1);
-/**
- * Encrypt / decrypt using the Code Book Chaining mode.
- *
- * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher-block_chaining_.28CBC.29
- */
-define('CRYPT_RIJNDAEL_MODE_CBC', 2);
-/**#@-*/
-
-/**#@+
- * @access private
- * @see Crypt_Rijndael::Crypt_Rijndael()
- */
-/**
- * Toggles the internal implementation
- */
-define('CRYPT_RIJNDAEL_MODE_INTERNAL', 1);
-/**
- * Toggles the mcrypt implementation
- */
-define('CRYPT_RIJNDAEL_MODE_MCRYPT', 2);
-/**#@-*/
-
-/**
- * Pure-PHP implementation of Rijndael.
- *
- * @author Jim Wigginton <terrafrost@php.net>
- * @version 0.1.0
- * @access public
- * @package Crypt_Rijndael
- */
-class Crypt_Rijndael {
- /**
- * The Encryption Mode
- *
- * @see Crypt_Rijndael::Crypt_Rijndael()
- * @var Integer
- * @access private
- */
- var $mode;
-
- /**
- * The Key
- *
- * @see Crypt_Rijndael::setKey()
- * @var String
- * @access private
- */
- var $key = "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0";
-
- /**
- * The Initialization Vector
- *
- * @see Crypt_Rijndael::setIV()
- * @var String
- * @access private
- */
- var $iv = '';
-
- /**
- * A "sliding" Initialization Vector
- *
- * @see Crypt_Rijndael::enableContinuousBuffer()
- * @var String
- * @access private
- */
- var $encryptIV = '';
-
- /**
- * A "sliding" Initialization Vector
- *
- * @see Crypt_Rijndael::enableContinuousBuffer()
- * @var String
- * @access private
- */
- var $decryptIV = '';
-
- /**
- * Continuous Buffer status
- *
- * @see Crypt_Rijndael::enableContinuousBuffer()
- * @var Boolean
- * @access private
- */
- var $continuousBuffer = false;
-
- /**
- * Padding status
- *
- * @see Crypt_Rijndael::enablePadding()
- * @var Boolean
- * @access private
- */
- var $padding = true;
-
- /**
- * Does the key schedule need to be (re)calculated?
- *
- * @see setKey()
- * @see setBlockLength()
- * @see setKeyLength()
- * @var Boolean
- * @access private
- */
- var $changed = true;
-
- /**
- * Has the key length explicitly been set or should it be derived from the key, itself?
- *
- * @see setKeyLength()
- * @var Boolean
- * @access private
- */
- var $explicit_key_length = false;
-
- /**
- * The Key Schedule
- *
- * @see _setup()
- * @var Array
- * @access private
- */
- var $w;
-
- /**
- * The Inverse Key Schedule
- *
- * @see _setup()
- * @var Array
- * @access private
- */
- var $dw;
-
- /**
- * The Block Length
- *
- * @see setBlockLength()
- * @var Integer
- * @access private
- * @internal The max value is 32, the min value is 16. All valid values are multiples of 4. Exists in conjunction with
- * $Nb because we need this value and not $Nb to pad strings appropriately.
- */
- var $block_size = 16;
-
- /**
- * The Block Length divided by 32
- *
- * @see setBlockLength()
- * @var Integer
- * @access private
- * @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.
- *
- */
- var $Nb = 4;
-
- /**
- * The Key Length
- *
- * @see setKeyLength()
- * @var Integer
- * @access private
- * @internal The max value is 256 / 8 = 32, the min value is 128 / 8 = 16. Exists in conjunction with $key_size
- * because the encryption / decryption / key schedule creation requires this number and not $key_size. We could
- * derive this from $key_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.
- */
- var $key_size = 16;
-
- /**
- * The Key Length divided by 32
- *
- * @see setKeyLength()
- * @var Integer
- * @access private
- * @internal The max value is 256 / 32 = 8, the min value is 128 / 32 = 4
- */
- var $Nk = 4;
-
- /**
- * The Number of Rounds
- *
- * @var Integer
- * @access private
- * @internal The max value is 14, the min value is 10.
- */
- var $Nr;
-
- /**
- * Shift offsets
- *
- * @var Array
- * @access private
- */
- var $c;
-
- /**
- * Precomputed mixColumns table
- *
- * @see Crypt_Rijndael()
- * @var Array
- * @access private
- */
- var $t0;
-
- /**
- * Precomputed mixColumns table
- *
- * @see Crypt_Rijndael()
- * @var Array
- * @access private
- */
- var $t1;
-
- /**
- * Precomputed mixColumns table
- *
- * @see Crypt_Rijndael()
- * @var Array
- * @access private
- */
- var $t2;
-
- /**
- * Precomputed mixColumns table
- *
- * @see Crypt_Rijndael()
- * @var Array
- * @access private
- */
- var $t3;
-
- /**
- * Precomputed invMixColumns table
- *
- * @see Crypt_Rijndael()
- * @var Array
- * @access private
- */
- var $dt0;
-
- /**
- * Precomputed invMixColumns table
- *
- * @see Crypt_Rijndael()
- * @var Array
- * @access private
- */
- var $dt1;
-
- /**
- * Precomputed invMixColumns table
- *
- * @see Crypt_Rijndael()
- * @var Array
- * @access private
- */
- var $dt2;
-
- /**
- * Precomputed invMixColumns table
- *
- * @see Crypt_Rijndael()
- * @var Array
- * @access private
- */
- var $dt3;
-
- /**
- * Default Constructor.
- *
- * Determines whether or not the mcrypt extension should be used. $mode should only, at present, be
- * CRYPT_RIJNDAEL_MODE_ECB or CRYPT_RIJNDAEL_MODE_CBC. If not explictly set, CRYPT_RIJNDAEL_MODE_CBC will be used.
- *
- * @param optional Integer $mode
- * @return Crypt_Rijndael
- * @access public
- */
- function Crypt_Rijndael($mode = CRYPT_RIJNDAEL_MODE_CBC)
- {
- switch ($mode) {
- case CRYPT_RIJNDAEL_MODE_ECB:
- case CRYPT_RIJNDAEL_MODE_CBC:
- case CRYPT_RIJNDAEL_MODE_CTR:
- $this->mode = $mode;
- break;
- default:
- $this->mode = CRYPT_RIJNDAEL_MODE_CBC;
- }
-
- $t3 = &$this->t3;
- $t2 = &$this->t2;
- $t1 = &$this->t1;
- $t0 = &$this->t0;
-
- $dt3 = &$this->dt3;
- $dt2 = &$this->dt2;
- $dt1 = &$this->dt1;
- $dt0 = &$this->dt0;
-
- // 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(
- 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,
- 0xE0E03BDB, 0x32325664, 0x3A3A4E74, 0x0A0A1E14, 0x4949DB92, 0x06060A0C, 0x24246C48, 0x5C5CE4B8,
- 0xC2C25D9F, 0xD3D36EBD, 0xACACEF43, 0x6262A6C4, 0x9191A839, 0x9595A431, 0xE4E437D3, 0x79798BF2,
- 0xE7E732D5, 0xC8C8438B, 0x3737596E, 0x6D6DB7DA, 0x8D8D8C01, 0xD5D564B1, 0x4E4ED29C, 0xA9A9E049,
- 0x6C6CB4D8, 0x5656FAAC, 0xF4F407F3, 0xEAEA25CF, 0x6565AFCA, 0x7A7A8EF4, 0xAEAEE947, 0x08081810,
- 0xBABAD56F, 0x787888F0, 0x25256F4A, 0x2E2E725C, 0x1C1C2438, 0xA6A6F157, 0xB4B4C773, 0xC6C65197,
- 0xE8E823CB, 0xDDDD7CA1, 0x74749CE8, 0x1F1F213E, 0x4B4BDD96, 0xBDBDDC61, 0x8B8B860D, 0x8A8A850F,
- 0x707090E0, 0x3E3E427C, 0xB5B5C471, 0x6666AACC, 0x4848D890, 0x03030506, 0xF6F601F7, 0x0E0E121C,
- 0x6161A3C2, 0x35355F6A, 0x5757F9AE, 0xB9B9D069, 0x86869117, 0xC1C15899, 0x1D1D273A, 0x9E9EB927,
- 0xE1E138D9, 0xF8F813EB, 0x9898B32B, 0x11113322, 0x6969BBD2, 0xD9D970A9, 0x8E8E8907, 0x9494A733,
- 0x9B9BB62D, 0x1E1E223C, 0x87879215, 0xE9E920C9, 0xCECE4987, 0x5555FFAA, 0x28287850, 0xDFDF7AA5,
- 0x8C8C8F03, 0xA1A1F859, 0x89898009, 0x0D0D171A, 0xBFBFDA65, 0xE6E631D7, 0x4242C684, 0x6868B8D0,
- 0x4141C382, 0x9999B029, 0x2D2D775A, 0x0F0F111E, 0xB0B0CB7B, 0x5454FCA8, 0xBBBBD66D, 0x16163A2C
- );
-
- $dt3 = array(
- 0xF4A75051, 0x4165537E, 0x17A4C31A, 0x275E963A, 0xAB6BCB3B, 0x9D45F11F, 0xFA58ABAC, 0xE303934B,
- 0x30FA5520, 0x766DF6AD, 0xCC769188, 0x024C25F5, 0xE5D7FC4F, 0x2ACBD7C5, 0x35448026, 0x62A38FB5,
- 0xB15A49DE, 0xBA1B6725, 0xEA0E9845, 0xFEC0E15D, 0x2F7502C3, 0x4CF01281, 0x4697A38D, 0xD3F9C66B,
- 0x8F5FE703, 0x929C9515, 0x6D7AEBBF, 0x5259DA95, 0xBE832DD4, 0x7421D358, 0xE0692949, 0xC9C8448E,
- 0xC2896A75, 0x8E7978F4, 0x583E6B99, 0xB971DD27, 0xE14FB6BE, 0x88AD17F0, 0x20AC66C9, 0xCE3AB47D,
- 0xDF4A1863, 0x1A3182E5, 0x51336097, 0x537F4562, 0x6477E0B1, 0x6BAE84BB, 0x81A01CFE, 0x082B94F9,
- 0x48685870, 0x45FD198F, 0xDE6C8794, 0x7BF8B752, 0x73D323AB, 0x4B02E272, 0x1F8F57E3, 0x55AB2A66,
- 0xEB2807B2, 0xB5C2032F, 0xC57B9A86, 0x3708A5D3, 0x2887F230, 0xBFA5B223, 0x036ABA02, 0x16825CED,
- 0xCF1C2B8A, 0x79B492A7, 0x07F2F0F3, 0x69E2A14E, 0xDAF4CD65, 0x05BED506, 0x34621FD1, 0xA6FE8AC4,
- 0x2E539D34, 0xF355A0A2, 0x8AE13205, 0xF6EB75A4, 0x83EC390B, 0x60EFAA40, 0x719F065E, 0x6E1051BD,
- 0x218AF93E, 0xDD063D96, 0x3E05AEDD, 0xE6BD464D, 0x548DB591, 0xC45D0571, 0x06D46F04, 0x5015FF60,
- 0x98FB2419, 0xBDE997D6, 0x4043CC89, 0xD99E7767, 0xE842BDB0, 0x898B8807, 0x195B38E7, 0xC8EEDB79,
- 0x7C0A47A1, 0x420FE97C, 0x841EC9F8, 0x00000000, 0x80868309, 0x2BED4832, 0x1170AC1E, 0x5A724E6C,
- 0x0EFFFBFD, 0x8538560F, 0xAED51E3D, 0x2D392736, 0x0FD9640A, 0x5CA62168, 0x5B54D19B, 0x362E3A24,
- 0x0A67B10C, 0x57E70F93, 0xEE96D2B4, 0x9B919E1B, 0xC0C54F80, 0xDC20A261, 0x774B695A, 0x121A161C,
- 0x93BA0AE2, 0xA02AE5C0, 0x22E0433C, 0x1B171D12, 0x090D0B0E, 0x8BC7ADF2, 0xB6A8B92D, 0x1EA9C814,
- 0xF1198557, 0x75074CAF, 0x99DDBBEE, 0x7F60FDA3, 0x01269FF7, 0x72F5BC5C, 0x663BC544, 0xFB7E345B,
- 0x4329768B, 0x23C6DCCB, 0xEDFC68B6, 0xE4F163B8, 0x31DCCAD7, 0x63851042, 0x97224013, 0xC6112084,
- 0x4A247D85, 0xBB3DF8D2, 0xF93211AE, 0x29A16DC7, 0x9E2F4B1D, 0xB230F3DC, 0x8652EC0D, 0xC1E3D077,
- 0xB3166C2B, 0x70B999A9, 0x9448FA11, 0xE9642247, 0xFC8CC4A8, 0xF03F1AA0, 0x7D2CD856, 0x3390EF22,
- 0x494EC787, 0x38D1C1D9, 0xCAA2FE8C, 0xD40B3698, 0xF581CFA6, 0x7ADE28A5, 0xB78E26DA, 0xADBFA43F,
- 0x3A9DE42C, 0x78920D50, 0x5FCC9B6A, 0x7E466254, 0x8D13C2F6, 0xD8B8E890, 0x39F75E2E, 0xC3AFF582,
- 0x5D80BE9F, 0xD0937C69, 0xD52DA96F, 0x2512B3CF, 0xAC993BC8, 0x187DA710, 0x9C636EE8, 0x3BBB7BDB,
- 0x267809CD, 0x5918F46E, 0x9AB701EC, 0x4F9AA883, 0x956E65E6, 0xFFE67EAA, 0xBCCF0821, 0x15E8E6EF,
- 0xE79BD9BA, 0x6F36CE4A, 0x9F09D4EA, 0xB07CD629, 0xA4B2AF31, 0x3F23312A, 0xA59430C6, 0xA266C035,
- 0x4EBC3774, 0x82CAA6FC, 0x90D0B0E0, 0xA7D81533, 0x04984AF1, 0xECDAF741, 0xCD500E7F, 0x91F62F17,
- 0x4DD68D76, 0xEFB04D43, 0xAA4D54CC, 0x9604DFE4, 0xD1B5E39E, 0x6A881B4C, 0x2C1FB8C1, 0x65517F46,
- 0x5EEA049D, 0x8C355D01, 0x877473FA, 0x0B412EFB, 0x671D5AB3, 0xDBD25292, 0x105633E9, 0xD647136D,
- 0xD7618C9A, 0xA10C7A37, 0xF8148E59, 0x133C89EB, 0xA927EECE, 0x61C935B7, 0x1CE5EDE1, 0x47B13C7A,
- 0xD2DF599C, 0xF2733F55, 0x14CE7918, 0xC737BF73, 0xF7CDEA53, 0xFDAA5B5F, 0x3D6F14DF, 0x44DB8678,
- 0xAFF381CA, 0x68C43EB9, 0x24342C38, 0xA3405FC2, 0x1DC37216, 0xE2250CBC, 0x3C498B28, 0x0D9541FF,
- 0xA8017139, 0x0CB3DE08, 0xB4E49CD8, 0x56C19064, 0xCB84617B, 0x32B670D5, 0x6C5C7448, 0xB85742D0
- );
-
- for ($i = 0; $i < 256; $i++) {
- $t2[$i << 8] = (($t3[$i] << 8) & 0xFFFFFF00) | (($t3[$i] >> 24) & 0x000000FF);
- $t1[$i << 16] = (($t3[$i] << 16) & 0xFFFF0000) | (($t3[$i] >> 16) & 0x0000FFFF);
- $t0[$i << 24] = (($t3[$i] << 24) & 0xFF000000) | (($t3[$i] >> 8) & 0x00FFFFFF);
-
- $dt2[$i << 8] = (($this->dt3[$i] << 8) & 0xFFFFFF00) | (($dt3[$i] >> 24) & 0x000000FF);
- $dt1[$i << 16] = (($this->dt3[$i] << 16) & 0xFFFF0000) | (($dt3[$i] >> 16) & 0x0000FFFF);
- $dt0[$i << 24] = (($this->dt3[$i] << 24) & 0xFF000000) | (($dt3[$i] >> 8) & 0x00FFFFFF);
- }
- }
-
- /**
- * Sets the key.
- *
- * Keys can be of any length. Rijndael, itself, requires the use of a key that's between 128-bits and 256-bits long and
- * whose length is a multiple of 32. If the key is less than 256-bits and the key length isn't set, we round the length
- * up to the closest valid key length, padding $key with null bytes. If the key is more than 256-bits, we trim the
- * excess bits.
- *
- * If the key is not explicitly set, it'll be assumed to be all null bytes.
- *
- * @access public
- * @param String $key
- */
- function setKey($key)
- {
- $this->key = $key;
- $this->changed = true;
- }
-
- /**
- * Sets the initialization vector. (optional)
- *
- * SetIV is not required when CRYPT_RIJNDAEL_MODE_ECB is being used. If not explictly set, it'll be assumed
- * to be all zero's.
- *
- * @access public
- * @param String $iv
- */
- function setIV($iv)
- {
- $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($iv, 0, $this->block_size), $this->block_size, chr(0));;
- }
-
- /**
- * Sets the key length
- *
- * Valid key lengths are 128, 160, 192, 224, and 256. If the length is less than 128, it will be rounded up to
- * 128. If the length is greater then 128 and invalid, it will be rounded down to the closest valid amount.
- *
- * @access public
- * @param Integer $length
- */
- function setKeyLength($length)
- {
- $length >>= 5;
- if ($length > 8) {
- $length = 8;
- } else if ($length < 4) {
- $length = 4;
- }
- $this->Nk = $length;
- $this->key_size = $length << 2;
-
- $this->explicit_key_length = true;
- $this->changed = true;
- }
-
- /**
- * Sets the block length
- *
- * Valid block lengths are 128, 160, 192, 224, and 256. If the length is less than 128, it will be rounded up to
- * 128. If the length is greater then 128 and invalid, it will be rounded down to the closest valid amount.
- *
- * @access public
- * @param Integer $length
- */
- function setBlockLength($length)
- {
- $length >>= 5;
- if ($length > 8) {
- $length = 8;
- } else if ($length < 4) {
- $length = 4;
- }
- $this->Nb = $length;
- $this->block_size = $length << 2;
- $this->changed = true;
- }
-
- /**
- * Generate CTR XOR encryption key
- *
- * Encrypt the output of this and XOR it against the ciphertext / plaintext to get the
- * plaintext / ciphertext in CTR mode.
- *
- * @see Crypt_Rijndael::decrypt()
- * @see Crypt_Rijndael::encrypt()
- * @access public
- * @param Integer $length
- * @param String $iv
- */
- function _generate_xor($length, &$iv)
- {
- $xor = '';
- $block_size = $this->block_size;
- $num_blocks = floor(($length + ($block_size - 1)) / $block_size);
- for ($i = 0; $i < $num_blocks; $i++) {
- $xor.= $iv;
- for ($j = 4; $j <= $block_size; $j+=4) {
- $temp = substr($iv, -$j, 4);
- switch ($temp) {
- case "\xFF\xFF\xFF\xFF":
- $iv = substr_replace($iv, "\x00\x00\x00\x00", -$j, 4);
- break;
- case "\x7F\xFF\xFF\xFF":
- $iv = substr_replace($iv, "\x80\x00\x00\x00", -$j, 4);
- break 2;
- default:
- extract(unpack('Ncount', $temp));
- $iv = substr_replace($iv, pack('N', $count + 1), -$j, 4);
- break 2;
- }
- }
- }
-
- return $xor;
- }
-
- /**
- * Encrypts a message.
- *
- * $plaintext will be padded with additional bytes such that it's length is a multiple of the block size. Other Rjindael
- * implementations may or may not pad in the same manner. Other common approaches to padding and the reasons why it's
- * necessary are discussed in the following
- * URL:
- *
- * {@link http://www.di-mgt.com.au/cryptopad.html http://www.di-mgt.com.au/cryptopad.html}
- *
- * An alternative to padding is to, separately, send the length of the file. This is what SSH, in fact, does.
- * strlen($plaintext) will still need to be a multiple of 8, however, arbitrary values can be added to make it that
- * length.
- *
- * @see Crypt_Rijndael::decrypt()
- * @access public
- * @param String $plaintext
- */
- function encrypt($plaintext)
- {
- $this->_setup();
- if ($this->mode != CRYPT_RIJNDAEL_MODE_CTR) {
- $plaintext = $this->_pad($plaintext);
- }
-
- $block_size = $this->block_size;
- $ciphertext = '';
- switch ($this->mode) {
- case CRYPT_RIJNDAEL_MODE_ECB:
- for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {
- $ciphertext.= $this->_encryptBlock(substr($plaintext, $i, $block_size));
- }
- break;
- case CRYPT_RIJNDAEL_MODE_CBC:
- $xor = $this->encryptIV;
- for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {
- $block = substr($plaintext, $i, $block_size);
- $block = $this->_encryptBlock($block ^ $xor);
- $xor = $block;
- $ciphertext.= $block;
- }
- if ($this->continuousBuffer) {
- $this->encryptIV = $xor;
- }
- break;
- case CRYPT_RIJNDAEL_MODE_CTR:
- $xor = $this->encryptIV;
- for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {
- $block = substr($plaintext, $i, $block_size);
- $key = $this->_encryptBlock($this->_generate_xor($block_size, $xor));
- $ciphertext.= $block ^ $key;
- }
- if ($this->continuousBuffer) {
- $this->encryptIV = $xor;
- }
- }
-
- return $ciphertext;
- }
-
- /**
- * Decrypts a message.
- *
- * If strlen($ciphertext) is not a multiple of the block size, null bytes will be added to the end of the string until
- * it is.
- *
- * @see Crypt_Rijndael::encrypt()
- * @access public
- * @param String $ciphertext
- */
- function decrypt($ciphertext)
- {
- $this->_setup();
-
- if ($this->mode != CRYPT_RIJNDAEL_MODE_CTR) {
- // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :
- // "The data is padded with "\0" to make sure the length of the data is n * blocksize."
- $ciphertext = str_pad($ciphertext, (strlen($ciphertext) + $this->block_size - 1) % $this->block_size, chr(0));
- }
-
- $block_size = $this->block_size;
- $plaintext = '';
- switch ($this->mode) {
- case CRYPT_RIJNDAEL_MODE_ECB:
- for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {
- $plaintext.= $this->_decryptBlock(substr($ciphertext, $i, $block_size));
- }
- break;
- case CRYPT_RIJNDAEL_MODE_CBC:
- $xor = $this->decryptIV;
- for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {
- $block = substr($ciphertext, $i, $block_size);
- $plaintext.= $this->_decryptBlock($block) ^ $xor;
- $xor = $block;
- }
- if ($this->continuousBuffer) {
- $this->decryptIV = $xor;
- }
- break;
- case CRYPT_RIJNDAEL_MODE_CTR:
- $xor = $this->decryptIV;
- for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {
- $block = substr($ciphertext, $i, $block_size);
- $key = $this->_encryptBlock($this->_generate_xor($block_size, $xor));
- $plaintext.= $block ^ $key;
- }
- if ($this->continuousBuffer) {
- $this->decryptIV = $xor;
- }
- }
-
- return $this->mode != CRYPT_RIJNDAEL_MODE_CTR ? $this->_unpad($plaintext) : $plaintext;
- }
-
- /**
- * Encrypts a block
- *
- * @access private
- * @param String $in
- * @return String
- */
- function _encryptBlock($in)
- {
- $state = array();
- $words = unpack('N*word', $in);
-
- $w = $this->w;
- $t0 = $this->t0;
- $t1 = $this->t1;
- $t2 = $this->t2;
- $t3 = $this->t3;
- $Nb = $this->Nb;
- $Nr = $this->Nr;
- $c = $this->c;
-
- // addRoundKey
- $i = 0;
- foreach ($words as $word) {
- $state[] = $word ^ $w[0][$i++];
- }
-
- // 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 = array();
- for ($round = 1; $round < $Nr; $round++) {
- $i = 0; // $c[0] == 0
- $j = $c[1];
- $k = $c[2];
- $l = $c[3];
-
- while ($i < $this->Nb) {
- $temp[$i] = $t0[$state[$i] & 0xFF000000] ^
- $t1[$state[$j] & 0x00FF0000] ^
- $t2[$state[$k] & 0x0000FF00] ^
- $t3[$state[$l] & 0x000000FF] ^
- $w[$round][$i];
- $i++;
- $j = ($j + 1) % $Nb;
- $k = ($k + 1) % $Nb;
- $l = ($l + 1) % $Nb;
- }
-
- for ($i = 0; $i < $Nb; $i++) {
- $state[$i] = $temp[$i];
- }
- }
-
- // subWord
- for ($i = 0; $i < $Nb; $i++) {
- $state[$i] = $this->_subWord($state[$i]);
- }
-
- // shiftRows + addRoundKey
- $i = 0; // $c[0] == 0
- $j = $c[1];
- $k = $c[2];
- $l = $c[3];
- while ($i < $this->Nb) {
- $temp[$i] = ($state[$i] & 0xFF000000) ^
- ($state[$j] & 0x00FF0000) ^
- ($state[$k] & 0x0000FF00) ^
- ($state[$l] & 0x000000FF) ^
- $w[$Nr][$i];
- $i++;
- $j = ($j + 1) % $Nb;
- $k = ($k + 1) % $Nb;
- $l = ($l + 1) % $Nb;
- }
- $state = $temp;
-
- array_unshift($state, 'N*');
-
- return call_user_func_array('pack', $state);
- }
-
- /**
- * Decrypts a block
- *
- * @access private
- * @param String $in
- * @return String
- */
- function _decryptBlock($in)
- {
- $state = array();
- $words = unpack('N*word', $in);
-
- $num_states = count($state);
- $dw = $this->dw;
- $dt0 = $this->dt0;
- $dt1 = $this->dt1;
- $dt2 = $this->dt2;
- $dt3 = $this->dt3;
- $Nb = $this->Nb;
- $Nr = $this->Nr;
- $c = $this->c;
-
- // addRoundKey
- $i = 0;
- foreach ($words as $word) {
- $state[] = $word ^ $dw[$Nr][$i++];
- }
-
- $temp = array();
- 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] & 0xFF000000] ^
- $dt1[$state[$j] & 0x00FF0000] ^
- $dt2[$state[$k] & 0x0000FF00] ^
- $dt3[$state[$l] & 0x000000FF] ^
- $dw[$round][$i];
- $i++;
- $j = ($j + 1) % $Nb;
- $k = ($k + 1) % $Nb;
- $l = ($l + 1) % $Nb;
- }
-
- for ($i = 0; $i < $Nb; $i++) {
- $state[$i] = $temp[$i];
- }
- }
-
- // invShiftRows + invSubWord + addRoundKey
- $i = 0; // $c[0] == 0
- $j = $Nb - $c[1];
- $k = $Nb - $c[2];
- $l = $Nb - $c[3];
-
- while ($i < $Nb) {
- $temp[$i] = $dw[0][$i] ^
- $this->_invSubWord(($state[$i] & 0xFF000000) |
- ($state[$j] & 0x00FF0000) |
- ($state[$k] & 0x0000FF00) |
- ($state[$l] & 0x000000FF));
- $i++;
- $j = ($j + 1) % $Nb;
- $k = ($k + 1) % $Nb;
- $l = ($l + 1) % $Nb;
- }
-
- $state = $temp;
-
- array_unshift($state, 'N*');
-
- return call_user_func_array('pack', $state);
- }
-
- /**
- * Setup Rijndael
- *
- * Validates all the variables and calculates $Nr - the number of rounds that need to be performed - and $w - the key
- * key schedule.
- *
- * @access private
- */
- function _setup()
- {
- // 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 = array(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 (!$this->changed) {
- return;
- }
-
- if (!$this->explicit_key_length) {
- // we do >> 2, here, and not >> 5, as we do above, since strlen($this->key) tells us the number of bytes - not bits
- $length = strlen($this->key) >> 2;
- if ($length > 8) {
- $length = 8;
- } else if ($length < 4) {
- $length = 4;
- }
- $this->Nk = $length;
- $this->key_size = $length << 2;
- }
-
- $this->key = str_pad(substr($this->key, 0, $this->key_size), $this->key_size, chr(0));
- $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($this->iv, 0, $this->block_size), $this->block_size, chr(0));
-
- // 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 = array(0, 1, 2, 3);
- break;
- case 7:
- $this->c = array(0, 1, 2, 4);
- break;
- case 8:
- $this->c = array(0, 1, 3, 4);
- }
-
- $key = $this->key;
-
- $w = array_values(unpack('N*words', $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];
- } else if ($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"
- $temp = array();
- 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] = $this->dt0[$dw & 0xFF000000] ^
- $this->dt1[$dw & 0x00FF0000] ^
- $this->dt2[$dw & 0x0000FF00] ^
- $this->dt3[$dw & 0x000000FF];
- $j++;
- }
- $this->dw[$row] = $temp;
- }
-
- $col = 0;
- $row++;
- }
- $this->w[$row][$col] = $w[$i];
- }
-
- $this->dw[$row] = $this->w[$row];
-
- $this->changed = false;
- }
-
- /**
- * Performs S-Box substitutions
- *
- * @access private
- */
- function _subWord($word)
- {
- static $sbox0, $sbox1, $sbox2, $sbox3;
-
- if (empty($sbox0)) {
- $sbox0 = array(
- 0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76,
- 0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD, 0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0,
- 0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15,
- 0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75,
- 0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84,
- 0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF,
- 0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8,
- 0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2,
- 0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4, 0xA7, 0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73,
- 0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46, 0xEE, 0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB,
- 0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2, 0xD3, 0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79,
- 0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C, 0x56, 0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08,
- 0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8, 0xDD, 0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A,
- 0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61, 0x35, 0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E,
- 0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B, 0x1E, 0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF,
- 0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41, 0x99, 0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16
- );
-
- $sbox1 = array();
- $sbox2 = array();
- $sbox3 = array();
-
- for ($i = 0; $i < 256; $i++) {
- $sbox1[$i << 8] = $sbox0[$i] << 8;
- $sbox2[$i << 16] = $sbox0[$i] << 16;
- $sbox3[$i << 24] = $sbox0[$i] << 24;
- }
- }
-
- return $sbox0[$word & 0x000000FF] |
- $sbox1[$word & 0x0000FF00] |
- $sbox2[$word & 0x00FF0000] |
- $sbox3[$word & 0xFF000000];
- }
-
- /**
- * Performs inverse S-Box substitutions
- *
- * @access private
- */
- function _invSubWord($word)
- {
- static $sbox0, $sbox1, $sbox2, $sbox3;
-
- if (empty($sbox0)) {
- $sbox0 = array(
- 0x52, 0x09, 0x6A, 0xD5, 0x30, 0x36, 0xA5, 0x38, 0xBF, 0x40, 0xA3, 0x9E, 0x81, 0xF3, 0xD7, 0xFB,
- 0x7C, 0xE3, 0x39, 0x82, 0x9B, 0x2F, 0xFF, 0x87, 0x34, 0x8E, 0x43, 0x44, 0xC4, 0xDE, 0xE9, 0xCB,
- 0x54, 0x7B, 0x94, 0x32, 0xA6, 0xC2, 0x23, 0x3D, 0xEE, 0x4C, 0x95, 0x0B, 0x42, 0xFA, 0xC3, 0x4E,
- 0x08, 0x2E, 0xA1, 0x66, 0x28, 0xD9, 0x24, 0xB2, 0x76, 0x5B, 0xA2, 0x49, 0x6D, 0x8B, 0xD1, 0x25,
- 0x72, 0xF8, 0xF6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xD4, 0xA4, 0x5C, 0xCC, 0x5D, 0x65, 0xB6, 0x92,
- 0x6C, 0x70, 0x48, 0x50, 0xFD, 0xED, 0xB9, 0xDA, 0x5E, 0x15, 0x46, 0x57, 0xA7, 0x8D, 0x9D, 0x84,
- 0x90, 0xD8, 0xAB, 0x00, 0x8C, 0xBC, 0xD3, 0x0A, 0xF7, 0xE4, 0x58, 0x05, 0xB8, 0xB3, 0x45, 0x06,
- 0xD0, 0x2C, 0x1E, 0x8F, 0xCA, 0x3F, 0x0F, 0x02, 0xC1, 0xAF, 0xBD, 0x03, 0x01, 0x13, 0x8A, 0x6B,
- 0x3A, 0x91, 0x11, 0x41, 0x4F, 0x67, 0xDC, 0xEA, 0x97, 0xF2, 0xCF, 0xCE, 0xF0, 0xB4, 0xE6, 0x73,
- 0x96, 0xAC, 0x74, 0x22, 0xE7, 0xAD, 0x35, 0x85, 0xE2, 0xF9, 0x37, 0xE8, 0x1C, 0x75, 0xDF, 0x6E,
- 0x47, 0xF1, 0x1A, 0x71, 0x1D, 0x29, 0xC5, 0x89, 0x6F, 0xB7, 0x62, 0x0E, 0xAA, 0x18, 0xBE, 0x1B,
- 0xFC, 0x56, 0x3E, 0x4B, 0xC6, 0xD2, 0x79, 0x20, 0x9A, 0xDB, 0xC0, 0xFE, 0x78, 0xCD, 0x5A, 0xF4,
- 0x1F, 0xDD, 0xA8, 0x33, 0x88, 0x07, 0xC7, 0x31, 0xB1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xEC, 0x5F,
- 0x60, 0x51, 0x7F, 0xA9, 0x19, 0xB5, 0x4A, 0x0D, 0x2D, 0xE5, 0x7A, 0x9F, 0x93, 0xC9, 0x9C, 0xEF,
- 0xA0, 0xE0, 0x3B, 0x4D, 0xAE, 0x2A, 0xF5, 0xB0, 0xC8, 0xEB, 0xBB, 0x3C, 0x83, 0x53, 0x99, 0x61,
- 0x17, 0x2B, 0x04, 0x7E, 0xBA, 0x77, 0xD6, 0x26, 0xE1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0C, 0x7D
- );
-
- $sbox1 = array();
- $sbox2 = array();
- $sbox3 = array();
-
- for ($i = 0; $i < 256; $i++) {
- $sbox1[$i << 8] = $sbox0[$i] << 8;
- $sbox2[$i << 16] = $sbox0[$i] << 16;
- $sbox3[$i << 24] = $sbox0[$i] << 24;
- }
- }
-
- return $sbox0[$word & 0x000000FF] |
- $sbox1[$word & 0x0000FF00] |
- $sbox2[$word & 0x00FF0000] |
- $sbox3[$word & 0xFF000000];
- }
-
- /**
- * Pad "packets".
- *
- * Rijndael works by encrypting between sixteen and thirty-two bytes at a time, provided that number is also a multiple
- * of four. If you ever need to encrypt or decrypt something that isn't of the proper length, it becomes necessary to
- * pad the input so that it is of the proper length.
- *
- * Padding is enabled by default. Sometimes, however, it is undesirable to pad strings. Such is the case in SSH,
- * where "packets" are padded with random bytes before being encrypted. Unpad these packets and you risk stripping
- * away characters that shouldn't be stripped away. (SSH knows how many bytes are added because the length is
- * transmitted separately)
- *
- * @see Crypt_Rijndael::disablePadding()
- * @access public
- */
- function enablePadding()
- {
- $this->padding = true;
- }
-
- /**
- * Do not pad packets.
- *
- * @see Crypt_Rijndael::enablePadding()
- * @access public
- */
- function disablePadding()
- {
- $this->padding = false;
- }
-
- /**
- * Pads a string
- *
- * Pads a string using the RSA PKCS padding standards so that its length is a multiple of the blocksize.
- * $block_size - (strlen($text) % $block_size) bytes are added, each of which is equal to
- * chr($block_size - (strlen($text) % $block_size)
- *
- * If padding is disabled and $text is not a multiple of the blocksize, the string will be padded regardless
- * and padding will, hence forth, be enabled.
- *
- * @see Crypt_Rijndael::_unpad()
- * @access private
- */
- function _pad($text)
- {
- $length = strlen($text);
-
- if (!$this->padding) {
- if ($length % $this->block_size == 0) {
- return $text;
- } else {
- user_error("The plaintext's length ($length) is not a multiple of the block size ({$this->block_size})", E_USER_NOTICE);
- $this->padding = true;
- }
- }
-
- $pad = $this->block_size - ($length % $this->block_size);
-
- return str_pad($text, $length + $pad, chr($pad));
- }
-
- /**
- * Unpads a string.
- *
- * If padding is enabled and the reported padding length is invalid the encryption key will be assumed to be wrong
- * and false will be returned.
- *
- * @see Crypt_Rijndael::_pad()
- * @access private
- */
- function _unpad($text)
- {
- if (!$this->padding) {
- return $text;
- }
-
- $length = ord($text[strlen($text) - 1]);
-
- if (!$length || $length > $this->block_size) {
- return false;
- }
-
- return substr($text, 0, -$length);
- }
-
- /**
- * Treat consecutive "packets" as if they are a continuous buffer.
- *
- * Say you have a 32-byte plaintext $plaintext. Using the default behavior, the two following code snippets
- * will yield different outputs:
- *
- * <code>
- * echo $rijndael->encrypt(substr($plaintext, 0, 16));
- * echo $rijndael->encrypt(substr($plaintext, 16, 16));
- * </code>
- * <code>
- * echo $rijndael->encrypt($plaintext);
- * </code>
- *
- * The solution is to enable the continuous buffer. Although this will resolve the above discrepancy, it creates
- * another, as demonstrated with the following:
- *
- * <code>
- * $rijndael->encrypt(substr($plaintext, 0, 16));
- * echo $rijndael->decrypt($des->encrypt(substr($plaintext, 16, 16)));
- * </code>
- * <code>
- * echo $rijndael->decrypt($des->encrypt(substr($plaintext, 16, 16)));
- * </code>
- *
- * With the continuous buffer disabled, these would yield the same output. With it enabled, they yield different
- * outputs. The reason is due to the fact that the initialization vector's change after every encryption /
- * decryption round when the continuous buffer is enabled. When it's disabled, they remain constant.
- *
- * Put another way, when the continuous buffer is enabled, the state of the Crypt_Rijndael() object changes after each
- * encryption / decryption round, whereas otherwise, it'd remain constant. For this reason, it's recommended that
- * continuous buffers not be used. They do offer better security and are, in fact, sometimes required (SSH uses them),
- * however, they are also less intuitive and more likely to cause you problems.
- *
- * @see Crypt_Rijndael::disableContinuousBuffer()
- * @access public
- */
- function enableContinuousBuffer()
- {
- $this->continuousBuffer = true;
- }
-
- /**
- * Treat consecutive packets as if they are a discontinuous buffer.
- *
- * The default behavior.
- *
- * @see Crypt_Rijndael::enableContinuousBuffer()
- * @access public
- */
- function disableContinuousBuffer()
- {
- $this->continuousBuffer = false;
- $this->encryptIV = $this->iv;
- $this->decryptIV = $this->iv;
- }
-
- /**
- * String Shift
- *
- * Inspired by array_shift
- *
- * @param String $string
- * @param optional Integer $index
- * @return String
- * @access private
- */
- function _string_shift(&$string, $index = 1)
- {
- $substr = substr($string, 0, $index);
- $string = substr($string, $index);
- return $substr;
- }
-}
-
-// vim: ts=4:sw=4:et:
-// vim6: fdl=1:
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP implementation of Rijndael.\r
+ *\r
+ * Does not use mcrypt, even when available, for reasons that are explained below.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * If {@link Crypt_Rijndael::setBlockLength() setBlockLength()} isn't called, it'll be assumed to be 128 bits. If \r
+ * {@link Crypt_Rijndael::setKeyLength() setKeyLength()} isn't called, it'll be calculated from \r
+ * {@link Crypt_Rijndael::setKey() setKey()}. ie. if the key is 128-bits, the key length will be 128-bits. If it's \r
+ * 136-bits it'll be null-padded to 160-bits and 160 bits will be the key length until \r
+ * {@link Crypt_Rijndael::setKey() setKey()} is called, again, at which point, it'll be recalculated.\r
+ *\r
+ * Not all Rijndael implementations may support 160-bits or 224-bits as the block length / key length. mcrypt, for example,\r
+ * does not. AES, itself, only supports block lengths of 128 and key lengths of 128, 192, and 256.\r
+ * {@link http://csrc.nist.gov/archive/aes/rijndael/Rijndael-ammended.pdf#page=10 Rijndael-ammended.pdf#page=10} defines the\r
+ * algorithm for block lengths of 192 and 256 but not for block lengths / key lengths of 160 and 224. Indeed, 160 and 224\r
+ * are first defined as valid key / block lengths in \r
+ * {@link http://csrc.nist.gov/archive/aes/rijndael/Rijndael-ammended.pdf#page=44 Rijndael-ammended.pdf#page=44}: \r
+ * Extensions: Other block and Cipher Key lengths.\r
+ *\r
+ * {@internal The variable names are the same as those in \r
+ * {@link http://www.csrc.nist.gov/publications/fips/fips197/fips-197.pdf#page=10 fips-197.pdf#page=10}.}}\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/Rijndael.php');\r
+ *\r
+ * $rijndael = new Crypt_Rijndael();\r
+ *\r
+ * $rijndael->setKey('abcdefghijklmnop');\r
+ *\r
+ * $size = 10 * 1024;\r
+ * $plaintext = '';\r
+ * for ($i = 0; $i < $size; $i++) {\r
+ * $plaintext.= 'a';\r
+ * }\r
+ *\r
+ * echo $rijndael->decrypt($rijndael->encrypt($plaintext));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_Rijndael\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMVIII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_Rijndael::encrypt()\r
+ * @see Crypt_Rijndael::decrypt()\r
+ */\r
+/**\r
+ * Encrypt / decrypt using the Counter mode.\r
+ *\r
+ * Set to -1 since that's what Crypt/Random.php uses to index the CTR mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Counter_.28CTR.29\r
+ */\r
+define('CRYPT_RIJNDAEL_MODE_CTR', -1);\r
+/**\r
+ * Encrypt / decrypt using the Electronic Code Book mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Electronic_codebook_.28ECB.29\r
+ */\r
+define('CRYPT_RIJNDAEL_MODE_ECB', 1);\r
+/**\r
+ * Encrypt / decrypt using the Code Book Chaining mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher-block_chaining_.28CBC.29\r
+ */\r
+define('CRYPT_RIJNDAEL_MODE_CBC', 2);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher_feedback_.28CFB.29\r
+ */\r
+define('CRYPT_RIJNDAEL_MODE_CFB', 3);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Output_feedback_.28OFB.29\r
+ */\r
+define('CRYPT_RIJNDAEL_MODE_OFB', 4);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_Rijndael::Crypt_Rijndael()\r
+ */\r
+/**\r
+ * Toggles the internal implementation\r
+ */\r
+define('CRYPT_RIJNDAEL_MODE_INTERNAL', 1);\r
+/**\r
+ * Toggles the mcrypt implementation\r
+ */\r
+define('CRYPT_RIJNDAEL_MODE_MCRYPT', 2);\r
+/**#@-*/\r
+\r
+/**\r
+ * Pure-PHP implementation of Rijndael.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @version 0.1.0\r
+ * @access public\r
+ * @package Crypt_Rijndael\r
+ */\r
+class Crypt_Rijndael {\r
+ /**\r
+ * The Encryption Mode\r
+ *\r
+ * @see Crypt_Rijndael::Crypt_Rijndael()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $mode;\r
+\r
+ /**\r
+ * The Key\r
+ *\r
+ * @see Crypt_Rijndael::setKey()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $key = "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * The Initialization Vector\r
+ *\r
+ * @see Crypt_Rijndael::setIV()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $iv = '';\r
+\r
+ /**\r
+ * A "sliding" Initialization Vector\r
+ *\r
+ * @see Crypt_Rijndael::enableContinuousBuffer()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $encryptIV = '';\r
+\r
+ /**\r
+ * A "sliding" Initialization Vector\r
+ *\r
+ * @see Crypt_Rijndael::enableContinuousBuffer()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $decryptIV = '';\r
+\r
+ /**\r
+ * Continuous Buffer status\r
+ *\r
+ * @see Crypt_Rijndael::enableContinuousBuffer()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $continuousBuffer = false;\r
+\r
+ /**\r
+ * Padding status\r
+ *\r
+ * @see Crypt_Rijndael::enablePadding()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $padding = true;\r
+\r
+ /**\r
+ * Does the key schedule need to be (re)calculated?\r
+ *\r
+ * @see setKey()\r
+ * @see setBlockLength()\r
+ * @see setKeyLength()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $changed = true;\r
+\r
+ /**\r
+ * Has the key length explicitly been set or should it be derived from the key, itself?\r
+ *\r
+ * @see setKeyLength()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $explicit_key_length = false;\r
+\r
+ /**\r
+ * The Key Schedule\r
+ *\r
+ * @see _setup()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $w;\r
+\r
+ /**\r
+ * The Inverse Key Schedule\r
+ *\r
+ * @see _setup()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $dw;\r
+\r
+ /**\r
+ * The Block Length\r
+ *\r
+ * @see setBlockLength()\r
+ * @var Integer\r
+ * @access private\r
+ * @internal The max value is 32, the min value is 16. All valid values are multiples of 4. Exists in conjunction with\r
+ * $Nb because we need this value and not $Nb to pad strings appropriately. \r
+ */\r
+ var $block_size = 16;\r
+\r
+ /**\r
+ * The Block Length divided by 32\r
+ *\r
+ * @see setBlockLength()\r
+ * @var Integer\r
+ * @access private\r
+ * @internal The max value is 256 / 32 = 8, the min value is 128 / 32 = 4. Exists in conjunction with $block_size \r
+ * because the encryption / decryption / key schedule creation requires this number and not $block_size. We could \r
+ * derive this from $block_size or vice versa, but that'd mean we'd have to do multiple shift operations, so in lieu\r
+ * of that, we'll just precompute it once.\r
+ *\r
+ */\r
+ var $Nb = 4;\r
+\r
+ /**\r
+ * The Key Length\r
+ *\r
+ * @see setKeyLength()\r
+ * @var Integer\r
+ * @access private\r
+ * @internal The max value is 256 / 8 = 32, the min value is 128 / 8 = 16. Exists in conjunction with $key_size\r
+ * because the encryption / decryption / key schedule creation requires this number and not $key_size. We could \r
+ * derive this from $key_size or vice versa, but that'd mean we'd have to do multiple shift operations, so in lieu\r
+ * of that, we'll just precompute it once.\r
+ */\r
+ var $key_size = 16;\r
+\r
+ /**\r
+ * The Key Length divided by 32\r
+ *\r
+ * @see setKeyLength()\r
+ * @var Integer\r
+ * @access private\r
+ * @internal The max value is 256 / 32 = 8, the min value is 128 / 32 = 4\r
+ */\r
+ var $Nk = 4;\r
+\r
+ /**\r
+ * The Number of Rounds\r
+ *\r
+ * @var Integer\r
+ * @access private\r
+ * @internal The max value is 14, the min value is 10.\r
+ */\r
+ var $Nr;\r
+\r
+ /**\r
+ * Shift offsets\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $c;\r
+\r
+ /**\r
+ * Precomputed mixColumns table\r
+ *\r
+ * @see Crypt_Rijndael()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $t0;\r
+\r
+ /**\r
+ * Precomputed mixColumns table\r
+ *\r
+ * @see Crypt_Rijndael()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $t1;\r
+\r
+ /**\r
+ * Precomputed mixColumns table\r
+ *\r
+ * @see Crypt_Rijndael()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $t2;\r
+\r
+ /**\r
+ * Precomputed mixColumns table\r
+ *\r
+ * @see Crypt_Rijndael()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $t3;\r
+\r
+ /**\r
+ * Precomputed invMixColumns table\r
+ *\r
+ * @see Crypt_Rijndael()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $dt0;\r
+\r
+ /**\r
+ * Precomputed invMixColumns table\r
+ *\r
+ * @see Crypt_Rijndael()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $dt1;\r
+\r
+ /**\r
+ * Precomputed invMixColumns table\r
+ *\r
+ * @see Crypt_Rijndael()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $dt2;\r
+\r
+ /**\r
+ * Precomputed invMixColumns table\r
+ *\r
+ * @see Crypt_Rijndael()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $dt3;\r
+\r
+ /**\r
+ * The SubByte S-Box\r
+ *\r
+ * @see Crypt_Rijndael::_encryptBlock()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $sbox;\r
+\r
+ /**\r
+ * The inverse SubByte S-Box\r
+ *\r
+ * @see Crypt_Rijndael::_decryptBlock()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $isbox;\r
+\r
+ /**\r
+ * Performance-optimized callback function for en/decrypt()\r
+ *\r
+ * @see Crypt_Rijndael::encrypt()\r
+ * @see Crypt_Rijndael::decrypt()\r
+ * @see Crypt_Rijndael::inline_crypt_setup()\r
+ * @see Crypt_Rijndael::$use_inline_crypt\r
+ * @var Callback\r
+ * @access private\r
+ */\r
+ var $inline_crypt;\r
+\r
+ /**\r
+ * Holds whether performance-optimized $inline_crypt should be used or not.\r
+ *\r
+ * @see Crypt_Rijndael::Crypt_Rijndael()\r
+ * @see Crypt_Rijndael::inline_crypt_setup()\r
+ * @see Crypt_Rijndael::$inline_crypt\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $use_inline_crypt = true;\r
+\r
+ /**\r
+ * Is the mode one that is paddable?\r
+ *\r
+ * @see Crypt_Rijndael::Crypt_Rijndael()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $paddable = false;\r
+\r
+ /**\r
+ * Encryption buffer for CTR, OFB and CFB modes\r
+ *\r
+ * @see Crypt_Rijndael::encrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0);\r
+\r
+ /**\r
+ * Decryption buffer for CTR, OFB and CFB modes\r
+ *\r
+ * @see Crypt_Rijndael::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0);\r
+\r
+ /**\r
+ * Default Constructor.\r
+ *\r
+ * Determines whether or not the mcrypt extension should be used. $mode should only, at present, be\r
+ * CRYPT_RIJNDAEL_MODE_ECB or CRYPT_RIJNDAEL_MODE_CBC. If not explictly set, CRYPT_RIJNDAEL_MODE_CBC will be used.\r
+ *\r
+ * @param optional Integer $mode\r
+ * @return Crypt_Rijndael\r
+ * @access public\r
+ */\r
+ function Crypt_Rijndael($mode = CRYPT_RIJNDAEL_MODE_CBC)\r
+ {\r
+ switch ($mode) {\r
+ case CRYPT_RIJNDAEL_MODE_ECB:\r
+ case CRYPT_RIJNDAEL_MODE_CBC:\r
+ $this->paddable = true;\r
+ $this->mode = $mode;\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CTR:\r
+ case CRYPT_RIJNDAEL_MODE_CFB:\r
+ case CRYPT_RIJNDAEL_MODE_OFB:\r
+ $this->mode = $mode;\r
+ break;\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = CRYPT_RIJNDAEL_MODE_CBC;\r
+ }\r
+\r
+ $t3 = &$this->t3;\r
+ $t2 = &$this->t2;\r
+ $t1 = &$this->t1;\r
+ $t0 = &$this->t0;\r
+\r
+ $dt3 = &$this->dt3;\r
+ $dt2 = &$this->dt2;\r
+ $dt1 = &$this->dt1;\r
+ $dt0 = &$this->dt0;\r
+\r
+ // according to <http://csrc.nist.gov/archive/aes/rijndael/Rijndael-ammended.pdf#page=19> (section 5.2.1), \r
+ // precomputed tables can be used in the mixColumns phase. in that example, they're assigned t0...t3, so\r
+ // those are the names we'll use.\r
+ $t3 = array(\r
+ 0x6363A5C6, 0x7C7C84F8, 0x777799EE, 0x7B7B8DF6, 0xF2F20DFF, 0x6B6BBDD6, 0x6F6FB1DE, 0xC5C55491, \r
+ 0x30305060, 0x01010302, 0x6767A9CE, 0x2B2B7D56, 0xFEFE19E7, 0xD7D762B5, 0xABABE64D, 0x76769AEC, \r
+ 0xCACA458F, 0x82829D1F, 0xC9C94089, 0x7D7D87FA, 0xFAFA15EF, 0x5959EBB2, 0x4747C98E, 0xF0F00BFB, \r
+ 0xADADEC41, 0xD4D467B3, 0xA2A2FD5F, 0xAFAFEA45, 0x9C9CBF23, 0xA4A4F753, 0x727296E4, 0xC0C05B9B, \r
+ 0xB7B7C275, 0xFDFD1CE1, 0x9393AE3D, 0x26266A4C, 0x36365A6C, 0x3F3F417E, 0xF7F702F5, 0xCCCC4F83, \r
+ 0x34345C68, 0xA5A5F451, 0xE5E534D1, 0xF1F108F9, 0x717193E2, 0xD8D873AB, 0x31315362, 0x15153F2A, \r
+ 0x04040C08, 0xC7C75295, 0x23236546, 0xC3C35E9D, 0x18182830, 0x9696A137, 0x05050F0A, 0x9A9AB52F, \r
+ 0x0707090E, 0x12123624, 0x80809B1B, 0xE2E23DDF, 0xEBEB26CD, 0x2727694E, 0xB2B2CD7F, 0x75759FEA, \r
+ 0x09091B12, 0x83839E1D, 0x2C2C7458, 0x1A1A2E34, 0x1B1B2D36, 0x6E6EB2DC, 0x5A5AEEB4, 0xA0A0FB5B, \r
+ 0x5252F6A4, 0x3B3B4D76, 0xD6D661B7, 0xB3B3CE7D, 0x29297B52, 0xE3E33EDD, 0x2F2F715E, 0x84849713, \r
+ 0x5353F5A6, 0xD1D168B9, 0x00000000, 0xEDED2CC1, 0x20206040, 0xFCFC1FE3, 0xB1B1C879, 0x5B5BEDB6, \r
+ 0x6A6ABED4, 0xCBCB468D, 0xBEBED967, 0x39394B72, 0x4A4ADE94, 0x4C4CD498, 0x5858E8B0, 0xCFCF4A85, \r
+ 0xD0D06BBB, 0xEFEF2AC5, 0xAAAAE54F, 0xFBFB16ED, 0x4343C586, 0x4D4DD79A, 0x33335566, 0x85859411, \r
+ 0x4545CF8A, 0xF9F910E9, 0x02020604, 0x7F7F81FE, 0x5050F0A0, 0x3C3C4478, 0x9F9FBA25, 0xA8A8E34B, \r
+ 0x5151F3A2, 0xA3A3FE5D, 0x4040C080, 0x8F8F8A05, 0x9292AD3F, 0x9D9DBC21, 0x38384870, 0xF5F504F1, \r
+ 0xBCBCDF63, 0xB6B6C177, 0xDADA75AF, 0x21216342, 0x10103020, 0xFFFF1AE5, 0xF3F30EFD, 0xD2D26DBF, \r
+ 0xCDCD4C81, 0x0C0C1418, 0x13133526, 0xECEC2FC3, 0x5F5FE1BE, 0x9797A235, 0x4444CC88, 0x1717392E, \r
+ 0xC4C45793, 0xA7A7F255, 0x7E7E82FC, 0x3D3D477A, 0x6464ACC8, 0x5D5DE7BA, 0x19192B32, 0x737395E6, \r
+ 0x6060A0C0, 0x81819819, 0x4F4FD19E, 0xDCDC7FA3, 0x22226644, 0x2A2A7E54, 0x9090AB3B, 0x8888830B, \r
+ 0x4646CA8C, 0xEEEE29C7, 0xB8B8D36B, 0x14143C28, 0xDEDE79A7, 0x5E5EE2BC, 0x0B0B1D16, 0xDBDB76AD, \r
+ 0xE0E03BDB, 0x32325664, 0x3A3A4E74, 0x0A0A1E14, 0x4949DB92, 0x06060A0C, 0x24246C48, 0x5C5CE4B8, \r
+ 0xC2C25D9F, 0xD3D36EBD, 0xACACEF43, 0x6262A6C4, 0x9191A839, 0x9595A431, 0xE4E437D3, 0x79798BF2, \r
+ 0xE7E732D5, 0xC8C8438B, 0x3737596E, 0x6D6DB7DA, 0x8D8D8C01, 0xD5D564B1, 0x4E4ED29C, 0xA9A9E049, \r
+ 0x6C6CB4D8, 0x5656FAAC, 0xF4F407F3, 0xEAEA25CF, 0x6565AFCA, 0x7A7A8EF4, 0xAEAEE947, 0x08081810, \r
+ 0xBABAD56F, 0x787888F0, 0x25256F4A, 0x2E2E725C, 0x1C1C2438, 0xA6A6F157, 0xB4B4C773, 0xC6C65197, \r
+ 0xE8E823CB, 0xDDDD7CA1, 0x74749CE8, 0x1F1F213E, 0x4B4BDD96, 0xBDBDDC61, 0x8B8B860D, 0x8A8A850F, \r
+ 0x707090E0, 0x3E3E427C, 0xB5B5C471, 0x6666AACC, 0x4848D890, 0x03030506, 0xF6F601F7, 0x0E0E121C, \r
+ 0x6161A3C2, 0x35355F6A, 0x5757F9AE, 0xB9B9D069, 0x86869117, 0xC1C15899, 0x1D1D273A, 0x9E9EB927, \r
+ 0xE1E138D9, 0xF8F813EB, 0x9898B32B, 0x11113322, 0x6969BBD2, 0xD9D970A9, 0x8E8E8907, 0x9494A733, \r
+ 0x9B9BB62D, 0x1E1E223C, 0x87879215, 0xE9E920C9, 0xCECE4987, 0x5555FFAA, 0x28287850, 0xDFDF7AA5, \r
+ 0x8C8C8F03, 0xA1A1F859, 0x89898009, 0x0D0D171A, 0xBFBFDA65, 0xE6E631D7, 0x4242C684, 0x6868B8D0, \r
+ 0x4141C382, 0x9999B029, 0x2D2D775A, 0x0F0F111E, 0xB0B0CB7B, 0x5454FCA8, 0xBBBBD66D, 0x16163A2C\r
+ );\r
+\r
+ $dt3 = array(\r
+ 0xF4A75051, 0x4165537E, 0x17A4C31A, 0x275E963A, 0xAB6BCB3B, 0x9D45F11F, 0xFA58ABAC, 0xE303934B, \r
+ 0x30FA5520, 0x766DF6AD, 0xCC769188, 0x024C25F5, 0xE5D7FC4F, 0x2ACBD7C5, 0x35448026, 0x62A38FB5, \r
+ 0xB15A49DE, 0xBA1B6725, 0xEA0E9845, 0xFEC0E15D, 0x2F7502C3, 0x4CF01281, 0x4697A38D, 0xD3F9C66B, \r
+ 0x8F5FE703, 0x929C9515, 0x6D7AEBBF, 0x5259DA95, 0xBE832DD4, 0x7421D358, 0xE0692949, 0xC9C8448E, \r
+ 0xC2896A75, 0x8E7978F4, 0x583E6B99, 0xB971DD27, 0xE14FB6BE, 0x88AD17F0, 0x20AC66C9, 0xCE3AB47D, \r
+ 0xDF4A1863, 0x1A3182E5, 0x51336097, 0x537F4562, 0x6477E0B1, 0x6BAE84BB, 0x81A01CFE, 0x082B94F9, \r
+ 0x48685870, 0x45FD198F, 0xDE6C8794, 0x7BF8B752, 0x73D323AB, 0x4B02E272, 0x1F8F57E3, 0x55AB2A66, \r
+ 0xEB2807B2, 0xB5C2032F, 0xC57B9A86, 0x3708A5D3, 0x2887F230, 0xBFA5B223, 0x036ABA02, 0x16825CED, \r
+ 0xCF1C2B8A, 0x79B492A7, 0x07F2F0F3, 0x69E2A14E, 0xDAF4CD65, 0x05BED506, 0x34621FD1, 0xA6FE8AC4, \r
+ 0x2E539D34, 0xF355A0A2, 0x8AE13205, 0xF6EB75A4, 0x83EC390B, 0x60EFAA40, 0x719F065E, 0x6E1051BD, \r
+ 0x218AF93E, 0xDD063D96, 0x3E05AEDD, 0xE6BD464D, 0x548DB591, 0xC45D0571, 0x06D46F04, 0x5015FF60, \r
+ 0x98FB2419, 0xBDE997D6, 0x4043CC89, 0xD99E7767, 0xE842BDB0, 0x898B8807, 0x195B38E7, 0xC8EEDB79, \r
+ 0x7C0A47A1, 0x420FE97C, 0x841EC9F8, 0x00000000, 0x80868309, 0x2BED4832, 0x1170AC1E, 0x5A724E6C, \r
+ 0x0EFFFBFD, 0x8538560F, 0xAED51E3D, 0x2D392736, 0x0FD9640A, 0x5CA62168, 0x5B54D19B, 0x362E3A24, \r
+ 0x0A67B10C, 0x57E70F93, 0xEE96D2B4, 0x9B919E1B, 0xC0C54F80, 0xDC20A261, 0x774B695A, 0x121A161C, \r
+ 0x93BA0AE2, 0xA02AE5C0, 0x22E0433C, 0x1B171D12, 0x090D0B0E, 0x8BC7ADF2, 0xB6A8B92D, 0x1EA9C814, \r
+ 0xF1198557, 0x75074CAF, 0x99DDBBEE, 0x7F60FDA3, 0x01269FF7, 0x72F5BC5C, 0x663BC544, 0xFB7E345B, \r
+ 0x4329768B, 0x23C6DCCB, 0xEDFC68B6, 0xE4F163B8, 0x31DCCAD7, 0x63851042, 0x97224013, 0xC6112084, \r
+ 0x4A247D85, 0xBB3DF8D2, 0xF93211AE, 0x29A16DC7, 0x9E2F4B1D, 0xB230F3DC, 0x8652EC0D, 0xC1E3D077, \r
+ 0xB3166C2B, 0x70B999A9, 0x9448FA11, 0xE9642247, 0xFC8CC4A8, 0xF03F1AA0, 0x7D2CD856, 0x3390EF22, \r
+ 0x494EC787, 0x38D1C1D9, 0xCAA2FE8C, 0xD40B3698, 0xF581CFA6, 0x7ADE28A5, 0xB78E26DA, 0xADBFA43F, \r
+ 0x3A9DE42C, 0x78920D50, 0x5FCC9B6A, 0x7E466254, 0x8D13C2F6, 0xD8B8E890, 0x39F75E2E, 0xC3AFF582, \r
+ 0x5D80BE9F, 0xD0937C69, 0xD52DA96F, 0x2512B3CF, 0xAC993BC8, 0x187DA710, 0x9C636EE8, 0x3BBB7BDB, \r
+ 0x267809CD, 0x5918F46E, 0x9AB701EC, 0x4F9AA883, 0x956E65E6, 0xFFE67EAA, 0xBCCF0821, 0x15E8E6EF, \r
+ 0xE79BD9BA, 0x6F36CE4A, 0x9F09D4EA, 0xB07CD629, 0xA4B2AF31, 0x3F23312A, 0xA59430C6, 0xA266C035, \r
+ 0x4EBC3774, 0x82CAA6FC, 0x90D0B0E0, 0xA7D81533, 0x04984AF1, 0xECDAF741, 0xCD500E7F, 0x91F62F17, \r
+ 0x4DD68D76, 0xEFB04D43, 0xAA4D54CC, 0x9604DFE4, 0xD1B5E39E, 0x6A881B4C, 0x2C1FB8C1, 0x65517F46, \r
+ 0x5EEA049D, 0x8C355D01, 0x877473FA, 0x0B412EFB, 0x671D5AB3, 0xDBD25292, 0x105633E9, 0xD647136D, \r
+ 0xD7618C9A, 0xA10C7A37, 0xF8148E59, 0x133C89EB, 0xA927EECE, 0x61C935B7, 0x1CE5EDE1, 0x47B13C7A, \r
+ 0xD2DF599C, 0xF2733F55, 0x14CE7918, 0xC737BF73, 0xF7CDEA53, 0xFDAA5B5F, 0x3D6F14DF, 0x44DB8678, \r
+ 0xAFF381CA, 0x68C43EB9, 0x24342C38, 0xA3405FC2, 0x1DC37216, 0xE2250CBC, 0x3C498B28, 0x0D9541FF, \r
+ 0xA8017139, 0x0CB3DE08, 0xB4E49CD8, 0x56C19064, 0xCB84617B, 0x32B670D5, 0x6C5C7448, 0xB85742D0\r
+ );\r
+\r
+ for ($i = 0; $i < 256; $i++) {\r
+ $t2[] = (($t3[$i] << 8) & 0xFFFFFF00) | (($t3[$i] >> 24) & 0x000000FF);\r
+ $t1[] = (($t3[$i] << 16) & 0xFFFF0000) | (($t3[$i] >> 16) & 0x0000FFFF);\r
+ $t0[] = (($t3[$i] << 24) & 0xFF000000) | (($t3[$i] >> 8) & 0x00FFFFFF);\r
+\r
+ $dt2[] = (($dt3[$i] << 8) & 0xFFFFFF00) | (($dt3[$i] >> 24) & 0x000000FF);\r
+ $dt1[] = (($dt3[$i] << 16) & 0xFFFF0000) | (($dt3[$i] >> 16) & 0x0000FFFF);\r
+ $dt0[] = (($dt3[$i] << 24) & 0xFF000000) | (($dt3[$i] >> 8) & 0x00FFFFFF);\r
+ }\r
+\r
+ // sbox for the S-Box substitution\r
+ $this->sbox = array(\r
+ 0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76,\r
+ 0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD, 0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0,\r
+ 0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15,\r
+ 0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75,\r
+ 0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84,\r
+ 0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF,\r
+ 0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8,\r
+ 0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2,\r
+ 0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4, 0xA7, 0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73,\r
+ 0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46, 0xEE, 0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB,\r
+ 0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2, 0xD3, 0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79,\r
+ 0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C, 0x56, 0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08,\r
+ 0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8, 0xDD, 0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A,\r
+ 0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61, 0x35, 0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E,\r
+ 0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B, 0x1E, 0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF,\r
+ 0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41, 0x99, 0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16\r
+ );\r
+\r
+ // sbox for the inverse S-Box substitution\r
+ $this->isbox = array(\r
+ 0x52, 0x09, 0x6A, 0xD5, 0x30, 0x36, 0xA5, 0x38, 0xBF, 0x40, 0xA3, 0x9E, 0x81, 0xF3, 0xD7, 0xFB,\r
+ 0x7C, 0xE3, 0x39, 0x82, 0x9B, 0x2F, 0xFF, 0x87, 0x34, 0x8E, 0x43, 0x44, 0xC4, 0xDE, 0xE9, 0xCB,\r
+ 0x54, 0x7B, 0x94, 0x32, 0xA6, 0xC2, 0x23, 0x3D, 0xEE, 0x4C, 0x95, 0x0B, 0x42, 0xFA, 0xC3, 0x4E,\r
+ 0x08, 0x2E, 0xA1, 0x66, 0x28, 0xD9, 0x24, 0xB2, 0x76, 0x5B, 0xA2, 0x49, 0x6D, 0x8B, 0xD1, 0x25,\r
+ 0x72, 0xF8, 0xF6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xD4, 0xA4, 0x5C, 0xCC, 0x5D, 0x65, 0xB6, 0x92,\r
+ 0x6C, 0x70, 0x48, 0x50, 0xFD, 0xED, 0xB9, 0xDA, 0x5E, 0x15, 0x46, 0x57, 0xA7, 0x8D, 0x9D, 0x84,\r
+ 0x90, 0xD8, 0xAB, 0x00, 0x8C, 0xBC, 0xD3, 0x0A, 0xF7, 0xE4, 0x58, 0x05, 0xB8, 0xB3, 0x45, 0x06,\r
+ 0xD0, 0x2C, 0x1E, 0x8F, 0xCA, 0x3F, 0x0F, 0x02, 0xC1, 0xAF, 0xBD, 0x03, 0x01, 0x13, 0x8A, 0x6B,\r
+ 0x3A, 0x91, 0x11, 0x41, 0x4F, 0x67, 0xDC, 0xEA, 0x97, 0xF2, 0xCF, 0xCE, 0xF0, 0xB4, 0xE6, 0x73,\r
+ 0x96, 0xAC, 0x74, 0x22, 0xE7, 0xAD, 0x35, 0x85, 0xE2, 0xF9, 0x37, 0xE8, 0x1C, 0x75, 0xDF, 0x6E,\r
+ 0x47, 0xF1, 0x1A, 0x71, 0x1D, 0x29, 0xC5, 0x89, 0x6F, 0xB7, 0x62, 0x0E, 0xAA, 0x18, 0xBE, 0x1B,\r
+ 0xFC, 0x56, 0x3E, 0x4B, 0xC6, 0xD2, 0x79, 0x20, 0x9A, 0xDB, 0xC0, 0xFE, 0x78, 0xCD, 0x5A, 0xF4,\r
+ 0x1F, 0xDD, 0xA8, 0x33, 0x88, 0x07, 0xC7, 0x31, 0xB1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xEC, 0x5F,\r
+ 0x60, 0x51, 0x7F, 0xA9, 0x19, 0xB5, 0x4A, 0x0D, 0x2D, 0xE5, 0x7A, 0x9F, 0x93, 0xC9, 0x9C, 0xEF,\r
+ 0xA0, 0xE0, 0x3B, 0x4D, 0xAE, 0x2A, 0xF5, 0xB0, 0xC8, 0xEB, 0xBB, 0x3C, 0x83, 0x53, 0x99, 0x61,\r
+ 0x17, 0x2B, 0x04, 0x7E, 0xBA, 0x77, 0xD6, 0x26, 0xE1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0C, 0x7D\r
+ );\r
+\r
+ if (!function_exists('create_function') || !is_callable('create_function')) {\r
+ $this->use_inline_crypt = false;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Sets the key.\r
+ *\r
+ * Keys can be of any length. Rijndael, itself, requires the use of a key that's between 128-bits and 256-bits long and\r
+ * whose length is a multiple of 32. If the key is less than 256-bits and the key length isn't set, we round the length\r
+ * up to the closest valid key length, padding $key with null bytes. If the key is more than 256-bits, we trim the\r
+ * excess bits.\r
+ *\r
+ * If the key is not explicitly set, it'll be assumed to be all null bytes.\r
+ *\r
+ * @access public\r
+ * @param String $key\r
+ */\r
+ function setKey($key)\r
+ {\r
+ $this->key = $key;\r
+ $this->changed = true;\r
+ }\r
+\r
+ /**\r
+ * Sets the initialization vector. (optional)\r
+ *\r
+ * SetIV is not required when CRYPT_RIJNDAEL_MODE_ECB is being used. If not explictly set, it'll be assumed\r
+ * to be all zero's.\r
+ *\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function setIV($iv)\r
+ {\r
+ $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($iv, 0, $this->block_size), $this->block_size, chr(0));\r
+ }\r
+\r
+ /**\r
+ * Sets the key length\r
+ *\r
+ * Valid key lengths are 128, 160, 192, 224, and 256. If the length is less than 128, it will be rounded up to\r
+ * 128. If the length is greater than 128 and invalid, it will be rounded down to the closest valid amount.\r
+ *\r
+ * @access public\r
+ * @param Integer $length\r
+ */\r
+ function setKeyLength($length)\r
+ {\r
+ $length >>= 5;\r
+ if ($length > 8) {\r
+ $length = 8;\r
+ } else if ($length < 4) {\r
+ $length = 4;\r
+ }\r
+ $this->Nk = $length;\r
+ $this->key_size = $length << 2;\r
+\r
+ $this->explicit_key_length = true;\r
+ $this->changed = true;\r
+ }\r
+\r
+ /**\r
+ * Sets the password.\r
+ *\r
+ * Depending on what $method is set to, setPassword()'s (optional) parameters are as follows:\r
+ * {@link http://en.wikipedia.org/wiki/PBKDF2 pbkdf2}:\r
+ * $hash, $salt, $method\r
+ * Set $dkLen by calling setKeyLength()\r
+ *\r
+ * @param String $password\r
+ * @param optional String $method\r
+ * @access public\r
+ */\r
+ function setPassword($password, $method = 'pbkdf2')\r
+ {\r
+ $key = '';\r
+\r
+ switch ($method) {\r
+ default: // 'pbkdf2'\r
+ list(, , $hash, $salt, $count) = func_get_args();\r
+ if (!isset($hash)) {\r
+ $hash = 'sha1';\r
+ }\r
+ // WPA and WPA2 use the SSID as the salt\r
+ if (!isset($salt)) {\r
+ $salt = 'phpseclib';\r
+ }\r
+ // RFC2898#section-4.2 uses 1,000 iterations by default\r
+ // WPA and WPA2 use 4,096.\r
+ if (!isset($count)) {\r
+ $count = 1000;\r
+ }\r
+\r
+ if (!class_exists('Crypt_Hash')) {\r
+ require_once('Crypt/Hash.php');\r
+ }\r
+\r
+ $i = 1;\r
+ while (strlen($key) < $this->key_size) { // $dkLen == $this->key_size\r
+ //$dk.= $this->_pbkdf($password, $salt, $count, $i++);\r
+ $hmac = new Crypt_Hash();\r
+ $hmac->setHash($hash);\r
+ $hmac->setKey($password);\r
+ $f = $u = $hmac->hash($salt . pack('N', $i++));\r
+ for ($j = 2; $j <= $count; $j++) {\r
+ $u = $hmac->hash($u);\r
+ $f^= $u;\r
+ }\r
+ $key.= $f;\r
+ }\r
+ }\r
+\r
+ $this->setKey(substr($key, 0, $this->key_size));\r
+ }\r
+\r
+ /**\r
+ * Sets the block length\r
+ *\r
+ * Valid block lengths are 128, 160, 192, 224, and 256. If the length is less than 128, it will be rounded up to\r
+ * 128. If the length is greater than 128 and invalid, it will be rounded down to the closest valid amount.\r
+ *\r
+ * @access public\r
+ * @param Integer $length\r
+ */\r
+ function setBlockLength($length)\r
+ {\r
+ $length >>= 5;\r
+ if ($length > 8) {\r
+ $length = 8;\r
+ } else if ($length < 4) {\r
+ $length = 4;\r
+ }\r
+ $this->Nb = $length;\r
+ $this->block_size = $length << 2;\r
+ $this->changed = true;\r
+ }\r
+\r
+ /**\r
+ * Generate CTR XOR encryption key\r
+ *\r
+ * Encrypt the output of this and XOR it against the ciphertext / plaintext to get the\r
+ * plaintext / ciphertext in CTR mode.\r
+ *\r
+ * @see Crypt_Rijndael::decrypt()\r
+ * @see Crypt_Rijndael::encrypt()\r
+ * @access public\r
+ * @param Integer $length\r
+ * @param String $iv\r
+ */\r
+ function _generate_xor($length, &$iv)\r
+ {\r
+ $xor = '';\r
+ $block_size = $this->block_size;\r
+ $num_blocks = floor(($length + ($block_size - 1)) / $block_size);\r
+ for ($i = 0; $i < $num_blocks; $i++) {\r
+ $xor.= $iv;\r
+ for ($j = 4; $j <= $block_size; $j+=4) {\r
+ $temp = substr($iv, -$j, 4);\r
+ switch ($temp) {\r
+ case "\xFF\xFF\xFF\xFF":\r
+ $iv = substr_replace($iv, "\x00\x00\x00\x00", -$j, 4);\r
+ break;\r
+ case "\x7F\xFF\xFF\xFF":\r
+ $iv = substr_replace($iv, "\x80\x00\x00\x00", -$j, 4);\r
+ break 2;\r
+ default:\r
+ extract(unpack('Ncount', $temp));\r
+ $iv = substr_replace($iv, pack('N', $count + 1), -$j, 4);\r
+ break 2;\r
+ }\r
+ }\r
+ }\r
+\r
+ return $xor;\r
+ }\r
+\r
+ /**\r
+ * Encrypts a message.\r
+ *\r
+ * $plaintext will be padded with additional bytes such that it's length is a multiple of the block size. Other Rjindael\r
+ * implementations may or may not pad in the same manner. Other common approaches to padding and the reasons why it's\r
+ * necessary are discussed in the following\r
+ * URL:\r
+ *\r
+ * {@link http://www.di-mgt.com.au/cryptopad.html http://www.di-mgt.com.au/cryptopad.html}\r
+ *\r
+ * An alternative to padding is to, separately, send the length of the file. This is what SSH, in fact, does.\r
+ * strlen($plaintext) will still need to be a multiple of 8, however, arbitrary values can be added to make it that\r
+ * length.\r
+ *\r
+ * @see Crypt_Rijndael::decrypt()\r
+ * @access public\r
+ * @param String $plaintext\r
+ */\r
+ function encrypt($plaintext)\r
+ {\r
+ if ($this->changed) {\r
+ $this->_setup();\r
+ }\r
+ if ($this->use_inline_crypt) {\r
+ $inline = $this->inline_crypt;\r
+ return $inline('encrypt', $this, $plaintext);\r
+ }\r
+ if ($this->paddable) {\r
+ $plaintext = $this->_pad($plaintext);\r
+ }\r
+\r
+ $block_size = $this->block_size;\r
+ $buffer = &$this->enbuffer;\r
+ $ciphertext = '';\r
+ switch ($this->mode) {\r
+ case CRYPT_RIJNDAEL_MODE_ECB:\r
+ for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {\r
+ $ciphertext.= $this->_encryptBlock(substr($plaintext, $i, $block_size));\r
+ }\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CBC:\r
+ $xor = $this->encryptIV;\r
+ for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {\r
+ $block = substr($plaintext, $i, $block_size);\r
+ $block = $this->_encryptBlock($block ^ $xor);\r
+ $xor = $block;\r
+ $ciphertext.= $block;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ }\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CTR:\r
+ $xor = $this->encryptIV;\r
+ if (strlen($buffer['encrypted'])) {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {\r
+ $block = substr($plaintext, $i, $block_size);\r
+ if (strlen($block) > strlen($buffer['encrypted'])) {\r
+ $buffer['encrypted'].= $this->_encryptBlock($this->_generate_xor($block_size, $xor));\r
+ }\r
+ $key = $this->_string_shift($buffer['encrypted'], $block_size);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {\r
+ $block = substr($plaintext, $i, $block_size);\r
+ $key = $this->_encryptBlock($this->_generate_xor($block_size, $xor));\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ if ($start = strlen($plaintext) % $block_size) {\r
+ $buffer['encrypted'] = substr($key, $start) . $buffer['encrypted'];\r
+ }\r
+ }\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CFB:\r
+ // cfb loosely routines inspired by openssl's:\r
+ // http://cvs.openssl.org/fileview?f=openssl/crypto/modes/cfb128.c&v=1.3.2.2.2.1\r
+ if ($this->continuousBuffer) {\r
+ $iv = &$this->encryptIV;\r
+ $pos = &$buffer['pos'];\r
+ } else {\r
+ $iv = $this->encryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($plaintext);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = $block_size - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ // ie. $i = min($max, $len), $len-= $i, $pos+= $i, $pos%= $blocksize\r
+ $ciphertext = substr($iv, $orig_pos) ^ $plaintext;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ }\r
+ while ($len >= $block_size) {\r
+ $iv = $this->_encryptBlock($iv) ^ substr($plaintext, $i, $block_size);\r
+ $ciphertext.= $iv;\r
+ $len-= $block_size;\r
+ $i+= $block_size;\r
+ }\r
+ if ($len) {\r
+ $iv = $this->_encryptBlock($iv);\r
+ $block = $iv ^ substr($plaintext, $i);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_OFB:\r
+ $xor = $this->encryptIV;\r
+ if (strlen($buffer['xor'])) {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {\r
+ $block = substr($plaintext, $i, $block_size);\r
+ if (strlen($block) > strlen($buffer['xor'])) {\r
+ $xor = $this->_encryptBlock($xor);\r
+ $buffer['xor'].= $xor;\r
+ }\r
+ $key = $this->_string_shift($buffer['xor'], $block_size);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=$block_size) {\r
+ $xor = $this->_encryptBlock($xor);\r
+ $ciphertext.= substr($plaintext, $i, $block_size) ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ if ($start = strlen($plaintext) % $block_size) {\r
+ $buffer['xor'] = substr($key, $start) . $buffer['xor'];\r
+ }\r
+ }\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ /**\r
+ * Decrypts a message.\r
+ *\r
+ * If strlen($ciphertext) is not a multiple of the block size, null bytes will be added to the end of the string until\r
+ * it is.\r
+ *\r
+ * @see Crypt_Rijndael::encrypt()\r
+ * @access public\r
+ * @param String $ciphertext\r
+ */\r
+ function decrypt($ciphertext)\r
+ {\r
+ if ($this->changed) {\r
+ $this->_setup();\r
+ }\r
+ if ($this->use_inline_crypt) {\r
+ $inline = $this->inline_crypt;\r
+ return $inline('decrypt', $this, $ciphertext);\r
+ }\r
+ if ($this->paddable) {\r
+ // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :\r
+ // "The data is padded with "\0" to make sure the length of the data is n * blocksize."\r
+ $ciphertext = str_pad($ciphertext, strlen($ciphertext) + ($this->block_size - strlen($ciphertext) % $this->block_size) % $this->block_size, chr(0));\r
+ }\r
+\r
+ $block_size = $this->block_size;\r
+ $buffer = &$this->debuffer;\r
+ $plaintext = '';\r
+ switch ($this->mode) {\r
+ case CRYPT_RIJNDAEL_MODE_ECB:\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {\r
+ $plaintext.= $this->_decryptBlock(substr($ciphertext, $i, $block_size));\r
+ }\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CBC:\r
+ $xor = $this->decryptIV;\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {\r
+ $block = substr($ciphertext, $i, $block_size);\r
+ $plaintext.= $this->_decryptBlock($block) ^ $xor;\r
+ $xor = $block;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ }\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CTR:\r
+ $xor = $this->decryptIV;\r
+ if (strlen($buffer['ciphertext'])) {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {\r
+ $block = substr($ciphertext, $i, $block_size);\r
+ if (strlen($block) > strlen($buffer['ciphertext'])) {\r
+ $buffer['ciphertext'].= $this->_encryptBlock($this->_generate_xor($block_size, $xor));\r
+ }\r
+ $key = $this->_string_shift($buffer['ciphertext'], $block_size);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {\r
+ $block = substr($ciphertext, $i, $block_size);\r
+ $key = $this->_encryptBlock($this->_generate_xor($block_size, $xor));\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ if ($start = strlen($ciphertext) % $block_size) {\r
+ $buffer['ciphertext'] = substr($key, $start) . $buffer['ciphertext'];\r
+ }\r
+ }\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CFB:\r
+ if ($this->continuousBuffer) {\r
+ $iv = &$this->decryptIV;\r
+ $pos = &$buffer['pos'];\r
+ } else {\r
+ $iv = $this->decryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($ciphertext);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = $block_size - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ // ie. $i = min($max, $len), $len-= $i, $pos+= $i, $pos%= $blocksize\r
+ $plaintext = substr($iv, $orig_pos) ^ $ciphertext;\r
+ $iv = substr_replace($iv, substr($ciphertext, 0, $i), $orig_pos, $i);\r
+ }\r
+ while ($len >= $block_size) {\r
+ $iv = $this->_encryptBlock($iv);\r
+ $cb = substr($ciphertext, $i, $block_size);\r
+ $plaintext.= $iv ^ $cb;\r
+ $iv = $cb;\r
+ $len-= $block_size;\r
+ $i+= $block_size;\r
+ }\r
+ if ($len) {\r
+ $iv = $this->_encryptBlock($iv);\r
+ $plaintext.= $iv ^ substr($ciphertext, $i);\r
+ $iv = substr_replace($iv, substr($ciphertext, $i), 0, $len);\r
+ $pos = $len;\r
+ }\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_OFB:\r
+ $xor = $this->decryptIV;\r
+ if (strlen($buffer['xor'])) {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {\r
+ $block = substr($ciphertext, $i, $block_size);\r
+ if (strlen($block) > strlen($buffer['xor'])) {\r
+ $xor = $this->_encryptBlock($xor);\r
+ $buffer['xor'].= $xor;\r
+ }\r
+ $key = $this->_string_shift($buffer['xor'], $block_size);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=$block_size) {\r
+ $xor = $this->_encryptBlock($xor);\r
+ $plaintext.= substr($ciphertext, $i, $block_size) ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ if ($start = strlen($ciphertext) % $block_size) {\r
+ $buffer['xor'] = substr($key, $start) . $buffer['xor'];\r
+ }\r
+ }\r
+ }\r
+\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ /**\r
+ * Encrypts a block\r
+ *\r
+ * @access private\r
+ * @param String $in\r
+ * @return String\r
+ */\r
+ function _encryptBlock($in)\r
+ {\r
+ $state = array();\r
+ $words = unpack('N*word', $in);\r
+\r
+ $w = $this->w;\r
+ $t0 = $this->t0;\r
+ $t1 = $this->t1;\r
+ $t2 = $this->t2;\r
+ $t3 = $this->t3;\r
+ $Nb = $this->Nb;\r
+ $Nr = $this->Nr;\r
+ $c = $this->c;\r
+\r
+ // addRoundKey\r
+ $i = -1;\r
+ foreach ($words as $word) {\r
+ $state[] = $word ^ $w[0][++$i];\r
+ }\r
+\r
+ // fips-197.pdf#page=19, "Figure 5. Pseudo Code for the Cipher", states that this loop has four components - \r
+ // subBytes, shiftRows, mixColumns, and addRoundKey. fips-197.pdf#page=30, "Implementation Suggestions Regarding \r
+ // Various Platforms" suggests that performs enhanced implementations are described in Rijndael-ammended.pdf.\r
+ // Rijndael-ammended.pdf#page=20, "Implementation aspects / 32-bit processor", discusses such an optimization.\r
+ // Unfortunately, the description given there is not quite correct. Per aes.spec.v316.pdf#page=19 [1], \r
+ // equation (7.4.7) is supposed to use addition instead of subtraction, so we'll do that here, as well.\r
+\r
+ // [1] http://fp.gladman.plus.com/cryptography_technology/rijndael/aes.spec.v316.pdf\r
+ $temp = array();\r
+ for ($round = 1; $round < $Nr; ++$round) {\r
+ $i = 0; // $c[0] == 0\r
+ $j = $c[1];\r
+ $k = $c[2];\r
+ $l = $c[3];\r
+\r
+ while ($i < $Nb) {\r
+ $temp[$i] = $t0[$state[$i] >> 24 & 0x000000FF] ^\r
+ $t1[$state[$j] >> 16 & 0x000000FF] ^\r
+ $t2[$state[$k] >> 8 & 0x000000FF] ^\r
+ $t3[$state[$l] & 0x000000FF] ^\r
+ $w[$round][$i];\r
+ ++$i;\r
+ $j = ($j + 1) % $Nb;\r
+ $k = ($k + 1) % $Nb;\r
+ $l = ($l + 1) % $Nb;\r
+ }\r
+ $state = $temp;\r
+ }\r
+\r
+ // subWord\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $state[$i] = $this->_subWord($state[$i]);\r
+ }\r
+\r
+ // shiftRows + addRoundKey\r
+ $i = 0; // $c[0] == 0\r
+ $j = $c[1];\r
+ $k = $c[2];\r
+ $l = $c[3];\r
+ while ($i < $Nb) {\r
+ $temp[$i] = ($state[$i] & 0xFF000000) ^\r
+ ($state[$j] & 0x00FF0000) ^\r
+ ($state[$k] & 0x0000FF00) ^\r
+ ($state[$l] & 0x000000FF) ^\r
+ $w[$Nr][$i];\r
+ ++$i;\r
+ $j = ($j + 1) % $Nb;\r
+ $k = ($k + 1) % $Nb;\r
+ $l = ($l + 1) % $Nb;\r
+ }\r
+\r
+ // 100% ugly switch/case code... but ~5% faster ("smart code" below commented out)\r
+ switch ($Nb) {\r
+ case 8:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3], $temp[4], $temp[5], $temp[6], $temp[7]);\r
+ case 7:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3], $temp[4], $temp[5], $temp[6]);\r
+ case 6:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3], $temp[4], $temp[5]);\r
+ case 5:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3], $temp[4]);\r
+ default:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3]);\r
+ }\r
+ /*\r
+ $state = $temp;\r
+\r
+ array_unshift($state, 'N*');\r
+\r
+ return call_user_func_array('pack', $state);\r
+ */\r
+ }\r
+\r
+ /**\r
+ * Decrypts a block\r
+ *\r
+ * @access private\r
+ * @param String $in\r
+ * @return String\r
+ */\r
+ function _decryptBlock($in)\r
+ {\r
+ $state = array();\r
+ $words = unpack('N*word', $in);\r
+\r
+ $dw = $this->dw;\r
+ $dt0 = $this->dt0;\r
+ $dt1 = $this->dt1;\r
+ $dt2 = $this->dt2;\r
+ $dt3 = $this->dt3;\r
+ $Nb = $this->Nb;\r
+ $Nr = $this->Nr;\r
+ $c = $this->c;\r
+\r
+ // addRoundKey\r
+ $i = -1;\r
+ foreach ($words as $word) {\r
+ $state[] = $word ^ $dw[$Nr][++$i];\r
+ }\r
+\r
+ $temp = array();\r
+ for ($round = $Nr - 1; $round > 0; --$round) {\r
+ $i = 0; // $c[0] == 0\r
+ $j = $Nb - $c[1];\r
+ $k = $Nb - $c[2];\r
+ $l = $Nb - $c[3];\r
+\r
+ while ($i < $Nb) {\r
+ $temp[$i] = $dt0[$state[$i] >> 24 & 0x000000FF] ^\r
+ $dt1[$state[$j] >> 16 & 0x000000FF] ^\r
+ $dt2[$state[$k] >> 8 & 0x000000FF] ^\r
+ $dt3[$state[$l] & 0x000000FF] ^\r
+ $dw[$round][$i];\r
+ ++$i;\r
+ $j = ($j + 1) % $Nb;\r
+ $k = ($k + 1) % $Nb;\r
+ $l = ($l + 1) % $Nb;\r
+ }\r
+ $state = $temp;\r
+ }\r
+\r
+ // invShiftRows + invSubWord + addRoundKey\r
+ $i = 0; // $c[0] == 0\r
+ $j = $Nb - $c[1];\r
+ $k = $Nb - $c[2];\r
+ $l = $Nb - $c[3];\r
+\r
+ while ($i < $Nb) {\r
+ $temp[$i] = $dw[0][$i] ^ \r
+ $this->_invSubWord(($state[$i] & 0xFF000000) | \r
+ ($state[$j] & 0x00FF0000) | \r
+ ($state[$k] & 0x0000FF00) | \r
+ ($state[$l] & 0x000000FF));\r
+ ++$i;\r
+ $j = ($j + 1) % $Nb;\r
+ $k = ($k + 1) % $Nb;\r
+ $l = ($l + 1) % $Nb;\r
+ }\r
+\r
+ switch ($Nb) {\r
+ case 8:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3], $temp[4], $temp[5], $temp[6], $temp[7]);\r
+ case 7:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3], $temp[4], $temp[5], $temp[6]);\r
+ case 6:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3], $temp[4], $temp[5]);\r
+ case 5:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3], $temp[4]);\r
+ default:\r
+ return pack('N*', $temp[0], $temp[1], $temp[2], $temp[3]);\r
+ }\r
+ /*\r
+ $state = $temp;\r
+\r
+ array_unshift($state, 'N*');\r
+\r
+ return call_user_func_array('pack', $state);\r
+ */\r
+ }\r
+\r
+ /**\r
+ * Setup Rijndael\r
+ *\r
+ * Validates all the variables and calculates $Nr - the number of rounds that need to be performed - and $w - the key\r
+ * key schedule.\r
+ *\r
+ * @access private\r
+ */\r
+ function _setup()\r
+ {\r
+ // Each number in $rcon is equal to the previous number multiplied by two in Rijndael's finite field.\r
+ // See http://en.wikipedia.org/wiki/Finite_field_arithmetic#Multiplicative_inverse\r
+ static $rcon = array(0,\r
+ 0x01000000, 0x02000000, 0x04000000, 0x08000000, 0x10000000,\r
+ 0x20000000, 0x40000000, 0x80000000, 0x1B000000, 0x36000000,\r
+ 0x6C000000, 0xD8000000, 0xAB000000, 0x4D000000, 0x9A000000,\r
+ 0x2F000000, 0x5E000000, 0xBC000000, 0x63000000, 0xC6000000,\r
+ 0x97000000, 0x35000000, 0x6A000000, 0xD4000000, 0xB3000000,\r
+ 0x7D000000, 0xFA000000, 0xEF000000, 0xC5000000, 0x91000000\r
+ );\r
+\r
+ if (!$this->explicit_key_length) {\r
+ // we do >> 2, here, and not >> 5, as we do above, since strlen($this->key) tells us the number of bytes - not bits\r
+ $length = strlen($this->key) >> 2;\r
+ if ($length > 8) {\r
+ $length = 8;\r
+ } else if ($length < 4) {\r
+ $length = 4;\r
+ }\r
+ $this->Nk = $length;\r
+ $this->key_size = $length << 2;\r
+ }\r
+\r
+ $this->key = str_pad(substr($this->key, 0, $this->key_size), $this->key_size, chr(0));\r
+ $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($this->iv, 0, $this->block_size), $this->block_size, chr(0));\r
+\r
+ // see Rijndael-ammended.pdf#page=44\r
+ $this->Nr = max($this->Nk, $this->Nb) + 6;\r
+\r
+ // shift offsets for Nb = 5, 7 are defined in Rijndael-ammended.pdf#page=44,\r
+ // "Table 8: Shift offsets in Shiftrow for the alternative block lengths"\r
+ // shift offsets for Nb = 4, 6, 8 are defined in Rijndael-ammended.pdf#page=14,\r
+ // "Table 2: Shift offsets for different block lengths"\r
+ switch ($this->Nb) {\r
+ case 4:\r
+ case 5:\r
+ case 6:\r
+ $this->c = array(0, 1, 2, 3);\r
+ break;\r
+ case 7:\r
+ $this->c = array(0, 1, 2, 4);\r
+ break;\r
+ case 8:\r
+ $this->c = array(0, 1, 3, 4);\r
+ }\r
+\r
+ $key = $this->key;\r
+\r
+ $w = array_values(unpack('N*words', $key));\r
+\r
+ $length = $this->Nb * ($this->Nr + 1);\r
+ for ($i = $this->Nk; $i < $length; $i++) {\r
+ $temp = $w[$i - 1];\r
+ if ($i % $this->Nk == 0) {\r
+ // according to <http://php.net/language.types.integer>, "the size of an integer is platform-dependent".\r
+ // on a 32-bit machine, it's 32-bits, and on a 64-bit machine, it's 64-bits. on a 32-bit machine,\r
+ // 0xFFFFFFFF << 8 == 0xFFFFFF00, but on a 64-bit machine, it equals 0xFFFFFFFF00. as such, doing 'and'\r
+ // with 0xFFFFFFFF (or 0xFFFFFF00) on a 32-bit machine is unnecessary, but on a 64-bit machine, it is.\r
+ $temp = (($temp << 8) & 0xFFFFFF00) | (($temp >> 24) & 0x000000FF); // rotWord\r
+ $temp = $this->_subWord($temp) ^ $rcon[$i / $this->Nk];\r
+ } else if ($this->Nk > 6 && $i % $this->Nk == 4) {\r
+ $temp = $this->_subWord($temp);\r
+ }\r
+ $w[$i] = $w[$i - $this->Nk] ^ $temp;\r
+ }\r
+\r
+ // convert the key schedule from a vector of $Nb * ($Nr + 1) length to a matrix with $Nr + 1 rows and $Nb columns\r
+ // and generate the inverse key schedule. more specifically,\r
+ // according to <http://csrc.nist.gov/archive/aes/rijndael/Rijndael-ammended.pdf#page=23> (section 5.3.3), \r
+ // "The key expansion for the Inverse Cipher is defined as follows:\r
+ // 1. Apply the Key Expansion.\r
+ // 2. Apply InvMixColumn to all Round Keys except the first and the last one."\r
+ // also, see fips-197.pdf#page=27, "5.3.5 Equivalent Inverse Cipher"\r
+ $temp = $this->w = $this->dw = array();\r
+ for ($i = $row = $col = 0; $i < $length; $i++, $col++) {\r
+ if ($col == $this->Nb) {\r
+ if ($row == 0) {\r
+ $this->dw[0] = $this->w[0];\r
+ } else {\r
+ // subWord + invMixColumn + invSubWord = invMixColumn\r
+ $j = 0;\r
+ while ($j < $this->Nb) {\r
+ $dw = $this->_subWord($this->w[$row][$j]);\r
+ $temp[$j] = $this->dt0[$dw >> 24 & 0x000000FF] ^ \r
+ $this->dt1[$dw >> 16 & 0x000000FF] ^ \r
+ $this->dt2[$dw >> 8 & 0x000000FF] ^ \r
+ $this->dt3[$dw & 0x000000FF];\r
+ $j++;\r
+ }\r
+ $this->dw[$row] = $temp;\r
+ }\r
+\r
+ $col = 0;\r
+ $row++;\r
+ }\r
+ $this->w[$row][$col] = $w[$i];\r
+ }\r
+\r
+ $this->dw[$row] = $this->w[$row];\r
+\r
+ // In case of $this->use_inline_crypt === true we have to use 1-dim key arrays (both ascending)\r
+ if ($this->use_inline_crypt) {\r
+ $this->dw = array_reverse($this->dw);\r
+ $w = array_pop($this->w);\r
+ $dw = array_pop($this->dw);\r
+ foreach ($this->w as $r => $wr) {\r
+ foreach ($wr as $c => $wc) {\r
+ $w[] = $wc;\r
+ $dw[] = $this->dw[$r][$c];\r
+ }\r
+ }\r
+ $this->w = $w;\r
+ $this->dw = $dw;\r
+\r
+ $this->inline_crypt_setup();\r
+ }\r
+\r
+ $this->changed = false;\r
+ }\r
+\r
+ /**\r
+ * Performs S-Box substitutions\r
+ *\r
+ * @access private\r
+ */\r
+ function _subWord($word)\r
+ {\r
+ $sbox = $this->sbox;\r
+\r
+ return $sbox[$word & 0x000000FF] |\r
+ ($sbox[$word >> 8 & 0x000000FF] << 8) |\r
+ ($sbox[$word >> 16 & 0x000000FF] << 16) |\r
+ ($sbox[$word >> 24 & 0x000000FF] << 24);\r
+ }\r
+\r
+ /**\r
+ * Performs inverse S-Box substitutions\r
+ *\r
+ * @access private\r
+ */\r
+ function _invSubWord($word)\r
+ {\r
+ $isbox = $this->isbox;\r
+\r
+ return $isbox[$word & 0x000000FF] |\r
+ ($isbox[$word >> 8 & 0x000000FF] << 8) |\r
+ ($isbox[$word >> 16 & 0x000000FF] << 16) |\r
+ ($isbox[$word >> 24 & 0x000000FF] << 24);\r
+ }\r
+\r
+ /**\r
+ * Pad "packets".\r
+ *\r
+ * Rijndael works by encrypting between sixteen and thirty-two bytes at a time, provided that number is also a multiple\r
+ * of four. If you ever need to encrypt or decrypt something that isn't of the proper length, it becomes necessary to\r
+ * pad the input so that it is of the proper length.\r
+ *\r
+ * Padding is enabled by default. Sometimes, however, it is undesirable to pad strings. Such is the case in SSH,\r
+ * where "packets" are padded with random bytes before being encrypted. Unpad these packets and you risk stripping\r
+ * away characters that shouldn't be stripped away. (SSH knows how many bytes are added because the length is\r
+ * transmitted separately)\r
+ *\r
+ * @see Crypt_Rijndael::disablePadding()\r
+ * @access public\r
+ */\r
+ function enablePadding()\r
+ {\r
+ $this->padding = true;\r
+ }\r
+\r
+ /**\r
+ * Do not pad packets.\r
+ *\r
+ * @see Crypt_Rijndael::enablePadding()\r
+ * @access public\r
+ */\r
+ function disablePadding()\r
+ {\r
+ $this->padding = false;\r
+ }\r
+\r
+ /**\r
+ * Pads a string\r
+ *\r
+ * Pads a string using the RSA PKCS padding standards so that its length is a multiple of the blocksize.\r
+ * $block_size - (strlen($text) % $block_size) bytes are added, each of which is equal to \r
+ * chr($block_size - (strlen($text) % $block_size)\r
+ *\r
+ * If padding is disabled and $text is not a multiple of the blocksize, the string will be padded regardless\r
+ * and padding will, hence forth, be enabled.\r
+ *\r
+ * @see Crypt_Rijndael::_unpad()\r
+ * @access private\r
+ */\r
+ function _pad($text)\r
+ {\r
+ $length = strlen($text);\r
+\r
+ if (!$this->padding) {\r
+ if ($length % $this->block_size == 0) {\r
+ return $text;\r
+ } else {\r
+ user_error("The plaintext's length ($length) is not a multiple of the block size ({$this->block_size})");\r
+ $this->padding = true;\r
+ }\r
+ }\r
+\r
+ $pad = $this->block_size - ($length % $this->block_size);\r
+\r
+ return str_pad($text, $length + $pad, chr($pad));\r
+ }\r
+\r
+ /**\r
+ * Unpads a string.\r
+ *\r
+ * If padding is enabled and the reported padding length is invalid the encryption key will be assumed to be wrong\r
+ * and false will be returned.\r
+ *\r
+ * @see Crypt_Rijndael::_pad()\r
+ * @access private\r
+ */\r
+ function _unpad($text)\r
+ {\r
+ if (!$this->padding) {\r
+ return $text;\r
+ }\r
+\r
+ $length = ord($text[strlen($text) - 1]);\r
+\r
+ if (!$length || $length > $this->block_size) {\r
+ return false;\r
+ }\r
+\r
+ return substr($text, 0, -$length);\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive "packets" as if they are a continuous buffer.\r
+ *\r
+ * Say you have a 32-byte plaintext $plaintext. Using the default behavior, the two following code snippets\r
+ * will yield different outputs:\r
+ *\r
+ * <code>\r
+ * echo $rijndael->encrypt(substr($plaintext, 0, 16));\r
+ * echo $rijndael->encrypt(substr($plaintext, 16, 16));\r
+ * </code>\r
+ * <code>\r
+ * echo $rijndael->encrypt($plaintext);\r
+ * </code>\r
+ *\r
+ * The solution is to enable the continuous buffer. Although this will resolve the above discrepancy, it creates\r
+ * another, as demonstrated with the following:\r
+ *\r
+ * <code>\r
+ * $rijndael->encrypt(substr($plaintext, 0, 16));\r
+ * echo $rijndael->decrypt($des->encrypt(substr($plaintext, 16, 16)));\r
+ * </code>\r
+ * <code>\r
+ * echo $rijndael->decrypt($des->encrypt(substr($plaintext, 16, 16)));\r
+ * </code>\r
+ *\r
+ * With the continuous buffer disabled, these would yield the same output. With it enabled, they yield different\r
+ * outputs. The reason is due to the fact that the initialization vector's change after every encryption /\r
+ * decryption round when the continuous buffer is enabled. When it's disabled, they remain constant.\r
+ *\r
+ * Put another way, when the continuous buffer is enabled, the state of the Crypt_Rijndael() object changes after each\r
+ * encryption / decryption round, whereas otherwise, it'd remain constant. For this reason, it's recommended that\r
+ * continuous buffers not be used. They do offer better security and are, in fact, sometimes required (SSH uses them),\r
+ * however, they are also less intuitive and more likely to cause you problems.\r
+ *\r
+ * @see Crypt_Rijndael::disableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function enableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = true;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive packets as if they are a discontinuous buffer.\r
+ *\r
+ * The default behavior.\r
+ *\r
+ * @see Crypt_Rijndael::enableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function disableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = false;\r
+ $this->encryptIV = $this->iv;\r
+ $this->decryptIV = $this->iv;\r
+ $this->enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0);\r
+ $this->debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0);\r
+ }\r
+\r
+ /**\r
+ * String Shift\r
+ *\r
+ * Inspired by array_shift\r
+ *\r
+ * @param String $string\r
+ * @param optional Integer $index\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _string_shift(&$string, $index = 1)\r
+ {\r
+ $substr = substr($string, 0, $index);\r
+ $string = substr($string, $index);\r
+ return $substr;\r
+ }\r
+\r
+ /**\r
+ * Creates performance-optimized function for de/encrypt(), storing it in $this->inline_crypt\r
+ *\r
+ * @see Crypt_Rijndael::encrypt()\r
+ * @see Crypt_Rijndael::decrypt()\r
+ * @access private\r
+ */\r
+ function inline_crypt_setup()\r
+ {\r
+ // Note: inline_crypt_setup() will be called only if $this->changed === true\r
+ // So here we are'nt under the same heavy timing-stress as we are in _de/encryptBlock() or de/encrypt().\r
+ // However...the here generated function- $code, stored as php callback in $this->inline_crypt, must work as fast as even possible.\r
+\r
+ $lambda_functions =& Crypt_Rijndael::get_lambda_functions();\r
+ $block_size = $this->block_size;\r
+ $mode = $this->mode;\r
+\r
+ // The first 5 generated $lambda_functions will use the key-words hardcoded for better performance. \r
+ // For memory reason we limit those ultra-optimized function code to 5.\r
+ // After that, we use pure (extracted) integer vars for the key-words which is faster than accessing them via array.\r
+ if (count($lambda_functions) < 5) {\r
+ $w = $this->w;\r
+ $dw = $this->dw;\r
+ $init_encryptBlock = '';\r
+ $init_decryptBlock = '';\r
+ } else {\r
+ for ($i = 0, $cw = count($this->w); $i < $cw; ++$i) {\r
+ $w[] = '$w_'.$i;\r
+ $dw[] = '$dw_'.$i;\r
+ }\r
+ $init_encryptBlock = 'extract($self->w, EXTR_PREFIX_ALL, "w");';\r
+ $init_decryptBlock = 'extract($self->dw, EXTR_PREFIX_ALL, "dw");';\r
+ }\r
+\r
+ $code_hash = md5("$mode, $block_size, " . implode(',', $w));\r
+\r
+ if (!isset($lambda_functions[$code_hash])) {\r
+ $Nr = $this->Nr;\r
+ $Nb = $this->Nb;\r
+ $c = $this->c;\r
+\r
+ // Generating encrypt code:\r
+ $init_encryptBlock.= '\r
+ $t0 = $self->t0;\r
+ $t1 = $self->t1;\r
+ $t2 = $self->t2;\r
+ $t3 = $self->t3;\r
+ $sbox = $self->sbox;';\r
+\r
+ $s = 'e';\r
+ $e = 's';\r
+ $wc = $Nb - 1;\r
+\r
+ // Preround: addRoundKey\r
+ $_encryptBlock = '$in = unpack("N*", $in);'."\n";\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $_encryptBlock .= '$s'.$i.' = $in['.($i + 1).'] ^ '.$w[++$wc].";\n";\r
+ }\r
+\r
+ // Mainrounds: shiftRows + subWord + mixColumns + addRoundKey\r
+ for ($round = 1; $round < $Nr; ++$round) {\r
+ list($s, $e) = array($e, $s);\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $_encryptBlock.=\r
+ '$'.$e.$i.' =\r
+ $t0[($'.$s.$i .' >> 24) & 0xff] ^\r
+ $t1[($'.$s.(($i + $c[1]) % $Nb).' >> 16) & 0xff] ^\r
+ $t2[($'.$s.(($i + $c[2]) % $Nb).' >> 8) & 0xff] ^\r
+ $t3[ $'.$s.(($i + $c[3]) % $Nb).' & 0xff] ^\r
+ '.$w[++$wc].";\n";\r
+ }\r
+ }\r
+\r
+ // Finalround: subWord + shiftRows + addRoundKey\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $_encryptBlock.=\r
+ '$'.$e.$i.' =\r
+ $sbox[ $'.$e.$i.' & 0xff] |\r
+ ($sbox[($'.$e.$i.' >> 8) & 0xff] << 8) |\r
+ ($sbox[($'.$e.$i.' >> 16) & 0xff] << 16) |\r
+ ($sbox[($'.$e.$i.' >> 24) & 0xff] << 24);'."\n";\r
+ }\r
+ $_encryptBlock .= '$in = pack("N*"'."\n";\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $_encryptBlock.= ',\r
+ ($'.$e.$i .' & 0xFF000000) ^\r
+ ($'.$e.(($i + $c[1]) % $Nb).' & 0x00FF0000) ^\r
+ ($'.$e.(($i + $c[2]) % $Nb).' & 0x0000FF00) ^\r
+ ($'.$e.(($i + $c[3]) % $Nb).' & 0x000000FF) ^\r
+ '.$w[$i]."\n";\r
+ }\r
+ $_encryptBlock .= ');';\r
+\r
+ // Generating decrypt code:\r
+ $init_decryptBlock.= '\r
+ $dt0 = $self->dt0;\r
+ $dt1 = $self->dt1;\r
+ $dt2 = $self->dt2;\r
+ $dt3 = $self->dt3;\r
+ $isbox = $self->isbox;';\r
+\r
+ $s = 'e';\r
+ $e = 's';\r
+ $wc = $Nb - 1;\r
+\r
+ // Preround: addRoundKey\r
+ $_decryptBlock = '$in = unpack("N*", $in);'."\n";\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $_decryptBlock .= '$s'.$i.' = $in['.($i + 1).'] ^ '.$dw[++$wc].';'."\n";\r
+ }\r
+\r
+ // Mainrounds: shiftRows + subWord + mixColumns + addRoundKey\r
+ for ($round = 1; $round < $Nr; ++$round) {\r
+ list($s, $e) = array($e, $s);\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $_decryptBlock.=\r
+ '$'.$e.$i.' =\r
+ $dt0[($'.$s.$i .' >> 24) & 0xff] ^\r
+ $dt1[($'.$s.(($Nb + $i - $c[1]) % $Nb).' >> 16) & 0xff] ^\r
+ $dt2[($'.$s.(($Nb + $i - $c[2]) % $Nb).' >> 8) & 0xff] ^\r
+ $dt3[ $'.$s.(($Nb + $i - $c[3]) % $Nb).' & 0xff] ^\r
+ '.$dw[++$wc].";\n";\r
+ }\r
+ }\r
+\r
+ // Finalround: subWord + shiftRows + addRoundKey\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $_decryptBlock.=\r
+ '$'.$e.$i.' =\r
+ $isbox[ $'.$e.$i.' & 0xff] |\r
+ ($isbox[($'.$e.$i.' >> 8) & 0xff] << 8) |\r
+ ($isbox[($'.$e.$i.' >> 16) & 0xff] << 16) |\r
+ ($isbox[($'.$e.$i.' >> 24) & 0xff] << 24);'."\n";\r
+ }\r
+ $_decryptBlock .= '$in = pack("N*"'."\n";\r
+ for ($i = 0; $i < $Nb; ++$i) {\r
+ $_decryptBlock.= ',\r
+ ($'.$e.$i. ' & 0xFF000000) ^\r
+ ($'.$e.(($Nb + $i - $c[1]) % $Nb).' & 0x00FF0000) ^\r
+ ($'.$e.(($Nb + $i - $c[2]) % $Nb).' & 0x0000FF00) ^\r
+ ($'.$e.(($Nb + $i - $c[3]) % $Nb).' & 0x000000FF) ^\r
+ '.$dw[$i]."\n";\r
+ }\r
+ $_decryptBlock .= ');';\r
+\r
+ // Generating mode of operation code:\r
+ switch ($mode) {\r
+ case CRYPT_RIJNDAEL_MODE_ECB:\r
+ $encrypt = $init_encryptBlock . '\r
+ $ciphertext = "";\r
+ $text = $self->_pad($text);\r
+ $plaintext_len = strlen($text);\r
+\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.');\r
+ '.$_encryptBlock.'\r
+ $ciphertext.= $in;\r
+ }\r
+ \r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_decryptBlock . '\r
+ $plaintext = "";\r
+ $text = str_pad($text, strlen($text) + ('.$block_size.' - strlen($text) % '.$block_size.') % '.$block_size.', chr(0));\r
+ $ciphertext_len = strlen($text);\r
+\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.');\r
+ '.$_decryptBlock.'\r
+ $plaintext.= $in;\r
+ }\r
+\r
+ return $self->_unpad($plaintext);\r
+ ';\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CBC:\r
+ $encrypt = $init_encryptBlock . '\r
+ $ciphertext = "";\r
+ $text = $self->_pad($text);\r
+ $plaintext_len = strlen($text);\r
+\r
+ $in = $self->encryptIV;\r
+\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.') ^ $in;\r
+ '.$_encryptBlock.'\r
+ $ciphertext.= $in;\r
+ }\r
+\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $in;\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_decryptBlock . '\r
+ $plaintext = "";\r
+ $text = str_pad($text, strlen($text) + ('.$block_size.' - strlen($text) % '.$block_size.') % '.$block_size.', chr(0));\r
+ $ciphertext_len = strlen($text);\r
+\r
+ $iv = $self->decryptIV;\r
+\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = $block = substr($text, $i, '.$block_size.');\r
+ '.$_decryptBlock.'\r
+ $plaintext.= $in ^ $iv;\r
+ $iv = $block;\r
+ }\r
+\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $iv;\r
+ }\r
+\r
+ return $self->_unpad($plaintext);\r
+ ';\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CTR:\r
+ $encrypt = $init_encryptBlock . '\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+ $xor = $self->encryptIV;\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if (strlen($buffer["encrypted"])) {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["encrypted"])) {\r
+ $in = $self->_generate_xor('.$block_size.', $xor);\r
+ '.$_encryptBlock.'\r
+ $buffer["encrypted"].= $in;\r
+ }\r
+ $key = $self->_string_shift($buffer["encrypted"], '.$block_size.');\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ $in = $self->_generate_xor('.$block_size.', $xor);\r
+ '.$_encryptBlock.'\r
+ $key = $in;\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $xor;\r
+ if ($start = $plaintext_len % '.$block_size.') {\r
+ $buffer["encrypted"] = substr($key, $start) . $buffer["encrypted"];\r
+ }\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_encryptBlock . '\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+ $xor = $self->decryptIV;\r
+ $buffer = &$self->debuffer;\r
+\r
+ if (strlen($buffer["ciphertext"])) {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["ciphertext"])) {\r
+ $in = $self->_generate_xor('.$block_size.', $xor);\r
+ '.$_encryptBlock.'\r
+ $buffer["ciphertext"].= $in;\r
+ }\r
+ $key = $self->_string_shift($buffer["ciphertext"], '.$block_size.');\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ $in = $self->_generate_xor('.$block_size.', $xor);\r
+ '.$_encryptBlock.'\r
+ $key = $in;\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $xor;\r
+ if ($start = $ciphertext_len % '.$block_size.') {\r
+ $buffer["ciphertext"] = substr($key, $start) . $buffer["ciphertext"];\r
+ }\r
+ }\r
+ \r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_CFB:\r
+ $encrypt = $init_encryptBlock . '\r
+ $ciphertext = "";\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if ($self->continuousBuffer) {\r
+ $iv = &$self->encryptIV;\r
+ $pos = &$buffer["pos"];\r
+ } else {\r
+ $iv = $self->encryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($text);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = '.$block_size.' - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $text;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ }\r
+ while ($len >= '.$block_size.') {\r
+ $in = $iv;\r
+ '.$_encryptBlock.';\r
+ $iv = $in ^ substr($text, $i, '.$block_size.');\r
+ $ciphertext.= $iv;\r
+ $len-= '.$block_size.';\r
+ $i+= '.$block_size.';\r
+ }\r
+ if ($len) {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $block = $iv ^ substr($text, $i);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_encryptBlock . '\r
+ $plaintext = "";\r
+ $buffer = &$self->debuffer;\r
+\r
+ if ($self->continuousBuffer) {\r
+ $iv = &$self->decryptIV;\r
+ $pos = &$buffer["pos"];\r
+ } else {\r
+ $iv = $self->decryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($text);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = '.$block_size.' - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $text;\r
+ $iv = substr_replace($iv, substr($text, 0, $i), $orig_pos, $i);\r
+ }\r
+ while ($len >= '.$block_size.') {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $cb = substr($text, $i, '.$block_size.');\r
+ $plaintext.= $iv ^ $cb;\r
+ $iv = $cb;\r
+ $len-= '.$block_size.';\r
+ $i+= '.$block_size.';\r
+ }\r
+ if ($len) {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $plaintext.= $iv ^ substr($text, $i);\r
+ $iv = substr_replace($iv, substr($text, $i), 0, $len);\r
+ $pos = $len;\r
+ }\r
+\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ case CRYPT_RIJNDAEL_MODE_OFB:\r
+ $encrypt = $init_encryptBlock . '\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+ $xor = $self->encryptIV;\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if (strlen($buffer["xor"])) {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["xor"])) {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $buffer["xor"].= $xor;\r
+ }\r
+ $key = $self->_string_shift($buffer["xor"], '.$block_size.');\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $ciphertext.= substr($text, $i, '.$block_size.') ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $xor;\r
+ if ($start = $plaintext_len % '.$block_size.') {\r
+ $buffer["xor"] = substr($key, $start) . $buffer["xor"];\r
+ }\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = $init_encryptBlock . '\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+ $xor = $self->decryptIV;\r
+ $buffer = &$self->debuffer;\r
+\r
+ if (strlen($buffer["xor"])) {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["xor"])) {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $buffer["xor"].= $xor;\r
+ }\r
+ $key = $self->_string_shift($buffer["xor"], '.$block_size.');\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $plaintext.= substr($text, $i, '.$block_size.') ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $xor;\r
+ if ($start = $ciphertext_len % '.$block_size.') {\r
+ $buffer["xor"] = substr($key, $start) . $buffer["xor"];\r
+ }\r
+ }\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ }\r
+ $lambda_functions[$code_hash] = create_function('$action, &$self, $text', 'if ($action == "encrypt") { '.$encrypt.' } else { '.$decrypt.' }');\r
+ }\r
+ $this->inline_crypt = $lambda_functions[$code_hash];\r
+ }\r
+\r
+ /**\r
+ * Holds the lambda_functions table (classwide)\r
+ *\r
+ * @see Crypt_Rijndael::inline_crypt_setup()\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function &get_lambda_functions()\r
+ {\r
+ static $functions = array();\r
+ return $functions;\r
+ }\r
+}\r
+\r
+// vim: ts=4:sw=4:et:\r
+// vim6: fdl=1:\r
-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Pure-PHP implementation of Triple DES.
- *
- * Uses mcrypt, if available, and an internal implementation, otherwise. Operates in the EDE3 mode (encrypt-decrypt-encrypt).
- *
- * PHP versions 4 and 5
- *
- * Here's a short example of how to use this library:
- * <code>
- * <?php
- * include('Crypt/TripleDES.php');
- *
- * $des = new Crypt_TripleDES();
- *
- * $des->setKey('abcdefghijklmnopqrstuvwx');
- *
- * $size = 10 * 1024;
- * $plaintext = '';
- * for ($i = 0; $i < $size; $i++) {
- * $plaintext.= 'a';
- * }
- *
- * echo $des->decrypt($des->encrypt($plaintext));
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Crypt
- * @package Crypt_TripleDES
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMVII Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: TripleDES.php,v 1.13 2010/02/26 03:40:25 terrafrost Exp $
- * @link http://phpseclib.sourceforge.net
- */
-
-/**
- * Include Crypt_DES
- */
-require_once 'DES.php';
-
-/**
- * Encrypt / decrypt using inner chaining
- *
- * Inner chaining is used by SSH-1 and is generally considered to be less secure then outer chaining (CRYPT_DES_MODE_CBC3).
- */
-define('CRYPT_DES_MODE_3CBC', 3);
-
-/**
- * Encrypt / decrypt using outer chaining
- *
- * Outer chaining is used by SSH-2 and when the mode is set to CRYPT_DES_MODE_CBC.
- */
-define('CRYPT_DES_MODE_CBC3', CRYPT_DES_MODE_CBC);
-
-/**
- * Pure-PHP implementation of Triple DES.
- *
- * @author Jim Wigginton <terrafrost@php.net>
- * @version 0.1.0
- * @access public
- * @package Crypt_TerraDES
- */
-class Crypt_TripleDES {
- /**
- * The Three Keys
- *
- * @see Crypt_TripleDES::setKey()
- * @var String
- * @access private
- */
- var $key = "\0\0\0\0\0\0\0\0";
-
- /**
- * The Encryption Mode
- *
- * @see Crypt_TripleDES::Crypt_TripleDES()
- * @var Integer
- * @access private
- */
- var $mode = CRYPT_DES_MODE_CBC;
-
- /**
- * Continuous Buffer status
- *
- * @see Crypt_TripleDES::enableContinuousBuffer()
- * @var Boolean
- * @access private
- */
- var $continuousBuffer = false;
-
- /**
- * Padding status
- *
- * @see Crypt_TripleDES::enablePadding()
- * @var Boolean
- * @access private
- */
- var $padding = true;
-
- /**
- * The Initialization Vector
- *
- * @see Crypt_TripleDES::setIV()
- * @var String
- * @access private
- */
- var $iv = "\0\0\0\0\0\0\0\0";
-
- /**
- * A "sliding" Initialization Vector
- *
- * @see Crypt_TripleDES::enableContinuousBuffer()
- * @var String
- * @access private
- */
- var $encryptIV = "\0\0\0\0\0\0\0\0";
-
- /**
- * A "sliding" Initialization Vector
- *
- * @see Crypt_TripleDES::enableContinuousBuffer()
- * @var String
- * @access private
- */
- var $decryptIV = "\0\0\0\0\0\0\0\0";
-
- /**
- * The Crypt_DES objects
- *
- * @var Array
- * @access private
- */
- var $des;
-
- /**
- * mcrypt resource for encryption
- *
- * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.
- * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.
- *
- * @see Crypt_AES::encrypt()
- * @var String
- * @access private
- */
- var $enmcrypt;
-
- /**
- * mcrypt resource for decryption
- *
- * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.
- * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.
- *
- * @see Crypt_AES::decrypt()
- * @var String
- * @access private
- */
- var $demcrypt;
-
- /**
- * Does the (en|de)mcrypt resource need to be (re)initialized?
- *
- * @see setKey()
- * @see setIV()
- * @var Boolean
- * @access private
- */
- var $changed = true;
-
- /**
- * Default Constructor.
- *
- * Determines whether or not the mcrypt extension should be used. $mode should only, at present, be
- * CRYPT_DES_MODE_ECB or CRYPT_DES_MODE_CBC. If not explictly set, CRYPT_DES_MODE_CBC will be used.
- *
- * @param optional Integer $mode
- * @return Crypt_TripleDES
- * @access public
- */
- function Crypt_TripleDES($mode = CRYPT_DES_MODE_CBC)
- {
- if ( !defined('CRYPT_DES_MODE') ) {
- switch (true) {
- case extension_loaded('mcrypt'):
- // i'd check to see if des was supported, by doing in_array('des', mcrypt_list_algorithms('')),
- // but since that can be changed after the object has been created, there doesn't seem to be
- // a lot of point...
- define('CRYPT_DES_MODE', CRYPT_DES_MODE_MCRYPT);
- break;
- default:
- define('CRYPT_DES_MODE', CRYPT_DES_MODE_INTERNAL);
- }
- }
-
- if ( $mode == CRYPT_DES_MODE_3CBC ) {
- $this->mode = CRYPT_DES_MODE_3CBC;
- $this->des = array(
- new Crypt_DES(CRYPT_DES_MODE_CBC),
- new Crypt_DES(CRYPT_DES_MODE_CBC),
- new Crypt_DES(CRYPT_DES_MODE_CBC)
- );
-
- // we're going to be doing the padding, ourselves, so disable it in the Crypt_DES objects
- $this->des[0]->disablePadding();
- $this->des[1]->disablePadding();
- $this->des[2]->disablePadding();
-
- return;
- }
-
- switch ( CRYPT_DES_MODE ) {
- case CRYPT_DES_MODE_MCRYPT:
- switch ($mode) {
- case CRYPT_DES_MODE_ECB:
- $this->mode = MCRYPT_MODE_ECB;
- break;
- case CRYPT_DES_MODE_CTR:
- $this->mode = 'ctr';
- break;
- case CRYPT_DES_MODE_CBC:
- default:
- $this->mode = MCRYPT_MODE_CBC;
- }
-
- break;
- default:
- $this->des = array(
- new Crypt_DES(CRYPT_DES_MODE_ECB),
- new Crypt_DES(CRYPT_DES_MODE_ECB),
- new Crypt_DES(CRYPT_DES_MODE_ECB)
- );
-
- // we're going to be doing the padding, ourselves, so disable it in the Crypt_DES objects
- $this->des[0]->disablePadding();
- $this->des[1]->disablePadding();
- $this->des[2]->disablePadding();
-
- switch ($mode) {
- case CRYPT_DES_MODE_ECB:
- case CRYPT_DES_MODE_CTR:
- case CRYPT_DES_MODE_CBC:
- $this->mode = $mode;
- break;
- default:
- $this->mode = CRYPT_DES_MODE_CBC;
- }
- }
- }
-
- /**
- * Sets the key.
- *
- * Keys can be of any length. Triple DES, itself, can use 128-bit (eg. strlen($key) == 16) or
- * 192-bit (eg. strlen($key) == 24) keys. This function pads and truncates $key as appropriate.
- *
- * DES also requires that every eighth bit be a parity bit, however, we'll ignore that.
- *
- * If the key is not explicitly set, it'll be assumed to be all zero's.
- *
- * @access public
- * @param String $key
- */
- function setKey($key)
- {
- $length = strlen($key);
- if ($length > 8) {
- $key = str_pad($key, 24, chr(0));
- // if $key is between 64 and 128-bits, use the first 64-bits as the last, per this:
- // http://php.net/function.mcrypt-encrypt#47973
- //$key = $length <= 16 ? substr_replace($key, substr($key, 0, 8), 16) : substr($key, 0, 24);
- }
- $this->key = $key;
- switch (true) {
- case CRYPT_DES_MODE == CRYPT_DES_MODE_INTERNAL:
- case $this->mode == CRYPT_DES_MODE_3CBC:
- $this->des[0]->setKey(substr($key, 0, 8));
- $this->des[1]->setKey(substr($key, 8, 8));
- $this->des[2]->setKey(substr($key, 16, 8));
- }
- $this->changed = true;
- }
-
- /**
- * Sets the initialization vector. (optional)
- *
- * SetIV is not required when CRYPT_DES_MODE_ECB is being used. If not explictly set, it'll be assumed
- * to be all zero's.
- *
- * @access public
- * @param String $iv
- */
- function setIV($iv)
- {
- $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($iv, 0, 8), 8, chr(0));
- if ($this->mode == CRYPT_DES_MODE_3CBC) {
- $this->des[0]->setIV($iv);
- $this->des[1]->setIV($iv);
- $this->des[2]->setIV($iv);
- }
- $this->changed = true;
- }
-
- /**
- * Generate CTR XOR encryption key
- *
- * Encrypt the output of this and XOR it against the ciphertext / plaintext to get the
- * plaintext / ciphertext in CTR mode.
- *
- * @see Crypt_DES::decrypt()
- * @see Crypt_DES::encrypt()
- * @access public
- * @param Integer $length
- * @param String $iv
- */
- function _generate_xor($length, &$iv)
- {
- $xor = '';
- $num_blocks = ($length + 7) >> 3;
- for ($i = 0; $i < $num_blocks; $i++) {
- $xor.= $iv;
- for ($j = 4; $j <= 8; $j+=4) {
- $temp = substr($iv, -$j, 4);
- switch ($temp) {
- case "\xFF\xFF\xFF\xFF":
- $iv = substr_replace($iv, "\x00\x00\x00\x00", -$j, 4);
- break;
- case "\x7F\xFF\xFF\xFF":
- $iv = substr_replace($iv, "\x80\x00\x00\x00", -$j, 4);
- break 2;
- default:
- extract(unpack('Ncount', $temp));
- $iv = substr_replace($iv, pack('N', $count + 1), -$j, 4);
- break 2;
- }
- }
- }
-
- return $xor;
- }
-
- /**
- * Encrypts a message.
- *
- * @access public
- * @param String $plaintext
- */
- function encrypt($plaintext)
- {
- if ($this->mode != CRYPT_DES_MODE_CTR && $this->mode != 'ctr') {
- $plaintext = $this->_pad($plaintext);
- }
-
- // if the key is smaller then 8, do what we'd normally do
- if ($this->mode == CRYPT_DES_MODE_3CBC && strlen($this->key) > 8) {
- $ciphertext = $this->des[2]->encrypt($this->des[1]->decrypt($this->des[0]->encrypt($plaintext)));
-
- return $ciphertext;
- }
-
- if ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) {
- if ($this->changed) {
- if (!isset($this->enmcrypt)) {
- $this->enmcrypt = mcrypt_module_open(MCRYPT_3DES, '', $this->mode, '');
- }
- mcrypt_generic_init($this->enmcrypt, $this->key, $this->encryptIV);
- $this->changed = false;
- }
-
- $ciphertext = mcrypt_generic($this->enmcrypt, $plaintext);
-
- if (!$this->continuousBuffer) {
- mcrypt_generic_init($this->enmcrypt, $this->key, $this->encryptIV);
- }
-
- return $ciphertext;
- }
-
- if (strlen($this->key) <= 8) {
- $this->des[0]->mode = $this->mode;
-
- return $this->des[0]->encrypt($plaintext);
- }
-
- // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :
- // "The data is padded with "\0" to make sure the length of the data is n * blocksize."
- $plaintext = str_pad($plaintext, ceil(strlen($plaintext) / 8) * 8, chr(0));
-
- $des = $this->des;
-
- $ciphertext = '';
- switch ($this->mode) {
- case CRYPT_DES_MODE_ECB:
- for ($i = 0; $i < strlen($plaintext); $i+=8) {
- $block = substr($plaintext, $i, 8);
- $block = $des[0]->_processBlock($block, CRYPT_DES_ENCRYPT);
- $block = $des[1]->_processBlock($block, CRYPT_DES_DECRYPT);
- $block = $des[2]->_processBlock($block, CRYPT_DES_ENCRYPT);
- $ciphertext.= $block;
- }
- break;
- case CRYPT_DES_MODE_CBC:
- $xor = $this->encryptIV;
- for ($i = 0; $i < strlen($plaintext); $i+=8) {
- $block = substr($plaintext, $i, 8) ^ $xor;
- $block = $des[0]->_processBlock($block, CRYPT_DES_ENCRYPT);
- $block = $des[1]->_processBlock($block, CRYPT_DES_DECRYPT);
- $block = $des[2]->_processBlock($block, CRYPT_DES_ENCRYPT);
- $xor = $block;
- $ciphertext.= $block;
- }
- if ($this->continuousBuffer) {
- $this->encryptIV = $xor;
- }
- break;
- case CRYPT_DES_MODE_CTR:
- $xor = $this->encryptIV;
- for ($i = 0; $i < strlen($plaintext); $i+=8) {
- $key = $this->_generate_xor(8, $xor);
- $key = $des[0]->_processBlock($key, CRYPT_DES_ENCRYPT);
- $key = $des[1]->_processBlock($key, CRYPT_DES_DECRYPT);
- $key = $des[2]->_processBlock($key, CRYPT_DES_ENCRYPT);
- $block = substr($plaintext, $i, 8);
- $ciphertext.= $block ^ $key;
- }
- if ($this->continuousBuffer) {
- $this->encryptIV = $xor;
- }
- }
-
- return $ciphertext;
- }
-
- /**
- * Decrypts a message.
- *
- * @access public
- * @param String $ciphertext
- */
- function decrypt($ciphertext)
- {
- if ($this->mode == CRYPT_DES_MODE_3CBC && strlen($this->key) > 8) {
- $plaintext = $this->des[0]->decrypt($this->des[1]->encrypt($this->des[2]->decrypt($ciphertext)));
-
- return $this->_unpad($plaintext);
- }
-
- // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :
- // "The data is padded with "\0" to make sure the length of the data is n * blocksize."
- $ciphertext = str_pad($ciphertext, (strlen($ciphertext) + 7) & 0xFFFFFFF8, chr(0));
-
- if ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) {
- if ($this->changed) {
- if (!isset($this->demcrypt)) {
- $this->demcrypt = mcrypt_module_open(MCRYPT_3DES, '', $this->mode, '');
- }
- mcrypt_generic_init($this->demcrypt, $this->key, $this->decryptIV);
- $this->changed = false;
- }
-
- $plaintext = mdecrypt_generic($this->demcrypt, $ciphertext);
-
- if (!$this->continuousBuffer) {
- mcrypt_generic_init($this->demcrypt, $this->key, $this->decryptIV);
- }
-
- return $this->mode != 'ctr' ? $this->_unpad($plaintext) : $plaintext;
- }
-
- if (strlen($this->key) <= 8) {
- $this->des[0]->mode = $this->mode;
-
- return $this->_unpad($this->des[0]->decrypt($plaintext));
- }
-
- $des = $this->des;
-
- $plaintext = '';
- switch ($this->mode) {
- case CRYPT_DES_MODE_ECB:
- for ($i = 0; $i < strlen($ciphertext); $i+=8) {
- $block = substr($ciphertext, $i, 8);
- $block = $des[2]->_processBlock($block, CRYPT_DES_DECRYPT);
- $block = $des[1]->_processBlock($block, CRYPT_DES_ENCRYPT);
- $block = $des[0]->_processBlock($block, CRYPT_DES_DECRYPT);
- $plaintext.= $block;
- }
- break;
- case CRYPT_DES_MODE_CBC:
- $xor = $this->decryptIV;
- for ($i = 0; $i < strlen($ciphertext); $i+=8) {
- $orig = $block = substr($ciphertext, $i, 8);
- $block = $des[2]->_processBlock($block, CRYPT_DES_DECRYPT);
- $block = $des[1]->_processBlock($block, CRYPT_DES_ENCRYPT);
- $block = $des[0]->_processBlock($block, CRYPT_DES_DECRYPT);
- $plaintext.= $block ^ $xor;
- $xor = $orig;
- }
- if ($this->continuousBuffer) {
- $this->decryptIV = $xor;
- }
- break;
- case CRYPT_DES_MODE_CTR:
- $xor = $this->decryptIV;
- for ($i = 0; $i < strlen($ciphertext); $i+=8) {
- $key = $this->_generate_xor(8, $xor);
- $key = $des[0]->_processBlock($key, CRYPT_DES_ENCRYPT);
- $key = $des[1]->_processBlock($key, CRYPT_DES_DECRYPT);
- $key = $des[2]->_processBlock($key, CRYPT_DES_ENCRYPT);
- $block = substr($ciphertext, $i, 8);
- $plaintext.= $block ^ $key;
- }
- if ($this->continuousBuffer) {
- $this->decryptIV = $xor;
- }
- }
-
- return $this->mode != CRYPT_DES_MODE_CTR ? $this->_unpad($plaintext) : $plaintext;
- }
-
- /**
- * Treat consecutive "packets" as if they are a continuous buffer.
- *
- * Say you have a 16-byte plaintext $plaintext. Using the default behavior, the two following code snippets
- * will yield different outputs:
- *
- * <code>
- * echo $des->encrypt(substr($plaintext, 0, 8));
- * echo $des->encrypt(substr($plaintext, 8, 8));
- * </code>
- * <code>
- * echo $des->encrypt($plaintext);
- * </code>
- *
- * The solution is to enable the continuous buffer. Although this will resolve the above discrepancy, it creates
- * another, as demonstrated with the following:
- *
- * <code>
- * $des->encrypt(substr($plaintext, 0, 8));
- * echo $des->decrypt($des->encrypt(substr($plaintext, 8, 8)));
- * </code>
- * <code>
- * echo $des->decrypt($des->encrypt(substr($plaintext, 8, 8)));
- * </code>
- *
- * With the continuous buffer disabled, these would yield the same output. With it enabled, they yield different
- * outputs. The reason is due to the fact that the initialization vector's change after every encryption /
- * decryption round when the continuous buffer is enabled. When it's disabled, they remain constant.
- *
- * Put another way, when the continuous buffer is enabled, the state of the Crypt_DES() object changes after each
- * encryption / decryption round, whereas otherwise, it'd remain constant. For this reason, it's recommended that
- * continuous buffers not be used. They do offer better security and are, in fact, sometimes required (SSH uses them),
- * however, they are also less intuitive and more likely to cause you problems.
- *
- * @see Crypt_TripleDES::disableContinuousBuffer()
- * @access public
- */
- function enableContinuousBuffer()
- {
- $this->continuousBuffer = true;
- if ($this->mode == CRYPT_DES_MODE_3CBC) {
- $this->des[0]->enableContinuousBuffer();
- $this->des[1]->enableContinuousBuffer();
- $this->des[2]->enableContinuousBuffer();
- }
- }
-
- /**
- * Treat consecutive packets as if they are a discontinuous buffer.
- *
- * The default behavior.
- *
- * @see Crypt_TripleDES::enableContinuousBuffer()
- * @access public
- */
- function disableContinuousBuffer()
- {
- $this->continuousBuffer = false;
- $this->encryptIV = $this->iv;
- $this->decryptIV = $this->iv;
-
- if ($this->mode == CRYPT_DES_MODE_3CBC) {
- $this->des[0]->disableContinuousBuffer();
- $this->des[1]->disableContinuousBuffer();
- $this->des[2]->disableContinuousBuffer();
- }
- }
-
- /**
- * Pad "packets".
- *
- * DES works by encrypting eight bytes at a time. If you ever need to encrypt or decrypt something that's not
- * a multiple of eight, it becomes necessary to pad the input so that it's length is a multiple of eight.
- *
- * Padding is enabled by default. Sometimes, however, it is undesirable to pad strings. Such is the case in SSH1,
- * where "packets" are padded with random bytes before being encrypted. Unpad these packets and you risk stripping
- * away characters that shouldn't be stripped away. (SSH knows how many bytes are added because the length is
- * transmitted separately)
- *
- * @see Crypt_TripleDES::disablePadding()
- * @access public
- */
- function enablePadding()
- {
- $this->padding = true;
- }
-
- /**
- * Do not pad packets.
- *
- * @see Crypt_TripleDES::enablePadding()
- * @access public
- */
- function disablePadding()
- {
- $this->padding = false;
- }
-
- /**
- * Pads a string
- *
- * Pads a string using the RSA PKCS padding standards so that its length is a multiple of the blocksize (8).
- * 8 - (strlen($text) & 7) bytes are added, each of which is equal to chr(8 - (strlen($text) & 7)
- *
- * If padding is disabled and $text is not a multiple of the blocksize, the string will be padded regardless
- * and padding will, hence forth, be enabled.
- *
- * @see Crypt_TripleDES::_unpad()
- * @access private
- */
- function _pad($text)
- {
- $length = strlen($text);
-
- if (!$this->padding) {
- if (($length & 7) == 0) {
- return $text;
- } else {
- user_error("The plaintext's length ($length) is not a multiple of the block size (8)", E_USER_NOTICE);
- $this->padding = true;
- }
- }
-
- $pad = 8 - ($length & 7);
- return str_pad($text, $length + $pad, chr($pad));
- }
-
- /**
- * Unpads a string
- *
- * If padding is enabled and the reported padding length is invalid the encryption key will be assumed to be wrong
- * and false will be returned.
- *
- * @see Crypt_TripleDES::_pad()
- * @access private
- */
- function _unpad($text)
- {
- if (!$this->padding) {
- return $text;
- }
-
- $length = ord($text[strlen($text) - 1]);
-
- if (!$length || $length > 8) {
- return false;
- }
-
- return substr($text, 0, -$length);
- }
-}
-
-// vim: ts=4:sw=4:et:
-// vim6: fdl=1:
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP implementation of Triple DES.\r
+ *\r
+ * Uses mcrypt, if available, and an internal implementation, otherwise. Operates in the EDE3 mode (encrypt-decrypt-encrypt).\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/TripleDES.php');\r
+ *\r
+ * $des = new Crypt_TripleDES();\r
+ *\r
+ * $des->setKey('abcdefghijklmnopqrstuvwx');\r
+ *\r
+ * $size = 10 * 1024;\r
+ * $plaintext = '';\r
+ * for ($i = 0; $i < $size; $i++) {\r
+ * $plaintext.= 'a';\r
+ * }\r
+ *\r
+ * echo $des->decrypt($des->encrypt($plaintext));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_TripleDES\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMVII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**\r
+ * Include Crypt_DES\r
+ */\r
+if (!class_exists('Crypt_DES')) {\r
+ require_once('DES.php');\r
+}\r
+\r
+/**\r
+ * Encrypt / decrypt using inner chaining\r
+ *\r
+ * Inner chaining is used by SSH-1 and is generally considered to be less secure then outer chaining (CRYPT_DES_MODE_CBC3).\r
+ */\r
+define('CRYPT_DES_MODE_3CBC', -2);\r
+\r
+/**\r
+ * Encrypt / decrypt using outer chaining\r
+ *\r
+ * Outer chaining is used by SSH-2 and when the mode is set to CRYPT_DES_MODE_CBC.\r
+ */\r
+define('CRYPT_DES_MODE_CBC3', CRYPT_DES_MODE_CBC);\r
+\r
+/**\r
+ * Pure-PHP implementation of Triple DES.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @version 0.1.0\r
+ * @access public\r
+ * @package Crypt_TerraDES\r
+ */\r
+class Crypt_TripleDES extends Crypt_DES {\r
+ /**\r
+ * The Crypt_DES objects\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $des;\r
+\r
+ /**\r
+ * Default Constructor.\r
+ *\r
+ * Determines whether or not the mcrypt extension should be used. $mode should only, at present, be\r
+ * CRYPT_DES_MODE_ECB or CRYPT_DES_MODE_CBC. If not explictly set, CRYPT_DES_MODE_CBC will be used.\r
+ *\r
+ * @param optional Integer $mode\r
+ * @return Crypt_TripleDES\r
+ * @access public\r
+ */\r
+ function Crypt_TripleDES($mode = CRYPT_DES_MODE_CBC)\r
+ {\r
+ if ( !defined('CRYPT_DES_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('mcrypt') && in_array('tripledes', mcrypt_list_algorithms()):\r
+ define('CRYPT_DES_MODE', CRYPT_DES_MODE_MCRYPT);\r
+ break;\r
+ default:\r
+ define('CRYPT_DES_MODE', CRYPT_DES_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ if ( $mode == CRYPT_DES_MODE_3CBC ) {\r
+ $this->mode = CRYPT_DES_MODE_3CBC;\r
+ $this->des = array(\r
+ new Crypt_DES(CRYPT_DES_MODE_CBC),\r
+ new Crypt_DES(CRYPT_DES_MODE_CBC),\r
+ new Crypt_DES(CRYPT_DES_MODE_CBC)\r
+ );\r
+ $this->paddable = true;\r
+\r
+ // we're going to be doing the padding, ourselves, so disable it in the Crypt_DES objects\r
+ $this->des[0]->disablePadding();\r
+ $this->des[1]->disablePadding();\r
+ $this->des[2]->disablePadding();\r
+\r
+ return;\r
+ }\r
+\r
+ switch ( CRYPT_DES_MODE ) {\r
+ case CRYPT_DES_MODE_MCRYPT:\r
+ switch ($mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_ECB;\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ $this->mode = 'ctr';\r
+ break;\r
+ case CRYPT_DES_MODE_CFB:\r
+ $this->mode = 'ncfb';\r
+ $this->ecb = mcrypt_module_open(MCRYPT_3DES, '', MCRYPT_MODE_ECB, '');\r
+ break;\r
+ case CRYPT_DES_MODE_OFB:\r
+ $this->mode = MCRYPT_MODE_NOFB;\r
+ break;\r
+ case CRYPT_DES_MODE_CBC:\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_CBC;\r
+ }\r
+ $this->enmcrypt = mcrypt_module_open(MCRYPT_3DES, '', $this->mode, '');\r
+ $this->demcrypt = mcrypt_module_open(MCRYPT_3DES, '', $this->mode, '');\r
+\r
+ break;\r
+ default:\r
+ $this->des = array(\r
+ new Crypt_DES(CRYPT_DES_MODE_ECB),\r
+ new Crypt_DES(CRYPT_DES_MODE_ECB),\r
+ new Crypt_DES(CRYPT_DES_MODE_ECB)\r
+ );\r
+ \r
+ // we're going to be doing the padding, ourselves, so disable it in the Crypt_DES objects\r
+ $this->des[0]->disablePadding();\r
+ $this->des[1]->disablePadding();\r
+ $this->des[2]->disablePadding();\r
+\r
+ switch ($mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ case CRYPT_DES_MODE_CBC:\r
+ $this->paddable = true;\r
+ $this->mode = $mode;\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ case CRYPT_DES_MODE_CFB:\r
+ case CRYPT_DES_MODE_OFB:\r
+ $this->mode = $mode;\r
+ break;\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = CRYPT_DES_MODE_CBC;\r
+ }\r
+ if (function_exists('create_function') && is_callable('create_function')) {\r
+ $this->inline_crypt_setup(3);\r
+ $this->use_inline_crypt = true;\r
+ }\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Sets the key.\r
+ *\r
+ * Keys can be of any length. Triple DES, itself, can use 128-bit (eg. strlen($key) == 16) or\r
+ * 192-bit (eg. strlen($key) == 24) keys. This function pads and truncates $key as appropriate.\r
+ *\r
+ * DES also requires that every eighth bit be a parity bit, however, we'll ignore that.\r
+ *\r
+ * If the key is not explicitly set, it'll be assumed to be all zero's.\r
+ *\r
+ * @access public\r
+ * @param String $key\r
+ */\r
+ function setKey($key)\r
+ {\r
+ $length = strlen($key);\r
+ if ($length > 8) {\r
+ $key = str_pad($key, 24, chr(0));\r
+ // if $key is between 64 and 128-bits, use the first 64-bits as the last, per this:\r
+ // http://php.net/function.mcrypt-encrypt#47973\r
+ //$key = $length <= 16 ? substr_replace($key, substr($key, 0, 8), 16) : substr($key, 0, 24);\r
+ } else {\r
+ $key = str_pad($key, 8, chr(0));\r
+ }\r
+ $this->key = $key;\r
+ switch (true) {\r
+ case CRYPT_DES_MODE == CRYPT_DES_MODE_INTERNAL:\r
+ case $this->mode == CRYPT_DES_MODE_3CBC:\r
+ $this->des[0]->setKey(substr($key, 0, 8));\r
+ $this->des[1]->setKey(substr($key, 8, 8));\r
+ $this->des[2]->setKey(substr($key, 16, 8));\r
+\r
+ // Merge the three DES-1-dim-key-arrays for 3DES-inline-en/decrypting \r
+ if ($this->use_inline_crypt && $this->mode != CRYPT_DES_MODE_3CBC) {\r
+ $this->keys = array(\r
+ CRYPT_DES_ENCRYPT_1DIM => array_merge(\r
+ $this->des[0]->keys[CRYPT_DES_ENCRYPT_1DIM],\r
+ $this->des[1]->keys[CRYPT_DES_DECRYPT_1DIM],\r
+ $this->des[2]->keys[CRYPT_DES_ENCRYPT_1DIM]\r
+ ),\r
+ CRYPT_DES_DECRYPT_1DIM => array_merge(\r
+ $this->des[2]->keys[CRYPT_DES_DECRYPT_1DIM],\r
+ $this->des[1]->keys[CRYPT_DES_ENCRYPT_1DIM],\r
+ $this->des[0]->keys[CRYPT_DES_DECRYPT_1DIM]\r
+ ),\r
+ );\r
+ }\r
+ }\r
+ $this->enchanged = $this->dechanged = true;\r
+ }\r
+\r
+ /**\r
+ * Sets the password.\r
+ *\r
+ * Depending on what $method is set to, setPassword()'s (optional) parameters are as follows:\r
+ * {@link http://en.wikipedia.org/wiki/PBKDF2 pbkdf2}:\r
+ * $hash, $salt, $method\r
+ *\r
+ * @param String $password\r
+ * @param optional String $method\r
+ * @access public\r
+ */\r
+ function setPassword($password, $method = 'pbkdf2')\r
+ {\r
+ $key = '';\r
+\r
+ switch ($method) {\r
+ default: // 'pbkdf2'\r
+ list(, , $hash, $salt, $count) = func_get_args();\r
+ if (!isset($hash)) {\r
+ $hash = 'sha1';\r
+ }\r
+ // WPA and WPA2 use the SSID as the salt\r
+ if (!isset($salt)) {\r
+ $salt = 'phpseclib';\r
+ }\r
+ // RFC2898#section-4.2 uses 1,000 iterations by default\r
+ // WPA and WPA2 use 4,096.\r
+ if (!isset($count)) {\r
+ $count = 1000;\r
+ }\r
+\r
+ if (!class_exists('Crypt_Hash')) {\r
+ require_once('Crypt/Hash.php');\r
+ }\r
+\r
+ $i = 1;\r
+ while (strlen($key) < 24) { // $dkLen == 24\r
+ $hmac = new Crypt_Hash();\r
+ $hmac->setHash($hash);\r
+ $hmac->setKey($password);\r
+ $f = $u = $hmac->hash($salt . pack('N', $i++));\r
+ for ($j = 2; $j <= $count; $j++) {\r
+ $u = $hmac->hash($u);\r
+ $f^= $u;\r
+ }\r
+ $key.= $f;\r
+ }\r
+ }\r
+\r
+ $this->setKey($key);\r
+ }\r
+\r
+ /**\r
+ * Sets the initialization vector. (optional)\r
+ *\r
+ * SetIV is not required when CRYPT_DES_MODE_ECB is being used. If not explictly set, it'll be assumed\r
+ * to be all zero's.\r
+ *\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function setIV($iv)\r
+ {\r
+ $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($iv, 0, 8), 8, chr(0));\r
+ if ($this->mode == CRYPT_DES_MODE_3CBC) {\r
+ $this->des[0]->setIV($iv);\r
+ $this->des[1]->setIV($iv);\r
+ $this->des[2]->setIV($iv);\r
+ }\r
+ $this->enchanged = $this->dechanged = true;\r
+ }\r
+\r
+ /**\r
+ * Encrypts a message.\r
+ *\r
+ * @access public\r
+ * @param String $plaintext\r
+ */\r
+ function encrypt($plaintext)\r
+ {\r
+ if ($this->paddable) {\r
+ $plaintext = $this->_pad($plaintext);\r
+ }\r
+\r
+ // if the key is smaller then 8, do what we'd normally do\r
+ if ($this->mode == CRYPT_DES_MODE_3CBC && strlen($this->key) > 8) {\r
+ $ciphertext = $this->des[2]->encrypt($this->des[1]->decrypt($this->des[0]->encrypt($plaintext)));\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ if ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) {\r
+ if ($this->enchanged) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->encryptIV);\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->key, "\0\0\0\0\0\0\0\0");\r
+ }\r
+ $this->enchanged = false;\r
+ }\r
+\r
+ if ($this->mode != 'ncfb' || !$this->continuousBuffer) {\r
+ $ciphertext = mcrypt_generic($this->enmcrypt, $plaintext);\r
+ } else {\r
+ $iv = &$this->encryptIV;\r
+ $pos = &$this->enbuffer['pos'];\r
+ $len = strlen($plaintext);\r
+ $ciphertext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 8 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $plaintext;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ $this->enbuffer['enmcrypt_init'] = true;\r
+ }\r
+ if ($len >= 8) {\r
+ if ($this->enbuffer['enmcrypt_init'] === false || $len > 950) {\r
+ if ($this->enbuffer['enmcrypt_init'] === true) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $iv);\r
+ $this->enbuffer['enmcrypt_init'] = false;\r
+ }\r
+ $ciphertext.= mcrypt_generic($this->enmcrypt, substr($plaintext, $i, $len - $len % 8));\r
+ $iv = substr($ciphertext, -8);\r
+ $i = strlen($ciphertext);\r
+ $len%= 8;\r
+ } else {\r
+ while ($len >= 8) {\r
+ $iv = mcrypt_generic($this->ecb, $iv) ^ substr($plaintext, $i, 8);\r
+ $ciphertext.= $iv;\r
+ $len-= 8;\r
+ $i+= 8;\r
+ }\r
+ }\r
+ } \r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $block = $iv ^ substr($plaintext, $i);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ }\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->encryptIV);\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ if (strlen($this->key) <= 8) {\r
+ $this->des[0]->mode = $this->mode;\r
+\r
+ return $this->des[0]->encrypt($plaintext);\r
+ }\r
+\r
+ if ($this->use_inline_crypt) {\r
+ $inline = $this->inline_crypt;\r
+ return $inline('encrypt', $this, $plaintext);\r
+ }\r
+\r
+ $des = $this->des;\r
+\r
+ $buffer = &$this->enbuffer;\r
+ $continuousBuffer = $this->continuousBuffer;\r
+ $ciphertext = '';\r
+ switch ($this->mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ // all of these _processBlock calls could, in theory, be put in a function - say Crypt_TripleDES::_ede_encrypt() or something.\r
+ // only problem with that: it would slow encryption and decryption down. $this->des would have to be called every time that\r
+ // function is called, instead of once for the whole string of text that's being encrypted, which would, in turn, make \r
+ // encryption and decryption take more time, per this:\r
+ //\r
+ // http://blog.libssh2.org/index.php?/archives/21-Compiled-Variables.html\r
+ $block = $des[0]->_processBlock($block, CRYPT_DES_ENCRYPT);\r
+ $block = $des[1]->_processBlock($block, CRYPT_DES_DECRYPT);\r
+ $block = $des[2]->_processBlock($block, CRYPT_DES_ENCRYPT);\r
+ $ciphertext.= $block;\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CBC:\r
+ $xor = $this->encryptIV;\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8) ^ $xor;\r
+ $block = $des[0]->_processBlock($block, CRYPT_DES_ENCRYPT);\r
+ $block = $des[1]->_processBlock($block, CRYPT_DES_DECRYPT);\r
+ $block = $des[2]->_processBlock($block, CRYPT_DES_ENCRYPT);\r
+ $xor = $block;\r
+ $ciphertext.= $block;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ $xor = $this->encryptIV;\r
+ if (strlen($buffer['encrypted'])) {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ if (strlen($block) > strlen($buffer['encrypted'])) {\r
+ $key = $this->_generate_xor($xor);\r
+ $key = $des[0]->_processBlock($key, CRYPT_DES_ENCRYPT);\r
+ $key = $des[1]->_processBlock($key, CRYPT_DES_DECRYPT);\r
+ $key = $des[2]->_processBlock($key, CRYPT_DES_ENCRYPT);\r
+ $buffer['encrypted'].= $key;\r
+ }\r
+ $key = $this->_string_shift($buffer['encrypted']);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ $key = $this->_generate_xor($xor);\r
+ $key = $des[0]->_processBlock($key, CRYPT_DES_ENCRYPT);\r
+ $key = $des[1]->_processBlock($key, CRYPT_DES_DECRYPT);\r
+ $key = $des[2]->_processBlock($key, CRYPT_DES_ENCRYPT);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ if ($start = strlen($plaintext) & 7) {\r
+ $buffer['encrypted'] = substr($key, $start) . $buffer['encrypted'];\r
+ }\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CFB:\r
+ if (strlen($buffer['xor'])) {\r
+ $ciphertext = $plaintext ^ $buffer['xor'];\r
+ $iv = $buffer['encrypted'] . $ciphertext;\r
+ $start = strlen($ciphertext);\r
+ $buffer['encrypted'].= $ciphertext;\r
+ $buffer['xor'] = substr($buffer['xor'], strlen($ciphertext));\r
+ } else {\r
+ $ciphertext = '';\r
+ $iv = $this->encryptIV;\r
+ $start = 0;\r
+ }\r
+\r
+ for ($i = $start; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ $iv = $des[0]->_processBlock($iv, CRYPT_DES_ENCRYPT);\r
+ $iv = $des[1]->_processBlock($iv, CRYPT_DES_DECRYPT);\r
+ $xor= $des[2]->_processBlock($iv, CRYPT_DES_ENCRYPT);\r
+\r
+ $iv = $block ^ $xor;\r
+ if ($continuousBuffer && strlen($iv) != 8) {\r
+ $buffer = array(\r
+ 'encrypted' => $iv,\r
+ 'xor' => substr($xor, strlen($iv))\r
+ );\r
+ }\r
+ $ciphertext.= $iv;\r
+ }\r
+\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $iv;\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_OFB:\r
+ $xor = $this->encryptIV;\r
+ if (strlen($buffer['xor'])) {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $block = substr($plaintext, $i, 8);\r
+ if (strlen($block) > strlen($buffer['xor'])) {\r
+ $xor = $des[0]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $xor = $des[1]->_processBlock($xor, CRYPT_DES_DECRYPT);\r
+ $xor = $des[2]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $buffer['xor'].= $xor;\r
+ }\r
+ $key = $this->_string_shift($buffer['xor']);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($plaintext); $i+=8) {\r
+ $xor = $des[0]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $xor = $des[1]->_processBlock($xor, CRYPT_DES_DECRYPT);\r
+ $xor = $des[2]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $ciphertext.= substr($plaintext, $i, 8) ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->encryptIV = $xor;\r
+ if ($start = strlen($plaintext) & 7) {\r
+ $buffer['xor'] = substr($key, $start) . $buffer['xor'];\r
+ }\r
+ }\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ /**\r
+ * Decrypts a message.\r
+ *\r
+ * @access public\r
+ * @param String $ciphertext\r
+ */\r
+ function decrypt($ciphertext)\r
+ {\r
+ if ($this->mode == CRYPT_DES_MODE_3CBC && strlen($this->key) > 8) {\r
+ $plaintext = $this->des[0]->decrypt($this->des[1]->encrypt($this->des[2]->decrypt($ciphertext)));\r
+\r
+ return $this->_unpad($plaintext);\r
+ }\r
+\r
+ if ($this->paddable) {\r
+ // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :\r
+ // "The data is padded with "\0" to make sure the length of the data is n * blocksize."\r
+ $ciphertext = str_pad($ciphertext, (strlen($ciphertext) + 7) & 0xFFFFFFF8, chr(0));\r
+ }\r
+\r
+ if ( CRYPT_DES_MODE == CRYPT_DES_MODE_MCRYPT ) {\r
+ if ($this->dechanged) {\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->decryptIV);\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->key, "\0\0\0\0\0\0\0\0");\r
+ }\r
+ $this->dechanged = false;\r
+ }\r
+\r
+ if ($this->mode != 'ncfb' || !$this->continuousBuffer) {\r
+ $plaintext = mdecrypt_generic($this->demcrypt, $ciphertext);\r
+ } else {\r
+ $iv = &$this->decryptIV;\r
+ $pos = &$this->debuffer['pos'];\r
+ $len = strlen($ciphertext);\r
+ $plaintext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 8 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $ciphertext;\r
+ $iv = substr_replace($iv, substr($ciphertext, 0, $i), $orig_pos, $i);\r
+ }\r
+ if ($len >= 8) {\r
+ $cb = substr($ciphertext, $i, $len - $len % 8);\r
+ $plaintext.= mcrypt_generic($this->ecb, $iv . $cb) ^ $cb;\r
+ $iv = substr($cb, -8);\r
+ $len%= 8;\r
+ }\r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $cb = substr($ciphertext, -$len);\r
+ $plaintext.= $iv ^ $cb;\r
+ $iv = substr_replace($iv, $cb, 0, $len);\r
+ $pos = $len;\r
+ }\r
+ return $plaintext;\r
+ }\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->decryptIV);\r
+ }\r
+\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ if (strlen($this->key) <= 8) {\r
+ $this->des[0]->mode = $this->mode;\r
+ $plaintext = $this->des[0]->decrypt($ciphertext);\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ if ($this->use_inline_crypt) {\r
+ $inline = $this->inline_crypt;\r
+ return $inline('decrypt', $this, $ciphertext);\r
+ }\r
+\r
+ $des = $this->des;\r
+\r
+ $buffer = &$this->debuffer;\r
+ $continuousBuffer = $this->continuousBuffer;\r
+ $plaintext = '';\r
+ switch ($this->mode) {\r
+ case CRYPT_DES_MODE_ECB:\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ $block = $des[2]->_processBlock($block, CRYPT_DES_DECRYPT);\r
+ $block = $des[1]->_processBlock($block, CRYPT_DES_ENCRYPT);\r
+ $block = $des[0]->_processBlock($block, CRYPT_DES_DECRYPT);\r
+ $plaintext.= $block;\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CBC:\r
+ $xor = $this->decryptIV;\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $orig = $block = substr($ciphertext, $i, 8);\r
+ $block = $des[2]->_processBlock($block, CRYPT_DES_DECRYPT);\r
+ $block = $des[1]->_processBlock($block, CRYPT_DES_ENCRYPT);\r
+ $block = $des[0]->_processBlock($block, CRYPT_DES_DECRYPT);\r
+ $plaintext.= $block ^ $xor;\r
+ $xor = $orig;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CTR:\r
+ $xor = $this->decryptIV;\r
+ if (strlen($buffer['ciphertext'])) {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ if (strlen($block) > strlen($buffer['ciphertext'])) {\r
+ $key = $this->_generate_xor($xor);\r
+ $key = $des[0]->_processBlock($key, CRYPT_DES_ENCRYPT);\r
+ $key = $des[1]->_processBlock($key, CRYPT_DES_DECRYPT);\r
+ $key = $des[2]->_processBlock($key, CRYPT_DES_ENCRYPT);\r
+ $buffer['ciphertext'].= $key;\r
+ }\r
+ $key = $this->_string_shift($buffer['ciphertext']);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ $key = $this->_generate_xor($xor);\r
+ $key = $des[0]->_processBlock($key, CRYPT_DES_ENCRYPT);\r
+ $key = $des[1]->_processBlock($key, CRYPT_DES_DECRYPT);\r
+ $key = $des[2]->_processBlock($key, CRYPT_DES_ENCRYPT);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ if ($start = strlen($plaintext) & 7) {\r
+ $buffer['ciphertext'] = substr($key, $start) . $buffer['ciphertext'];\r
+ }\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_CFB:\r
+ if (strlen($buffer['ciphertext'])) {\r
+ $plaintext = $ciphertext ^ substr($this->decryptIV, strlen($buffer['ciphertext']));\r
+ $buffer['ciphertext'].= substr($ciphertext, 0, strlen($plaintext));\r
+ if (strlen($buffer['ciphertext']) != 8) {\r
+ $block = $this->decryptIV;\r
+ } else {\r
+ $block = $buffer['ciphertext'];\r
+ $xor = $des[0]->_processBlock($buffer['ciphertext'], CRYPT_DES_ENCRYPT);\r
+ $xor = $des[1]->_processBlock($xor, CRYPT_DES_DECRYPT);\r
+ $xor = $des[2]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $buffer['ciphertext'] = '';\r
+ }\r
+ $start = strlen($plaintext);\r
+ } else {\r
+ $plaintext = '';\r
+ $xor = $des[0]->_processBlock($this->decryptIV, CRYPT_DES_ENCRYPT);\r
+ $xor = $des[1]->_processBlock($xor, CRYPT_DES_DECRYPT);\r
+ $xor = $des[2]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $start = 0;\r
+ }\r
+\r
+ for ($i = $start; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ $plaintext.= $block ^ $xor;\r
+ if ($continuousBuffer && strlen($block) != 8) {\r
+ $buffer['ciphertext'].= $block;\r
+ $block = $xor;\r
+ } else if (strlen($block) == 8) {\r
+ $xor = $des[0]->_processBlock($block, CRYPT_DES_ENCRYPT);\r
+ $xor = $des[1]->_processBlock($xor, CRYPT_DES_DECRYPT);\r
+ $xor = $des[2]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ }\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $block;\r
+ }\r
+ break;\r
+ case CRYPT_DES_MODE_OFB:\r
+ $xor = $this->decryptIV;\r
+ if (strlen($buffer['xor'])) {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $block = substr($ciphertext, $i, 8);\r
+ if (strlen($block) > strlen($buffer['xor'])) {\r
+ $xor = $des[0]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $xor = $des[1]->_processBlock($xor, CRYPT_DES_DECRYPT);\r
+ $xor = $des[2]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $buffer['xor'].= $xor;\r
+ }\r
+ $key = $this->_string_shift($buffer['xor']);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < strlen($ciphertext); $i+=8) {\r
+ $xor = $des[0]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $xor = $des[1]->_processBlock($xor, CRYPT_DES_DECRYPT);\r
+ $xor = $des[2]->_processBlock($xor, CRYPT_DES_ENCRYPT);\r
+ $plaintext.= substr($ciphertext, $i, 8) ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($this->continuousBuffer) {\r
+ $this->decryptIV = $xor;\r
+ if ($start = strlen($ciphertext) & 7) {\r
+ $buffer['xor'] = substr($key, $start) . $buffer['xor'];\r
+ }\r
+ }\r
+ }\r
+\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive "packets" as if they are a continuous buffer.\r
+ *\r
+ * Say you have a 16-byte plaintext $plaintext. Using the default behavior, the two following code snippets\r
+ * will yield different outputs:\r
+ *\r
+ * <code>\r
+ * echo $des->encrypt(substr($plaintext, 0, 8));\r
+ * echo $des->encrypt(substr($plaintext, 8, 8));\r
+ * </code>\r
+ * <code>\r
+ * echo $des->encrypt($plaintext);\r
+ * </code>\r
+ *\r
+ * The solution is to enable the continuous buffer. Although this will resolve the above discrepancy, it creates\r
+ * another, as demonstrated with the following:\r
+ *\r
+ * <code>\r
+ * $des->encrypt(substr($plaintext, 0, 8));\r
+ * echo $des->decrypt($des->encrypt(substr($plaintext, 8, 8)));\r
+ * </code>\r
+ * <code>\r
+ * echo $des->decrypt($des->encrypt(substr($plaintext, 8, 8)));\r
+ * </code>\r
+ *\r
+ * With the continuous buffer disabled, these would yield the same output. With it enabled, they yield different\r
+ * outputs. The reason is due to the fact that the initialization vector's change after every encryption /\r
+ * decryption round when the continuous buffer is enabled. When it's disabled, they remain constant.\r
+ *\r
+ * Put another way, when the continuous buffer is enabled, the state of the Crypt_DES() object changes after each\r
+ * encryption / decryption round, whereas otherwise, it'd remain constant. For this reason, it's recommended that\r
+ * continuous buffers not be used. They do offer better security and are, in fact, sometimes required (SSH uses them),\r
+ * however, they are also less intuitive and more likely to cause you problems.\r
+ *\r
+ * @see Crypt_TripleDES::disableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function enableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = true;\r
+ if ($this->mode == CRYPT_DES_MODE_3CBC) {\r
+ $this->des[0]->enableContinuousBuffer();\r
+ $this->des[1]->enableContinuousBuffer();\r
+ $this->des[2]->enableContinuousBuffer();\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive packets as if they are a discontinuous buffer.\r
+ *\r
+ * The default behavior.\r
+ *\r
+ * @see Crypt_TripleDES::enableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function disableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = false;\r
+ $this->encryptIV = $this->iv;\r
+ $this->decryptIV = $this->iv;\r
+ $this->enchanged = true;\r
+ $this->dechanged = true;\r
+ $this->enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0, 'enmcrypt_init' => true);\r
+ $this->debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0, 'demcrypt_init' => true);\r
+\r
+ if ($this->mode == CRYPT_DES_MODE_3CBC) {\r
+ $this->des[0]->disableContinuousBuffer();\r
+ $this->des[1]->disableContinuousBuffer();\r
+ $this->des[2]->disableContinuousBuffer();\r
+ }\r
+ }\r
+}\r
+\r
+// vim: ts=4:sw=4:et:\r
+// vim6: fdl=1:\r
--- /dev/null
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP implementation of Twofish.\r
+ *\r
+ * Uses mcrypt, if available, and an internal implementation, otherwise.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * Useful resources are as follows:\r
+ *\r
+ * - {@link http://en.wikipedia.org/wiki/Twofish Wikipedia description of Twofish}\r
+ *\r
+ * Here's a short example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Crypt/Twofish.php');\r
+ *\r
+ * $Twofish = new Crypt_Twofish();\r
+ *\r
+ * $Twofish->setKey('12345678901234567890123456789012');\r
+ *\r
+ * $plaintext = str_repeat('a', 1024);\r
+ *\r
+ * echo $Twofish->decrypt($Twofish->encrypt($plaintext));\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ *\r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ *\r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Crypt\r
+ * @package Crypt_Twofish\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @author Hans-Juergen Petrich <petrich@tronic-media.com>\r
+ * @copyright MMVII Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @version 1.0\r
+ * @link http://phpseclib.sourceforge.net\r
+ */\r
+\r
+/**#@+\r
+ * @access public\r
+ * @see Crypt_Twofish::encrypt()\r
+ * @see Crypt_Twofish::decrypt()\r
+ */\r
+/**\r
+ * Encrypt / decrypt using the Counter mode.\r
+ *\r
+ * Set to -1 since that's what Crypt/Random.php uses to index the CTR mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Counter_.28CTR.29\r
+ */\r
+define('CRYPT_TWOFISH_MODE_CTR', -1);\r
+/**\r
+ * Encrypt / decrypt using the Electronic Code Book mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Electronic_codebook_.28ECB.29\r
+ */\r
+define('CRYPT_TWOFISH_MODE_ECB', 1);\r
+/**\r
+ * Encrypt / decrypt using the Code Book Chaining mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher-block_chaining_.28CBC.29\r
+ */\r
+define('CRYPT_TWOFISH_MODE_CBC', 2);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Cipher_feedback_.28CFB.29\r
+ */\r
+define('CRYPT_TWOFISH_MODE_CFB', 3);\r
+/**\r
+ * Encrypt / decrypt using the Cipher Feedback mode.\r
+ *\r
+ * @link http://en.wikipedia.org/wiki/Block_cipher_modes_of_operation#Output_feedback_.28OFB.29\r
+ */\r
+define('CRYPT_TWOFISH_MODE_OFB', 4);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Crypt_Twofish::Crypt_Twofish()\r
+ */\r
+/**\r
+ * Toggles the internal implementation\r
+ */\r
+define('CRYPT_TWOFISH_MODE_INTERNAL', 1);\r
+/**\r
+ * Toggles the mcrypt implementation\r
+ */\r
+define('CRYPT_TWOFISH_MODE_MCRYPT', 2);\r
+/**#@-*/\r
+\r
+/**\r
+ * Pure-PHP implementation of Twofish.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @author Hans-Juergen Petrich <petrich@tronic-media.com>\r
+ * @version 1.0\r
+ * @access public\r
+ * @package Crypt_Twofish\r
+ */\r
+class Crypt_Twofish {\r
+ /**\r
+ * The Key as String\r
+ *\r
+ * @see Crypt_Twofish::setKey()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $key = "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * The Encryption Mode\r
+ *\r
+ * @see Crypt_Twofish::Crypt_Twofish()\r
+ * @var Integer\r
+ * @access private\r
+ */\r
+ var $mode;\r
+\r
+ /**\r
+ * Continuous Buffer status\r
+ *\r
+ * @see Crypt_Twofish::enableContinuousBuffer()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $continuousBuffer = false;\r
+\r
+ /**\r
+ * Padding status\r
+ *\r
+ * @see Crypt_Twofish::enablePadding()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $padding = true;\r
+\r
+ /**\r
+ * The Initialization Vector\r
+ *\r
+ * @see Crypt_Twofish::setIV()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $iv = "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * A "sliding" Initialization Vector\r
+ *\r
+ * @see Crypt_Twofish::enableContinuousBuffer()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $encryptIV = "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * A "sliding" Initialization Vector\r
+ *\r
+ * @see Crypt_Twofish::enableContinuousBuffer()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $decryptIV = "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0";\r
+\r
+ /**\r
+ * mcrypt resource for encryption\r
+ *\r
+ * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.\r
+ * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.\r
+ *\r
+ * @see Crypt_Twofish::encrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $enmcrypt;\r
+\r
+ /**\r
+ * mcrypt resource for decryption\r
+ *\r
+ * The mcrypt resource can be recreated every time something needs to be created or it can be created just once.\r
+ * Since mcrypt operates in continuous mode, by default, it'll need to be recreated when in non-continuous mode.\r
+ *\r
+ * @see Crypt_Twofish::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $demcrypt;\r
+\r
+ /**\r
+ * Does the enmcrypt resource need to be (re)initialized?\r
+ *\r
+ * @see Crypt_Twofish::setKey()\r
+ * @see Crypt_Twofish::setIV()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $enchanged = true;\r
+\r
+ /**\r
+ * Does the demcrypt resource need to be (re)initialized?\r
+ *\r
+ * @see Crypt_Twofish::setKey()\r
+ * @see Crypt_Twofish::setIV()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $dechanged = true;\r
+\r
+ /**\r
+ * Is the mode one that is paddable?\r
+ *\r
+ * @see Crypt_Twofish::Crypt_Twofish()\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $paddable = false;\r
+\r
+ /**\r
+ * Encryption buffer for CTR, OFB and CFB modes\r
+ *\r
+ * @see Crypt_Twofish::encrypt()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0, 'enmcrypt_init' => true);\r
+\r
+ /**\r
+ * Decryption buffer for CTR, OFB and CFB modes\r
+ *\r
+ * @see Crypt_Twofish::decrypt()\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0, 'demcrypt_init' => true);\r
+\r
+ /**\r
+ * mcrypt resource for CFB mode\r
+ *\r
+ * @see Crypt_Twofish::encrypt()\r
+ * @see Crypt_Twofish::decrypt()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $ecb;\r
+\r
+ /**\r
+ * Performance-optimized callback function for en/decrypt()\r
+ *\r
+ * @var Callback\r
+ * @access private\r
+ */\r
+ var $inline_crypt;\r
+\r
+ /**\r
+ * Q-Table\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $q0 = array (\r
+ 0xA9, 0x67, 0xB3, 0xE8, 0x04, 0xFD, 0xA3, 0x76,\r
+ 0x9A, 0x92, 0x80, 0x78, 0xE4, 0xDD, 0xD1, 0x38,\r
+ 0x0D, 0xC6, 0x35, 0x98, 0x18, 0xF7, 0xEC, 0x6C,\r
+ 0x43, 0x75, 0x37, 0x26, 0xFA, 0x13, 0x94, 0x48,\r
+ 0xF2, 0xD0, 0x8B, 0x30, 0x84, 0x54, 0xDF, 0x23,\r
+ 0x19, 0x5B, 0x3D, 0x59, 0xF3, 0xAE, 0xA2, 0x82,\r
+ 0x63, 0x01, 0x83, 0x2E, 0xD9, 0x51, 0x9B, 0x7C,\r
+ 0xA6, 0xEB, 0xA5, 0xBE, 0x16, 0x0C, 0xE3, 0x61,\r
+ 0xC0, 0x8C, 0x3A, 0xF5, 0x73, 0x2C, 0x25, 0x0B,\r
+ 0xBB, 0x4E, 0x89, 0x6B, 0x53, 0x6A, 0xB4, 0xF1,\r
+ 0xE1, 0xE6, 0xBD, 0x45, 0xE2, 0xF4, 0xB6, 0x66,\r
+ 0xCC, 0x95, 0x03, 0x56, 0xD4, 0x1C, 0x1E, 0xD7,\r
+ 0xFB, 0xC3, 0x8E, 0xB5, 0xE9, 0xCF, 0xBF, 0xBA,\r
+ 0xEA, 0x77, 0x39, 0xAF, 0x33, 0xC9, 0x62, 0x71,\r
+ 0x81, 0x79, 0x09, 0xAD, 0x24, 0xCD, 0xF9, 0xD8,\r
+ 0xE5, 0xC5, 0xB9, 0x4D, 0x44, 0x08, 0x86, 0xE7,\r
+ 0xA1, 0x1D, 0xAA, 0xED, 0x06, 0x70, 0xB2, 0xD2,\r
+ 0x41, 0x7B, 0xA0, 0x11, 0x31, 0xC2, 0x27, 0x90,\r
+ 0x20, 0xF6, 0x60, 0xFF, 0x96, 0x5C, 0xB1, 0xAB,\r
+ 0x9E, 0x9C, 0x52, 0x1B, 0x5F, 0x93, 0x0A, 0xEF,\r
+ 0x91, 0x85, 0x49, 0xEE, 0x2D, 0x4F, 0x8F, 0x3B,\r
+ 0x47, 0x87, 0x6D, 0x46, 0xD6, 0x3E, 0x69, 0x64,\r
+ 0x2A, 0xCE, 0xCB, 0x2F, 0xFC, 0x97, 0x05, 0x7A,\r
+ 0xAC, 0x7F, 0xD5, 0x1A, 0x4B, 0x0E, 0xA7, 0x5A,\r
+ 0x28, 0x14, 0x3F, 0x29, 0x88, 0x3C, 0x4C, 0x02,\r
+ 0xB8, 0xDA, 0xB0, 0x17, 0x55, 0x1F, 0x8A, 0x7D,\r
+ 0x57, 0xC7, 0x8D, 0x74, 0xB7, 0xC4, 0x9F, 0x72,\r
+ 0x7E, 0x15, 0x22, 0x12, 0x58, 0x07, 0x99, 0x34,\r
+ 0x6E, 0x50, 0xDE, 0x68, 0x65, 0xBC, 0xDB, 0xF8,\r
+ 0xC8, 0xA8, 0x2B, 0x40, 0xDC, 0xFE, 0x32, 0xA4,\r
+ 0xCA, 0x10, 0x21, 0xF0, 0xD3, 0x5D, 0x0F, 0x00,\r
+ 0x6F, 0x9D, 0x36, 0x42, 0x4A, 0x5E, 0xC1, 0xE0\r
+ );\r
+\r
+ /**\r
+ * Q-Table\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $q1 = array (\r
+ 0x75, 0xF3, 0xC6, 0xF4, 0xDB, 0x7B, 0xFB, 0xC8,\r
+ 0x4A, 0xD3, 0xE6, 0x6B, 0x45, 0x7D, 0xE8, 0x4B,\r
+ 0xD6, 0x32, 0xD8, 0xFD, 0x37, 0x71, 0xF1, 0xE1,\r
+ 0x30, 0x0F, 0xF8, 0x1B, 0x87, 0xFA, 0x06, 0x3F,\r
+ 0x5E, 0xBA, 0xAE, 0x5B, 0x8A, 0x00, 0xBC, 0x9D,\r
+ 0x6D, 0xC1, 0xB1, 0x0E, 0x80, 0x5D, 0xD2, 0xD5,\r
+ 0xA0, 0x84, 0x07, 0x14, 0xB5, 0x90, 0x2C, 0xA3,\r
+ 0xB2, 0x73, 0x4C, 0x54, 0x92, 0x74, 0x36, 0x51,\r
+ 0x38, 0xB0, 0xBD, 0x5A, 0xFC, 0x60, 0x62, 0x96,\r
+ 0x6C, 0x42, 0xF7, 0x10, 0x7C, 0x28, 0x27, 0x8C,\r
+ 0x13, 0x95, 0x9C, 0xC7, 0x24, 0x46, 0x3B, 0x70,\r
+ 0xCA, 0xE3, 0x85, 0xCB, 0x11, 0xD0, 0x93, 0xB8,\r
+ 0xA6, 0x83, 0x20, 0xFF, 0x9F, 0x77, 0xC3, 0xCC,\r
+ 0x03, 0x6F, 0x08, 0xBF, 0x40, 0xE7, 0x2B, 0xE2,\r
+ 0x79, 0x0C, 0xAA, 0x82, 0x41, 0x3A, 0xEA, 0xB9,\r
+ 0xE4, 0x9A, 0xA4, 0x97, 0x7E, 0xDA, 0x7A, 0x17,\r
+ 0x66, 0x94, 0xA1, 0x1D, 0x3D, 0xF0, 0xDE, 0xB3,\r
+ 0x0B, 0x72, 0xA7, 0x1C, 0xEF, 0xD1, 0x53, 0x3E,\r
+ 0x8F, 0x33, 0x26, 0x5F, 0xEC, 0x76, 0x2A, 0x49,\r
+ 0x81, 0x88, 0xEE, 0x21, 0xC4, 0x1A, 0xEB, 0xD9,\r
+ 0xC5, 0x39, 0x99, 0xCD, 0xAD, 0x31, 0x8B, 0x01,\r
+ 0x18, 0x23, 0xDD, 0x1F, 0x4E, 0x2D, 0xF9, 0x48,\r
+ 0x4F, 0xF2, 0x65, 0x8E, 0x78, 0x5C, 0x58, 0x19,\r
+ 0x8D, 0xE5, 0x98, 0x57, 0x67, 0x7F, 0x05, 0x64,\r
+ 0xAF, 0x63, 0xB6, 0xFE, 0xF5, 0xB7, 0x3C, 0xA5,\r
+ 0xCE, 0xE9, 0x68, 0x44, 0xE0, 0x4D, 0x43, 0x69,\r
+ 0x29, 0x2E, 0xAC, 0x15, 0x59, 0xA8, 0x0A, 0x9E,\r
+ 0x6E, 0x47, 0xDF, 0x34, 0x35, 0x6A, 0xCF, 0xDC,\r
+ 0x22, 0xC9, 0xC0, 0x9B, 0x89, 0xD4, 0xED, 0xAB,\r
+ 0x12, 0xA2, 0x0D, 0x52, 0xBB, 0x02, 0x2F, 0xA9,\r
+ 0xD7, 0x61, 0x1E, 0xB4, 0x50, 0x04, 0xF6, 0xC2,\r
+ 0x16, 0x25, 0x86, 0x56, 0x55, 0x09, 0xBE, 0x91\r
+ );\r
+\r
+ /**\r
+ * M-Table\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $m0 = array (\r
+ 0xBCBC3275, 0xECEC21F3, 0x202043C6, 0xB3B3C9F4, 0xDADA03DB, 0x02028B7B, 0xE2E22BFB, 0x9E9EFAC8,\r
+ 0xC9C9EC4A, 0xD4D409D3, 0x18186BE6, 0x1E1E9F6B, 0x98980E45, 0xB2B2387D, 0xA6A6D2E8, 0x2626B74B,\r
+ 0x3C3C57D6, 0x93938A32, 0x8282EED8, 0x525298FD, 0x7B7BD437, 0xBBBB3771, 0x5B5B97F1, 0x474783E1,\r
+ 0x24243C30, 0x5151E20F, 0xBABAC6F8, 0x4A4AF31B, 0xBFBF4887, 0x0D0D70FA, 0xB0B0B306, 0x7575DE3F,\r
+ 0xD2D2FD5E, 0x7D7D20BA, 0x666631AE, 0x3A3AA35B, 0x59591C8A, 0x00000000, 0xCDCD93BC, 0x1A1AE09D,\r
+ 0xAEAE2C6D, 0x7F7FABC1, 0x2B2BC7B1, 0xBEBEB90E, 0xE0E0A080, 0x8A8A105D, 0x3B3B52D2, 0x6464BAD5,\r
+ 0xD8D888A0, 0xE7E7A584, 0x5F5FE807, 0x1B1B1114, 0x2C2CC2B5, 0xFCFCB490, 0x3131272C, 0x808065A3,\r
+ 0x73732AB2, 0x0C0C8173, 0x79795F4C, 0x6B6B4154, 0x4B4B0292, 0x53536974, 0x94948F36, 0x83831F51,\r
+ 0x2A2A3638, 0xC4C49CB0, 0x2222C8BD, 0xD5D5F85A, 0xBDBDC3FC, 0x48487860, 0xFFFFCE62, 0x4C4C0796,\r
+ 0x4141776C, 0xC7C7E642, 0xEBEB24F7, 0x1C1C1410, 0x5D5D637C, 0x36362228, 0x6767C027, 0xE9E9AF8C,\r
+ 0x4444F913, 0x1414EA95, 0xF5F5BB9C, 0xCFCF18C7, 0x3F3F2D24, 0xC0C0E346, 0x7272DB3B, 0x54546C70,\r
+ 0x29294CCA, 0xF0F035E3, 0x0808FE85, 0xC6C617CB, 0xF3F34F11, 0x8C8CE4D0, 0xA4A45993, 0xCACA96B8,\r
+ 0x68683BA6, 0xB8B84D83, 0x38382820, 0xE5E52EFF, 0xADAD569F, 0x0B0B8477, 0xC8C81DC3, 0x9999FFCC,\r
+ 0x5858ED03, 0x19199A6F, 0x0E0E0A08, 0x95957EBF, 0x70705040, 0xF7F730E7, 0x6E6ECF2B, 0x1F1F6EE2,\r
+ 0xB5B53D79, 0x09090F0C, 0x616134AA, 0x57571682, 0x9F9F0B41, 0x9D9D803A, 0x111164EA, 0x2525CDB9,\r
+ 0xAFAFDDE4, 0x4545089A, 0xDFDF8DA4, 0xA3A35C97, 0xEAEAD57E, 0x353558DA, 0xEDEDD07A, 0x4343FC17,\r
+ 0xF8F8CB66, 0xFBFBB194, 0x3737D3A1, 0xFAFA401D, 0xC2C2683D, 0xB4B4CCF0, 0x32325DDE, 0x9C9C71B3,\r
+ 0x5656E70B, 0xE3E3DA72, 0x878760A7, 0x15151B1C, 0xF9F93AEF, 0x6363BFD1, 0x3434A953, 0x9A9A853E,\r
+ 0xB1B1428F, 0x7C7CD133, 0x88889B26, 0x3D3DA65F, 0xA1A1D7EC, 0xE4E4DF76, 0x8181942A, 0x91910149,\r
+ 0x0F0FFB81, 0xEEEEAA88, 0x161661EE, 0xD7D77321, 0x9797F5C4, 0xA5A5A81A, 0xFEFE3FEB, 0x6D6DB5D9,\r
+ 0x7878AEC5, 0xC5C56D39, 0x1D1DE599, 0x7676A4CD, 0x3E3EDCAD, 0xCBCB6731, 0xB6B6478B, 0xEFEF5B01,\r
+ 0x12121E18, 0x6060C523, 0x6A6AB0DD, 0x4D4DF61F, 0xCECEE94E, 0xDEDE7C2D, 0x55559DF9, 0x7E7E5A48,\r
+ 0x2121B24F, 0x03037AF2, 0xA0A02665, 0x5E5E198E, 0x5A5A6678, 0x65654B5C, 0x62624E58, 0xFDFD4519,\r
+ 0x0606F48D, 0x404086E5, 0xF2F2BE98, 0x3333AC57, 0x17179067, 0x05058E7F, 0xE8E85E05, 0x4F4F7D64,\r
+ 0x89896AAF, 0x10109563, 0x74742FB6, 0x0A0A75FE, 0x5C5C92F5, 0x9B9B74B7, 0x2D2D333C, 0x3030D6A5,\r
+ 0x2E2E49CE, 0x494989E9, 0x46467268, 0x77775544, 0xA8A8D8E0, 0x9696044D, 0x2828BD43, 0xA9A92969,\r
+ 0xD9D97929, 0x8686912E, 0xD1D187AC, 0xF4F44A15, 0x8D8D1559, 0xD6D682A8, 0xB9B9BC0A, 0x42420D9E,\r
+ 0xF6F6C16E, 0x2F2FB847, 0xDDDD06DF, 0x23233934, 0xCCCC6235, 0xF1F1C46A, 0xC1C112CF, 0x8585EBDC,\r
+ 0x8F8F9E22, 0x7171A1C9, 0x9090F0C0, 0xAAAA539B, 0x0101F189, 0x8B8BE1D4, 0x4E4E8CED, 0x8E8E6FAB,\r
+ 0xABABA212, 0x6F6F3EA2, 0xE6E6540D, 0xDBDBF252, 0x92927BBB, 0xB7B7B602, 0x6969CA2F, 0x3939D9A9,\r
+ 0xD3D30CD7, 0xA7A72361, 0xA2A2AD1E, 0xC3C399B4, 0x6C6C4450, 0x07070504, 0x04047FF6, 0x272746C2,\r
+ 0xACACA716, 0xD0D07625, 0x50501386, 0xDCDCF756, 0x84841A55, 0xE1E15109, 0x7A7A25BE, 0x1313EF91\r
+ );\r
+\r
+ /**\r
+ * M-Table\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $m1 = array (\r
+ 0xA9D93939, 0x67901717, 0xB3719C9C, 0xE8D2A6A6, 0x04050707, 0xFD985252, 0xA3658080, 0x76DFE4E4,\r
+ 0x9A084545, 0x92024B4B, 0x80A0E0E0, 0x78665A5A, 0xE4DDAFAF, 0xDDB06A6A, 0xD1BF6363, 0x38362A2A,\r
+ 0x0D54E6E6, 0xC6432020, 0x3562CCCC, 0x98BEF2F2, 0x181E1212, 0xF724EBEB, 0xECD7A1A1, 0x6C774141,\r
+ 0x43BD2828, 0x7532BCBC, 0x37D47B7B, 0x269B8888, 0xFA700D0D, 0x13F94444, 0x94B1FBFB, 0x485A7E7E,\r
+ 0xF27A0303, 0xD0E48C8C, 0x8B47B6B6, 0x303C2424, 0x84A5E7E7, 0x54416B6B, 0xDF06DDDD, 0x23C56060,\r
+ 0x1945FDFD, 0x5BA33A3A, 0x3D68C2C2, 0x59158D8D, 0xF321ECEC, 0xAE316666, 0xA23E6F6F, 0x82165757,\r
+ 0x63951010, 0x015BEFEF, 0x834DB8B8, 0x2E918686, 0xD9B56D6D, 0x511F8383, 0x9B53AAAA, 0x7C635D5D,\r
+ 0xA63B6868, 0xEB3FFEFE, 0xA5D63030, 0xBE257A7A, 0x16A7ACAC, 0x0C0F0909, 0xE335F0F0, 0x6123A7A7,\r
+ 0xC0F09090, 0x8CAFE9E9, 0x3A809D9D, 0xF5925C5C, 0x73810C0C, 0x2C273131, 0x2576D0D0, 0x0BE75656,\r
+ 0xBB7B9292, 0x4EE9CECE, 0x89F10101, 0x6B9F1E1E, 0x53A93434, 0x6AC4F1F1, 0xB499C3C3, 0xF1975B5B,\r
+ 0xE1834747, 0xE66B1818, 0xBDC82222, 0x450E9898, 0xE26E1F1F, 0xF4C9B3B3, 0xB62F7474, 0x66CBF8F8,\r
+ 0xCCFF9999, 0x95EA1414, 0x03ED5858, 0x56F7DCDC, 0xD4E18B8B, 0x1C1B1515, 0x1EADA2A2, 0xD70CD3D3,\r
+ 0xFB2BE2E2, 0xC31DC8C8, 0x8E195E5E, 0xB5C22C2C, 0xE9894949, 0xCF12C1C1, 0xBF7E9595, 0xBA207D7D,\r
+ 0xEA641111, 0x77840B0B, 0x396DC5C5, 0xAF6A8989, 0x33D17C7C, 0xC9A17171, 0x62CEFFFF, 0x7137BBBB,\r
+ 0x81FB0F0F, 0x793DB5B5, 0x0951E1E1, 0xADDC3E3E, 0x242D3F3F, 0xCDA47676, 0xF99D5555, 0xD8EE8282,\r
+ 0xE5864040, 0xC5AE7878, 0xB9CD2525, 0x4D049696, 0x44557777, 0x080A0E0E, 0x86135050, 0xE730F7F7,\r
+ 0xA1D33737, 0x1D40FAFA, 0xAA346161, 0xED8C4E4E, 0x06B3B0B0, 0x706C5454, 0xB22A7373, 0xD2523B3B,\r
+ 0x410B9F9F, 0x7B8B0202, 0xA088D8D8, 0x114FF3F3, 0x3167CBCB, 0xC2462727, 0x27C06767, 0x90B4FCFC,\r
+ 0x20283838, 0xF67F0404, 0x60784848, 0xFF2EE5E5, 0x96074C4C, 0x5C4B6565, 0xB1C72B2B, 0xAB6F8E8E,\r
+ 0x9E0D4242, 0x9CBBF5F5, 0x52F2DBDB, 0x1BF34A4A, 0x5FA63D3D, 0x9359A4A4, 0x0ABCB9B9, 0xEF3AF9F9,\r
+ 0x91EF1313, 0x85FE0808, 0x49019191, 0xEE611616, 0x2D7CDEDE, 0x4FB22121, 0x8F42B1B1, 0x3BDB7272,\r
+ 0x47B82F2F, 0x8748BFBF, 0x6D2CAEAE, 0x46E3C0C0, 0xD6573C3C, 0x3E859A9A, 0x6929A9A9, 0x647D4F4F,\r
+ 0x2A948181, 0xCE492E2E, 0xCB17C6C6, 0x2FCA6969, 0xFCC3BDBD, 0x975CA3A3, 0x055EE8E8, 0x7AD0EDED,\r
+ 0xAC87D1D1, 0x7F8E0505, 0xD5BA6464, 0x1AA8A5A5, 0x4BB72626, 0x0EB9BEBE, 0xA7608787, 0x5AF8D5D5,\r
+ 0x28223636, 0x14111B1B, 0x3FDE7575, 0x2979D9D9, 0x88AAEEEE, 0x3C332D2D, 0x4C5F7979, 0x02B6B7B7,\r
+ 0xB896CACA, 0xDA583535, 0xB09CC4C4, 0x17FC4343, 0x551A8484, 0x1FF64D4D, 0x8A1C5959, 0x7D38B2B2,\r
+ 0x57AC3333, 0xC718CFCF, 0x8DF40606, 0x74695353, 0xB7749B9B, 0xC4F59797, 0x9F56ADAD, 0x72DAE3E3,\r
+ 0x7ED5EAEA, 0x154AF4F4, 0x229E8F8F, 0x12A2ABAB, 0x584E6262, 0x07E85F5F, 0x99E51D1D, 0x34392323,\r
+ 0x6EC1F6F6, 0x50446C6C, 0xDE5D3232, 0x68724646, 0x6526A0A0, 0xBC93CDCD, 0xDB03DADA, 0xF8C6BABA,\r
+ 0xC8FA9E9E, 0xA882D6D6, 0x2BCF6E6E, 0x40507070, 0xDCEB8585, 0xFE750A0A, 0x328A9393, 0xA48DDFDF,\r
+ 0xCA4C2929, 0x10141C1C, 0x2173D7D7, 0xF0CCB4B4, 0xD309D4D4, 0x5D108A8A, 0x0FE25151, 0x00000000,\r
+ 0x6F9A1919, 0x9DE01A1A, 0x368F9494, 0x42E6C7C7, 0x4AECC9C9, 0x5EFDD2D2, 0xC1AB7F7F, 0xE0D8A8A8\r
+ );\r
+\r
+ /**\r
+ * M-Table\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $m2 = array (\r
+ 0xBC75BC32, 0xECF3EC21, 0x20C62043, 0xB3F4B3C9, 0xDADBDA03, 0x027B028B, 0xE2FBE22B, 0x9EC89EFA,\r
+ 0xC94AC9EC, 0xD4D3D409, 0x18E6186B, 0x1E6B1E9F, 0x9845980E, 0xB27DB238, 0xA6E8A6D2, 0x264B26B7,\r
+ 0x3CD63C57, 0x9332938A, 0x82D882EE, 0x52FD5298, 0x7B377BD4, 0xBB71BB37, 0x5BF15B97, 0x47E14783,\r
+ 0x2430243C, 0x510F51E2, 0xBAF8BAC6, 0x4A1B4AF3, 0xBF87BF48, 0x0DFA0D70, 0xB006B0B3, 0x753F75DE,\r
+ 0xD25ED2FD, 0x7DBA7D20, 0x66AE6631, 0x3A5B3AA3, 0x598A591C, 0x00000000, 0xCDBCCD93, 0x1A9D1AE0,\r
+ 0xAE6DAE2C, 0x7FC17FAB, 0x2BB12BC7, 0xBE0EBEB9, 0xE080E0A0, 0x8A5D8A10, 0x3BD23B52, 0x64D564BA,\r
+ 0xD8A0D888, 0xE784E7A5, 0x5F075FE8, 0x1B141B11, 0x2CB52CC2, 0xFC90FCB4, 0x312C3127, 0x80A38065,\r
+ 0x73B2732A, 0x0C730C81, 0x794C795F, 0x6B546B41, 0x4B924B02, 0x53745369, 0x9436948F, 0x8351831F,\r
+ 0x2A382A36, 0xC4B0C49C, 0x22BD22C8, 0xD55AD5F8, 0xBDFCBDC3, 0x48604878, 0xFF62FFCE, 0x4C964C07,\r
+ 0x416C4177, 0xC742C7E6, 0xEBF7EB24, 0x1C101C14, 0x5D7C5D63, 0x36283622, 0x672767C0, 0xE98CE9AF,\r
+ 0x441344F9, 0x149514EA, 0xF59CF5BB, 0xCFC7CF18, 0x3F243F2D, 0xC046C0E3, 0x723B72DB, 0x5470546C,\r
+ 0x29CA294C, 0xF0E3F035, 0x088508FE, 0xC6CBC617, 0xF311F34F, 0x8CD08CE4, 0xA493A459, 0xCAB8CA96,\r
+ 0x68A6683B, 0xB883B84D, 0x38203828, 0xE5FFE52E, 0xAD9FAD56, 0x0B770B84, 0xC8C3C81D, 0x99CC99FF,\r
+ 0x580358ED, 0x196F199A, 0x0E080E0A, 0x95BF957E, 0x70407050, 0xF7E7F730, 0x6E2B6ECF, 0x1FE21F6E,\r
+ 0xB579B53D, 0x090C090F, 0x61AA6134, 0x57825716, 0x9F419F0B, 0x9D3A9D80, 0x11EA1164, 0x25B925CD,\r
+ 0xAFE4AFDD, 0x459A4508, 0xDFA4DF8D, 0xA397A35C, 0xEA7EEAD5, 0x35DA3558, 0xED7AEDD0, 0x431743FC,\r
+ 0xF866F8CB, 0xFB94FBB1, 0x37A137D3, 0xFA1DFA40, 0xC23DC268, 0xB4F0B4CC, 0x32DE325D, 0x9CB39C71,\r
+ 0x560B56E7, 0xE372E3DA, 0x87A78760, 0x151C151B, 0xF9EFF93A, 0x63D163BF, 0x345334A9, 0x9A3E9A85,\r
+ 0xB18FB142, 0x7C337CD1, 0x8826889B, 0x3D5F3DA6, 0xA1ECA1D7, 0xE476E4DF, 0x812A8194, 0x91499101,\r
+ 0x0F810FFB, 0xEE88EEAA, 0x16EE1661, 0xD721D773, 0x97C497F5, 0xA51AA5A8, 0xFEEBFE3F, 0x6DD96DB5,\r
+ 0x78C578AE, 0xC539C56D, 0x1D991DE5, 0x76CD76A4, 0x3EAD3EDC, 0xCB31CB67, 0xB68BB647, 0xEF01EF5B,\r
+ 0x1218121E, 0x602360C5, 0x6ADD6AB0, 0x4D1F4DF6, 0xCE4ECEE9, 0xDE2DDE7C, 0x55F9559D, 0x7E487E5A,\r
+ 0x214F21B2, 0x03F2037A, 0xA065A026, 0x5E8E5E19, 0x5A785A66, 0x655C654B, 0x6258624E, 0xFD19FD45,\r
+ 0x068D06F4, 0x40E54086, 0xF298F2BE, 0x335733AC, 0x17671790, 0x057F058E, 0xE805E85E, 0x4F644F7D,\r
+ 0x89AF896A, 0x10631095, 0x74B6742F, 0x0AFE0A75, 0x5CF55C92, 0x9BB79B74, 0x2D3C2D33, 0x30A530D6,\r
+ 0x2ECE2E49, 0x49E94989, 0x46684672, 0x77447755, 0xA8E0A8D8, 0x964D9604, 0x284328BD, 0xA969A929,\r
+ 0xD929D979, 0x862E8691, 0xD1ACD187, 0xF415F44A, 0x8D598D15, 0xD6A8D682, 0xB90AB9BC, 0x429E420D,\r
+ 0xF66EF6C1, 0x2F472FB8, 0xDDDFDD06, 0x23342339, 0xCC35CC62, 0xF16AF1C4, 0xC1CFC112, 0x85DC85EB,\r
+ 0x8F228F9E, 0x71C971A1, 0x90C090F0, 0xAA9BAA53, 0x018901F1, 0x8BD48BE1, 0x4EED4E8C, 0x8EAB8E6F,\r
+ 0xAB12ABA2, 0x6FA26F3E, 0xE60DE654, 0xDB52DBF2, 0x92BB927B, 0xB702B7B6, 0x692F69CA, 0x39A939D9,\r
+ 0xD3D7D30C, 0xA761A723, 0xA21EA2AD, 0xC3B4C399, 0x6C506C44, 0x07040705, 0x04F6047F, 0x27C22746,\r
+ 0xAC16ACA7, 0xD025D076, 0x50865013, 0xDC56DCF7, 0x8455841A, 0xE109E151, 0x7ABE7A25, 0x139113EF\r
+ );\r
+\r
+ /**\r
+ * M-Table\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $m3 = array (\r
+ 0xD939A9D9, 0x90176790, 0x719CB371, 0xD2A6E8D2, 0x05070405, 0x9852FD98, 0x6580A365, 0xDFE476DF,\r
+ 0x08459A08, 0x024B9202, 0xA0E080A0, 0x665A7866, 0xDDAFE4DD, 0xB06ADDB0, 0xBF63D1BF, 0x362A3836,\r
+ 0x54E60D54, 0x4320C643, 0x62CC3562, 0xBEF298BE, 0x1E12181E, 0x24EBF724, 0xD7A1ECD7, 0x77416C77,\r
+ 0xBD2843BD, 0x32BC7532, 0xD47B37D4, 0x9B88269B, 0x700DFA70, 0xF94413F9, 0xB1FB94B1, 0x5A7E485A,\r
+ 0x7A03F27A, 0xE48CD0E4, 0x47B68B47, 0x3C24303C, 0xA5E784A5, 0x416B5441, 0x06DDDF06, 0xC56023C5,\r
+ 0x45FD1945, 0xA33A5BA3, 0x68C23D68, 0x158D5915, 0x21ECF321, 0x3166AE31, 0x3E6FA23E, 0x16578216,\r
+ 0x95106395, 0x5BEF015B, 0x4DB8834D, 0x91862E91, 0xB56DD9B5, 0x1F83511F, 0x53AA9B53, 0x635D7C63,\r
+ 0x3B68A63B, 0x3FFEEB3F, 0xD630A5D6, 0x257ABE25, 0xA7AC16A7, 0x0F090C0F, 0x35F0E335, 0x23A76123,\r
+ 0xF090C0F0, 0xAFE98CAF, 0x809D3A80, 0x925CF592, 0x810C7381, 0x27312C27, 0x76D02576, 0xE7560BE7,\r
+ 0x7B92BB7B, 0xE9CE4EE9, 0xF10189F1, 0x9F1E6B9F, 0xA93453A9, 0xC4F16AC4, 0x99C3B499, 0x975BF197,\r
+ 0x8347E183, 0x6B18E66B, 0xC822BDC8, 0x0E98450E, 0x6E1FE26E, 0xC9B3F4C9, 0x2F74B62F, 0xCBF866CB,\r
+ 0xFF99CCFF, 0xEA1495EA, 0xED5803ED, 0xF7DC56F7, 0xE18BD4E1, 0x1B151C1B, 0xADA21EAD, 0x0CD3D70C,\r
+ 0x2BE2FB2B, 0x1DC8C31D, 0x195E8E19, 0xC22CB5C2, 0x8949E989, 0x12C1CF12, 0x7E95BF7E, 0x207DBA20,\r
+ 0x6411EA64, 0x840B7784, 0x6DC5396D, 0x6A89AF6A, 0xD17C33D1, 0xA171C9A1, 0xCEFF62CE, 0x37BB7137,\r
+ 0xFB0F81FB, 0x3DB5793D, 0x51E10951, 0xDC3EADDC, 0x2D3F242D, 0xA476CDA4, 0x9D55F99D, 0xEE82D8EE,\r
+ 0x8640E586, 0xAE78C5AE, 0xCD25B9CD, 0x04964D04, 0x55774455, 0x0A0E080A, 0x13508613, 0x30F7E730,\r
+ 0xD337A1D3, 0x40FA1D40, 0x3461AA34, 0x8C4EED8C, 0xB3B006B3, 0x6C54706C, 0x2A73B22A, 0x523BD252,\r
+ 0x0B9F410B, 0x8B027B8B, 0x88D8A088, 0x4FF3114F, 0x67CB3167, 0x4627C246, 0xC06727C0, 0xB4FC90B4,\r
+ 0x28382028, 0x7F04F67F, 0x78486078, 0x2EE5FF2E, 0x074C9607, 0x4B655C4B, 0xC72BB1C7, 0x6F8EAB6F,\r
+ 0x0D429E0D, 0xBBF59CBB, 0xF2DB52F2, 0xF34A1BF3, 0xA63D5FA6, 0x59A49359, 0xBCB90ABC, 0x3AF9EF3A,\r
+ 0xEF1391EF, 0xFE0885FE, 0x01914901, 0x6116EE61, 0x7CDE2D7C, 0xB2214FB2, 0x42B18F42, 0xDB723BDB,\r
+ 0xB82F47B8, 0x48BF8748, 0x2CAE6D2C, 0xE3C046E3, 0x573CD657, 0x859A3E85, 0x29A96929, 0x7D4F647D,\r
+ 0x94812A94, 0x492ECE49, 0x17C6CB17, 0xCA692FCA, 0xC3BDFCC3, 0x5CA3975C, 0x5EE8055E, 0xD0ED7AD0,\r
+ 0x87D1AC87, 0x8E057F8E, 0xBA64D5BA, 0xA8A51AA8, 0xB7264BB7, 0xB9BE0EB9, 0x6087A760, 0xF8D55AF8,\r
+ 0x22362822, 0x111B1411, 0xDE753FDE, 0x79D92979, 0xAAEE88AA, 0x332D3C33, 0x5F794C5F, 0xB6B702B6,\r
+ 0x96CAB896, 0x5835DA58, 0x9CC4B09C, 0xFC4317FC, 0x1A84551A, 0xF64D1FF6, 0x1C598A1C, 0x38B27D38,\r
+ 0xAC3357AC, 0x18CFC718, 0xF4068DF4, 0x69537469, 0x749BB774, 0xF597C4F5, 0x56AD9F56, 0xDAE372DA,\r
+ 0xD5EA7ED5, 0x4AF4154A, 0x9E8F229E, 0xA2AB12A2, 0x4E62584E, 0xE85F07E8, 0xE51D99E5, 0x39233439,\r
+ 0xC1F66EC1, 0x446C5044, 0x5D32DE5D, 0x72466872, 0x26A06526, 0x93CDBC93, 0x03DADB03, 0xC6BAF8C6,\r
+ 0xFA9EC8FA, 0x82D6A882, 0xCF6E2BCF, 0x50704050, 0xEB85DCEB, 0x750AFE75, 0x8A93328A, 0x8DDFA48D,\r
+ 0x4C29CA4C, 0x141C1014, 0x73D72173, 0xCCB4F0CC, 0x09D4D309, 0x108A5D10, 0xE2510FE2, 0x00000000,\r
+ 0x9A196F9A, 0xE01A9DE0, 0x8F94368F, 0xE6C742E6, 0xECC94AEC, 0xFDD25EFD, 0xAB7FC1AB, 0xD8A8E0D8\r
+ );\r
+\r
+ /**\r
+ * The Key Schedule Array\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $K = array();\r
+\r
+ /**\r
+ * The Key depended S-Table 0\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $S0 = array();\r
+\r
+ /**\r
+ * The Key depended S-Table 1\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $S1 = array();\r
+\r
+ /**\r
+ * The Key depended S-Table 2\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $S2 = array();\r
+\r
+ /**\r
+ * The Key depended S-Table 3\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $S3 = array();\r
+\r
+ /**\r
+ * Default Constructor.\r
+ *\r
+ * Determines whether or not the mcrypt extension should be used.\r
+ * If not explictly set, CRYPT_TWOFISH_MODE_CBC will be used.\r
+ *\r
+ * @param optional Integer $mode\r
+ * @access public\r
+ */\r
+ function Crypt_Twofish($mode = CRYPT_TWOFISH_MODE_CBC)\r
+ {\r
+ if ( !defined('CRYPT_TWOFISH_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('mcrypt') && in_array('twofish', mcrypt_list_algorithms()):\r
+ define('CRYPT_TWOFISH_MODE', CRYPT_TWOFISH_MODE_MCRYPT);\r
+ break;\r
+ default:\r
+ define('CRYPT_TWOFISH_MODE', CRYPT_TWOFISH_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ switch ( CRYPT_TWOFISH_MODE ) {\r
+ case CRYPT_TWOFISH_MODE_MCRYPT:\r
+ switch ($mode) {\r
+ case CRYPT_TWOFISH_MODE_ECB:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_ECB;\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_CTR:\r
+ $this->mode = 'ctr';\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_CFB:\r
+ $this->mode = 'ncfb';\r
+ $this->ecb = mcrypt_module_open(MCRYPT_TWOFISH, '', MCRYPT_MODE_ECB, '');\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_OFB:\r
+ $this->mode = MCRYPT_MODE_NOFB;\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_CBC:\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = MCRYPT_MODE_CBC;\r
+ }\r
+ $this->enmcrypt = mcrypt_module_open(MCRYPT_TWOFISH, '', $this->mode, '');\r
+ $this->demcrypt = mcrypt_module_open(MCRYPT_TWOFISH, '', $this->mode, '');\r
+\r
+ break;\r
+ default:\r
+ switch ($mode) {\r
+ case CRYPT_TWOFISH_MODE_ECB:\r
+ case CRYPT_TWOFISH_MODE_CBC:\r
+ $this->paddable = true;\r
+ $this->mode = $mode;\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_CTR:\r
+ case CRYPT_TWOFISH_MODE_CFB:\r
+ case CRYPT_TWOFISH_MODE_OFB:\r
+ $this->mode = $mode;\r
+ break;\r
+ default:\r
+ $this->paddable = true;\r
+ $this->mode = CRYPT_TWOFISH_MODE_CBC;\r
+ }\r
+ $this->inline_crypt_setup();\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Sets the key.\r
+ *\r
+ * Keys can be of any length. Twofish, itself, requires the use of a key that's 128, 192 or 256-bits long.\r
+ * If the key is less than 256-bits we round the length up to the closest valid key length,\r
+ * padding $key with null bytes. If the key is more than 256-bits, we trim the excess bits.\r
+ *\r
+ * If the key is not explicitly set, it'll be assumed a 128 bits key to be all null bytes.\r
+ *\r
+ * @access public\r
+ * @param String $key\r
+ */\r
+ function setKey($key)\r
+ {\r
+ $keylength = strlen($key);\r
+ switch (true) {\r
+ case $keylength <= 16:\r
+ $key.= str_repeat("\0", 16 - $keylength);\r
+ break;\r
+ case $keylength <= 24:\r
+ $key.= str_repeat("\0", 24 - $keylength);\r
+ break;\r
+ case $keylength <= 32:\r
+ $key.= str_repeat("\0", 32 - $keylength);\r
+ break;\r
+ default:\r
+ $key = substr($key, 0, 32);\r
+ }\r
+ $this->key = $key;\r
+\r
+ $this->enchanged = true;\r
+ $this->dechanged = true;\r
+\r
+ if (CRYPT_TWOFISH_MODE == CRYPT_TWOFISH_MODE_MCRYPT) {\r
+ return;\r
+ }\r
+\r
+ /* Key expanding and generating the key-depended s-boxes */\r
+ $le_longs = unpack('V*', $key);\r
+ $key = unpack('C*', $key);\r
+ $m0 = $this->m0;\r
+ $m1 = $this->m1;\r
+ $m2 = $this->m2;\r
+ $m3 = $this->m3;\r
+ $q0 = $this->q0;\r
+ $q1 = $this->q1;\r
+\r
+ $K = $S0 = $S1 = $S2 = $S3 = array();\r
+\r
+ switch (strlen($this->key)) {\r
+ case 16:\r
+ list ($s7, $s6, $s5, $s4) = $this->mds_rem($le_longs[1], $le_longs[2]);\r
+ list ($s3, $s2, $s1, $s0) = $this->mds_rem($le_longs[3], $le_longs[4]);\r
+ for ($i = 0, $j = 1; $i < 40; $i+= 2,$j+= 2) {\r
+ $A = $m0[$q0[$q0[$i] ^ $key[ 9]] ^ $key[1]] ^\r
+ $m1[$q0[$q1[$i] ^ $key[10]] ^ $key[2]] ^\r
+ $m2[$q1[$q0[$i] ^ $key[11]] ^ $key[3]] ^\r
+ $m3[$q1[$q1[$i] ^ $key[12]] ^ $key[4]];\r
+ $B = $m0[$q0[$q0[$j] ^ $key[13]] ^ $key[5]] ^\r
+ $m1[$q0[$q1[$j] ^ $key[14]] ^ $key[6]] ^\r
+ $m2[$q1[$q0[$j] ^ $key[15]] ^ $key[7]] ^\r
+ $m3[$q1[$q1[$j] ^ $key[16]] ^ $key[8]];\r
+ $B = ($B << 8) | ($B >> 24 & 0xff);\r
+ $K[] = $A+= $B;\r
+ $K[] = (($A+= $B) << 9 | $A >> 23 & 0x1ff);\r
+ }\r
+ for ($i = 0; $i < 256; ++$i) {\r
+ $S0[$i] = $m0[$q0[$q0[$i] ^ $s4] ^ $s0];\r
+ $S1[$i] = $m1[$q0[$q1[$i] ^ $s5] ^ $s1];\r
+ $S2[$i] = $m2[$q1[$q0[$i] ^ $s6] ^ $s2];\r
+ $S3[$i] = $m3[$q1[$q1[$i] ^ $s7] ^ $s3];\r
+ }\r
+ break;\r
+ case 24:\r
+ list ($sb, $sa, $s9, $s8) = $this->mds_rem($le_longs[1], $le_longs[2]);\r
+ list ($s7, $s6, $s5, $s4) = $this->mds_rem($le_longs[3], $le_longs[4]);\r
+ list ($s3, $s2, $s1, $s0) = $this->mds_rem($le_longs[5], $le_longs[6]);\r
+ for ($i = 0, $j = 1; $i < 40; $i+= 2, $j+= 2) {\r
+ $A = $m0[$q0[$q0[$q1[$i] ^ $key[17]] ^ $key[ 9]] ^ $key[1]] ^\r
+ $m1[$q0[$q1[$q1[$i] ^ $key[18]] ^ $key[10]] ^ $key[2]] ^\r
+ $m2[$q1[$q0[$q0[$i] ^ $key[19]] ^ $key[11]] ^ $key[3]] ^\r
+ $m3[$q1[$q1[$q0[$i] ^ $key[20]] ^ $key[12]] ^ $key[4]];\r
+ $B = $m0[$q0[$q0[$q1[$j] ^ $key[21]] ^ $key[13]] ^ $key[5]] ^\r
+ $m1[$q0[$q1[$q1[$j] ^ $key[22]] ^ $key[14]] ^ $key[6]] ^\r
+ $m2[$q1[$q0[$q0[$j] ^ $key[23]] ^ $key[15]] ^ $key[7]] ^\r
+ $m3[$q1[$q1[$q0[$j] ^ $key[24]] ^ $key[16]] ^ $key[8]];\r
+ $B = ($B << 8) | ($B >> 24 & 0xff);\r
+ $K[] = $A+= $B;\r
+ $K[] = (($A+= $B) << 9 | $A >> 23 & 0x1ff);\r
+ }\r
+ for ($i = 0; $i < 256; ++$i) {\r
+ $S0[$i] = $m0[$q0[$q0[$q1[$i] ^ $s8] ^ $s4] ^ $s0];\r
+ $S1[$i] = $m1[$q0[$q1[$q1[$i] ^ $s9] ^ $s5] ^ $s1];\r
+ $S2[$i] = $m2[$q1[$q0[$q0[$i] ^ $sa] ^ $s6] ^ $s2];\r
+ $S3[$i] = $m3[$q1[$q1[$q0[$i] ^ $sb] ^ $s7] ^ $s3];\r
+ }\r
+ break;\r
+ default: // 32\r
+ list ($sf, $se, $sd, $sc) = $this->mds_rem($le_longs[1], $le_longs[2]);\r
+ list ($sb, $sa, $s9, $s8) = $this->mds_rem($le_longs[3], $le_longs[4]);\r
+ list ($s7, $s6, $s5, $s4) = $this->mds_rem($le_longs[5], $le_longs[6]);\r
+ list ($s3, $s2, $s1, $s0) = $this->mds_rem($le_longs[7], $le_longs[8]);\r
+ for ($i = 0, $j = 1; $i < 40; $i+= 2, $j+= 2) {\r
+ $A = $m0[$q0[$q0[$q1[$q1[$i] ^ $key[25]] ^ $key[17]] ^ $key[ 9]] ^ $key[1]] ^\r
+ $m1[$q0[$q1[$q1[$q0[$i] ^ $key[26]] ^ $key[18]] ^ $key[10]] ^ $key[2]] ^\r
+ $m2[$q1[$q0[$q0[$q0[$i] ^ $key[27]] ^ $key[19]] ^ $key[11]] ^ $key[3]] ^\r
+ $m3[$q1[$q1[$q0[$q1[$i] ^ $key[28]] ^ $key[20]] ^ $key[12]] ^ $key[4]];\r
+ $B = $m0[$q0[$q0[$q1[$q1[$j] ^ $key[29]] ^ $key[21]] ^ $key[13]] ^ $key[5]] ^\r
+ $m1[$q0[$q1[$q1[$q0[$j] ^ $key[30]] ^ $key[22]] ^ $key[14]] ^ $key[6]] ^\r
+ $m2[$q1[$q0[$q0[$q0[$j] ^ $key[31]] ^ $key[23]] ^ $key[15]] ^ $key[7]] ^\r
+ $m3[$q1[$q1[$q0[$q1[$j] ^ $key[32]] ^ $key[24]] ^ $key[16]] ^ $key[8]];\r
+ $B = ($B << 8) | ($B >> 24 & 0xff);\r
+ $K[] = $A+= $B;\r
+ $K[] = (($A+= $B) << 9 | $A >> 23 & 0x1ff);\r
+ }\r
+ for ($i = 0; $i < 256; ++$i) {\r
+ $S0[$i] = $m0[$q0[$q0[$q1[$q1[$i] ^ $sc] ^ $s8] ^ $s4] ^ $s0];\r
+ $S1[$i] = $m1[$q0[$q1[$q1[$q0[$i] ^ $sd] ^ $s9] ^ $s5] ^ $s1];\r
+ $S2[$i] = $m2[$q1[$q0[$q0[$q0[$i] ^ $se] ^ $sa] ^ $s6] ^ $s2];\r
+ $S3[$i] = $m3[$q1[$q1[$q0[$q1[$i] ^ $sf] ^ $sb] ^ $s7] ^ $s3];\r
+ }\r
+ }\r
+\r
+ $this->K = $K;\r
+ $this->S0 = $S0;\r
+ $this->S1 = $S1;\r
+ $this->S2 = $S2;\r
+ $this->S3 = $S3;\r
+ }\r
+\r
+ /**\r
+ * Sets the password.\r
+ *\r
+ * Depending on what $method is set to, setPassword()'s (optional) parameters are as follows:\r
+ * {@link http://en.wikipedia.org/wiki/PBKDF2 pbkdf2}:\r
+ * $hash, $salt, $count\r
+ *\r
+ * @param String $password\r
+ * @param optional String $method\r
+ * @access public\r
+ */\r
+ function setPassword($password, $method = 'pbkdf2')\r
+ {\r
+ $key = '';\r
+\r
+ switch ($method) {\r
+ default: // 'pbkdf2'\r
+ list(, , $hash, $salt, $count) = func_get_args();\r
+ if (!isset($hash)) {\r
+ $hash = 'sha1';\r
+ }\r
+ // WPA and WPA2 use the SSID as the salt\r
+ if (!isset($salt)) {\r
+ $salt = 'phpseclib/salt';\r
+ }\r
+ // RFC2898#section-4.2 uses 1,000 iterations by default\r
+ // WPA and WPA2 use 4,096.\r
+ if (!isset($count)) {\r
+ $count = 1000;\r
+ }\r
+\r
+ if (!class_exists('Crypt_Hash')) {\r
+ require_once('Crypt/Hash.php');\r
+ }\r
+\r
+ $i = 1;\r
+ while (strlen($key) < 32) {\r
+ $hmac = new Crypt_Hash();\r
+ $hmac->setHash($hash);\r
+ $hmac->setKey($password);\r
+ $f = $u = $hmac->hash($salt . pack('N', $i++));\r
+ for ($j = 2; $j <= $count; ++$j) {\r
+ $u = $hmac->hash($u);\r
+ $f^= $u;\r
+ }\r
+ $key.= $f;\r
+ }\r
+ }\r
+\r
+ $this->setKey($key);\r
+ }\r
+\r
+ /**\r
+ * Sets the initialization vector. (optional)\r
+ *\r
+ * SetIV is not required when CRYPT_TWOFISH_MODE_ECB is being used. If not explictly set, it'll be assumed\r
+ * to be all null bytes.\r
+ *\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function setIV($iv)\r
+ {\r
+ $this->encryptIV = $this->decryptIV = $this->iv = str_pad(substr($iv, 0, 16), 16, chr(0));\r
+ $this->enchanged = true;\r
+ $this->dechanged = true;\r
+ }\r
+\r
+ /**\r
+ * Encrypts a message.\r
+ *\r
+ * $plaintext will be padded with up to 16 additional bytes. Other Twofish implementations may or may not pad in the\r
+ * same manner. Other common approaches to padding and the reasons why it's necessary are discussed in the following\r
+ * URL:\r
+ *\r
+ * {@link http://www.di-mgt.com.au/cryptopad.html http://www.di-mgt.com.au/cryptopad.html}\r
+ *\r
+ * An alternative to padding is to, separately, send the length of the file. This is what SSH, in fact, does.\r
+ * strlen($plaintext) will still need to be a multiple of 16, however, arbitrary values can be added to make it that\r
+ * length.\r
+ *\r
+ * @see Crypt_Twofish::decrypt()\r
+ * @access public\r
+ * @param String $plaintext\r
+ */\r
+ function encrypt($plaintext)\r
+ {\r
+ if ( CRYPT_TWOFISH_MODE == CRYPT_TWOFISH_MODE_MCRYPT ) {\r
+ if ($this->paddable) {\r
+ $plaintext = $this->_pad($plaintext);\r
+ }\r
+\r
+ if ($this->enchanged) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->encryptIV);\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->key, "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0");\r
+ }\r
+ $this->enchanged = false;\r
+ }\r
+\r
+ if ($this->mode != 'ncfb' || !$this->continuousBuffer) {\r
+ $ciphertext = mcrypt_generic($this->enmcrypt, $plaintext);\r
+ } else {\r
+ $iv = &$this->encryptIV;\r
+ $pos = &$this->enbuffer['pos'];\r
+ $len = strlen($plaintext);\r
+ $ciphertext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 16 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $plaintext;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ $this->enbuffer['enmcrypt_init'] = true;\r
+ }\r
+ if ($len >= 16) {\r
+ if ($this->enbuffer['enmcrypt_init'] === false || $len > 600) {\r
+ if ($this->enbuffer['enmcrypt_init'] === true) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $iv);\r
+ $this->enbuffer['enmcrypt_init'] = false;\r
+ }\r
+ $ciphertext.= mcrypt_generic($this->enmcrypt, substr($plaintext, $i, $len - $len % 16));\r
+ $iv = substr($ciphertext, -16);\r
+ $len%= 16;\r
+ } else {\r
+ while ($len >= 16) {\r
+ $iv = mcrypt_generic($this->ecb, $iv) ^ substr($plaintext, $i, 16);\r
+ $ciphertext.= $iv;\r
+ $len-= 16;\r
+ $i+= 16;\r
+ }\r
+ }\r
+ }\r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $block = $iv ^ substr($plaintext, -$len);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ }\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->encryptIV);\r
+ }\r
+\r
+ return $ciphertext;\r
+ }\r
+\r
+ if (empty($this->K)) {\r
+ $this->setKey($this->key);\r
+ }\r
+\r
+ $inline = $this->inline_crypt;\r
+ return $inline('encrypt', $this, $plaintext);\r
+ }\r
+\r
+ /**\r
+ * Decrypts a message.\r
+ *\r
+ * If strlen($ciphertext) is not a multiple of 16, null bytes will be added to the end of the string until it is.\r
+ *\r
+ * @see Crypt_Twofish::encrypt()\r
+ * @access public\r
+ * @param String $ciphertext\r
+ */\r
+ function decrypt($ciphertext)\r
+ {\r
+ if ( CRYPT_TWOFISH_MODE == CRYPT_TWOFISH_MODE_MCRYPT ) {\r
+ if ($this->paddable) {\r
+ // we pad with chr(0) since that's what mcrypt_generic does. to quote from http://php.net/function.mcrypt-generic :\r
+ // "The data is padded with "\0" to make sure the length of the data is n * blocksize."\r
+ $ciphertext = str_pad($ciphertext, strlen($ciphertext) + (16 - strlen($ciphertext) % 16) % 16, chr(0));\r
+ }\r
+\r
+ if ($this->dechanged) {\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->decryptIV);\r
+ if ($this->mode == 'ncfb') {\r
+ mcrypt_generic_init($this->ecb, $this->key, "\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0");\r
+ }\r
+ $this->dechanged = false;\r
+ }\r
+\r
+ if ($this->mode != 'ncfb' || !$this->continuousBuffer) {\r
+ $plaintext = mdecrypt_generic($this->demcrypt, $ciphertext);\r
+ } else {\r
+ $iv = &$this->decryptIV;\r
+ $pos = &$this->debuffer['pos'];\r
+ $len = strlen($ciphertext);\r
+ $plaintext = '';\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = 16 - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $ciphertext;\r
+ $iv = substr_replace($iv, substr($ciphertext, 0, $i), $orig_pos, $i);\r
+ }\r
+ if ($len >= 16) {\r
+ $cb = substr($ciphertext, $i, $len - $len % 16);\r
+ $plaintext.= mcrypt_generic($this->ecb, $iv . $cb) ^ $cb;\r
+ $iv = substr($cb, -16);\r
+ $len%= 16;\r
+ }\r
+ if ($len) {\r
+ $iv = mcrypt_generic($this->ecb, $iv);\r
+ $plaintext.= $iv ^ substr($ciphertext, -$len);\r
+ $iv = substr_replace($iv, substr($ciphertext, -$len), 0, $len);\r
+ $pos = $len;\r
+ }\r
+ return $plaintext;\r
+ }\r
+\r
+ if (!$this->continuousBuffer) {\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->decryptIV);\r
+ }\r
+\r
+ return $this->paddable ? $this->_unpad($plaintext) : $plaintext;\r
+ }\r
+\r
+ if (empty($this->K)) {\r
+ $this->setKey($this->key);\r
+ }\r
+\r
+ $inline = $this->inline_crypt;\r
+ return $inline('decrypt', $this, $ciphertext);\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive "packets" as if they are a continuous buffer.\r
+ *\r
+ * @see Crypt_Twofish::disableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function enableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = true;\r
+ }\r
+\r
+ /**\r
+ * Treat consecutive packets as if they are a discontinuous buffer.\r
+ *\r
+ * The default behavior.\r
+ *\r
+ * @see Crypt_Twofish::enableContinuousBuffer()\r
+ * @access public\r
+ */\r
+ function disableContinuousBuffer()\r
+ {\r
+ $this->continuousBuffer = false;\r
+ $this->encryptIV = $this->iv;\r
+ $this->decryptIV = $this->iv;\r
+ $this->enbuffer = array('encrypted' => '', 'xor' => '', 'pos' => 0, 'enmcrypt_init' => true);\r
+ $this->debuffer = array('ciphertext' => '', 'xor' => '', 'pos' => 0, 'demcrypt_init' => true);\r
+\r
+ if (CRYPT_TWOFISH_MODE == CRYPT_TWOFISH_MODE_MCRYPT) {\r
+ mcrypt_generic_init($this->enmcrypt, $this->key, $this->iv);\r
+ mcrypt_generic_init($this->demcrypt, $this->key, $this->iv);\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Pad "packets".\r
+ *\r
+ * Twofish works by encrypting 16 bytes at a time. If you ever need to encrypt or decrypt something that's not\r
+ * a multiple of 16, it becomes necessary to pad the input so that it's length is a multiple of eight.\r
+ *\r
+ * Padding is enabled by default. Sometimes, however, it is undesirable to pad strings. Such is the case in SSH1,\r
+ * where "packets" are padded with random bytes before being encrypted. Unpad these packets and you risk stripping\r
+ * away characters that shouldn't be stripped away. (SSH knows how many bytes are added because the length is\r
+ * transmitted separately)\r
+ *\r
+ * @see Crypt_Twofish::disablePadding()\r
+ * @access public\r
+ */\r
+ function enablePadding()\r
+ {\r
+ $this->padding = true;\r
+ }\r
+\r
+ /**\r
+ * Do not pad packets.\r
+ *\r
+ * @see Crypt_Twofish::enablePadding()\r
+ * @access public\r
+ */\r
+ function disablePadding()\r
+ {\r
+ $this->padding = false;\r
+ }\r
+\r
+ /**\r
+ * Pads a string\r
+ *\r
+ * Pads a string using the RSA PKCS padding standards so that its length is a multiple of the blocksize (16).\r
+ *\r
+ * If padding is disabled and $text is not a multiple of the blocksize, the string will be padded regardless\r
+ * and padding will, hence forth, be enabled.\r
+ *\r
+ * @see Crypt_Twofish::_unpad()\r
+ * @access private\r
+ */\r
+ function _pad($text)\r
+ {\r
+ $length = strlen($text);\r
+\r
+ if (!$this->padding) {\r
+ if ($length % 16 == 0) {\r
+ return $text;\r
+ } else {\r
+ user_error("The plaintext's length ($length) is not a multiple of the block size (16)");\r
+ $this->padding = true;\r
+ }\r
+ }\r
+\r
+ $pad = 16 - ($length % 16);\r
+\r
+ return str_pad($text, $length + $pad, chr($pad));\r
+ }\r
+\r
+ /**\r
+ * Unpads a string\r
+ *\r
+ * If padding is enabled and the reported padding length is invalid the encryption key will be assumed to be wrong\r
+ * and false will be returned.\r
+ *\r
+ * @see Crypt_Twofish::_pad()\r
+ * @access private\r
+ */\r
+ function _unpad($text)\r
+ {\r
+ if (!$this->padding) {\r
+ return $text;\r
+ }\r
+\r
+ $length = ord($text[strlen($text) - 1]);\r
+\r
+ if (!$length || $length > 16) {\r
+ return false;\r
+ }\r
+\r
+ return substr($text, 0, -$length);\r
+ }\r
+\r
+ /**\r
+ * String Shift\r
+ *\r
+ * Inspired by array_shift\r
+ *\r
+ * @param String $string\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _string_shift(&$string)\r
+ {\r
+ $substr = substr($string, 0, 16);\r
+ $string = substr($string, 16);\r
+ return $substr;\r
+ }\r
+\r
+ /**\r
+ * Generate CTR XOR encryption key\r
+ *\r
+ * Encrypt the output of this and XOR it against the ciphertext / plaintext to get the\r
+ * plaintext / ciphertext in CTR mode.\r
+ *\r
+ * @see Crypt_Twofish::decrypt()\r
+ * @see Crypt_Twofish::encrypt()\r
+ * @access public\r
+ * @param String $iv\r
+ */\r
+ function _generate_xor(&$iv)\r
+ {\r
+ $xor = $iv;\r
+ for ($j = 4; $j <= 16; $j+=4) {\r
+ $temp = substr($iv, -$j, 4);\r
+ switch ($temp) {\r
+ case "\xFF\xFF\xFF\xFF":\r
+ $iv = substr_replace($iv, "\x00\x00\x00\x00", -$j, 4);\r
+ break;\r
+ case "\x7F\xFF\xFF\xFF":\r
+ $iv = substr_replace($iv, "\x80\x00\x00\x00", -$j, 4);\r
+ break 2;\r
+ default:\r
+ extract(unpack('Ncount', $temp));\r
+ $iv = substr_replace($iv, pack('N', $count + 1), -$j, 4);\r
+ break 2;\r
+ }\r
+ }\r
+\r
+ return $xor;\r
+ }\r
+\r
+ /**\r
+ * mds_rem function using by the twofish cipher algorithm\r
+ *\r
+ * @access private\r
+ * @param String $A\r
+ * @param String $B\r
+ * @return Array\r
+ */\r
+ function mds_rem($A, $B)\r
+ {\r
+ // No gain by unrolling this loop.\r
+ for ($i = 0; $i < 8; ++$i) {\r
+ // Get most significant coefficient.\r
+ $t = 0xff & ($B >> 24);\r
+\r
+ // Shift the others up.\r
+ $B = ($B << 8) | (0xff & ($A >> 24));\r
+ $A<<= 8;\r
+\r
+ $u = $t << 1;\r
+\r
+ // Subtract the modular polynomial on overflow.\r
+ if ($t & 0x80) {\r
+ $u^= 0x14d;\r
+ }\r
+\r
+ // Remove t * (a * x^2 + 1).\r
+ $B ^= $t ^ ($u << 16);\r
+\r
+ // Form u = a*t + t/a = t*(a + 1/a).\r
+ $u^= 0x7fffffff & ($t >> 1);\r
+\r
+ // Add the modular polynomial on underflow.\r
+ if ($t & 0x01) $u^= 0xa6 ;\r
+\r
+ // Remove t * (a + 1/a) * (x^3 + x).\r
+ $B^= ($u << 24) | ($u << 8);\r
+ }\r
+\r
+ return array(\r
+ 0xff & $B >> 24,\r
+ 0xff & $B >> 16,\r
+ 0xff & $B >> 8,\r
+ 0xff & $B);\r
+ }\r
+\r
+ /**\r
+ * Creates performance-optimized function for de/encrypt(), storing it in $this->inline_crypt\r
+ *\r
+ * @access private\r
+ */\r
+ function inline_crypt_setup()\r
+ {\r
+ $lambda_functions =& Crypt_Twofish::get_lambda_functions();\r
+ $block_size = 16;\r
+ $mode = $this->mode;\r
+ $code_hash = "$mode";\r
+\r
+ if (!isset($lambda_functions[$code_hash])) {\r
+ $init_cryptBlock = '\r
+ $S0 = $self->S0;\r
+ $S1 = $self->S1;\r
+ $S2 = $self->S2;\r
+ $S3 = $self->S3;\r
+ extract($self->K, EXTR_PREFIX_ALL, "K");\r
+ ';\r
+\r
+ // Generating encrypt code:\r
+ $_encryptBlock = '\r
+ $in = unpack("V4", $in);\r
+ $R0 = $K_0 ^ $in[1];\r
+ $R1 = $K_1 ^ $in[2];\r
+ $R2 = $K_2 ^ $in[3];\r
+ $R3 = $K_3 ^ $in[4];\r
+ ';\r
+ for ($ki = 7, $i = 0; $i < 8; ++$i) {\r
+ $_encryptBlock.= '\r
+ $t0 = $S0[ $R0 & 0xff] ^\r
+ $S1[($R0 >> 8) & 0xff] ^\r
+ $S2[($R0 >> 16) & 0xff] ^\r
+ $S3[($R0 >> 24) & 0xff];\r
+ $t1 = $S0[($R1 >> 24) & 0xff] ^\r
+ $S1[ $R1 & 0xff] ^\r
+ $S2[($R1 >> 8) & 0xff] ^\r
+ $S3[($R1 >> 16) & 0xff];\r
+ $R2^= ($t0 + $t1 + $K_'.(++$ki).');\r
+ $R2 = ($R2 >> 1 & 0x7fffffff) | ($R2 << 31);\r
+ $R3 = ((($R3 >> 31) & 1) | ($R3 << 1)) ^ ($t0 + ($t1 << 1) + $K_'.(++$ki).');\r
+\r
+ $t0 = $S0[ $R2 & 0xff] ^\r
+ $S1[($R2 >> 8) & 0xff] ^\r
+ $S2[($R2 >> 16) & 0xff] ^\r
+ $S3[($R2 >> 24) & 0xff];\r
+ $t1 = $S0[($R3 >> 24) & 0xff] ^\r
+ $S1[ $R3 & 0xff] ^\r
+ $S2[($R3 >> 8) & 0xff] ^\r
+ $S3[($R3 >> 16) & 0xff];\r
+ $R0^= ($t0 + $t1 + $K_'.(++$ki).');\r
+ $R0 = ($R0 >> 1 & 0x7fffffff) | ($R0 << 31);\r
+ $R1 = ((($R1 >> 31) & 1) | ($R1 << 1)) ^ ($t0 + ($t1 << 1) + $K_'.(++$ki).');\r
+ ';\r
+ }\r
+ $_encryptBlock.= '\r
+ $in = pack("V4", $K_4 ^ $R2,\r
+ $K_5 ^ $R3,\r
+ $K_6 ^ $R0,\r
+ $K_7 ^ $R1);\r
+ ';\r
+\r
+ // Generating decrypt code:\r
+ $_decryptBlock = '\r
+ $in = unpack("V4", $in);\r
+ $R0 = $K_4 ^ $in[1];\r
+ $R1 = $K_5 ^ $in[2];\r
+ $R2 = $K_6 ^ $in[3];\r
+ $R3 = $K_7 ^ $in[4];\r
+ ';\r
+ for ($ki = 40, $i = 0; $i < 8; ++$i) {\r
+ $_decryptBlock.= '\r
+ $t0 = $S0[$R0 & 0xff] ^\r
+ $S1[$R0 >> 8 & 0xff] ^\r
+ $S2[$R0 >> 16 & 0xff] ^\r
+ $S3[$R0 >> 24 & 0xff];\r
+ $t1 = $S0[$R1 >> 24 & 0xff] ^\r
+ $S1[$R1 & 0xff] ^\r
+ $S2[$R1 >> 8 & 0xff] ^\r
+ $S3[$R1 >> 16 & 0xff];\r
+ $R3^= $t0 + ($t1 << 1) + $K_'.(--$ki).';\r
+ $R3 = $R3 >> 1 & 0x7fffffff | $R3 << 31;\r
+ $R2 = ($R2 >> 31 & 0x1 | $R2 << 1) ^ ($t0 + $t1 + $K_'.(--$ki).');\r
+\r
+ $t0 = $S0[$R2 & 0xff] ^\r
+ $S1[$R2 >> 8 & 0xff] ^\r
+ $S2[$R2 >> 16 & 0xff] ^\r
+ $S3[$R2 >> 24 & 0xff];\r
+ $t1 = $S0[$R3 >> 24 & 0xff] ^\r
+ $S1[$R3 & 0xff] ^\r
+ $S2[$R3 >> 8 & 0xff] ^\r
+ $S3[$R3 >> 16 & 0xff];\r
+ $R1^= $t0 + ($t1 << 1) + $K_'.(--$ki).';\r
+ $R1 = $R1 >> 1 & 0x7fffffff | $R1 << 31;\r
+ $R0 = ($R0 >> 31 & 0x1 | $R0 << 1) ^ ($t0 + $t1 + $K_'.(--$ki).');\r
+ ';\r
+ }\r
+ $_decryptBlock.= '\r
+ $in = pack("V4", $K_0 ^ $R2,\r
+ $K_1 ^ $R3,\r
+ $K_2 ^ $R0,\r
+ $K_3 ^ $R1);\r
+ ';\r
+\r
+ // Generating mode of operation code:\r
+ switch ($mode) {\r
+ case CRYPT_TWOFISH_MODE_ECB:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $text = $self->_pad($text);\r
+ $plaintext_len = strlen($text);\r
+\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.');\r
+ '.$_encryptBlock.'\r
+ $ciphertext.= $in;\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $text = str_pad($text, strlen($text) + ('.$block_size.' - strlen($text) % '.$block_size.') % '.$block_size.', chr(0));\r
+ $ciphertext_len = strlen($text);\r
+\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.');\r
+ '.$_decryptBlock.'\r
+ $plaintext.= $in;\r
+ }\r
+\r
+ return $self->_unpad($plaintext);\r
+ ';\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_CBC:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $text = $self->_pad($text);\r
+ $plaintext_len = strlen($text);\r
+\r
+ $in = $self->encryptIV;\r
+\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = substr($text, $i, '.$block_size.') ^ $in;\r
+ '.$_encryptBlock.'\r
+ $ciphertext.= $in;\r
+ }\r
+\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $in;\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $text = str_pad($text, strlen($text) + ('.$block_size.' - strlen($text) % '.$block_size.') % '.$block_size.', chr(0));\r
+ $ciphertext_len = strlen($text);\r
+\r
+ $iv = $self->decryptIV;\r
+\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = $block = substr($text, $i, '.$block_size.');\r
+ '.$_decryptBlock.'\r
+ $plaintext.= $in ^ $iv;\r
+ $iv = $block;\r
+ }\r
+\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $iv;\r
+ }\r
+\r
+ return $self->_unpad($plaintext);\r
+ ';\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_CTR:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+ $xor = $self->encryptIV;\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if (strlen($buffer["encrypted"])) {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["encrypted"])) {\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_encryptBlock.'\r
+ $buffer["encrypted"].= $in;\r
+ }\r
+ $key = $self->_string_shift($buffer["encrypted"]);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_encryptBlock.'\r
+ $key = $in;\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $xor;\r
+ if ($start = $plaintext_len % '.$block_size.') {\r
+ $buffer["encrypted"] = substr($key, $start) . $buffer["encrypted"];\r
+ }\r
+ }\r
+\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+ $xor = $self->decryptIV;\r
+ $buffer = &$self->debuffer;\r
+\r
+ if (strlen($buffer["ciphertext"])) {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["ciphertext"])) {\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_encryptBlock.'\r
+ $buffer["ciphertext"].= $in;\r
+ }\r
+ $key = $self->_string_shift($buffer["ciphertext"]);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ $in = $self->_generate_xor($xor);\r
+ '.$_encryptBlock.'\r
+ $key = $in;\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $xor;\r
+ if ($start = $ciphertext_len % '.$block_size.') {\r
+ $buffer["ciphertext"] = substr($key, $start) . $buffer["ciphertext"];\r
+ }\r
+ }\r
+\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_CFB:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if ($self->continuousBuffer) {\r
+ $iv = &$self->encryptIV;\r
+ $pos = &$buffer["pos"];\r
+ } else {\r
+ $iv = $self->encryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($text);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = '.$block_size.' - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $ciphertext = substr($iv, $orig_pos) ^ $text;\r
+ $iv = substr_replace($iv, $ciphertext, $orig_pos, $i);\r
+ }\r
+ while ($len >= '.$block_size.') {\r
+ $in = $iv;\r
+ '.$_encryptBlock.';\r
+ $iv = $in ^ substr($text, $i, '.$block_size.');\r
+ $ciphertext.= $iv;\r
+ $len-= '.$block_size.';\r
+ $i+= '.$block_size.';\r
+ }\r
+ if ($len) {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $block = $iv ^ substr($text, $i);\r
+ $iv = substr_replace($iv, $block, 0, $len);\r
+ $ciphertext.= $block;\r
+ $pos = $len;\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $buffer = &$self->debuffer;\r
+\r
+ if ($self->continuousBuffer) {\r
+ $iv = &$self->decryptIV;\r
+ $pos = &$buffer["pos"];\r
+ } else {\r
+ $iv = $self->decryptIV;\r
+ $pos = 0;\r
+ }\r
+ $len = strlen($text);\r
+ $i = 0;\r
+ if ($pos) {\r
+ $orig_pos = $pos;\r
+ $max = '.$block_size.' - $pos;\r
+ if ($len >= $max) {\r
+ $i = $max;\r
+ $len-= $max;\r
+ $pos = 0;\r
+ } else {\r
+ $i = $len;\r
+ $pos+= $len;\r
+ $len = 0;\r
+ }\r
+ $plaintext = substr($iv, $orig_pos) ^ $text;\r
+ $iv = substr_replace($iv, substr($text, 0, $i), $orig_pos, $i);\r
+ }\r
+ while ($len >= '.$block_size.') {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $cb = substr($text, $i, '.$block_size.');\r
+ $plaintext.= $iv ^ $cb;\r
+ $iv = $cb;\r
+ $len-= '.$block_size.';\r
+ $i+= '.$block_size.';\r
+ }\r
+ if ($len) {\r
+ $in = $iv;\r
+ '.$_encryptBlock.'\r
+ $iv = $in;\r
+ $plaintext.= $iv ^ substr($text, $i);\r
+ $iv = substr_replace($iv, substr($text, $i), 0, $len);\r
+ $pos = $len;\r
+ }\r
+\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ case CRYPT_TWOFISH_MODE_OFB:\r
+ $encrypt = '\r
+ $ciphertext = "";\r
+ $plaintext_len = strlen($text);\r
+ $xor = $self->encryptIV;\r
+ $buffer = &$self->enbuffer;\r
+\r
+ if (strlen($buffer["xor"])) {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["xor"])) {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $buffer["xor"].= $xor;\r
+ }\r
+ $key = $self->_string_shift($buffer["xor"]);\r
+ $ciphertext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $plaintext_len; $i+= '.$block_size.') {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $ciphertext.= substr($text, $i, '.$block_size.') ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->encryptIV = $xor;\r
+ if ($start = $plaintext_len % '.$block_size.') {\r
+ $buffer["xor"] = substr($key, $start) . $buffer["xor"];\r
+ }\r
+ }\r
+ return $ciphertext;\r
+ ';\r
+\r
+ $decrypt = '\r
+ $plaintext = "";\r
+ $ciphertext_len = strlen($text);\r
+ $xor = $self->decryptIV;\r
+ $buffer = &$self->debuffer;\r
+\r
+ if (strlen($buffer["xor"])) {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $block = substr($text, $i, '.$block_size.');\r
+ if (strlen($block) > strlen($buffer["xor"])) {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $buffer["xor"].= $xor;\r
+ }\r
+ $key = $self->_string_shift($buffer["xor"]);\r
+ $plaintext.= $block ^ $key;\r
+ }\r
+ } else {\r
+ for ($i = 0; $i < $ciphertext_len; $i+= '.$block_size.') {\r
+ $in = $xor;\r
+ '.$_encryptBlock.'\r
+ $xor = $in;\r
+ $plaintext.= substr($text, $i, '.$block_size.') ^ $xor;\r
+ }\r
+ $key = $xor;\r
+ }\r
+ if ($self->continuousBuffer) {\r
+ $self->decryptIV = $xor;\r
+ if ($start = $ciphertext_len % '.$block_size.') {\r
+ $buffer["xor"] = substr($key, $start) . $buffer["xor"];\r
+ }\r
+ }\r
+ return $plaintext;\r
+ ';\r
+ break;\r
+ }\r
+ $fnc_head = '$action, &$self, $text';\r
+ $fnc_body = $init_cryptBlock . 'if ($action == "encrypt") { ' . $encrypt . ' } else { ' . $decrypt . ' }';\r
+\r
+ if (function_exists('create_function') && is_callable('create_function')) {\r
+ $lambda_functions[$code_hash] = create_function($fnc_head, $fnc_body);\r
+ } else {\r
+ eval('function ' . ($lambda_functions[$code_hash] = 'f' . md5(microtime())) . '(' . $fnc_head . ') { ' . $fnc_body . ' }');\r
+ }\r
+ }\r
+ $this->inline_crypt = $lambda_functions[$code_hash];\r
+ }\r
+\r
+ /**\r
+ * Holds the lambda_functions table (classwide)\r
+ *\r
+ * @see inline_crypt_setup()\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function &get_lambda_functions()\r
+ {\r
+ static $functions = array();\r
+ return $functions;\r
+ }\r
+}\r
+\r
+// vim: ts=4:sw=4:et:\r
+// vim6: fdl=1:\r
-<?php
-/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */
-
-/**
- * Pure-PHP arbitrary precision integer arithmetic library.
- *
- * Supports base-2, base-10, base-16, and base-256 numbers. Uses the GMP or BCMath extensions, if available,
- * and an internal implementation, otherwise.
- *
- * PHP versions 4 and 5
- *
- * {@internal (all DocBlock comments regarding implementation - such as the one that follows - refer to the
- * {@link MATH_BIGINTEGER_MODE_INTERNAL MATH_BIGINTEGER_MODE_INTERNAL} mode)
- *
- * Math_BigInteger uses base-2**26 to perform operations such as multiplication and division and
- * base-2**52 (ie. two base 2**26 digits) to perform addition and subtraction. Because the largest possible
- * value when multiplying two base-2**26 numbers together is a base-2**52 number, double precision floating
- * point numbers - numbers that should be supported on most hardware and whose significand is 53 bits - are
- * used. As a consequence, bitwise operators such as >> and << cannot be used, nor can the modulo operator %,
- * which only supports integers. Although this fact will slow this library down, the fact that such a high
- * base is being used should more than compensate.
- *
- * When PHP version 6 is officially released, we'll be able to use 64-bit integers. This should, once again,
- * allow bitwise operators, and will increase the maximum possible base to 2**31 (or 2**62 for addition /
- * subtraction).
- *
- * Numbers are stored in {@link http://en.wikipedia.org/wiki/Endianness little endian} format. ie.
- * (new Math_BigInteger(pow(2, 26)))->value = array(0, 1)
- *
- * Useful resources are as follows:
- *
- * - {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf Handbook of Applied Cryptography (HAC)}
- * - {@link http://math.libtomcrypt.com/files/tommath.pdf Multi-Precision Math (MPM)}
- * - Java's BigInteger classes. See /j2se/src/share/classes/java/math in jdk-1_5_0-src-jrl.zip
- *
- * Here's an example of how to use this library:
- * <code>
- * <?php
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger(2);
- * $b = new Math_BigInteger(3);
- *
- * $c = $a->add($b);
- *
- * echo $c->toString(); // outputs 5
- * ?>
- * </code>
- *
- * LICENSE: This library is free software; you can redistribute it and/or
- * modify it under the terms of the GNU Lesser General Public
- * License as published by the Free Software Foundation; either
- * version 2.1 of the License, or (at your option) any later version.
- *
- * This library is distributed in the hope that it will be useful,
- * but WITHOUT ANY WARRANTY; without even the implied warranty of
- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- * Lesser General Public License for more details.
- *
- * You should have received a copy of the GNU Lesser General Public
- * License along with this library; if not, write to the Free Software
- * Foundation, Inc., 59 Temple Place, Suite 330, Boston,
- * MA 02111-1307 USA
- *
- * @category Math
- * @package Math_BigInteger
- * @author Jim Wigginton <terrafrost@php.net>
- * @copyright MMVI Jim Wigginton
- * @license http://www.gnu.org/licenses/lgpl.txt
- * @version $Id: BigInteger.php,v 1.33 2010/03/22 22:32:03 terrafrost Exp $
- * @link http://pear.php.net/package/Math_BigInteger
- */
-
-/**#@+
- * Reduction constants
- *
- * @access private
- * @see Math_BigInteger::_reduce()
- */
-/**
- * @see Math_BigInteger::_montgomery()
- * @see Math_BigInteger::_prepMontgomery()
- */
-define('MATH_BIGINTEGER_MONTGOMERY', 0);
-/**
- * @see Math_BigInteger::_barrett()
- */
-define('MATH_BIGINTEGER_BARRETT', 1);
-/**
- * @see Math_BigInteger::_mod2()
- */
-define('MATH_BIGINTEGER_POWEROF2', 2);
-/**
- * @see Math_BigInteger::_remainder()
- */
-define('MATH_BIGINTEGER_CLASSIC', 3);
-/**
- * @see Math_BigInteger::__clone()
- */
-define('MATH_BIGINTEGER_NONE', 4);
-/**#@-*/
-
-/**#@+
- * Array constants
- *
- * Rather than create a thousands and thousands of new Math_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[MATH_BIGINTEGER_VALUE] contains the value.
- */
-define('MATH_BIGINTEGER_VALUE', 0);
-/**
- * $result[MATH_BIGINTEGER_SIGN] contains the sign.
- */
-define('MATH_BIGINTEGER_SIGN', 1);
-/**#@-*/
-
-/**#@+
- * @access private
- * @see Math_BigInteger::_montgomery()
- * @see Math_BigInteger::_barrett()
- */
-/**
- * Cache constants
- *
- * $cache[MATH_BIGINTEGER_VARIABLE] tells us whether or not the cached data is still valid.
- */
-define('MATH_BIGINTEGER_VARIABLE', 0);
-/**
- * $cache[MATH_BIGINTEGER_DATA] contains the cached data.
- */
-define('MATH_BIGINTEGER_DATA', 1);
-/**#@-*/
-
-/**#@+
- * Mode constants.
- *
- * @access private
- * @see Math_BigInteger::Math_BigInteger()
- */
-/**
- * To use the pure-PHP implementation
- */
-define('MATH_BIGINTEGER_MODE_INTERNAL', 1);
-/**
- * To use the BCMath library
- *
- * (if enabled; otherwise, the internal implementation will be used)
- */
-define('MATH_BIGINTEGER_MODE_BCMATH', 2);
-/**
- * To use the GMP library
- *
- * (if present; otherwise, either the BCMath or the internal implementation will be used)
- */
-define('MATH_BIGINTEGER_MODE_GMP', 3);
-/**#@-*/
-
-/**
- * The largest digit that may be used in addition / subtraction
- *
- * (we do pow(2, 52) instead of using 4503599627370496, directly, because some PHP installations
- * will truncate 4503599627370496)
- *
- * @access private
- */
-define('MATH_BIGINTEGER_MAX_DIGIT52', pow(2, 52));
-
-/**
- * Karatsuba Cutoff
- *
- * At what point do we switch between Karatsuba multiplication and schoolbook long multiplication?
- *
- * @access private
- */
-define('MATH_BIGINTEGER_KARATSUBA_CUTOFF', 25);
-
-/**
- * Pure-PHP arbitrary precision integer arithmetic library. Supports base-2, base-10, base-16, and base-256
- * numbers.
- *
- * @author Jim Wigginton <terrafrost@php.net>
- * @version 1.0.0RC4
- * @access public
- * @package Math_BigInteger
- */
-class Math_BigInteger {
- /**
- * Holds the BigInteger's value.
- *
- * @var Array
- * @access private
- */
- var $value;
-
- /**
- * Holds the BigInteger's magnitude.
- *
- * @var Boolean
- * @access private
- */
- var $is_negative = false;
-
- /**
- * Random number generator function
- *
- * @see setRandomGenerator()
- * @access private
- */
- var $generator = 'mt_rand';
-
- /**
- * Precision
- *
- * @see setPrecision()
- * @access private
- */
- var $precision = -1;
-
- /**
- * Precision Bitmask
- *
- * @see setPrecision()
- * @access private
- */
- var $bitmask = false;
-
- /**
- * Mode independant 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 __sleep()
- * @see __wakeup()
- * @var String
- * @access private
- */
- var $hex;
-
- /**
- * Converts base-2, base-10, base-16, and binary strings (eg. 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
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('0x32', 16); // 50 in base-16
- *
- * echo $a->toString(); // outputs 50
- * ?>
- * </code>
- *
- * @param optional $x base-10 number or base-$base number if $base set.
- * @param optional integer $base
- * @return Math_BigInteger
- * @access public
- */
- function Math_BigInteger($x = 0, $base = 10)
- {
- if ( !defined('MATH_BIGINTEGER_MODE') ) {
- switch (true) {
- case extension_loaded('gmp'):
- define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_GMP);
- break;
- case extension_loaded('bcmath'):
- define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_BCMATH);
- break;
- default:
- define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_INTERNAL);
- }
- }
-
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- if (is_resource($x) && get_resource_type($x) == 'GMP integer') {
- $this->value = $x;
- return;
- }
- $this->value = gmp_init(0);
- break;
- case MATH_BIGINTEGER_MODE_BCMATH:
- $this->value = '0';
- break;
- default:
- $this->value = array();
- }
-
- if (empty($x)) {
- return;
- }
-
- switch ($base) {
- case -256:
- if (ord($x[0]) & 0x80) {
- $x = ~$x;
- $this->is_negative = true;
- }
- case 256:
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $sign = $this->is_negative ? '-' : '';
- $this->value = gmp_init($sign . '0x' . bin2hex($x));
- break;
- case MATH_BIGINTEGER_MODE_BCMATH:
- // round $len to the nearest 4 (thanks, DavidMJ!)
- $len = (strlen($x) + 3) & 0xFFFFFFFC;
-
- $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, 26));
- }
- }
-
- if ($this->is_negative) {
- if (MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_INTERNAL) {
- $this->is_negative = false;
- }
- $temp = $this->add(new Math_BigInteger('-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 MATH_BIGINTEGER_MODE_GMP:
- $temp = $this->is_negative ? '-0x' . $x : '0x' . $x;
- $this->value = gmp_init($temp);
- $this->is_negative = false;
- break;
- case MATH_BIGINTEGER_MODE_BCMATH:
- $x = ( strlen($x) & 1 ) ? '0' . $x : $x;
- $temp = new Math_BigInteger(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 Math_BigInteger(pack('H*', $x), 256);
- $this->value = $temp->value;
- }
-
- if ($is_negative) {
- $temp = $this->add(new Math_BigInteger('-1'));
- $this->value = $temp->value;
- }
- break;
- case 10:
- case -10:
- $x = preg_replace('#^(-?[0-9]*).*#', '$1', $x);
-
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $this->value = gmp_init($x);
- break;
- case MATH_BIGINTEGER_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 = (string) $x;
- break;
- default:
- $temp = new Math_BigInteger();
-
- // array(10000000) is 10**7 in base-2**26. 10**7 is the closest to 2**26 we can get without passing it.
- $multiplier = new Math_BigInteger();
- $multiplier->value = array(10000000);
-
- if ($x[0] == '-') {
- $this->is_negative = true;
- $x = substr($x, 1);
- }
-
- $x = str_pad($x, strlen($x) + (6 * strlen($x)) % 7, 0, STR_PAD_LEFT);
-
- while (strlen($x)) {
- $temp = $temp->multiply($multiplier);
- $temp = $temp->add(new Math_BigInteger($this->_int2bytes(substr($x, 0, 7)), 256));
- $x = substr($x, 7);
- }
-
- $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 Math_BigInteger($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
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('65');
- *
- * echo $a->toBytes(); // outputs chr(65)
- * ?>
- * </code>
- *
- * @param Boolean $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 Math_BigInteger());
- if ($comparison == 0) {
- return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
- }
-
- $temp = $comparison < 0 ? $this->add(new Math_BigInteger(1)) : $this->copy();
- $bytes = $temp->toBytes();
-
- if (empty($bytes)) { // eg. if the number we're trying to convert is -1
- $bytes = chr(0);
- }
-
- if (ord($bytes[0]) & 0x80) {
- $bytes = chr(0) . $bytes;
- }
-
- return $comparison < 0 ? ~$bytes : $bytes;
- }
-
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- if (gmp_cmp($this->value, gmp_init(0)) == 0) {
- return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';
- }
-
- $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 MATH_BIGINTEGER_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, 26);
- $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
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('65');
- *
- * echo $a->toHex(); // outputs '41'
- * ?>
- * </code>
- *
- * @param Boolean $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
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('65');
- *
- * echo $a->toBits(); // outputs '1000001'
- * ?>
- * </code>
- *
- * @param Boolean $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 = 0; $i < strlen($hex); $i+=8) {
- $bits.= str_pad(decbin(hexdec(substr($hex, $i, 8))), 32, '0', STR_PAD_LEFT);
- }
- return $this->precision > 0 ? substr($bits, -$this->precision) : ltrim($bits, '0');
- }
-
- /**
- * Converts a BigInteger to a base-10 number.
- *
- * Here's an example:
- * <code>
- * <?php
- * include('Math/BigInteger.php');
- *
- * $a = new 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 MATH_BIGINTEGER_MODE_GMP:
- return gmp_strval($this->value);
- case MATH_BIGINTEGER_MODE_BCMATH:
- if ($this->value === '0') {
- return '0';
- }
-
- return ltrim($this->value, '0');
- }
-
- if (!count($this->value)) {
- return '0';
- }
-
- $temp = $this->copy();
- $temp->is_negative = false;
-
- $divisor = new Math_BigInteger();
- $divisor->value = array(10000000); // eg. 10**7
- $result = '';
- while (count($temp->value)) {
- list($temp, $mod) = $temp->divide($divisor);
- $result = str_pad(isset($mod->value[0]) ? $mod->value[0] : '', 7, '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
- * @see __clone()
- * @return Math_BigInteger
- */
- function copy()
- {
- $temp = new Math_BigInteger();
- $temp->value = $this->value;
- $temp->is_negative = $this->is_negative;
- $temp->generator = $this->generator;
- $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 Math_BigInteger::__toString() directly in PHP5, you cannot call Math_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 Math_BigInteger::copy(), instead.
- *
- * @access public
- * @see copy()
- * @return Math_BigInteger
- */
- function __clone()
- {
- return $this->copy();
- }
-
- /**
- * __sleep() magic method
- *
- * Will be called, automatically, when serialize() is called on a Math_BigInteger object.
- *
- * @see __wakeup()
- * @access public
- */
- function __sleep()
- {
- $this->hex = $this->toHex(true);
- $vars = array('hex');
- if ($this->generator != 'mt_rand') {
- $vars[] = 'generator';
- }
- if ($this->precision > 0) {
- $vars[] = 'precision';
- }
- return $vars;
-
- }
-
- /**
- * __wakeup() magic method
- *
- * Will be called, automatically, when unserialize() is called on a Math_BigInteger object.
- *
- * @see __sleep()
- * @access public
- */
- function __wakeup()
- {
- $temp = new Math_BigInteger($this->hex, -16);
- $this->value = $temp->value;
- $this->is_negative = $temp->is_negative;
- $this->setRandomGenerator($this->generator);
- if ($this->precision > 0) {
- // recalculate $this->bitmask
- $this->setPrecision($this->precision);
- }
- }
-
- /**
- * Adds two BigIntegers.
- *
- * Here's an example:
- * <code>
- * <?php
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('10');
- * $b = new Math_BigInteger('20');
- *
- * $c = $a->add($b);
- *
- * echo $c->toString(); // outputs 30
- * ?>
- * </code>
- *
- * @param Math_BigInteger $y
- * @return Math_BigInteger
- * @access public
- * @internal Performs base-2**52 addition
- */
- function add($y)
- {
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $temp = new Math_BigInteger();
- $temp->value = gmp_add($this->value, $y->value);
-
- return $this->_normalize($temp);
- case MATH_BIGINTEGER_MODE_BCMATH:
- $temp = new Math_BigInteger();
- $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 Math_BigInteger();
- $result->value = $temp[MATH_BIGINTEGER_VALUE];
- $result->is_negative = $temp[MATH_BIGINTEGER_SIGN];
-
- return $this->_normalize($result);
- }
-
- /**
- * Performs addition.
- *
- * @param Array $x_value
- * @param Boolean $x_negative
- * @param Array $y_value
- * @param Boolean $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(
- MATH_BIGINTEGER_VALUE => $y_value,
- MATH_BIGINTEGER_SIGN => $y_negative
- );
- } else if ($y_size == 0) {
- return array(
- MATH_BIGINTEGER_VALUE => $x_value,
- MATH_BIGINTEGER_SIGN => $x_negative
- );
- }
-
- // subtract, if appropriate
- if ( $x_negative != $y_negative ) {
- if ( $x_value == $y_value ) {
- return array(
- MATH_BIGINTEGER_VALUE => array(),
- MATH_BIGINTEGER_SIGN => false
- );
- }
-
- $temp = $this->_subtract($x_value, false, $y_value, false);
- $temp[MATH_BIGINTEGER_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[] = 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] * 0x4000000 + $x_value[$i] + $y_value[$j] * 0x4000000 + $y_value[$i] + $carry;
- $carry = $sum >= MATH_BIGINTEGER_MAX_DIGIT52; // eg. floor($sum / 2**52); only possible values (in any base) are 0 and 1
- $sum = $carry ? $sum - MATH_BIGINTEGER_MAX_DIGIT52 : $sum;
-
- $temp = (int) ($sum / 0x4000000);
-
- $value[$i] = (int) ($sum - 0x4000000 * $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 >= 0x4000000;
- $value[$i] = $carry ? $sum - 0x4000000 : $sum;
- ++$i; // ie. let $i = $j since we've just done $value[$i]
- }
-
- if ($carry) {
- for (; $value[$i] == 0x3FFFFFF; ++$i) {
- $value[$i] = 0;
- }
- ++$value[$i];
- }
-
- return array(
- MATH_BIGINTEGER_VALUE => $this->_trim($value),
- MATH_BIGINTEGER_SIGN => $x_negative
- );
- }
-
- /**
- * Subtracts two BigIntegers.
- *
- * Here's an example:
- * <code>
- * <?php
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('10');
- * $b = new Math_BigInteger('20');
- *
- * $c = $a->subtract($b);
- *
- * echo $c->toString(); // outputs -10
- * ?>
- * </code>
- *
- * @param Math_BigInteger $y
- * @return Math_BigInteger
- * @access public
- * @internal Performs base-2**52 subtraction
- */
- function subtract($y)
- {
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $temp = new Math_BigInteger();
- $temp->value = gmp_sub($this->value, $y->value);
-
- return $this->_normalize($temp);
- case MATH_BIGINTEGER_MODE_BCMATH:
- $temp = new Math_BigInteger();
- $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 Math_BigInteger();
- $result->value = $temp[MATH_BIGINTEGER_VALUE];
- $result->is_negative = $temp[MATH_BIGINTEGER_SIGN];
-
- return $this->_normalize($result);
- }
-
- /**
- * Performs subtraction.
- *
- * @param Array $x_value
- * @param Boolean $x_negative
- * @param Array $y_value
- * @param Boolean $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(
- MATH_BIGINTEGER_VALUE => $y_value,
- MATH_BIGINTEGER_SIGN => !$y_negative
- );
- } else if ($y_size == 0) {
- return array(
- MATH_BIGINTEGER_VALUE => $x_value,
- MATH_BIGINTEGER_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[MATH_BIGINTEGER_SIGN] = $x_negative;
-
- return $temp;
- }
-
- $diff = $this->_compare($x_value, $x_negative, $y_value, $y_negative);
-
- if ( !$diff ) {
- return array(
- MATH_BIGINTEGER_VALUE => array(),
- MATH_BIGINTEGER_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] * 0x4000000 + $x_value[$i] - $y_value[$j] * 0x4000000 - $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 + MATH_BIGINTEGER_MAX_DIGIT52 : $sum;
-
- $temp = (int) ($sum / 0x4000000);
-
- $x_value[$i] = (int) ($sum - 0x4000000 * $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 + 0x4000000 : $sum;
- ++$i;
- }
-
- if ($carry) {
- for (; !$x_value[$i]; ++$i) {
- $x_value[$i] = 0x3FFFFFF;
- }
- --$x_value[$i];
- }
-
- return array(
- MATH_BIGINTEGER_VALUE => $this->_trim($x_value),
- MATH_BIGINTEGER_SIGN => $x_negative
- );
- }
-
- /**
- * Multiplies two BigIntegers
- *
- * Here's an example:
- * <code>
- * <?php
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('10');
- * $b = new Math_BigInteger('20');
- *
- * $c = $a->multiply($b);
- *
- * echo $c->toString(); // outputs 200
- * ?>
- * </code>
- *
- * @param Math_BigInteger $x
- * @return Math_BigInteger
- * @access public
- */
- function multiply($x)
- {
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $temp = new Math_BigInteger();
- $temp->value = gmp_mul($this->value, $x->value);
-
- return $this->_normalize($temp);
- case MATH_BIGINTEGER_MODE_BCMATH:
- $temp = new Math_BigInteger();
- $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 Math_BigInteger();
- $product->value = $temp[MATH_BIGINTEGER_VALUE];
- $product->is_negative = $temp[MATH_BIGINTEGER_SIGN];
-
- return $this->_normalize($product);
- }
-
- /**
- * Performs multiplication.
- *
- * @param Array $x_value
- * @param Boolean $x_negative
- * @param Array $y_value
- * @param Boolean $y_negative
- * @return Array
- * @access private
- */
- function _multiply($x_value, $x_negative, $y_value, $y_negative)
- {
- //if ( $x_value == $y_value ) {
- // return array(
- // MATH_BIGINTEGER_VALUE => $this->_square($x_value),
- // MATH_BIGINTEGER_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(
- MATH_BIGINTEGER_VALUE => array(),
- MATH_BIGINTEGER_SIGN => false
- );
- }
-
- return array(
- MATH_BIGINTEGER_VALUE => min($x_length, $y_length) < 2 * MATH_BIGINTEGER_KARATSUBA_CUTOFF ?
- $this->_trim($this->_regularMultiply($x_value, $y_value)) :
- $this->_trim($this->_karatsuba($x_value, $y_value)),
- MATH_BIGINTEGER_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 = (int) ($temp / 0x4000000);
- $product_value[$j] = (int) ($temp - 0x4000000 * $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 = (int) ($temp / 0x4000000);
- $product_value[$k] = (int) ($temp - 0x4000000 * $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 < MATH_BIGINTEGER_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[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_VALUE]);
- $temp = $this->_add($z2, false, $z0, false);
- $z1 = $this->_subtract($z1, false, $temp[MATH_BIGINTEGER_VALUE], false);
-
- $z2 = array_merge(array_fill(0, 2 * $m, 0), $z2);
- $z1[MATH_BIGINTEGER_VALUE] = array_merge(array_fill(0, $m, 0), $z1[MATH_BIGINTEGER_VALUE]);
-
- $xy = $this->_add($z2, false, $z1[MATH_BIGINTEGER_VALUE], $z1[MATH_BIGINTEGER_SIGN]);
- $xy = $this->_add($xy[MATH_BIGINTEGER_VALUE], $xy[MATH_BIGINTEGER_SIGN], $z0, false);
-
- return $xy[MATH_BIGINTEGER_VALUE];
- }
-
- /**
- * Performs squaring
- *
- * @param Array $x
- * @return Array
- * @access private
- */
- function _square($x = false)
- {
- return count($x) < 2 * MATH_BIGINTEGER_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 = (int) ($temp / 0x4000000);
- $square_value[$i2] = (int) ($temp - 0x4000000 * $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 = (int) ($temp / 0x4000000);
- $square_value[$k] = (int) ($temp - 0x4000000 * $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 < MATH_BIGINTEGER_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[MATH_BIGINTEGER_VALUE]);
- $temp = $this->_add($z2, false, $z0, false);
- $z1 = $this->_subtract($z1, false, $temp[MATH_BIGINTEGER_VALUE], false);
-
- $z2 = array_merge(array_fill(0, 2 * $m, 0), $z2);
- $z1[MATH_BIGINTEGER_VALUE] = array_merge(array_fill(0, $m, 0), $z1[MATH_BIGINTEGER_VALUE]);
-
- $xx = $this->_add($z2, false, $z1[MATH_BIGINTEGER_VALUE], $z1[MATH_BIGINTEGER_SIGN]);
- $xx = $this->_add($xx[MATH_BIGINTEGER_VALUE], $xx[MATH_BIGINTEGER_SIGN], $z0, false);
-
- return $xx[MATH_BIGINTEGER_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
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('10');
- * $b = new Math_BigInteger('20');
- *
- * list($quotient, $remainder) = $a->divide($b);
- *
- * echo $quotient->toString(); // outputs 0
- * echo "\r\n";
- * echo $remainder->toString(); // outputs 10
- * ?>
- * </code>
- *
- * @param 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 MATH_BIGINTEGER_MODE_GMP:
- $quotient = new Math_BigInteger();
- $remainder = new Math_BigInteger();
-
- 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 MATH_BIGINTEGER_MODE_BCMATH:
- $quotient = new Math_BigInteger();
- $remainder = new Math_BigInteger();
-
- $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 Math_BigInteger();
- $remainder = new Math_BigInteger();
- $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 Math_BigInteger();
- }
-
- $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 Math_BigInteger();
- $temp->value = array(1);
- $temp->is_negative = $x_sign != $y_sign;
- return array($this->_normalize($temp), $this->_normalize(new Math_BigInteger()));
- }
-
- if ( $diff < 0 ) {
- // if $x is negative, "add" $y.
- if ( $x_sign ) {
- $x = $y->subtract($x);
- }
- return array($this->_normalize(new Math_BigInteger()), $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 & 0x2000000); ++$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 Math_BigInteger();
- $quotient_value = &$quotient->value;
- $quotient_value = $this->_array_repeat(0, $x_max - $y_max + 1);
-
- static $temp, $lhs, $rhs;
- if (!isset($temp)) {
- $temp = new Math_BigInteger();
- $lhs = new Math_BigInteger();
- $rhs = new Math_BigInteger();
- }
- $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] = 0x3FFFFFF;
- } else {
- $quotient_value[$q_index] = (int) (
- ($x_window[0] * 0x4000000 + $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;
- $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 Array $divisor
- * @return Array
- * @access private
- */
- function _divide_digit($dividend, $divisor)
- {
- $carry = 0;
- $result = array();
-
- for ($i = count($dividend) - 1; $i >= 0; --$i) {
- $temp = 0x4000000 * $carry + $dividend[$i];
- $result[$i] = (int) ($temp / $divisor);
- $carry = (int) ($temp - $divisor * $result[$i]);
- }
-
- return array($result, $carry);
- }
-
- /**
- * Performs modular exponentiation.
- *
- * Here's an example:
- * <code>
- * <?php
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger('10');
- * $b = new Math_BigInteger('20');
- * $c = new Math_BigInteger('30');
- *
- * $c = $a->modPow($b, $c);
- *
- * echo $c->toString(); // outputs 10
- * ?>
- * </code>
- *
- * @param Math_BigInteger $e
- * @param Math_BigInteger $n
- * @return Math_BigInteger
- * @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 Math_BigInteger()) < 0) {
- $e = $e->abs();
-
- $temp = $this->modInverse($n);
- if ($temp === false) {
- return false;
- }
-
- return $this->_normalize($temp->modPow($e, $n));
- }
-
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $temp = new Math_BigInteger();
- $temp->value = gmp_powm($this->value, $e->value, $n->value);
-
- return $this->_normalize($temp);
- case MATH_BIGINTEGER_MODE_BCMATH:
- $temp = new Math_BigInteger();
- $temp->value = bcpowmod($this->value, $e->value, $n->value, 0);
-
- return $this->_normalize($temp);
- }
-
- if ( empty($e->value) ) {
- $temp = new Math_BigInteger();
- $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 Math_BigInteger();
- $temp->value = $this->_square($this->value);
- list(, $temp) = $temp->divide($n);
- return $this->_normalize($temp);
- }
-
- return $this->_normalize($this->_slidingWindow($e, $n, MATH_BIGINTEGER_BARRETT));
-
- // is the modulo odd?
- if ( $n->value[0] & 1 ) {
- return $this->_normalize($this->_slidingWindow($e, $n, MATH_BIGINTEGER_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 Math_BigInteger();
- $mod2->value = array(1);
- $mod2->_lshift($j);
-
- $part1 = ( $mod1->value != array(1) ) ? $this->_slidingWindow($e, $mod1, MATH_BIGINTEGER_MONTGOMERY) : new Math_BigInteger();
- $part2 = $this->_slidingWindow($e, $mod2, MATH_BIGINTEGER_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 Math_BigInteger::modPow()
- *
- * @param Math_BigInteger $e
- * @param Math_BigInteger $n
- * @return 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 Math_BigInteger $e
- * @param Math_BigInteger $n
- * @param Integer $mode
- * @return 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]), 26, '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; $e_length > $window_ranges[$i] && $i < count($window_ranges); ++$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;
- }
- }
-
- for ($k = 0; $k <= $j; ++$k) {// eg. the length of substr($e_bits, $i, $j+1)
- $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 Math_BigInteger();
- $temp->value = $this->_reduce($result, $n_value, $mode);
-
- return $temp;
- }
-
- /**
- * Modular reduction
- *
- * For most $modes this will return the remainder.
- *
- * @see _slidingWindow()
- * @access private
- * @param Array $x
- * @param Array $n
- * @param Integer $mode
- * @return Array
- */
- function _reduce($x, $n, $mode)
- {
- switch ($mode) {
- case MATH_BIGINTEGER_MONTGOMERY:
- return $this->_montgomery($x, $n);
- case MATH_BIGINTEGER_BARRETT:
- return $this->_barrett($x, $n);
- case MATH_BIGINTEGER_POWEROF2:
- $lhs = new Math_BigInteger();
- $lhs->value = $x;
- $rhs = new Math_BigInteger();
- $rhs->value = $n;
- return $x->_mod2($n);
- case MATH_BIGINTEGER_CLASSIC:
- $lhs = new Math_BigInteger();
- $lhs->value = $x;
- $rhs = new Math_BigInteger();
- $rhs->value = $n;
- list(, $temp) = $lhs->divide($rhs);
- return $temp->value;
- case MATH_BIGINTEGER_NONE:
- return $x;
- default:
- // an invalid $mode was provided
- }
- }
-
- /**
- * Modular reduction preperation
- *
- * @see _slidingWindow()
- * @access private
- * @param Array $x
- * @param Array $n
- * @param Integer $mode
- * @return Array
- */
- function _prepareReduce($x, $n, $mode)
- {
- if ($mode == MATH_BIGINTEGER_MONTGOMERY) {
- return $this->_prepMontgomery($x, $n);
- }
- return $this->_reduce($x, $n, $mode);
- }
-
- /**
- * Modular multiply
- *
- * @see _slidingWindow()
- * @access private
- * @param Array $x
- * @param Array $y
- * @param Array $n
- * @param Integer $mode
- * @return Array
- */
- function _multiplyReduce($x, $y, $n, $mode)
- {
- if ($mode == MATH_BIGINTEGER_MONTGOMERY) {
- return $this->_montgomeryMultiply($x, $y, $n);
- }
- $temp = $this->_multiply($x, false, $y, false);
- return $this->_reduce($temp[MATH_BIGINTEGER_VALUE], $n, $mode);
- }
-
- /**
- * Modular square
- *
- * @see _slidingWindow()
- * @access private
- * @param Array $x
- * @param Array $n
- * @param Integer $mode
- * @return Array
- */
- function _squareReduce($x, $n, $mode)
- {
- if ($mode == MATH_BIGINTEGER_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.
- *
- * @see _slidingWindow()
- * @access private
- * @param Math_BigInteger
- * @return Math_BigInteger
- */
- function _mod2($n)
- {
- $temp = new Math_BigInteger();
- $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.
- *
- * @see _slidingWindow()
- * @access private
- * @param Array $n
- * @param Array $m
- * @return Array
- */
- function _barrett($n, $m)
- {
- static $cache = array(
- MATH_BIGINTEGER_VARIABLE => array(),
- MATH_BIGINTEGER_DATA => array()
- );
-
- $m_length = count($m);
-
- // if ($this->_compare($n, $this->_square($m)) >= 0) {
- if (count($n) > 2 * $m_length) {
- $lhs = new Math_BigInteger();
- $rhs = new Math_BigInteger();
- $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[MATH_BIGINTEGER_VARIABLE])) === false ) {
- $key = count($cache[MATH_BIGINTEGER_VARIABLE]);
- $cache[MATH_BIGINTEGER_VARIABLE][] = $m;
-
- $lhs = new Math_BigInteger();
- $lhs_value = &$lhs->value;
- $lhs_value = $this->_array_repeat(0, $m_length + ($m_length >> 1));
- $lhs_value[] = 1;
- $rhs = new Math_BigInteger();
- $rhs->value = $m;
-
- list($u, $m1) = $lhs->divide($rhs);
- $u = $u->value;
- $m1 = $m1->value;
-
- $cache[MATH_BIGINTEGER_DATA][] = array(
- 'u' => $u, // m.length >> 1 (technically (m.length >> 1) + 1)
- 'm1'=> $m1 // m.length
- );
- } else {
- extract($cache[MATH_BIGINTEGER_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[MATH_BIGINTEGER_VALUE], false); // m.length + (m.length >> 1) + 1
-
- if ($m_length & 1) {
- return $this->_regularBarrett($n[MATH_BIGINTEGER_VALUE], $m);
- }
-
- // (m.length + (m.length >> 1) + 1) - (m.length - 1) == (m.length >> 1) + 2
- $temp = array_slice($n[MATH_BIGINTEGER_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[MATH_BIGINTEGER_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[MATH_BIGINTEGER_VALUE], false, $temp[MATH_BIGINTEGER_VALUE], false);
-
- while ($this->_compare($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $m, false) >= 0) {
- $result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $m, false);
- }
-
- return $result[MATH_BIGINTEGER_VALUE];
- }
-
- /**
- * (Regular) Barrett Modular Reduction
- *
- * For numbers with more than four digits Math_BigInteger::_barrett() is faster. The difference between that and this
- * is that this function does not fold the denominator into a smaller form.
- *
- * @see _slidingWindow()
- * @access private
- * @param Array $x
- * @param Array $n
- * @return Array
- */
- function _regularBarrett($x, $n)
- {
- static $cache = array(
- MATH_BIGINTEGER_VARIABLE => array(),
- MATH_BIGINTEGER_DATA => array()
- );
-
- $n_length = count($n);
-
- if (count($x) > 2 * $n_length) {
- $lhs = new Math_BigInteger();
- $rhs = new Math_BigInteger();
- $lhs->value = $x;
- $rhs->value = $n;
- list(, $temp) = $lhs->divide($rhs);
- return $temp->value;
- }
-
- if ( ($key = array_search($n, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {
- $key = count($cache[MATH_BIGINTEGER_VARIABLE]);
- $cache[MATH_BIGINTEGER_VARIABLE][] = $n;
- $lhs = new Math_BigInteger();
- $lhs_value = &$lhs->value;
- $lhs_value = $this->_array_repeat(0, 2 * $n_length);
- $lhs_value[] = 1;
- $rhs = new Math_BigInteger();
- $rhs->value = $n;
- list($temp, ) = $lhs->divide($rhs); // m.length
- $cache[MATH_BIGINTEGER_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[MATH_BIGINTEGER_DATA][$key], false);
- // (2 * m.length + 1) - (m.length - 1) = m.length + 2
- $temp = array_slice($temp[MATH_BIGINTEGER_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[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_SIGN]) < 0) {
- $corrector_value = $this->_array_repeat(0, $n_length + 1);
- $corrector_value[] = 1;
- $result = $this->_add($result, false, $corrector, false);
- $result = $result[MATH_BIGINTEGER_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[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_SIGN]);
- while ($this->_compare($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $n, false) > 0) {
- $result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $n, false);
- }
-
- return $result[MATH_BIGINTEGER_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.
- *
- * @see _regularBarrett()
- * @param Array $x_value
- * @param Boolean $x_negative
- * @param Array $y_value
- * @param Boolean $y_negative
- * @return Array
- * @access private
- */
- 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 ) { // a 0 is being multiplied
- return array(
- MATH_BIGINTEGER_VALUE => array(),
- MATH_BIGINTEGER_SIGN => false
- );
- }
-
- 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, $k = $i
- $temp = $x_value[$j] * $y_value[0] + $carry; // $product_value[$k] == 0
- $carry = (int) ($temp / 0x4000000);
- $product_value[$j] = (int) ($temp - 0x4000000 * $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 = (int) ($temp / 0x4000000);
- $product_value[$k] = (int) ($temp - 0x4000000 * $carry);
- }
-
- if ($k < $stop) {
- $product_value[$k] = $carry;
- }
- }
-
- return array(
- MATH_BIGINTEGER_VALUE => $this->_trim($product_value),
- MATH_BIGINTEGER_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.
- *
- * @see _prepMontgomery()
- * @see _slidingWindow()
- * @access private
- * @param Array $x
- * @param Array $n
- * @return Array
- */
- function _montgomery($x, $n)
- {
- static $cache = array(
- MATH_BIGINTEGER_VARIABLE => array(),
- MATH_BIGINTEGER_DATA => array()
- );
-
- if ( ($key = array_search($n, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {
- $key = count($cache[MATH_BIGINTEGER_VARIABLE]);
- $cache[MATH_BIGINTEGER_VARIABLE][] = $x;
- $cache[MATH_BIGINTEGER_DATA][] = $this->_modInverse67108864($n);
- }
-
- $k = count($n);
-
- $result = array(MATH_BIGINTEGER_VALUE => $x);
-
- for ($i = 0; $i < $k; ++$i) {
- $temp = $result[MATH_BIGINTEGER_VALUE][$i] * $cache[MATH_BIGINTEGER_DATA][$key];
- $temp = (int) ($temp - 0x4000000 * ((int) ($temp / 0x4000000)));
- $temp = $this->_regularMultiply(array($temp), $n);
- $temp = array_merge($this->_array_repeat(0, $i), $temp);
- $result = $this->_add($result[MATH_BIGINTEGER_VALUE], false, $temp, false);
- }
-
- $result[MATH_BIGINTEGER_VALUE] = array_slice($result[MATH_BIGINTEGER_VALUE], $k);
-
- if ($this->_compare($result, false, $n, false) >= 0) {
- $result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], false, $n, false);
- }
-
- return $result[MATH_BIGINTEGER_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}
- *
- * @see _prepMontgomery()
- * @see _montgomery()
- * @access private
- * @param Array $x
- * @param Array $y
- * @param Array $m
- * @return Array
- */
- function _montgomeryMultiply($x, $y, $m)
- {
- $temp = $this->_multiply($x, false, $y, false);
- return $this->_montgomery($temp[MATH_BIGINTEGER_VALUE], $m);
-
- static $cache = array(
- MATH_BIGINTEGER_VARIABLE => array(),
- MATH_BIGINTEGER_DATA => array()
- );
-
- if ( ($key = array_search($m, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {
- $key = count($cache[MATH_BIGINTEGER_VARIABLE]);
- $cache[MATH_BIGINTEGER_VARIABLE][] = $m;
- $cache[MATH_BIGINTEGER_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(MATH_BIGINTEGER_VALUE => $this->_array_repeat(0, $n + 1));
- for ($i = 0; $i < $n; ++$i) {
- $temp = $a[MATH_BIGINTEGER_VALUE][0] + $x[$i] * $y[0];
- $temp = (int) ($temp - 0x4000000 * ((int) ($temp / 0x4000000)));
- $temp = $temp * $cache[MATH_BIGINTEGER_DATA][$key];
- $temp = (int) ($temp - 0x4000000 * ((int) ($temp / 0x4000000)));
- $temp = $this->_add($this->_regularMultiply(array($x[$i]), $y), false, $this->_regularMultiply(array($temp), $m), false);
- $a = $this->_add($a[MATH_BIGINTEGER_VALUE], false, $temp[MATH_BIGINTEGER_VALUE], false);
- $a[MATH_BIGINTEGER_VALUE] = array_slice($a[MATH_BIGINTEGER_VALUE], 1);
- }
- if ($this->_compare($a[MATH_BIGINTEGER_VALUE], false, $m, false) >= 0) {
- $a = $this->_subtract($a[MATH_BIGINTEGER_VALUE], false, $m, false);
- }
- return $a[MATH_BIGINTEGER_VALUE];
- }
-
- /**
- * Prepare a number for use in Montgomery Modular Reductions
- *
- * @see _montgomery()
- * @see _slidingWindow()
- * @access private
- * @param Array $x
- * @param Array $n
- * @return Array
- */
- function _prepMontgomery($x, $n)
- {
- $lhs = new Math_BigInteger();
- $lhs->value = array_merge($this->_array_repeat(0, count($n)), $x);
- $rhs = new Math_BigInteger();
- $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!
- *
- * @see _montgomery()
- * @access private
- * @param Array $x
- * @return Integer
- */
- function _modInverse67108864($x) // 2**26 == 67108864
- {
- $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, 0x4000000)), 0x4000000); // x**-1 mod 2**26
- return $result & 0x3FFFFFF;
- }
-
- /**
- * 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
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger(30);
- * $b = new 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 Math_BigInteger $n
- * @return mixed false, if no modular inverse exists, Math_BigInteger, otherwise.
- * @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 MATH_BIGINTEGER_MODE_GMP:
- $temp = new Math_BigInteger();
- $temp->value = gmp_invert($this->value, $n->value);
-
- return ( $temp->value === false ) ? false : $this->_normalize($temp);
- }
-
- static $zero, $one;
- if (!isset($zero)) {
- $zero = new Math_BigInteger();
- $one = new Math_BigInteger(1);
- }
-
- // $x mod $n == $x mod -$n.
- $n = $n->abs();
-
- if ($this->compare($zero) < 0) {
- $temp = $this->abs();
- $temp = $temp->modInverse($n);
- return $negated === false ? false : $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 Bézout's identity.
- *
- * Say you have 693 and 609. The GCD is 21. Bézout'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 dependant upon which mode is in use. See
- * {@link http://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity Bézout's identity - Wikipedia} for more information.
- *
- * Here's an example:
- * <code>
- * <?php
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger(693);
- * $b = new 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 Math_BigInteger $n
- * @return 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 MATH_BIGINTEGER_MODE_GMP:
- extract(gmp_gcdext($this->value, $n->value));
-
- return array(
- 'gcd' => $this->_normalize(new Math_BigInteger($g)),
- 'x' => $this->_normalize(new Math_BigInteger($s)),
- 'y' => $this->_normalize(new Math_BigInteger($t))
- );
- case MATH_BIGINTEGER_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 Math_BigInteger($u)),
- 'x' => $this->_normalize(new Math_BigInteger($a)),
- 'y' => $this->_normalize(new Math_BigInteger($b))
- );
- }
-
- $y = $n->copy();
- $x = $this->copy();
- $g = new Math_BigInteger();
- $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 Math_BigInteger();
- $b = new Math_BigInteger();
- $c = new Math_BigInteger();
- $d = new Math_BigInteger();
-
- $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
- * include('Math/BigInteger.php');
- *
- * $a = new Math_BigInteger(693);
- * $b = new Math_BigInteger(609);
- *
- * $gcd = a->extendedGCD($b);
- *
- * echo $gcd->toString() . "\r\n"; // outputs 21
- * ?>
- * </code>
- *
- * @param Math_BigInteger $n
- * @return Math_BigInteger
- * @access public
- */
- function gcd($n)
- {
- extract($this->extendedGCD($n));
- return $gcd;
- }
-
- /**
- * Absolute value.
- *
- * @return Math_BigInteger
- * @access public
- */
- function abs()
- {
- $temp = new Math_BigInteger();
-
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $temp->value = gmp_abs($this->value);
- break;
- case MATH_BIGINTEGER_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 Math_BigInteger $x
- * @return Integer < 0 if $this is less than $x; > 0 if $this is greater than $x, and 0 if they are equal.
- * @access public
- * @see 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 MATH_BIGINTEGER_MODE_GMP:
- return gmp_cmp($this->value, $y->value);
- case MATH_BIGINTEGER_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 Boolean $x_negative
- * @param Array $y_value
- * @param Boolean $y_negative
- * @return Integer
- * @see 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 Math_BigInteger::compare()
- *
- * @param Math_BigInteger $x
- * @return Boolean
- * @access public
- * @see compare()
- */
- function equals($x)
- {
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_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 Math_BigInteger $x
- * @access public
- * @return Math_BigInteger
- */
- function setPrecision($bits)
- {
- $this->precision = $bits;
- if ( MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_BCMATH ) {
- $this->bitmask = new Math_BigInteger(chr((1 << ($bits & 0x7)) - 1) . str_repeat(chr(0xFF), $bits >> 3), 256);
- } else {
- $this->bitmask = new Math_BigInteger(bcpow('2', $bits, 0));
- }
-
- $temp = $this->_normalize($this);
- $this->value = $temp->value;
- }
-
- /**
- * Logical And
- *
- * @param Math_BigInteger $x
- * @access public
- * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
- * @return Math_BigInteger
- */
- function bitwise_and($x)
- {
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $temp = new Math_BigInteger();
- $temp->value = gmp_and($this->value, $x->value);
-
- return $this->_normalize($temp);
- case MATH_BIGINTEGER_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 Math_BigInteger($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] = $result->value[$i] & $x->value[$i];
- }
-
- return $this->_normalize($result);
- }
-
- /**
- * Logical Or
- *
- * @param Math_BigInteger $x
- * @access public
- * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
- * @return Math_BigInteger
- */
- function bitwise_or($x)
- {
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $temp = new Math_BigInteger();
- $temp->value = gmp_or($this->value, $x->value);
-
- return $this->_normalize($temp);
- case MATH_BIGINTEGER_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 Math_BigInteger($left | $right, 256));
- }
-
- $length = max(count($this->value), count($x->value));
- $result = $this->copy();
- $result->value = array_pad($result->value, 0, $length);
- $x->value = array_pad($x->value, 0, $length);
-
- for ($i = 0; $i < $length; ++$i) {
- $result->value[$i] = $this->value[$i] | $x->value[$i];
- }
-
- return $this->_normalize($result);
- }
-
- /**
- * Logical Exclusive-Or
- *
- * @param Math_BigInteger $x
- * @access public
- * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
- * @return Math_BigInteger
- */
- function bitwise_xor($x)
- {
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- $temp = new Math_BigInteger();
- $temp->value = gmp_xor($this->value, $x->value);
-
- return $this->_normalize($temp);
- case MATH_BIGINTEGER_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 Math_BigInteger($left ^ $right, 256));
- }
-
- $length = max(count($this->value), count($x->value));
- $result = $this->copy();
- $result->value = array_pad($result->value, 0, $length);
- $x->value = array_pad($x->value, 0, $length);
-
- for ($i = 0; $i < $length; ++$i) {
- $result->value[$i] = $this->value[$i] ^ $x->value[$i];
- }
-
- return $this->_normalize($result);
- }
-
- /**
- * Logical Not
- *
- * @access public
- * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
- * @return Math_BigInteger
- */
- 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();
- $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 Math_BigInteger($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, ceil($this->bits / 8), chr(0), STR_PAD_LEFT);
-
- return $this->_normalize(new Math_BigInteger($leading_ones | $temp, 256));
- }
-
- /**
- * Logical Right Shift
- *
- * Shifts BigInteger's by $shift bits, effectively dividing by 2**$shift.
- *
- * @param Integer $shift
- * @return Math_BigInteger
- * @access public
- * @internal The only version that yields any speed increases is the internal version.
- */
- function bitwise_rightShift($shift)
- {
- $temp = new Math_BigInteger();
-
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- static $two;
-
- if (!isset($two)) {
- $two = gmp_init('2');
- }
-
- $temp->value = gmp_div_q($this->value, gmp_pow($two, $shift));
-
- break;
- case MATH_BIGINTEGER_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 Integer $shift
- * @return Math_BigInteger
- * @access public
- * @internal The only version that yields any speed increases is the internal version.
- */
- function bitwise_leftShift($shift)
- {
- $temp = new Math_BigInteger();
-
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- static $two;
-
- if (!isset($two)) {
- $two = gmp_init('2');
- }
-
- $temp->value = gmp_mul($this->value, gmp_pow($two, $shift));
-
- break;
- case MATH_BIGINTEGER_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 Integer $shift
- * @return Math_BigInteger
- * @access public
- */
- function bitwise_leftRotate($shift)
- {
- $bits = $this->toBytes();
-
- if ($this->precision > 0) {
- $precision = $this->precision;
- if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_BCMATH ) {
- $mask = $this->bitmask->subtract(new Math_BigInteger(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 Math_BigInteger($mask, 256));
- $right = $this->bitwise_rightShift($precision - $shift);
- $result = MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_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 Integer $shift
- * @return Math_BigInteger
- * @access public
- */
- function bitwise_rightRotate($shift)
- {
- return $this->bitwise_leftRotate(-$shift);
- }
-
- /**
- * Set random number generator function
- *
- * $generator should be the name of a random generating function whose first parameter is the minimum
- * value and whose second parameter is the maximum value. If this function needs to be seeded, it should
- * be seeded prior to calling Math_BigInteger::random() or Math_BigInteger::randomPrime()
- *
- * If the random generating function is not explicitly set, it'll be assumed to be mt_rand().
- *
- * @see random()
- * @see randomPrime()
- * @param optional String $generator
- * @access public
- */
- function setRandomGenerator($generator)
- {
- $this->generator = $generator;
- }
-
- /**
- * Generate a random number
- *
- * @param optional Integer $min
- * @param optional Integer $max
- * @return Math_BigInteger
- * @access public
- */
- function random($min = false, $max = false)
- {
- if ($min === false) {
- $min = new Math_BigInteger(0);
- }
-
- if ($max === false) {
- $max = new Math_BigInteger(0x7FFFFFFF);
- }
-
- $compare = $max->compare($min);
-
- if (!$compare) {
- return $this->_normalize($min);
- } else if ($compare < 0) {
- // if $min is bigger then $max, swap $min and $max
- $temp = $max;
- $max = $min;
- $min = $temp;
- }
-
- $generator = $this->generator;
-
- $max = $max->subtract($min);
- $max = ltrim($max->toBytes(), chr(0));
- $size = strlen($max) - 1;
- $random = '';
-
- $bytes = $size & 1;
- for ($i = 0; $i < $bytes; ++$i) {
- $random.= chr($generator(0, 255));
- }
-
- $blocks = $size >> 1;
- for ($i = 0; $i < $blocks; ++$i) {
- // mt_rand(-2147483648, 0x7FFFFFFF) always produces -2147483648 on some systems
- $random.= pack('n', $generator(0, 0xFFFF));
- }
-
- $temp = new Math_BigInteger($random, 256);
- if ($temp->compare(new Math_BigInteger(substr($max, 1), 256)) > 0) {
- $random = chr($generator(0, ord($max[0]) - 1)) . $random;
- } else {
- $random = chr($generator(0, ord($max[0]) )) . $random;
- }
-
- $random = new Math_BigInteger($random, 256);
-
- 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 optional Integer $min
- * @param optional Integer $max
- * @param optional Integer $timeout
- * @return Math_BigInteger
- * @access public
- * @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap4.pdf#page=15 HAC 4.44}.
- */
- function randomPrime($min = false, $max = false, $timeout = false)
- {
- $compare = $max->compare($min);
-
- if (!$compare) {
- return $min;
- } else if ($compare < 0) {
- // if $min is bigger then $max, swap $min and $max
- $temp = $max;
- $max = $min;
- $min = $temp;
- }
-
- // gmp_nextprime() requires PHP 5 >= 5.2.0 per <http://php.net/gmp-nextprime>.
- if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_GMP && function_exists('gmp_nextprime') ) {
- // we don't rely on Math_BigInteger::random()'s min / max when gmp_nextprime() is being used since this function
- // does its own checks on $max / $min when gmp_nextprime() is used. When gmp_nextprime() is not used, however,
- // the same $max / $min checks are not performed.
- if ($min === false) {
- $min = new Math_BigInteger(0);
- }
-
- if ($max === false) {
- $max = new Math_BigInteger(0x7FFFFFFF);
- }
-
- $x = $this->random($min, $max);
-
- $x->value = gmp_nextprime($x->value);
-
- if ($x->compare($max) <= 0) {
- return $x;
- }
-
- $x->value = gmp_nextprime($min->value);
-
- if ($x->compare($max) <= 0) {
- return $x;
- }
-
- return false;
- }
-
- static $one, $two;
- if (!isset($one)) {
- $one = new Math_BigInteger(1);
- $two = new Math_BigInteger(2);
- }
-
- $start = time();
-
- $x = $this->random($min, $max);
- 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 randomPrime()
- * @access private
- */
- function _make_odd()
- {
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- gmp_setbit($this->value, 0);
- break;
- case MATH_BIGINTEGER_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. Math_BigInteger::randomPrime() can be distributed accross multiple pageloads
- * on a website instead of just one.
- *
- * @param optional Integer $t
- * @return Boolean
- * @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)"
- 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; }
- }
-
- // ie. gmp_testbit($this, 0)
- // ie. isEven() or !isOdd()
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- return gmp_prob_prime($this->value, $t) != 0;
- case MATH_BIGINTEGER_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 != MATH_BIGINTEGER_MODE_INTERNAL ) {
- for ($i = 0; $i < count($primes); ++$i) {
- $primes[$i] = new Math_BigInteger($primes[$i]);
- }
- }
-
- $zero = new Math_BigInteger();
- $one = new Math_BigInteger(1);
- $two = new Math_BigInteger(2);
- }
-
- if ($this->equals($one)) {
- return false;
- }
-
- // see HAC 4.4.1 "Random search for probable primes"
- if ( MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_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 == MATH_BIGINTEGER_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 - 1;
- $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 Integer $shift
- * @access private
- */
- function _lshift($shift)
- {
- if ( $shift == 0 ) {
- return;
- }
-
- $num_digits = (int) ($shift / 26);
- $shift %= 26;
- $shift = 1 << $shift;
-
- $carry = 0;
-
- for ($i = 0; $i < count($this->value); ++$i) {
- $temp = $this->value[$i] * $shift + $carry;
- $carry = (int) ($temp / 0x4000000);
- $this->value[$i] = (int) ($temp - $carry * 0x4000000);
- }
-
- if ( $carry ) {
- $this->value[] = $carry;
- }
-
- while ($num_digits--) {
- array_unshift($this->value, 0);
- }
- }
-
- /**
- * Logical Right Shift
- *
- * Shifts BigInteger's by $shift bits.
- *
- * @param Integer $shift
- * @access private
- */
- function _rshift($shift)
- {
- if ($shift == 0) {
- return;
- }
-
- $num_digits = (int) ($shift / 26);
- $shift %= 26;
- $carry_shift = 26 - $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 Math_BigInteger
- * @return Math_BigInteger
- * @see _trim()
- * @access private
- */
- function _normalize($result)
- {
- $result->precision = $this->precision;
- $result->bitmask = $this->bitmask;
-
- switch ( MATH_BIGINTEGER_MODE ) {
- case MATH_BIGINTEGER_MODE_GMP:
- if (!empty($result->bitmask->value)) {
- $result->value = gmp_and($result->value, $result->bitmask->value);
- }
-
- return $result;
- case MATH_BIGINTEGER_MODE_BCMATH:
- if (!empty($result->bitmask->value)) {
- $result->value = bcmod($result->value, $result->bitmask->value);
- }
-
- return $result;
- }
-
- $value = &$result->value;
-
- if ( !count($value) ) {
- 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
- *
- * @return 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 $input Array
- * @param $multiplier mixed
- * @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 $x String
- * @param $shift Integer
- * @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 $x String
- * @param $shift Integer
- * @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 Integer $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 Integer
- * @access private
- */
- function _bytes2int($x)
- {
- $temp = unpack('Nint', str_pad($x, 4, chr(0), STR_PAD_LEFT));
- return $temp['int'];
- }
-}
\ No newline at end of file
+<?php\r
+/* vim: set expandtab tabstop=4 shiftwidth=4 softtabstop=4: */\r
+\r
+/**\r
+ * Pure-PHP arbitrary precision integer arithmetic library.\r
+ *\r
+ * Supports base-2, base-10, base-16, and base-256 numbers. Uses the GMP or BCMath extensions, if available,\r
+ * and an internal implementation, otherwise.\r
+ *\r
+ * PHP versions 4 and 5\r
+ *\r
+ * {@internal (all DocBlock comments regarding implementation - such as the one that follows - refer to the \r
+ * {@link MATH_BIGINTEGER_MODE_INTERNAL MATH_BIGINTEGER_MODE_INTERNAL} mode)\r
+ *\r
+ * Math_BigInteger uses base-2**26 to perform operations such as multiplication and division and\r
+ * base-2**52 (ie. two base 2**26 digits) to perform addition and subtraction. Because the largest possible\r
+ * value when multiplying two base-2**26 numbers together is a base-2**52 number, double precision floating\r
+ * point numbers - numbers that should be supported on most hardware and whose significand is 53 bits - are\r
+ * used. As a consequence, bitwise operators such as >> and << cannot be used, nor can the modulo operator %,\r
+ * which only supports integers. Although this fact will slow this library down, the fact that such a high\r
+ * base is being used should more than compensate.\r
+ *\r
+ * When PHP version 6 is officially released, we'll be able to use 64-bit integers. This should, once again,\r
+ * allow bitwise operators, and will increase the maximum possible base to 2**31 (or 2**62 for addition /\r
+ * subtraction).\r
+ *\r
+ * Numbers are stored in {@link http://en.wikipedia.org/wiki/Endianness little endian} format. ie.\r
+ * (new Math_BigInteger(pow(2, 26)))->value = array(0, 1)\r
+ *\r
+ * Useful resources are as follows:\r
+ *\r
+ * - {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf Handbook of Applied Cryptography (HAC)}\r
+ * - {@link http://math.libtomcrypt.com/files/tommath.pdf Multi-Precision Math (MPM)}\r
+ * - Java's BigInteger classes. See /j2se/src/share/classes/java/math in jdk-1_5_0-src-jrl.zip\r
+ *\r
+ * Here's an example of how to use this library:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger(2);\r
+ * $b = new Math_BigInteger(3);\r
+ *\r
+ * $c = $a->add($b);\r
+ *\r
+ * echo $c->toString(); // outputs 5\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * LICENSE: Permission is hereby granted, free of charge, to any person obtaining a copy\r
+ * of this software and associated documentation files (the "Software"), to deal\r
+ * in the Software without restriction, including without limitation the rights\r
+ * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\r
+ * copies of the Software, and to permit persons to whom the Software is\r
+ * furnished to do so, subject to the following conditions:\r
+ * \r
+ * The above copyright notice and this permission notice shall be included in\r
+ * all copies or substantial portions of the Software.\r
+ * \r
+ * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\r
+ * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\r
+ * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\r
+ * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\r
+ * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\r
+ * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\r
+ * THE SOFTWARE.\r
+ *\r
+ * @category Math\r
+ * @package Math_BigInteger\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @copyright MMVI Jim Wigginton\r
+ * @license http://www.opensource.org/licenses/mit-license.html MIT License\r
+ * @link http://pear.php.net/package/Math_BigInteger\r
+ */\r
+\r
+/**#@+\r
+ * Reduction constants\r
+ *\r
+ * @access private\r
+ * @see Math_BigInteger::_reduce()\r
+ */\r
+/**\r
+ * @see Math_BigInteger::_montgomery()\r
+ * @see Math_BigInteger::_prepMontgomery()\r
+ */\r
+define('MATH_BIGINTEGER_MONTGOMERY', 0);\r
+/**\r
+ * @see Math_BigInteger::_barrett()\r
+ */\r
+define('MATH_BIGINTEGER_BARRETT', 1);\r
+/**\r
+ * @see Math_BigInteger::_mod2()\r
+ */\r
+define('MATH_BIGINTEGER_POWEROF2', 2);\r
+/**\r
+ * @see Math_BigInteger::_remainder()\r
+ */\r
+define('MATH_BIGINTEGER_CLASSIC', 3);\r
+/**\r
+ * @see Math_BigInteger::__clone()\r
+ */\r
+define('MATH_BIGINTEGER_NONE', 4);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * Array constants\r
+ *\r
+ * Rather than create a thousands and thousands of new Math_BigInteger objects in repeated function calls to add() and\r
+ * multiply() or whatever, we'll just work directly on arrays, taking them in as parameters and returning them.\r
+ *\r
+ * @access private\r
+ */\r
+/**\r
+ * $result[MATH_BIGINTEGER_VALUE] contains the value.\r
+ */\r
+define('MATH_BIGINTEGER_VALUE', 0);\r
+/**\r
+ * $result[MATH_BIGINTEGER_SIGN] contains the sign.\r
+ */\r
+define('MATH_BIGINTEGER_SIGN', 1);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * @access private\r
+ * @see Math_BigInteger::_montgomery()\r
+ * @see Math_BigInteger::_barrett()\r
+ */\r
+/**\r
+ * Cache constants\r
+ *\r
+ * $cache[MATH_BIGINTEGER_VARIABLE] tells us whether or not the cached data is still valid.\r
+ */\r
+define('MATH_BIGINTEGER_VARIABLE', 0);\r
+/**\r
+ * $cache[MATH_BIGINTEGER_DATA] contains the cached data.\r
+ */\r
+define('MATH_BIGINTEGER_DATA', 1);\r
+/**#@-*/\r
+\r
+/**#@+\r
+ * Mode constants.\r
+ *\r
+ * @access private\r
+ * @see Math_BigInteger::Math_BigInteger()\r
+ */\r
+/**\r
+ * To use the pure-PHP implementation\r
+ */\r
+define('MATH_BIGINTEGER_MODE_INTERNAL', 1);\r
+/**\r
+ * To use the BCMath library\r
+ *\r
+ * (if enabled; otherwise, the internal implementation will be used)\r
+ */\r
+define('MATH_BIGINTEGER_MODE_BCMATH', 2);\r
+/**\r
+ * To use the GMP library\r
+ *\r
+ * (if present; otherwise, either the BCMath or the internal implementation will be used)\r
+ */\r
+define('MATH_BIGINTEGER_MODE_GMP', 3);\r
+/**#@-*/\r
+\r
+/**\r
+ * Karatsuba Cutoff\r
+ *\r
+ * At what point do we switch between Karatsuba multiplication and schoolbook long multiplication?\r
+ *\r
+ * @access private\r
+ */\r
+define('MATH_BIGINTEGER_KARATSUBA_CUTOFF', 25);\r
+\r
+/**\r
+ * Pure-PHP arbitrary precision integer arithmetic library. Supports base-2, base-10, base-16, and base-256\r
+ * numbers.\r
+ *\r
+ * @author Jim Wigginton <terrafrost@php.net>\r
+ * @version 1.0.0RC4\r
+ * @access public\r
+ * @package Math_BigInteger\r
+ */\r
+class Math_BigInteger {\r
+ /**\r
+ * Holds the BigInteger's value.\r
+ *\r
+ * @var Array\r
+ * @access private\r
+ */\r
+ var $value;\r
+\r
+ /**\r
+ * Holds the BigInteger's magnitude.\r
+ *\r
+ * @var Boolean\r
+ * @access private\r
+ */\r
+ var $is_negative = false;\r
+\r
+ /**\r
+ * Random number generator function\r
+ *\r
+ * @see setRandomGenerator()\r
+ * @access private\r
+ */\r
+ var $generator = 'mt_rand';\r
+\r
+ /**\r
+ * Precision\r
+ *\r
+ * @see setPrecision()\r
+ * @access private\r
+ */\r
+ var $precision = -1;\r
+\r
+ /**\r
+ * Precision Bitmask\r
+ *\r
+ * @see setPrecision()\r
+ * @access private\r
+ */\r
+ var $bitmask = false;\r
+\r
+ /**\r
+ * Mode independent value used for serialization.\r
+ *\r
+ * If the bcmath or gmp extensions are installed $this->value will be a non-serializable resource, hence the need for \r
+ * a variable that'll be serializable regardless of whether or not extensions are being used. Unlike $this->value,\r
+ * however, $this->hex is only calculated when $this->__sleep() is called.\r
+ *\r
+ * @see __sleep()\r
+ * @see __wakeup()\r
+ * @var String\r
+ * @access private\r
+ */\r
+ var $hex;\r
+\r
+ /**\r
+ * Converts base-2, base-10, base-16, and binary strings (base-256) to BigIntegers.\r
+ *\r
+ * If the second parameter - $base - is negative, then it will be assumed that the number's are encoded using\r
+ * two's compliment. The sole exception to this is -10, which is treated the same as 10 is.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('0x32', 16); // 50 in base-16\r
+ *\r
+ * echo $a->toString(); // outputs 50\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param optional $x base-10 number or base-$base number if $base set.\r
+ * @param optional integer $base\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ */\r
+ function Math_BigInteger($x = 0, $base = 10)\r
+ {\r
+ if ( !defined('MATH_BIGINTEGER_MODE') ) {\r
+ switch (true) {\r
+ case extension_loaded('gmp'):\r
+ define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_GMP);\r
+ break;\r
+ case extension_loaded('bcmath'):\r
+ define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_BCMATH);\r
+ break;\r
+ default:\r
+ define('MATH_BIGINTEGER_MODE', MATH_BIGINTEGER_MODE_INTERNAL);\r
+ }\r
+ }\r
+\r
+ if (function_exists('openssl_public_encrypt') && !defined('MATH_BIGINTEGER_OPENSSL_DISABLE') && !defined('MATH_BIGINTEGER_OPENSSL_ENABLED')) {\r
+ define('MATH_BIGINTEGER_OPENSSL_ENABLED', true);\r
+ }\r
+\r
+ if (!defined('PHP_INT_SIZE')) {\r
+ define('PHP_INT_SIZE', 4);\r
+ }\r
+\r
+ if (!defined('MATH_BIGINTEGER_BASE') && MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_INTERNAL) {\r
+ switch (PHP_INT_SIZE) {\r
+ case 8: // use 64-bit integers if int size is 8 bytes\r
+ define('MATH_BIGINTEGER_BASE', 31);\r
+ define('MATH_BIGINTEGER_BASE_FULL', 0x80000000);\r
+ define('MATH_BIGINTEGER_MAX_DIGIT', 0x7FFFFFFF);\r
+ define('MATH_BIGINTEGER_MSB', 0x40000000);\r
+ // 10**9 is the closest we can get to 2**31 without passing it\r
+ define('MATH_BIGINTEGER_MAX10', 1000000000);\r
+ define('MATH_BIGINTEGER_MAX10_LEN', 9);\r
+ // the largest digit that may be used in addition / subtraction\r
+ define('MATH_BIGINTEGER_MAX_DIGIT2', pow(2, 62));\r
+ break;\r
+ //case 4: // use 64-bit floats if int size is 4 bytes\r
+ default:\r
+ define('MATH_BIGINTEGER_BASE', 26);\r
+ define('MATH_BIGINTEGER_BASE_FULL', 0x4000000);\r
+ define('MATH_BIGINTEGER_MAX_DIGIT', 0x3FFFFFF);\r
+ define('MATH_BIGINTEGER_MSB', 0x2000000);\r
+ // 10**7 is the closest to 2**26 without passing it\r
+ define('MATH_BIGINTEGER_MAX10', 10000000);\r
+ define('MATH_BIGINTEGER_MAX10_LEN', 7);\r
+ // the largest digit that may be used in addition / subtraction\r
+ // we do pow(2, 52) instead of using 4503599627370496 directly because some\r
+ // PHP installations will truncate 4503599627370496.\r
+ define('MATH_BIGINTEGER_MAX_DIGIT2', pow(2, 52));\r
+ }\r
+ }\r
+\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ if (is_resource($x) && get_resource_type($x) == 'GMP integer') {\r
+ $this->value = $x;\r
+ return;\r
+ }\r
+ $this->value = gmp_init(0);\r
+ break;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $this->value = '0';\r
+ break;\r
+ default:\r
+ $this->value = array();\r
+ }\r
+\r
+ // '0' counts as empty() but when the base is 256 '0' is equal to ord('0') or 48\r
+ // '0' is the only value like this per http://php.net/empty\r
+ if (empty($x) && (abs($base) != 256 || $x !== '0')) {\r
+ return;\r
+ }\r
+\r
+ switch ($base) {\r
+ case -256:\r
+ if (ord($x[0]) & 0x80) {\r
+ $x = ~$x;\r
+ $this->is_negative = true;\r
+ }\r
+ case 256:\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $sign = $this->is_negative ? '-' : '';\r
+ $this->value = gmp_init($sign . '0x' . bin2hex($x));\r
+ break;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ // round $len to the nearest 4 (thanks, DavidMJ!)\r
+ $len = (strlen($x) + 3) & 0xFFFFFFFC;\r
+\r
+ $x = str_pad($x, $len, chr(0), STR_PAD_LEFT);\r
+\r
+ for ($i = 0; $i < $len; $i+= 4) {\r
+ $this->value = bcmul($this->value, '4294967296', 0); // 4294967296 == 2**32\r
+ $this->value = bcadd($this->value, 0x1000000 * ord($x[$i]) + ((ord($x[$i + 1]) << 16) | (ord($x[$i + 2]) << 8) | ord($x[$i + 3])), 0);\r
+ }\r
+\r
+ if ($this->is_negative) {\r
+ $this->value = '-' . $this->value;\r
+ }\r
+\r
+ break;\r
+ // converts a base-2**8 (big endian / msb) number to base-2**26 (little endian / lsb)\r
+ default:\r
+ while (strlen($x)) {\r
+ $this->value[] = $this->_bytes2int($this->_base256_rshift($x, MATH_BIGINTEGER_BASE));\r
+ }\r
+ }\r
+\r
+ if ($this->is_negative) {\r
+ if (MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_INTERNAL) {\r
+ $this->is_negative = false;\r
+ }\r
+ $temp = $this->add(new Math_BigInteger('-1'));\r
+ $this->value = $temp->value;\r
+ }\r
+ break;\r
+ case 16:\r
+ case -16:\r
+ if ($base > 0 && $x[0] == '-') {\r
+ $this->is_negative = true;\r
+ $x = substr($x, 1);\r
+ }\r
+\r
+ $x = preg_replace('#^(?:0x)?([A-Fa-f0-9]*).*#', '$1', $x);\r
+\r
+ $is_negative = false;\r
+ if ($base < 0 && hexdec($x[0]) >= 8) {\r
+ $this->is_negative = $is_negative = true;\r
+ $x = bin2hex(~pack('H*', $x));\r
+ }\r
+\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp = $this->is_negative ? '-0x' . $x : '0x' . $x;\r
+ $this->value = gmp_init($temp);\r
+ $this->is_negative = false;\r
+ break;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $x = ( strlen($x) & 1 ) ? '0' . $x : $x;\r
+ $temp = new Math_BigInteger(pack('H*', $x), 256);\r
+ $this->value = $this->is_negative ? '-' . $temp->value : $temp->value;\r
+ $this->is_negative = false;\r
+ break;\r
+ default:\r
+ $x = ( strlen($x) & 1 ) ? '0' . $x : $x;\r
+ $temp = new Math_BigInteger(pack('H*', $x), 256);\r
+ $this->value = $temp->value;\r
+ }\r
+\r
+ if ($is_negative) {\r
+ $temp = $this->add(new Math_BigInteger('-1'));\r
+ $this->value = $temp->value;\r
+ }\r
+ break;\r
+ case 10:\r
+ case -10:\r
+ // (?<!^)(?:-).*: find any -'s that aren't at the beginning and then any characters that follow that\r
+ // (?<=^|-)0*: find any 0's that are preceded by the start of the string or by a - (ie. octals)\r
+ // [^-0-9].*: find any non-numeric characters and then any characters that follow that\r
+ $x = preg_replace('#(?<!^)(?:-).*|(?<=^|-)0*|[^-0-9].*#', '', $x);\r
+\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $this->value = gmp_init($x);\r
+ break;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ // explicitly casting $x to a string is necessary, here, since doing $x[0] on -1 yields different\r
+ // results then doing it on '-1' does (modInverse does $x[0])\r
+ $this->value = $x === '-' ? '0' : (string) $x;\r
+ break;\r
+ default:\r
+ $temp = new Math_BigInteger();\r
+\r
+ $multiplier = new Math_BigInteger();\r
+ $multiplier->value = array(MATH_BIGINTEGER_MAX10);\r
+\r
+ if ($x[0] == '-') {\r
+ $this->is_negative = true;\r
+ $x = substr($x, 1);\r
+ }\r
+\r
+ $x = str_pad($x, strlen($x) + ((MATH_BIGINTEGER_MAX10_LEN - 1) * strlen($x)) % MATH_BIGINTEGER_MAX10_LEN, 0, STR_PAD_LEFT);\r
+\r
+ while (strlen($x)) {\r
+ $temp = $temp->multiply($multiplier);\r
+ $temp = $temp->add(new Math_BigInteger($this->_int2bytes(substr($x, 0, MATH_BIGINTEGER_MAX10_LEN)), 256));\r
+ $x = substr($x, MATH_BIGINTEGER_MAX10_LEN);\r
+ }\r
+\r
+ $this->value = $temp->value;\r
+ }\r
+ break;\r
+ case 2: // base-2 support originally implemented by Lluis Pamies - thanks!\r
+ case -2:\r
+ if ($base > 0 && $x[0] == '-') {\r
+ $this->is_negative = true;\r
+ $x = substr($x, 1);\r
+ }\r
+\r
+ $x = preg_replace('#^([01]*).*#', '$1', $x);\r
+ $x = str_pad($x, strlen($x) + (3 * strlen($x)) % 4, 0, STR_PAD_LEFT);\r
+\r
+ $str = '0x';\r
+ while (strlen($x)) {\r
+ $part = substr($x, 0, 4);\r
+ $str.= dechex(bindec($part));\r
+ $x = substr($x, 4);\r
+ }\r
+\r
+ if ($this->is_negative) {\r
+ $str = '-' . $str;\r
+ }\r
+\r
+ $temp = new Math_BigInteger($str, 8 * $base); // ie. either -16 or +16\r
+ $this->value = $temp->value;\r
+ $this->is_negative = $temp->is_negative;\r
+\r
+ break;\r
+ default:\r
+ // base not supported, so we'll let $this == 0\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Converts a BigInteger to a byte string (eg. base-256).\r
+ *\r
+ * Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're\r
+ * saved as two's compliment.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('65');\r
+ *\r
+ * echo $a->toBytes(); // outputs chr(65)\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Boolean $twos_compliment\r
+ * @return String\r
+ * @access public\r
+ * @internal Converts a base-2**26 number to base-2**8\r
+ */\r
+ function toBytes($twos_compliment = false)\r
+ {\r
+ if ($twos_compliment) {\r
+ $comparison = $this->compare(new Math_BigInteger());\r
+ if ($comparison == 0) {\r
+ return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';\r
+ }\r
+\r
+ $temp = $comparison < 0 ? $this->add(new Math_BigInteger(1)) : $this->copy();\r
+ $bytes = $temp->toBytes();\r
+\r
+ if (empty($bytes)) { // eg. if the number we're trying to convert is -1\r
+ $bytes = chr(0);\r
+ }\r
+\r
+ if (ord($bytes[0]) & 0x80) {\r
+ $bytes = chr(0) . $bytes;\r
+ }\r
+\r
+ return $comparison < 0 ? ~$bytes : $bytes;\r
+ }\r
+\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ if (gmp_cmp($this->value, gmp_init(0)) == 0) {\r
+ return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';\r
+ }\r
+\r
+ $temp = gmp_strval(gmp_abs($this->value), 16);\r
+ $temp = ( strlen($temp) & 1 ) ? '0' . $temp : $temp;\r
+ $temp = pack('H*', $temp);\r
+\r
+ return $this->precision > 0 ?\r
+ substr(str_pad($temp, $this->precision >> 3, chr(0), STR_PAD_LEFT), -($this->precision >> 3)) :\r
+ ltrim($temp, chr(0));\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ if ($this->value === '0') {\r
+ return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';\r
+ }\r
+\r
+ $value = '';\r
+ $current = $this->value;\r
+\r
+ if ($current[0] == '-') {\r
+ $current = substr($current, 1);\r
+ }\r
+\r
+ while (bccomp($current, '0', 0) > 0) {\r
+ $temp = bcmod($current, '16777216');\r
+ $value = chr($temp >> 16) . chr($temp >> 8) . chr($temp) . $value;\r
+ $current = bcdiv($current, '16777216', 0);\r
+ }\r
+\r
+ return $this->precision > 0 ?\r
+ substr(str_pad($value, $this->precision >> 3, chr(0), STR_PAD_LEFT), -($this->precision >> 3)) :\r
+ ltrim($value, chr(0));\r
+ }\r
+\r
+ if (!count($this->value)) {\r
+ return $this->precision > 0 ? str_repeat(chr(0), ($this->precision + 1) >> 3) : '';\r
+ }\r
+ $result = $this->_int2bytes($this->value[count($this->value) - 1]);\r
+\r
+ $temp = $this->copy();\r
+\r
+ for ($i = count($temp->value) - 2; $i >= 0; --$i) {\r
+ $temp->_base256_lshift($result, MATH_BIGINTEGER_BASE);\r
+ $result = $result | str_pad($temp->_int2bytes($temp->value[$i]), strlen($result), chr(0), STR_PAD_LEFT);\r
+ }\r
+\r
+ return $this->precision > 0 ?\r
+ str_pad(substr($result, -(($this->precision + 7) >> 3)), ($this->precision + 7) >> 3, chr(0), STR_PAD_LEFT) :\r
+ $result;\r
+ }\r
+\r
+ /**\r
+ * Converts a BigInteger to a hex string (eg. base-16)).\r
+ *\r
+ * Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're\r
+ * saved as two's compliment.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('65');\r
+ *\r
+ * echo $a->toHex(); // outputs '41'\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Boolean $twos_compliment\r
+ * @return String\r
+ * @access public\r
+ * @internal Converts a base-2**26 number to base-2**8\r
+ */\r
+ function toHex($twos_compliment = false)\r
+ {\r
+ return bin2hex($this->toBytes($twos_compliment));\r
+ }\r
+\r
+ /**\r
+ * Converts a BigInteger to a bit string (eg. base-2).\r
+ *\r
+ * Negative numbers are saved as positive numbers, unless $twos_compliment is set to true, at which point, they're\r
+ * saved as two's compliment.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('65');\r
+ *\r
+ * echo $a->toBits(); // outputs '1000001'\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Boolean $twos_compliment\r
+ * @return String\r
+ * @access public\r
+ * @internal Converts a base-2**26 number to base-2**2\r
+ */\r
+ function toBits($twos_compliment = false)\r
+ {\r
+ $hex = $this->toHex($twos_compliment);\r
+ $bits = '';\r
+ for ($i = strlen($hex) - 8, $start = strlen($hex) & 7; $i >= $start; $i-=8) {\r
+ $bits = str_pad(decbin(hexdec(substr($hex, $i, 8))), 32, '0', STR_PAD_LEFT) . $bits;\r
+ }\r
+ if ($start) { // hexdec('') == 0\r
+ $bits = str_pad(decbin(hexdec(substr($hex, 0, $start))), 8, '0', STR_PAD_LEFT) . $bits;\r
+ }\r
+ $result = $this->precision > 0 ? substr($bits, -$this->precision) : ltrim($bits, '0');\r
+\r
+ if ($twos_compliment && $this->compare(new Math_BigInteger()) > 0 && $this->precision <= 0) {\r
+ return '0' . $result;\r
+ }\r
+\r
+ return $result;\r
+ }\r
+\r
+ /**\r
+ * Converts a BigInteger to a base-10 number.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('50');\r
+ *\r
+ * echo $a->toString(); // outputs 50\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @return String\r
+ * @access public\r
+ * @internal Converts a base-2**26 number to base-10**7 (which is pretty much base-10)\r
+ */\r
+ function toString()\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ return gmp_strval($this->value);\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ if ($this->value === '0') {\r
+ return '0';\r
+ }\r
+\r
+ return ltrim($this->value, '0');\r
+ }\r
+\r
+ if (!count($this->value)) {\r
+ return '0';\r
+ }\r
+\r
+ $temp = $this->copy();\r
+ $temp->is_negative = false;\r
+\r
+ $divisor = new Math_BigInteger();\r
+ $divisor->value = array(MATH_BIGINTEGER_MAX10);\r
+ $result = '';\r
+ while (count($temp->value)) {\r
+ list($temp, $mod) = $temp->divide($divisor);\r
+ $result = str_pad(isset($mod->value[0]) ? $mod->value[0] : '', MATH_BIGINTEGER_MAX10_LEN, '0', STR_PAD_LEFT) . $result;\r
+ }\r
+ $result = ltrim($result, '0');\r
+ if (empty($result)) {\r
+ $result = '0';\r
+ }\r
+\r
+ if ($this->is_negative) {\r
+ $result = '-' . $result;\r
+ }\r
+\r
+ return $result;\r
+ }\r
+\r
+ /**\r
+ * Copy an object\r
+ *\r
+ * PHP5 passes objects by reference while PHP4 passes by value. As such, we need a function to guarantee\r
+ * that all objects are passed by value, when appropriate. More information can be found here:\r
+ *\r
+ * {@link http://php.net/language.oop5.basic#51624}\r
+ *\r
+ * @access public\r
+ * @see __clone()\r
+ * @return Math_BigInteger\r
+ */\r
+ function copy()\r
+ {\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = $this->value;\r
+ $temp->is_negative = $this->is_negative;\r
+ $temp->generator = $this->generator;\r
+ $temp->precision = $this->precision;\r
+ $temp->bitmask = $this->bitmask;\r
+ return $temp;\r
+ }\r
+\r
+ /**\r
+ * __toString() magic method\r
+ *\r
+ * Will be called, automatically, if you're supporting just PHP5. If you're supporting PHP4, you'll need to call\r
+ * toString().\r
+ *\r
+ * @access public\r
+ * @internal Implemented per a suggestion by Techie-Michael - thanks!\r
+ */\r
+ function __toString()\r
+ {\r
+ return $this->toString();\r
+ }\r
+\r
+ /**\r
+ * __clone() magic method\r
+ *\r
+ * Although you can call Math_BigInteger::__toString() directly in PHP5, you cannot call Math_BigInteger::__clone()\r
+ * 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\r
+ * only syntax of $y = clone $x. As such, if you're trying to write an application that works on both PHP4 and PHP5,\r
+ * call Math_BigInteger::copy(), instead.\r
+ *\r
+ * @access public\r
+ * @see copy()\r
+ * @return Math_BigInteger\r
+ */\r
+ function __clone()\r
+ {\r
+ return $this->copy();\r
+ }\r
+\r
+ /**\r
+ * __sleep() magic method\r
+ *\r
+ * Will be called, automatically, when serialize() is called on a Math_BigInteger object.\r
+ *\r
+ * @see __wakeup()\r
+ * @access public\r
+ */\r
+ function __sleep()\r
+ {\r
+ $this->hex = $this->toHex(true);\r
+ $vars = array('hex');\r
+ if ($this->generator != 'mt_rand') {\r
+ $vars[] = 'generator';\r
+ }\r
+ if ($this->precision > 0) {\r
+ $vars[] = 'precision';\r
+ }\r
+ return $vars;\r
+ \r
+ }\r
+\r
+ /**\r
+ * __wakeup() magic method\r
+ *\r
+ * Will be called, automatically, when unserialize() is called on a Math_BigInteger object.\r
+ *\r
+ * @see __sleep()\r
+ * @access public\r
+ */\r
+ function __wakeup()\r
+ {\r
+ $temp = new Math_BigInteger($this->hex, -16);\r
+ $this->value = $temp->value;\r
+ $this->is_negative = $temp->is_negative;\r
+ $this->setRandomGenerator($this->generator);\r
+ if ($this->precision > 0) {\r
+ // recalculate $this->bitmask\r
+ $this->setPrecision($this->precision);\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Adds two BigIntegers.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('10');\r
+ * $b = new Math_BigInteger('20');\r
+ *\r
+ * $c = $a->add($b);\r
+ *\r
+ * echo $c->toString(); // outputs 30\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Math_BigInteger $y\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ * @internal Performs base-2**52 addition\r
+ */\r
+ function add($y)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = gmp_add($this->value, $y->value);\r
+\r
+ return $this->_normalize($temp);\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = bcadd($this->value, $y->value, 0);\r
+\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ $temp = $this->_add($this->value, $this->is_negative, $y->value, $y->is_negative);\r
+\r
+ $result = new Math_BigInteger();\r
+ $result->value = $temp[MATH_BIGINTEGER_VALUE];\r
+ $result->is_negative = $temp[MATH_BIGINTEGER_SIGN];\r
+\r
+ return $this->_normalize($result);\r
+ }\r
+\r
+ /**\r
+ * Performs addition.\r
+ *\r
+ * @param Array $x_value\r
+ * @param Boolean $x_negative\r
+ * @param Array $y_value\r
+ * @param Boolean $y_negative\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _add($x_value, $x_negative, $y_value, $y_negative)\r
+ {\r
+ $x_size = count($x_value);\r
+ $y_size = count($y_value);\r
+\r
+ if ($x_size == 0) {\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => $y_value,\r
+ MATH_BIGINTEGER_SIGN => $y_negative\r
+ );\r
+ } else if ($y_size == 0) {\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => $x_value,\r
+ MATH_BIGINTEGER_SIGN => $x_negative\r
+ );\r
+ }\r
+\r
+ // subtract, if appropriate\r
+ if ( $x_negative != $y_negative ) {\r
+ if ( $x_value == $y_value ) {\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => array(),\r
+ MATH_BIGINTEGER_SIGN => false\r
+ );\r
+ }\r
+\r
+ $temp = $this->_subtract($x_value, false, $y_value, false);\r
+ $temp[MATH_BIGINTEGER_SIGN] = $this->_compare($x_value, false, $y_value, false) > 0 ?\r
+ $x_negative : $y_negative;\r
+\r
+ return $temp;\r
+ }\r
+\r
+ if ($x_size < $y_size) {\r
+ $size = $x_size;\r
+ $value = $y_value;\r
+ } else {\r
+ $size = $y_size;\r
+ $value = $x_value;\r
+ }\r
+\r
+ $value[] = 0; // just in case the carry adds an extra digit\r
+\r
+ $carry = 0;\r
+ for ($i = 0, $j = 1; $j < $size; $i+=2, $j+=2) {\r
+ $sum = $x_value[$j] * MATH_BIGINTEGER_BASE_FULL + $x_value[$i] + $y_value[$j] * MATH_BIGINTEGER_BASE_FULL + $y_value[$i] + $carry;\r
+ $carry = $sum >= MATH_BIGINTEGER_MAX_DIGIT2; // eg. floor($sum / 2**52); only possible values (in any base) are 0 and 1\r
+ $sum = $carry ? $sum - MATH_BIGINTEGER_MAX_DIGIT2 : $sum;\r
+\r
+ $temp = (int) ($sum / MATH_BIGINTEGER_BASE_FULL);\r
+\r
+ $value[$i] = (int) ($sum - MATH_BIGINTEGER_BASE_FULL * $temp); // eg. a faster alternative to fmod($sum, 0x4000000)\r
+ $value[$j] = $temp;\r
+ }\r
+\r
+ if ($j == $size) { // ie. if $y_size is odd\r
+ $sum = $x_value[$i] + $y_value[$i] + $carry;\r
+ $carry = $sum >= MATH_BIGINTEGER_BASE_FULL;\r
+ $value[$i] = $carry ? $sum - MATH_BIGINTEGER_BASE_FULL : $sum;\r
+ ++$i; // ie. let $i = $j since we've just done $value[$i]\r
+ }\r
+\r
+ if ($carry) {\r
+ for (; $value[$i] == MATH_BIGINTEGER_MAX_DIGIT; ++$i) {\r
+ $value[$i] = 0;\r
+ }\r
+ ++$value[$i];\r
+ }\r
+\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => $this->_trim($value),\r
+ MATH_BIGINTEGER_SIGN => $x_negative\r
+ );\r
+ }\r
+\r
+ /**\r
+ * Subtracts two BigIntegers.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('10');\r
+ * $b = new Math_BigInteger('20');\r
+ *\r
+ * $c = $a->subtract($b);\r
+ *\r
+ * echo $c->toString(); // outputs -10\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Math_BigInteger $y\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ * @internal Performs base-2**52 subtraction\r
+ */\r
+ function subtract($y)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = gmp_sub($this->value, $y->value);\r
+\r
+ return $this->_normalize($temp);\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = bcsub($this->value, $y->value, 0);\r
+\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ $temp = $this->_subtract($this->value, $this->is_negative, $y->value, $y->is_negative);\r
+\r
+ $result = new Math_BigInteger();\r
+ $result->value = $temp[MATH_BIGINTEGER_VALUE];\r
+ $result->is_negative = $temp[MATH_BIGINTEGER_SIGN];\r
+\r
+ return $this->_normalize($result);\r
+ }\r
+\r
+ /**\r
+ * Performs subtraction.\r
+ *\r
+ * @param Array $x_value\r
+ * @param Boolean $x_negative\r
+ * @param Array $y_value\r
+ * @param Boolean $y_negative\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _subtract($x_value, $x_negative, $y_value, $y_negative)\r
+ {\r
+ $x_size = count($x_value);\r
+ $y_size = count($y_value);\r
+\r
+ if ($x_size == 0) {\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => $y_value,\r
+ MATH_BIGINTEGER_SIGN => !$y_negative\r
+ );\r
+ } else if ($y_size == 0) {\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => $x_value,\r
+ MATH_BIGINTEGER_SIGN => $x_negative\r
+ );\r
+ }\r
+\r
+ // add, if appropriate (ie. -$x - +$y or +$x - -$y)\r
+ if ( $x_negative != $y_negative ) {\r
+ $temp = $this->_add($x_value, false, $y_value, false);\r
+ $temp[MATH_BIGINTEGER_SIGN] = $x_negative;\r
+\r
+ return $temp;\r
+ }\r
+\r
+ $diff = $this->_compare($x_value, $x_negative, $y_value, $y_negative);\r
+\r
+ if ( !$diff ) {\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => array(),\r
+ MATH_BIGINTEGER_SIGN => false\r
+ );\r
+ }\r
+\r
+ // switch $x and $y around, if appropriate.\r
+ if ( (!$x_negative && $diff < 0) || ($x_negative && $diff > 0) ) {\r
+ $temp = $x_value;\r
+ $x_value = $y_value;\r
+ $y_value = $temp;\r
+\r
+ $x_negative = !$x_negative;\r
+\r
+ $x_size = count($x_value);\r
+ $y_size = count($y_value);\r
+ }\r
+\r
+ // at this point, $x_value should be at least as big as - if not bigger than - $y_value\r
+\r
+ $carry = 0;\r
+ for ($i = 0, $j = 1; $j < $y_size; $i+=2, $j+=2) {\r
+ $sum = $x_value[$j] * MATH_BIGINTEGER_BASE_FULL + $x_value[$i] - $y_value[$j] * MATH_BIGINTEGER_BASE_FULL - $y_value[$i] - $carry;\r
+ $carry = $sum < 0; // eg. floor($sum / 2**52); only possible values (in any base) are 0 and 1\r
+ $sum = $carry ? $sum + MATH_BIGINTEGER_MAX_DIGIT2 : $sum;\r
+\r
+ $temp = (int) ($sum / MATH_BIGINTEGER_BASE_FULL);\r
+\r
+ $x_value[$i] = (int) ($sum - MATH_BIGINTEGER_BASE_FULL * $temp);\r
+ $x_value[$j] = $temp;\r
+ }\r
+\r
+ if ($j == $y_size) { // ie. if $y_size is odd\r
+ $sum = $x_value[$i] - $y_value[$i] - $carry;\r
+ $carry = $sum < 0;\r
+ $x_value[$i] = $carry ? $sum + MATH_BIGINTEGER_BASE_FULL : $sum;\r
+ ++$i;\r
+ }\r
+\r
+ if ($carry) {\r
+ for (; !$x_value[$i]; ++$i) {\r
+ $x_value[$i] = MATH_BIGINTEGER_MAX_DIGIT;\r
+ }\r
+ --$x_value[$i];\r
+ }\r
+\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => $this->_trim($x_value),\r
+ MATH_BIGINTEGER_SIGN => $x_negative\r
+ );\r
+ }\r
+\r
+ /**\r
+ * Multiplies two BigIntegers\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('10');\r
+ * $b = new Math_BigInteger('20');\r
+ *\r
+ * $c = $a->multiply($b);\r
+ *\r
+ * echo $c->toString(); // outputs 200\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Math_BigInteger $x\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ */\r
+ function multiply($x)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = gmp_mul($this->value, $x->value);\r
+\r
+ return $this->_normalize($temp);\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = bcmul($this->value, $x->value, 0);\r
+\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ $temp = $this->_multiply($this->value, $this->is_negative, $x->value, $x->is_negative);\r
+\r
+ $product = new Math_BigInteger();\r
+ $product->value = $temp[MATH_BIGINTEGER_VALUE];\r
+ $product->is_negative = $temp[MATH_BIGINTEGER_SIGN];\r
+\r
+ return $this->_normalize($product);\r
+ }\r
+\r
+ /**\r
+ * Performs multiplication.\r
+ *\r
+ * @param Array $x_value\r
+ * @param Boolean $x_negative\r
+ * @param Array $y_value\r
+ * @param Boolean $y_negative\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _multiply($x_value, $x_negative, $y_value, $y_negative)\r
+ {\r
+ //if ( $x_value == $y_value ) {\r
+ // return array(\r
+ // MATH_BIGINTEGER_VALUE => $this->_square($x_value),\r
+ // MATH_BIGINTEGER_SIGN => $x_sign != $y_value\r
+ // );\r
+ //}\r
+\r
+ $x_length = count($x_value);\r
+ $y_length = count($y_value);\r
+\r
+ if ( !$x_length || !$y_length ) { // a 0 is being multiplied\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => array(),\r
+ MATH_BIGINTEGER_SIGN => false\r
+ );\r
+ }\r
+\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => min($x_length, $y_length) < 2 * MATH_BIGINTEGER_KARATSUBA_CUTOFF ?\r
+ $this->_trim($this->_regularMultiply($x_value, $y_value)) :\r
+ $this->_trim($this->_karatsuba($x_value, $y_value)),\r
+ MATH_BIGINTEGER_SIGN => $x_negative != $y_negative\r
+ );\r
+ }\r
+\r
+ /**\r
+ * Performs long multiplication on two BigIntegers\r
+ *\r
+ * Modeled after 'multiply' in MutableBigInteger.java.\r
+ *\r
+ * @param Array $x_value\r
+ * @param Array $y_value\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _regularMultiply($x_value, $y_value)\r
+ {\r
+ $x_length = count($x_value);\r
+ $y_length = count($y_value);\r
+\r
+ if ( !$x_length || !$y_length ) { // a 0 is being multiplied\r
+ return array();\r
+ }\r
+\r
+ if ( $x_length < $y_length ) {\r
+ $temp = $x_value;\r
+ $x_value = $y_value;\r
+ $y_value = $temp;\r
+\r
+ $x_length = count($x_value);\r
+ $y_length = count($y_value);\r
+ }\r
+\r
+ $product_value = $this->_array_repeat(0, $x_length + $y_length);\r
+\r
+ // the following for loop could be removed if the for loop following it\r
+ // (the one with nested for loops) initially set $i to 0, but\r
+ // doing so would also make the result in one set of unnecessary adds,\r
+ // since on the outermost loops first pass, $product->value[$k] is going\r
+ // to always be 0\r
+\r
+ $carry = 0;\r
+\r
+ for ($j = 0; $j < $x_length; ++$j) { // ie. $i = 0\r
+ $temp = $x_value[$j] * $y_value[0] + $carry; // $product_value[$k] == 0\r
+ $carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);\r
+ $product_value[$j] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);\r
+ }\r
+\r
+ $product_value[$j] = $carry;\r
+\r
+ // the above for loop is what the previous comment was talking about. the\r
+ // following for loop is the "one with nested for loops"\r
+ for ($i = 1; $i < $y_length; ++$i) {\r
+ $carry = 0;\r
+\r
+ for ($j = 0, $k = $i; $j < $x_length; ++$j, ++$k) {\r
+ $temp = $product_value[$k] + $x_value[$j] * $y_value[$i] + $carry;\r
+ $carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);\r
+ $product_value[$k] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);\r
+ }\r
+\r
+ $product_value[$k] = $carry;\r
+ }\r
+\r
+ return $product_value;\r
+ }\r
+\r
+ /**\r
+ * Performs Karatsuba multiplication on two BigIntegers\r
+ *\r
+ * See {@link http://en.wikipedia.org/wiki/Karatsuba_algorithm Karatsuba algorithm} and\r
+ * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=120 MPM 5.2.3}.\r
+ *\r
+ * @param Array $x_value\r
+ * @param Array $y_value\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _karatsuba($x_value, $y_value)\r
+ {\r
+ $m = min(count($x_value) >> 1, count($y_value) >> 1);\r
+\r
+ if ($m < MATH_BIGINTEGER_KARATSUBA_CUTOFF) {\r
+ return $this->_regularMultiply($x_value, $y_value);\r
+ }\r
+\r
+ $x1 = array_slice($x_value, $m);\r
+ $x0 = array_slice($x_value, 0, $m);\r
+ $y1 = array_slice($y_value, $m);\r
+ $y0 = array_slice($y_value, 0, $m);\r
+\r
+ $z2 = $this->_karatsuba($x1, $y1);\r
+ $z0 = $this->_karatsuba($x0, $y0);\r
+\r
+ $z1 = $this->_add($x1, false, $x0, false);\r
+ $temp = $this->_add($y1, false, $y0, false);\r
+ $z1 = $this->_karatsuba($z1[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_VALUE]);\r
+ $temp = $this->_add($z2, false, $z0, false);\r
+ $z1 = $this->_subtract($z1, false, $temp[MATH_BIGINTEGER_VALUE], false);\r
+\r
+ $z2 = array_merge(array_fill(0, 2 * $m, 0), $z2);\r
+ $z1[MATH_BIGINTEGER_VALUE] = array_merge(array_fill(0, $m, 0), $z1[MATH_BIGINTEGER_VALUE]);\r
+\r
+ $xy = $this->_add($z2, false, $z1[MATH_BIGINTEGER_VALUE], $z1[MATH_BIGINTEGER_SIGN]);\r
+ $xy = $this->_add($xy[MATH_BIGINTEGER_VALUE], $xy[MATH_BIGINTEGER_SIGN], $z0, false);\r
+\r
+ return $xy[MATH_BIGINTEGER_VALUE];\r
+ }\r
+\r
+ /**\r
+ * Performs squaring\r
+ *\r
+ * @param Array $x\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _square($x = false)\r
+ {\r
+ return count($x) < 2 * MATH_BIGINTEGER_KARATSUBA_CUTOFF ?\r
+ $this->_trim($this->_baseSquare($x)) :\r
+ $this->_trim($this->_karatsubaSquare($x));\r
+ }\r
+\r
+ /**\r
+ * Performs traditional squaring on two BigIntegers\r
+ *\r
+ * Squaring can be done faster than multiplying a number by itself can be. See\r
+ * {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=7 HAC 14.2.4} /\r
+ * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=141 MPM 5.3} for more information.\r
+ *\r
+ * @param Array $value\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _baseSquare($value)\r
+ {\r
+ if ( empty($value) ) {\r
+ return array();\r
+ }\r
+ $square_value = $this->_array_repeat(0, 2 * count($value));\r
+\r
+ for ($i = 0, $max_index = count($value) - 1; $i <= $max_index; ++$i) {\r
+ $i2 = $i << 1;\r
+\r
+ $temp = $square_value[$i2] + $value[$i] * $value[$i];\r
+ $carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);\r
+ $square_value[$i2] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);\r
+\r
+ // note how we start from $i+1 instead of 0 as we do in multiplication.\r
+ for ($j = $i + 1, $k = $i2 + 1; $j <= $max_index; ++$j, ++$k) {\r
+ $temp = $square_value[$k] + 2 * $value[$j] * $value[$i] + $carry;\r
+ $carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);\r
+ $square_value[$k] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);\r
+ }\r
+\r
+ // the following line can yield values larger 2**15. at this point, PHP should switch\r
+ // over to floats.\r
+ $square_value[$i + $max_index + 1] = $carry;\r
+ }\r
+\r
+ return $square_value;\r
+ }\r
+\r
+ /**\r
+ * Performs Karatsuba "squaring" on two BigIntegers\r
+ *\r
+ * See {@link http://en.wikipedia.org/wiki/Karatsuba_algorithm Karatsuba algorithm} and\r
+ * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=151 MPM 5.3.4}.\r
+ *\r
+ * @param Array $value\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _karatsubaSquare($value)\r
+ {\r
+ $m = count($value) >> 1;\r
+\r
+ if ($m < MATH_BIGINTEGER_KARATSUBA_CUTOFF) {\r
+ return $this->_baseSquare($value);\r
+ }\r
+\r
+ $x1 = array_slice($value, $m);\r
+ $x0 = array_slice($value, 0, $m);\r
+\r
+ $z2 = $this->_karatsubaSquare($x1);\r
+ $z0 = $this->_karatsubaSquare($x0);\r
+\r
+ $z1 = $this->_add($x1, false, $x0, false);\r
+ $z1 = $this->_karatsubaSquare($z1[MATH_BIGINTEGER_VALUE]);\r
+ $temp = $this->_add($z2, false, $z0, false);\r
+ $z1 = $this->_subtract($z1, false, $temp[MATH_BIGINTEGER_VALUE], false);\r
+\r
+ $z2 = array_merge(array_fill(0, 2 * $m, 0), $z2);\r
+ $z1[MATH_BIGINTEGER_VALUE] = array_merge(array_fill(0, $m, 0), $z1[MATH_BIGINTEGER_VALUE]);\r
+\r
+ $xx = $this->_add($z2, false, $z1[MATH_BIGINTEGER_VALUE], $z1[MATH_BIGINTEGER_SIGN]);\r
+ $xx = $this->_add($xx[MATH_BIGINTEGER_VALUE], $xx[MATH_BIGINTEGER_SIGN], $z0, false);\r
+\r
+ return $xx[MATH_BIGINTEGER_VALUE];\r
+ }\r
+\r
+ /**\r
+ * Divides two BigIntegers.\r
+ *\r
+ * Returns an array whose first element contains the quotient and whose second element contains the\r
+ * "common residue". If the remainder would be positive, the "common residue" and the remainder are the\r
+ * same. If the remainder would be negative, the "common residue" is equal to the sum of the remainder\r
+ * and the divisor (basically, the "common residue" is the first positive modulo).\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('10');\r
+ * $b = new Math_BigInteger('20');\r
+ *\r
+ * list($quotient, $remainder) = $a->divide($b);\r
+ *\r
+ * echo $quotient->toString(); // outputs 0\r
+ * echo "\r\n";\r
+ * echo $remainder->toString(); // outputs 10\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Math_BigInteger $y\r
+ * @return Array\r
+ * @access public\r
+ * @internal This function is based off of {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=9 HAC 14.20}.\r
+ */\r
+ function divide($y)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $quotient = new Math_BigInteger();\r
+ $remainder = new Math_BigInteger();\r
+\r
+ list($quotient->value, $remainder->value) = gmp_div_qr($this->value, $y->value);\r
+\r
+ if (gmp_sign($remainder->value) < 0) {\r
+ $remainder->value = gmp_add($remainder->value, gmp_abs($y->value));\r
+ }\r
+\r
+ return array($this->_normalize($quotient), $this->_normalize($remainder));\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $quotient = new Math_BigInteger();\r
+ $remainder = new Math_BigInteger();\r
+\r
+ $quotient->value = bcdiv($this->value, $y->value, 0);\r
+ $remainder->value = bcmod($this->value, $y->value);\r
+\r
+ if ($remainder->value[0] == '-') {\r
+ $remainder->value = bcadd($remainder->value, $y->value[0] == '-' ? substr($y->value, 1) : $y->value, 0);\r
+ }\r
+\r
+ return array($this->_normalize($quotient), $this->_normalize($remainder));\r
+ }\r
+\r
+ if (count($y->value) == 1) {\r
+ list($q, $r) = $this->_divide_digit($this->value, $y->value[0]);\r
+ $quotient = new Math_BigInteger();\r
+ $remainder = new Math_BigInteger();\r
+ $quotient->value = $q;\r
+ $remainder->value = array($r);\r
+ $quotient->is_negative = $this->is_negative != $y->is_negative;\r
+ return array($this->_normalize($quotient), $this->_normalize($remainder));\r
+ }\r
+\r
+ static $zero;\r
+ if ( !isset($zero) ) {\r
+ $zero = new Math_BigInteger();\r
+ }\r
+\r
+ $x = $this->copy();\r
+ $y = $y->copy();\r
+\r
+ $x_sign = $x->is_negative;\r
+ $y_sign = $y->is_negative;\r
+\r
+ $x->is_negative = $y->is_negative = false;\r
+\r
+ $diff = $x->compare($y);\r
+\r
+ if ( !$diff ) {\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = array(1);\r
+ $temp->is_negative = $x_sign != $y_sign;\r
+ return array($this->_normalize($temp), $this->_normalize(new Math_BigInteger()));\r
+ }\r
+\r
+ if ( $diff < 0 ) {\r
+ // if $x is negative, "add" $y.\r
+ if ( $x_sign ) {\r
+ $x = $y->subtract($x);\r
+ }\r
+ return array($this->_normalize(new Math_BigInteger()), $this->_normalize($x));\r
+ }\r
+\r
+ // normalize $x and $y as described in HAC 14.23 / 14.24\r
+ $msb = $y->value[count($y->value) - 1];\r
+ for ($shift = 0; !($msb & MATH_BIGINTEGER_MSB); ++$shift) {\r
+ $msb <<= 1;\r
+ }\r
+ $x->_lshift($shift);\r
+ $y->_lshift($shift);\r
+ $y_value = &$y->value;\r
+\r
+ $x_max = count($x->value) - 1;\r
+ $y_max = count($y->value) - 1;\r
+\r
+ $quotient = new Math_BigInteger();\r
+ $quotient_value = &$quotient->value;\r
+ $quotient_value = $this->_array_repeat(0, $x_max - $y_max + 1);\r
+\r
+ static $temp, $lhs, $rhs;\r
+ if (!isset($temp)) {\r
+ $temp = new Math_BigInteger();\r
+ $lhs = new Math_BigInteger();\r
+ $rhs = new Math_BigInteger();\r
+ }\r
+ $temp_value = &$temp->value;\r
+ $rhs_value = &$rhs->value;\r
+\r
+ // $temp = $y << ($x_max - $y_max-1) in base 2**26\r
+ $temp_value = array_merge($this->_array_repeat(0, $x_max - $y_max), $y_value);\r
+\r
+ while ( $x->compare($temp) >= 0 ) {\r
+ // calculate the "common residue"\r
+ ++$quotient_value[$x_max - $y_max];\r
+ $x = $x->subtract($temp);\r
+ $x_max = count($x->value) - 1;\r
+ }\r
+\r
+ for ($i = $x_max; $i >= $y_max + 1; --$i) {\r
+ $x_value = &$x->value;\r
+ $x_window = array(\r
+ isset($x_value[$i]) ? $x_value[$i] : 0,\r
+ isset($x_value[$i - 1]) ? $x_value[$i - 1] : 0,\r
+ isset($x_value[$i - 2]) ? $x_value[$i - 2] : 0\r
+ );\r
+ $y_window = array(\r
+ $y_value[$y_max],\r
+ ( $y_max > 0 ) ? $y_value[$y_max - 1] : 0\r
+ );\r
+\r
+ $q_index = $i - $y_max - 1;\r
+ if ($x_window[0] == $y_window[0]) {\r
+ $quotient_value[$q_index] = MATH_BIGINTEGER_MAX_DIGIT;\r
+ } else {\r
+ $quotient_value[$q_index] = (int) (\r
+ ($x_window[0] * MATH_BIGINTEGER_BASE_FULL + $x_window[1])\r
+ /\r
+ $y_window[0]\r
+ );\r
+ }\r
+\r
+ $temp_value = array($y_window[1], $y_window[0]);\r
+\r
+ $lhs->value = array($quotient_value[$q_index]);\r
+ $lhs = $lhs->multiply($temp);\r
+\r
+ $rhs_value = array($x_window[2], $x_window[1], $x_window[0]);\r
+\r
+ while ( $lhs->compare($rhs) > 0 ) {\r
+ --$quotient_value[$q_index];\r
+\r
+ $lhs->value = array($quotient_value[$q_index]);\r
+ $lhs = $lhs->multiply($temp);\r
+ }\r
+\r
+ $adjust = $this->_array_repeat(0, $q_index);\r
+ $temp_value = array($quotient_value[$q_index]);\r
+ $temp = $temp->multiply($y);\r
+ $temp_value = &$temp->value;\r
+ $temp_value = array_merge($adjust, $temp_value);\r
+\r
+ $x = $x->subtract($temp);\r
+\r
+ if ($x->compare($zero) < 0) {\r
+ $temp_value = array_merge($adjust, $y_value);\r
+ $x = $x->add($temp);\r
+\r
+ --$quotient_value[$q_index];\r
+ }\r
+\r
+ $x_max = count($x_value) - 1;\r
+ }\r
+\r
+ // unnormalize the remainder\r
+ $x->_rshift($shift);\r
+\r
+ $quotient->is_negative = $x_sign != $y_sign;\r
+\r
+ // calculate the "common residue", if appropriate\r
+ if ( $x_sign ) {\r
+ $y->_rshift($shift);\r
+ $x = $y->subtract($x);\r
+ }\r
+\r
+ return array($this->_normalize($quotient), $this->_normalize($x));\r
+ }\r
+\r
+ /**\r
+ * Divides a BigInteger by a regular integer\r
+ *\r
+ * abc / x = a00 / x + b0 / x + c / x\r
+ *\r
+ * @param Array $dividend\r
+ * @param Array $divisor\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _divide_digit($dividend, $divisor)\r
+ {\r
+ $carry = 0;\r
+ $result = array();\r
+\r
+ for ($i = count($dividend) - 1; $i >= 0; --$i) {\r
+ $temp = MATH_BIGINTEGER_BASE_FULL * $carry + $dividend[$i];\r
+ $result[$i] = (int) ($temp / $divisor);\r
+ $carry = (int) ($temp - $divisor * $result[$i]);\r
+ }\r
+\r
+ return array($result, $carry);\r
+ }\r
+\r
+ /**\r
+ * Performs modular exponentiation.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger('10');\r
+ * $b = new Math_BigInteger('20');\r
+ * $c = new Math_BigInteger('30');\r
+ *\r
+ * $c = $a->modPow($b, $c);\r
+ *\r
+ * echo $c->toString(); // outputs 10\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Math_BigInteger $e\r
+ * @param Math_BigInteger $n\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ * @internal The most naive approach to modular exponentiation has very unreasonable requirements, and\r
+ * and although the approach involving repeated squaring does vastly better, it, too, is impractical\r
+ * for our purposes. The reason being that division - by far the most complicated and time-consuming\r
+ * of the basic operations (eg. +,-,*,/) - occurs multiple times within it.\r
+ *\r
+ * Modular reductions resolve this issue. Although an individual modular reduction takes more time\r
+ * then an individual division, when performed in succession (with the same modulo), they're a lot faster.\r
+ *\r
+ * The two most commonly used modular reductions are Barrett and Montgomery reduction. Montgomery reduction,\r
+ * although faster, only works when the gcd of the modulo and of the base being used is 1. In RSA, when the\r
+ * base is a power of two, the modulo - a product of two primes - is always going to have a gcd of 1 (because\r
+ * the product of two odd numbers is odd), but what about when RSA isn't used?\r
+ *\r
+ * In contrast, Barrett reduction has no such constraint. As such, some bigint implementations perform a\r
+ * Barrett reduction after every operation in the modpow function. Others perform Barrett reductions when the\r
+ * modulo is even and Montgomery reductions when the modulo is odd. BigInteger.java's modPow method, however,\r
+ * uses a trick involving the Chinese Remainder Theorem to factor the even modulo into two numbers - one odd and\r
+ * the other, a power of two - and recombine them, later. This is the method that this modPow function uses.\r
+ * {@link http://islab.oregonstate.edu/papers/j34monex.pdf Montgomery Reduction with Even Modulus} elaborates.\r
+ */\r
+ function modPow($e, $n)\r
+ {\r
+ $n = $this->bitmask !== false && $this->bitmask->compare($n) < 0 ? $this->bitmask : $n->abs();\r
+\r
+ if ($e->compare(new Math_BigInteger()) < 0) {\r
+ $e = $e->abs();\r
+\r
+ $temp = $this->modInverse($n);\r
+ if ($temp === false) {\r
+ return false;\r
+ }\r
+\r
+ return $this->_normalize($temp->modPow($e, $n));\r
+ }\r
+\r
+ if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_GMP ) {\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = gmp_powm($this->value, $e->value, $n->value);\r
+\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ if ($this->compare(new Math_BigInteger()) < 0 || $this->compare($n) > 0) {\r
+ list(, $temp) = $this->divide($n);\r
+ return $temp->modPow($e, $n);\r
+ }\r
+\r
+ if (defined('MATH_BIGINTEGER_OPENSSL_ENABLED')) {\r
+ $components = array(\r
+ 'modulus' => $n->toBytes(true),\r
+ 'publicExponent' => $e->toBytes(true)\r
+ );\r
+\r
+ $components = array(\r
+ 'modulus' => pack('Ca*a*', 2, $this->_encodeASN1Length(strlen($components['modulus'])), $components['modulus']),\r
+ 'publicExponent' => pack('Ca*a*', 2, $this->_encodeASN1Length(strlen($components['publicExponent'])), $components['publicExponent'])\r
+ );\r
+\r
+ $RSAPublicKey = pack('Ca*a*a*',\r
+ 48, $this->_encodeASN1Length(strlen($components['modulus']) + strlen($components['publicExponent'])),\r
+ $components['modulus'], $components['publicExponent']\r
+ );\r
+\r
+ $rsaOID = pack('H*', '300d06092a864886f70d0101010500'); // hex version of MA0GCSqGSIb3DQEBAQUA\r
+ $RSAPublicKey = chr(0) . $RSAPublicKey;\r
+ $RSAPublicKey = chr(3) . $this->_encodeASN1Length(strlen($RSAPublicKey)) . $RSAPublicKey;\r
+\r
+ $encapsulated = pack('Ca*a*',\r
+ 48, $this->_encodeASN1Length(strlen($rsaOID . $RSAPublicKey)), $rsaOID . $RSAPublicKey\r
+ );\r
+\r
+ $RSAPublicKey = "-----BEGIN PUBLIC KEY-----\r\n" .\r
+ chunk_split(base64_encode($encapsulated)) .\r
+ '-----END PUBLIC KEY-----';\r
+\r
+ $plaintext = str_pad($this->toBytes(), strlen($n->toBytes(true)) - 1, "\0", STR_PAD_LEFT);\r
+\r
+ if (openssl_public_encrypt($plaintext, $result, $RSAPublicKey, OPENSSL_NO_PADDING)) {\r
+ return new Math_BigInteger($result, 256);\r
+ }\r
+ }\r
+\r
+ if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_BCMATH ) {\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = bcpowmod($this->value, $e->value, $n->value, 0);\r
+\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ if ( empty($e->value) ) {\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = array(1);\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ if ( $e->value == array(1) ) {\r
+ list(, $temp) = $this->divide($n);\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ if ( $e->value == array(2) ) {\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = $this->_square($this->value);\r
+ list(, $temp) = $temp->divide($n);\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ return $this->_normalize($this->_slidingWindow($e, $n, MATH_BIGINTEGER_BARRETT));\r
+\r
+ // is the modulo odd?\r
+ if ( $n->value[0] & 1 ) {\r
+ return $this->_normalize($this->_slidingWindow($e, $n, MATH_BIGINTEGER_MONTGOMERY));\r
+ }\r
+ // if it's not, it's even\r
+\r
+ // find the lowest set bit (eg. the max pow of 2 that divides $n)\r
+ for ($i = 0; $i < count($n->value); ++$i) {\r
+ if ( $n->value[$i] ) {\r
+ $temp = decbin($n->value[$i]);\r
+ $j = strlen($temp) - strrpos($temp, '1') - 1;\r
+ $j+= 26 * $i;\r
+ break;\r
+ }\r
+ }\r
+ // at this point, 2^$j * $n/(2^$j) == $n\r
+\r
+ $mod1 = $n->copy();\r
+ $mod1->_rshift($j);\r
+ $mod2 = new Math_BigInteger();\r
+ $mod2->value = array(1);\r
+ $mod2->_lshift($j);\r
+\r
+ $part1 = ( $mod1->value != array(1) ) ? $this->_slidingWindow($e, $mod1, MATH_BIGINTEGER_MONTGOMERY) : new Math_BigInteger();\r
+ $part2 = $this->_slidingWindow($e, $mod2, MATH_BIGINTEGER_POWEROF2);\r
+\r
+ $y1 = $mod2->modInverse($mod1);\r
+ $y2 = $mod1->modInverse($mod2);\r
+\r
+ $result = $part1->multiply($mod2);\r
+ $result = $result->multiply($y1);\r
+\r
+ $temp = $part2->multiply($mod1);\r
+ $temp = $temp->multiply($y2);\r
+\r
+ $result = $result->add($temp);\r
+ list(, $result) = $result->divide($n);\r
+\r
+ return $this->_normalize($result);\r
+ }\r
+\r
+ /**\r
+ * Performs modular exponentiation.\r
+ *\r
+ * Alias for Math_BigInteger::modPow()\r
+ *\r
+ * @param Math_BigInteger $e\r
+ * @param Math_BigInteger $n\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ */\r
+ function powMod($e, $n)\r
+ {\r
+ return $this->modPow($e, $n);\r
+ }\r
+\r
+ /**\r
+ * Sliding Window k-ary Modular Exponentiation\r
+ *\r
+ * Based on {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=27 HAC 14.85} /\r
+ * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=210 MPM 7.7}. In a departure from those algorithims,\r
+ * however, this function performs a modular reduction after every multiplication and squaring operation.\r
+ * As such, this function has the same preconditions that the reductions being used do.\r
+ *\r
+ * @param Math_BigInteger $e\r
+ * @param Math_BigInteger $n\r
+ * @param Integer $mode\r
+ * @return Math_BigInteger\r
+ * @access private\r
+ */\r
+ function _slidingWindow($e, $n, $mode)\r
+ {\r
+ static $window_ranges = array(7, 25, 81, 241, 673, 1793); // from BigInteger.java's oddModPow function\r
+ //static $window_ranges = array(0, 7, 36, 140, 450, 1303, 3529); // from MPM 7.3.1\r
+\r
+ $e_value = $e->value;\r
+ $e_length = count($e_value) - 1;\r
+ $e_bits = decbin($e_value[$e_length]);\r
+ for ($i = $e_length - 1; $i >= 0; --$i) {\r
+ $e_bits.= str_pad(decbin($e_value[$i]), MATH_BIGINTEGER_BASE, '0', STR_PAD_LEFT);\r
+ }\r
+\r
+ $e_length = strlen($e_bits);\r
+\r
+ // calculate the appropriate window size.\r
+ // $window_size == 3 if $window_ranges is between 25 and 81, for example.\r
+ for ($i = 0, $window_size = 1; $e_length > $window_ranges[$i] && $i < count($window_ranges); ++$window_size, ++$i);\r
+\r
+ $n_value = $n->value;\r
+\r
+ // precompute $this^0 through $this^$window_size\r
+ $powers = array();\r
+ $powers[1] = $this->_prepareReduce($this->value, $n_value, $mode);\r
+ $powers[2] = $this->_squareReduce($powers[1], $n_value, $mode);\r
+\r
+ // we do every other number since substr($e_bits, $i, $j+1) (see below) is supposed to end\r
+ // in a 1. ie. it's supposed to be odd.\r
+ $temp = 1 << ($window_size - 1);\r
+ for ($i = 1; $i < $temp; ++$i) {\r
+ $i2 = $i << 1;\r
+ $powers[$i2 + 1] = $this->_multiplyReduce($powers[$i2 - 1], $powers[2], $n_value, $mode);\r
+ }\r
+\r
+ $result = array(1);\r
+ $result = $this->_prepareReduce($result, $n_value, $mode);\r
+\r
+ for ($i = 0; $i < $e_length; ) {\r
+ if ( !$e_bits[$i] ) {\r
+ $result = $this->_squareReduce($result, $n_value, $mode);\r
+ ++$i;\r
+ } else {\r
+ for ($j = $window_size - 1; $j > 0; --$j) {\r
+ if ( !empty($e_bits[$i + $j]) ) {\r
+ break;\r
+ }\r
+ }\r
+\r
+ for ($k = 0; $k <= $j; ++$k) {// eg. the length of substr($e_bits, $i, $j+1)\r
+ $result = $this->_squareReduce($result, $n_value, $mode);\r
+ }\r
+\r
+ $result = $this->_multiplyReduce($result, $powers[bindec(substr($e_bits, $i, $j + 1))], $n_value, $mode);\r
+\r
+ $i+=$j + 1;\r
+ }\r
+ }\r
+\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = $this->_reduce($result, $n_value, $mode);\r
+\r
+ return $temp;\r
+ }\r
+\r
+ /**\r
+ * Modular reduction\r
+ *\r
+ * For most $modes this will return the remainder.\r
+ *\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Array $x\r
+ * @param Array $n\r
+ * @param Integer $mode\r
+ * @return Array\r
+ */\r
+ function _reduce($x, $n, $mode)\r
+ {\r
+ switch ($mode) {\r
+ case MATH_BIGINTEGER_MONTGOMERY:\r
+ return $this->_montgomery($x, $n);\r
+ case MATH_BIGINTEGER_BARRETT:\r
+ return $this->_barrett($x, $n);\r
+ case MATH_BIGINTEGER_POWEROF2:\r
+ $lhs = new Math_BigInteger();\r
+ $lhs->value = $x;\r
+ $rhs = new Math_BigInteger();\r
+ $rhs->value = $n;\r
+ return $x->_mod2($n);\r
+ case MATH_BIGINTEGER_CLASSIC:\r
+ $lhs = new Math_BigInteger();\r
+ $lhs->value = $x;\r
+ $rhs = new Math_BigInteger();\r
+ $rhs->value = $n;\r
+ list(, $temp) = $lhs->divide($rhs);\r
+ return $temp->value;\r
+ case MATH_BIGINTEGER_NONE:\r
+ return $x;\r
+ default:\r
+ // an invalid $mode was provided\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Modular reduction preperation\r
+ *\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Array $x\r
+ * @param Array $n\r
+ * @param Integer $mode\r
+ * @return Array\r
+ */\r
+ function _prepareReduce($x, $n, $mode)\r
+ {\r
+ if ($mode == MATH_BIGINTEGER_MONTGOMERY) {\r
+ return $this->_prepMontgomery($x, $n);\r
+ }\r
+ return $this->_reduce($x, $n, $mode);\r
+ }\r
+\r
+ /**\r
+ * Modular multiply\r
+ *\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Array $x\r
+ * @param Array $y\r
+ * @param Array $n\r
+ * @param Integer $mode\r
+ * @return Array\r
+ */\r
+ function _multiplyReduce($x, $y, $n, $mode)\r
+ {\r
+ if ($mode == MATH_BIGINTEGER_MONTGOMERY) {\r
+ return $this->_montgomeryMultiply($x, $y, $n);\r
+ }\r
+ $temp = $this->_multiply($x, false, $y, false);\r
+ return $this->_reduce($temp[MATH_BIGINTEGER_VALUE], $n, $mode);\r
+ }\r
+\r
+ /**\r
+ * Modular square\r
+ *\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Array $x\r
+ * @param Array $n\r
+ * @param Integer $mode\r
+ * @return Array\r
+ */\r
+ function _squareReduce($x, $n, $mode)\r
+ {\r
+ if ($mode == MATH_BIGINTEGER_MONTGOMERY) {\r
+ return $this->_montgomeryMultiply($x, $x, $n);\r
+ }\r
+ return $this->_reduce($this->_square($x), $n, $mode);\r
+ }\r
+\r
+ /**\r
+ * Modulos for Powers of Two\r
+ *\r
+ * Calculates $x%$n, where $n = 2**$e, for some $e. Since this is basically the same as doing $x & ($n-1),\r
+ * we'll just use this function as a wrapper for doing that.\r
+ *\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Math_BigInteger\r
+ * @return Math_BigInteger\r
+ */\r
+ function _mod2($n)\r
+ {\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = array(1);\r
+ return $this->bitwise_and($n->subtract($temp));\r
+ }\r
+\r
+ /**\r
+ * Barrett Modular Reduction\r
+ *\r
+ * See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=14 HAC 14.3.3} /\r
+ * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=165 MPM 6.2.5} for more information. Modified slightly,\r
+ * so as not to require negative numbers (initially, this script didn't support negative numbers).\r
+ *\r
+ * Employs "folding", as described at\r
+ * {@link http://www.cosic.esat.kuleuven.be/publications/thesis-149.pdf#page=66 thesis-149.pdf#page=66}. To quote from\r
+ * 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."\r
+ *\r
+ * Unfortunately, the "Barrett Reduction with Folding" algorithm described in thesis-149.pdf is not, as written, all that\r
+ * usable on account of (1) its not using reasonable radix points as discussed in\r
+ * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=162 MPM 6.2.2} and (2) the fact that, even with reasonable\r
+ * radix points, it only works when there are an even number of digits in the denominator. The reason for (2) is that\r
+ * (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\r
+ * comments for details.\r
+ *\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Array $n\r
+ * @param Array $m\r
+ * @return Array\r
+ */\r
+ function _barrett($n, $m)\r
+ {\r
+ static $cache = array(\r
+ MATH_BIGINTEGER_VARIABLE => array(),\r
+ MATH_BIGINTEGER_DATA => array()\r
+ );\r
+\r
+ $m_length = count($m);\r
+\r
+ // if ($this->_compare($n, $this->_square($m)) >= 0) {\r
+ if (count($n) > 2 * $m_length) {\r
+ $lhs = new Math_BigInteger();\r
+ $rhs = new Math_BigInteger();\r
+ $lhs->value = $n;\r
+ $rhs->value = $m;\r
+ list(, $temp) = $lhs->divide($rhs);\r
+ return $temp->value;\r
+ }\r
+\r
+ // if (m.length >> 1) + 2 <= m.length then m is too small and n can't be reduced\r
+ if ($m_length < 5) {\r
+ return $this->_regularBarrett($n, $m);\r
+ }\r
+\r
+ // n = 2 * m.length\r
+\r
+ if ( ($key = array_search($m, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {\r
+ $key = count($cache[MATH_BIGINTEGER_VARIABLE]);\r
+ $cache[MATH_BIGINTEGER_VARIABLE][] = $m;\r
+\r
+ $lhs = new Math_BigInteger();\r
+ $lhs_value = &$lhs->value;\r
+ $lhs_value = $this->_array_repeat(0, $m_length + ($m_length >> 1));\r
+ $lhs_value[] = 1;\r
+ $rhs = new Math_BigInteger();\r
+ $rhs->value = $m;\r
+\r
+ list($u, $m1) = $lhs->divide($rhs);\r
+ $u = $u->value;\r
+ $m1 = $m1->value;\r
+\r
+ $cache[MATH_BIGINTEGER_DATA][] = array(\r
+ 'u' => $u, // m.length >> 1 (technically (m.length >> 1) + 1)\r
+ 'm1'=> $m1 // m.length\r
+ );\r
+ } else {\r
+ extract($cache[MATH_BIGINTEGER_DATA][$key]);\r
+ }\r
+\r
+ $cutoff = $m_length + ($m_length >> 1);\r
+ $lsd = array_slice($n, 0, $cutoff); // m.length + (m.length >> 1)\r
+ $msd = array_slice($n, $cutoff); // m.length >> 1\r
+ $lsd = $this->_trim($lsd);\r
+ $temp = $this->_multiply($msd, false, $m1, false);\r
+ $n = $this->_add($lsd, false, $temp[MATH_BIGINTEGER_VALUE], false); // m.length + (m.length >> 1) + 1\r
+\r
+ if ($m_length & 1) {\r
+ return $this->_regularBarrett($n[MATH_BIGINTEGER_VALUE], $m);\r
+ }\r
+\r
+ // (m.length + (m.length >> 1) + 1) - (m.length - 1) == (m.length >> 1) + 2\r
+ $temp = array_slice($n[MATH_BIGINTEGER_VALUE], $m_length - 1);\r
+ // if even: ((m.length >> 1) + 2) + (m.length >> 1) == m.length + 2\r
+ // if odd: ((m.length >> 1) + 2) + (m.length >> 1) == (m.length - 1) + 2 == m.length + 1\r
+ $temp = $this->_multiply($temp, false, $u, false);\r
+ // if even: (m.length + 2) - ((m.length >> 1) + 1) = m.length - (m.length >> 1) + 1\r
+ // if odd: (m.length + 1) - ((m.length >> 1) + 1) = m.length - (m.length >> 1)\r
+ $temp = array_slice($temp[MATH_BIGINTEGER_VALUE], ($m_length >> 1) + 1);\r
+ // if even: (m.length - (m.length >> 1) + 1) + m.length = 2 * m.length - (m.length >> 1) + 1\r
+ // if odd: (m.length - (m.length >> 1)) + m.length = 2 * m.length - (m.length >> 1)\r
+ $temp = $this->_multiply($temp, false, $m, false);\r
+\r
+ // at this point, if m had an odd number of digits, we'd be subtracting a 2 * m.length - (m.length >> 1) digit\r
+ // number from a m.length + (m.length >> 1) + 1 digit number. ie. there'd be an extra digit and the while loop\r
+ // following this comment would loop a lot (hence our calling _regularBarrett() in that situation).\r
+\r
+ $result = $this->_subtract($n[MATH_BIGINTEGER_VALUE], false, $temp[MATH_BIGINTEGER_VALUE], false);\r
+\r
+ while ($this->_compare($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $m, false) >= 0) {\r
+ $result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $m, false);\r
+ }\r
+\r
+ return $result[MATH_BIGINTEGER_VALUE];\r
+ }\r
+\r
+ /**\r
+ * (Regular) Barrett Modular Reduction\r
+ *\r
+ * For numbers with more than four digits Math_BigInteger::_barrett() is faster. The difference between that and this\r
+ * is that this function does not fold the denominator into a smaller form.\r
+ *\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Array $x\r
+ * @param Array $n\r
+ * @return Array\r
+ */\r
+ function _regularBarrett($x, $n)\r
+ {\r
+ static $cache = array(\r
+ MATH_BIGINTEGER_VARIABLE => array(),\r
+ MATH_BIGINTEGER_DATA => array()\r
+ );\r
+\r
+ $n_length = count($n);\r
+\r
+ if (count($x) > 2 * $n_length) {\r
+ $lhs = new Math_BigInteger();\r
+ $rhs = new Math_BigInteger();\r
+ $lhs->value = $x;\r
+ $rhs->value = $n;\r
+ list(, $temp) = $lhs->divide($rhs);\r
+ return $temp->value;\r
+ }\r
+\r
+ if ( ($key = array_search($n, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {\r
+ $key = count($cache[MATH_BIGINTEGER_VARIABLE]);\r
+ $cache[MATH_BIGINTEGER_VARIABLE][] = $n;\r
+ $lhs = new Math_BigInteger();\r
+ $lhs_value = &$lhs->value;\r
+ $lhs_value = $this->_array_repeat(0, 2 * $n_length);\r
+ $lhs_value[] = 1;\r
+ $rhs = new Math_BigInteger();\r
+ $rhs->value = $n;\r
+ list($temp, ) = $lhs->divide($rhs); // m.length\r
+ $cache[MATH_BIGINTEGER_DATA][] = $temp->value;\r
+ }\r
+\r
+ // 2 * m.length - (m.length - 1) = m.length + 1\r
+ $temp = array_slice($x, $n_length - 1);\r
+ // (m.length + 1) + m.length = 2 * m.length + 1\r
+ $temp = $this->_multiply($temp, false, $cache[MATH_BIGINTEGER_DATA][$key], false);\r
+ // (2 * m.length + 1) - (m.length - 1) = m.length + 2\r
+ $temp = array_slice($temp[MATH_BIGINTEGER_VALUE], $n_length + 1);\r
+\r
+ // m.length + 1\r
+ $result = array_slice($x, 0, $n_length + 1);\r
+ // m.length + 1\r
+ $temp = $this->_multiplyLower($temp, false, $n, false, $n_length + 1);\r
+ // $temp == array_slice($temp->_multiply($temp, false, $n, false)->value, 0, $n_length + 1)\r
+\r
+ if ($this->_compare($result, false, $temp[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_SIGN]) < 0) {\r
+ $corrector_value = $this->_array_repeat(0, $n_length + 1);\r
+ $corrector_value[] = 1;\r
+ $result = $this->_add($result, false, $corrector_value, false);\r
+ $result = $result[MATH_BIGINTEGER_VALUE];\r
+ }\r
+\r
+ // at this point, we're subtracting a number with m.length + 1 digits from another number with m.length + 1 digits\r
+ $result = $this->_subtract($result, false, $temp[MATH_BIGINTEGER_VALUE], $temp[MATH_BIGINTEGER_SIGN]);\r
+ while ($this->_compare($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $n, false) > 0) {\r
+ $result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], $result[MATH_BIGINTEGER_SIGN], $n, false);\r
+ }\r
+\r
+ return $result[MATH_BIGINTEGER_VALUE];\r
+ }\r
+\r
+ /**\r
+ * Performs long multiplication up to $stop digits\r
+ *\r
+ * If you're going to be doing array_slice($product->value, 0, $stop), some cycles can be saved.\r
+ *\r
+ * @see _regularBarrett()\r
+ * @param Array $x_value\r
+ * @param Boolean $x_negative\r
+ * @param Array $y_value\r
+ * @param Boolean $y_negative\r
+ * @param Integer $stop\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _multiplyLower($x_value, $x_negative, $y_value, $y_negative, $stop)\r
+ {\r
+ $x_length = count($x_value);\r
+ $y_length = count($y_value);\r
+\r
+ if ( !$x_length || !$y_length ) { // a 0 is being multiplied\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => array(),\r
+ MATH_BIGINTEGER_SIGN => false\r
+ );\r
+ }\r
+\r
+ if ( $x_length < $y_length ) {\r
+ $temp = $x_value;\r
+ $x_value = $y_value;\r
+ $y_value = $temp;\r
+\r
+ $x_length = count($x_value);\r
+ $y_length = count($y_value);\r
+ }\r
+\r
+ $product_value = $this->_array_repeat(0, $x_length + $y_length);\r
+\r
+ // the following for loop could be removed if the for loop following it\r
+ // (the one with nested for loops) initially set $i to 0, but\r
+ // doing so would also make the result in one set of unnecessary adds,\r
+ // since on the outermost loops first pass, $product->value[$k] is going\r
+ // to always be 0\r
+\r
+ $carry = 0;\r
+\r
+ for ($j = 0; $j < $x_length; ++$j) { // ie. $i = 0, $k = $i\r
+ $temp = $x_value[$j] * $y_value[0] + $carry; // $product_value[$k] == 0\r
+ $carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);\r
+ $product_value[$j] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);\r
+ }\r
+\r
+ if ($j < $stop) {\r
+ $product_value[$j] = $carry;\r
+ }\r
+\r
+ // the above for loop is what the previous comment was talking about. the\r
+ // following for loop is the "one with nested for loops"\r
+\r
+ for ($i = 1; $i < $y_length; ++$i) {\r
+ $carry = 0;\r
+\r
+ for ($j = 0, $k = $i; $j < $x_length && $k < $stop; ++$j, ++$k) {\r
+ $temp = $product_value[$k] + $x_value[$j] * $y_value[$i] + $carry;\r
+ $carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);\r
+ $product_value[$k] = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * $carry);\r
+ }\r
+\r
+ if ($k < $stop) {\r
+ $product_value[$k] = $carry;\r
+ }\r
+ }\r
+\r
+ return array(\r
+ MATH_BIGINTEGER_VALUE => $this->_trim($product_value),\r
+ MATH_BIGINTEGER_SIGN => $x_negative != $y_negative\r
+ );\r
+ }\r
+\r
+ /**\r
+ * Montgomery Modular Reduction\r
+ *\r
+ * ($x->_prepMontgomery($n))->_montgomery($n) yields $x % $n.\r
+ * {@link http://math.libtomcrypt.com/files/tommath.pdf#page=170 MPM 6.3} provides insights on how this can be\r
+ * improved upon (basically, by using the comba method). gcd($n, 2) must be equal to one for this function\r
+ * to work correctly.\r
+ *\r
+ * @see _prepMontgomery()\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Array $x\r
+ * @param Array $n\r
+ * @return Array\r
+ */\r
+ function _montgomery($x, $n)\r
+ {\r
+ static $cache = array(\r
+ MATH_BIGINTEGER_VARIABLE => array(),\r
+ MATH_BIGINTEGER_DATA => array()\r
+ );\r
+\r
+ if ( ($key = array_search($n, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {\r
+ $key = count($cache[MATH_BIGINTEGER_VARIABLE]);\r
+ $cache[MATH_BIGINTEGER_VARIABLE][] = $x;\r
+ $cache[MATH_BIGINTEGER_DATA][] = $this->_modInverse67108864($n);\r
+ }\r
+\r
+ $k = count($n);\r
+\r
+ $result = array(MATH_BIGINTEGER_VALUE => $x);\r
+\r
+ for ($i = 0; $i < $k; ++$i) {\r
+ $temp = $result[MATH_BIGINTEGER_VALUE][$i] * $cache[MATH_BIGINTEGER_DATA][$key];\r
+ $temp = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * ((int) ($temp / MATH_BIGINTEGER_BASE_FULL)));\r
+ $temp = $this->_regularMultiply(array($temp), $n);\r
+ $temp = array_merge($this->_array_repeat(0, $i), $temp);\r
+ $result = $this->_add($result[MATH_BIGINTEGER_VALUE], false, $temp, false);\r
+ }\r
+\r
+ $result[MATH_BIGINTEGER_VALUE] = array_slice($result[MATH_BIGINTEGER_VALUE], $k);\r
+\r
+ if ($this->_compare($result, false, $n, false) >= 0) {\r
+ $result = $this->_subtract($result[MATH_BIGINTEGER_VALUE], false, $n, false);\r
+ }\r
+\r
+ return $result[MATH_BIGINTEGER_VALUE];\r
+ }\r
+\r
+ /**\r
+ * Montgomery Multiply\r
+ *\r
+ * Interleaves the montgomery reduction and long multiplication algorithms together as described in \r
+ * {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=13 HAC 14.36}\r
+ *\r
+ * @see _prepMontgomery()\r
+ * @see _montgomery()\r
+ * @access private\r
+ * @param Array $x\r
+ * @param Array $y\r
+ * @param Array $m\r
+ * @return Array\r
+ */\r
+ function _montgomeryMultiply($x, $y, $m)\r
+ {\r
+ $temp = $this->_multiply($x, false, $y, false);\r
+ return $this->_montgomery($temp[MATH_BIGINTEGER_VALUE], $m);\r
+\r
+ static $cache = array(\r
+ MATH_BIGINTEGER_VARIABLE => array(),\r
+ MATH_BIGINTEGER_DATA => array()\r
+ );\r
+\r
+ if ( ($key = array_search($m, $cache[MATH_BIGINTEGER_VARIABLE])) === false ) {\r
+ $key = count($cache[MATH_BIGINTEGER_VARIABLE]);\r
+ $cache[MATH_BIGINTEGER_VARIABLE][] = $m;\r
+ $cache[MATH_BIGINTEGER_DATA][] = $this->_modInverse67108864($m);\r
+ }\r
+\r
+ $n = max(count($x), count($y), count($m));\r
+ $x = array_pad($x, $n, 0);\r
+ $y = array_pad($y, $n, 0);\r
+ $m = array_pad($m, $n, 0);\r
+ $a = array(MATH_BIGINTEGER_VALUE => $this->_array_repeat(0, $n + 1));\r
+ for ($i = 0; $i < $n; ++$i) {\r
+ $temp = $a[MATH_BIGINTEGER_VALUE][0] + $x[$i] * $y[0];\r
+ $temp = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * ((int) ($temp / MATH_BIGINTEGER_BASE_FULL)));\r
+ $temp = $temp * $cache[MATH_BIGINTEGER_DATA][$key];\r
+ $temp = (int) ($temp - MATH_BIGINTEGER_BASE_FULL * ((int) ($temp / MATH_BIGINTEGER_BASE_FULL)));\r
+ $temp = $this->_add($this->_regularMultiply(array($x[$i]), $y), false, $this->_regularMultiply(array($temp), $m), false);\r
+ $a = $this->_add($a[MATH_BIGINTEGER_VALUE], false, $temp[MATH_BIGINTEGER_VALUE], false);\r
+ $a[MATH_BIGINTEGER_VALUE] = array_slice($a[MATH_BIGINTEGER_VALUE], 1);\r
+ }\r
+ if ($this->_compare($a[MATH_BIGINTEGER_VALUE], false, $m, false) >= 0) {\r
+ $a = $this->_subtract($a[MATH_BIGINTEGER_VALUE], false, $m, false);\r
+ }\r
+ return $a[MATH_BIGINTEGER_VALUE];\r
+ }\r
+\r
+ /**\r
+ * Prepare a number for use in Montgomery Modular Reductions\r
+ *\r
+ * @see _montgomery()\r
+ * @see _slidingWindow()\r
+ * @access private\r
+ * @param Array $x\r
+ * @param Array $n\r
+ * @return Array\r
+ */\r
+ function _prepMontgomery($x, $n)\r
+ {\r
+ $lhs = new Math_BigInteger();\r
+ $lhs->value = array_merge($this->_array_repeat(0, count($n)), $x);\r
+ $rhs = new Math_BigInteger();\r
+ $rhs->value = $n;\r
+\r
+ list(, $temp) = $lhs->divide($rhs);\r
+ return $temp->value;\r
+ }\r
+\r
+ /**\r
+ * Modular Inverse of a number mod 2**26 (eg. 67108864)\r
+ *\r
+ * Based off of the bnpInvDigit function implemented and justified in the following URL:\r
+ *\r
+ * {@link http://www-cs-students.stanford.edu/~tjw/jsbn/jsbn.js}\r
+ *\r
+ * The following URL provides more info:\r
+ *\r
+ * {@link http://groups.google.com/group/sci.crypt/msg/7a137205c1be7d85}\r
+ *\r
+ * As for why we do all the bitmasking... strange things can happen when converting from floats to ints. For\r
+ * instance, on some computers, var_dump((int) -4294967297) yields int(-1) and on others, it yields \r
+ * int(-2147483648). To avoid problems stemming from this, we use bitmasks to guarantee that ints aren't\r
+ * auto-converted to floats. The outermost bitmask is present because without it, there's no guarantee that\r
+ * the "residue" returned would be the so-called "common residue". We use fmod, in the last step, because the\r
+ * maximum possible $x is 26 bits and the maximum $result is 16 bits. Thus, we have to be able to handle up to\r
+ * 40 bits, which only 64-bit floating points will support.\r
+ *\r
+ * Thanks to Pedro Gimeno Fortea for input!\r
+ *\r
+ * @see _montgomery()\r
+ * @access private\r
+ * @param Array $x\r
+ * @return Integer\r
+ */\r
+ function _modInverse67108864($x) // 2**26 == 67,108,864\r
+ {\r
+ $x = -$x[0];\r
+ $result = $x & 0x3; // x**-1 mod 2**2\r
+ $result = ($result * (2 - $x * $result)) & 0xF; // x**-1 mod 2**4\r
+ $result = ($result * (2 - ($x & 0xFF) * $result)) & 0xFF; // x**-1 mod 2**8\r
+ $result = ($result * ((2 - ($x & 0xFFFF) * $result) & 0xFFFF)) & 0xFFFF; // x**-1 mod 2**16\r
+ $result = fmod($result * (2 - fmod($x * $result, MATH_BIGINTEGER_BASE_FULL)), MATH_BIGINTEGER_BASE_FULL); // x**-1 mod 2**26\r
+ return $result & MATH_BIGINTEGER_MAX_DIGIT;\r
+ }\r
+\r
+ /**\r
+ * Calculates modular inverses.\r
+ *\r
+ * Say you have (30 mod 17 * x mod 17) mod 17 == 1. x can be found using modular inverses.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger(30);\r
+ * $b = new Math_BigInteger(17);\r
+ *\r
+ * $c = $a->modInverse($b);\r
+ * echo $c->toString(); // outputs 4\r
+ *\r
+ * echo "\r\n";\r
+ *\r
+ * $d = $a->multiply($c);\r
+ * list(, $d) = $d->divide($b);\r
+ * echo $d; // outputs 1 (as per the definition of modular inverse)\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Math_BigInteger $n\r
+ * @return mixed false, if no modular inverse exists, Math_BigInteger, otherwise.\r
+ * @access public\r
+ * @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=21 HAC 14.64} for more information.\r
+ */\r
+ function modInverse($n)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = gmp_invert($this->value, $n->value);\r
+\r
+ return ( $temp->value === false ) ? false : $this->_normalize($temp);\r
+ }\r
+\r
+ static $zero, $one;\r
+ if (!isset($zero)) {\r
+ $zero = new Math_BigInteger();\r
+ $one = new Math_BigInteger(1);\r
+ }\r
+\r
+ // $x mod -$n == $x mod $n.\r
+ $n = $n->abs();\r
+\r
+ if ($this->compare($zero) < 0) {\r
+ $temp = $this->abs();\r
+ $temp = $temp->modInverse($n);\r
+ return $this->_normalize($n->subtract($temp));\r
+ }\r
+\r
+ extract($this->extendedGCD($n));\r
+\r
+ if (!$gcd->equals($one)) {\r
+ return false;\r
+ }\r
+\r
+ $x = $x->compare($zero) < 0 ? $x->add($n) : $x;\r
+\r
+ return $this->compare($zero) < 0 ? $this->_normalize($n->subtract($x)) : $this->_normalize($x);\r
+ }\r
+\r
+ /**\r
+ * Calculates the greatest common divisor and Bezout's identity.\r
+ *\r
+ * Say you have 693 and 609. The GCD is 21. Bezout's identity states that there exist integers x and y such that\r
+ * 693*x + 609*y == 21. In point of fact, there are actually an infinite number of x and y combinations and which\r
+ * combination is returned is dependant upon which mode is in use. See\r
+ * {@link http://en.wikipedia.org/wiki/B%C3%A9zout%27s_identity Bezout's identity - Wikipedia} for more information.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger(693);\r
+ * $b = new Math_BigInteger(609);\r
+ *\r
+ * extract($a->extendedGCD($b));\r
+ *\r
+ * echo $gcd->toString() . "\r\n"; // outputs 21\r
+ * echo $a->toString() * $x->toString() + $b->toString() * $y->toString(); // outputs 21\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Math_BigInteger $n\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ * @internal Calculates the GCD using the binary xGCD algorithim described in\r
+ * {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=19 HAC 14.61}. As the text above 14.61 notes,\r
+ * the more traditional algorithim requires "relatively costly multiple-precision divisions".\r
+ */\r
+ function extendedGCD($n)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ extract(gmp_gcdext($this->value, $n->value));\r
+\r
+ return array(\r
+ 'gcd' => $this->_normalize(new Math_BigInteger($g)),\r
+ 'x' => $this->_normalize(new Math_BigInteger($s)),\r
+ 'y' => $this->_normalize(new Math_BigInteger($t))\r
+ );\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ // it might be faster to use the binary xGCD algorithim here, as well, but (1) that algorithim works\r
+ // best when the base is a power of 2 and (2) i don't think it'd make much difference, anyway. as is,\r
+ // the basic extended euclidean algorithim is what we're using.\r
+\r
+ $u = $this->value;\r
+ $v = $n->value;\r
+\r
+ $a = '1';\r
+ $b = '0';\r
+ $c = '0';\r
+ $d = '1';\r
+\r
+ while (bccomp($v, '0', 0) != 0) {\r
+ $q = bcdiv($u, $v, 0);\r
+\r
+ $temp = $u;\r
+ $u = $v;\r
+ $v = bcsub($temp, bcmul($v, $q, 0), 0);\r
+\r
+ $temp = $a;\r
+ $a = $c;\r
+ $c = bcsub($temp, bcmul($a, $q, 0), 0);\r
+\r
+ $temp = $b;\r
+ $b = $d;\r
+ $d = bcsub($temp, bcmul($b, $q, 0), 0);\r
+ }\r
+\r
+ return array(\r
+ 'gcd' => $this->_normalize(new Math_BigInteger($u)),\r
+ 'x' => $this->_normalize(new Math_BigInteger($a)),\r
+ 'y' => $this->_normalize(new Math_BigInteger($b))\r
+ );\r
+ }\r
+\r
+ $y = $n->copy();\r
+ $x = $this->copy();\r
+ $g = new Math_BigInteger();\r
+ $g->value = array(1);\r
+\r
+ while ( !(($x->value[0] & 1)|| ($y->value[0] & 1)) ) {\r
+ $x->_rshift(1);\r
+ $y->_rshift(1);\r
+ $g->_lshift(1);\r
+ }\r
+\r
+ $u = $x->copy();\r
+ $v = $y->copy();\r
+\r
+ $a = new Math_BigInteger();\r
+ $b = new Math_BigInteger();\r
+ $c = new Math_BigInteger();\r
+ $d = new Math_BigInteger();\r
+\r
+ $a->value = $d->value = $g->value = array(1);\r
+ $b->value = $c->value = array();\r
+\r
+ while ( !empty($u->value) ) {\r
+ while ( !($u->value[0] & 1) ) {\r
+ $u->_rshift(1);\r
+ if ( (!empty($a->value) && ($a->value[0] & 1)) || (!empty($b->value) && ($b->value[0] & 1)) ) {\r
+ $a = $a->add($y);\r
+ $b = $b->subtract($x);\r
+ }\r
+ $a->_rshift(1);\r
+ $b->_rshift(1);\r
+ }\r
+\r
+ while ( !($v->value[0] & 1) ) {\r
+ $v->_rshift(1);\r
+ if ( (!empty($d->value) && ($d->value[0] & 1)) || (!empty($c->value) && ($c->value[0] & 1)) ) {\r
+ $c = $c->add($y);\r
+ $d = $d->subtract($x);\r
+ }\r
+ $c->_rshift(1);\r
+ $d->_rshift(1);\r
+ }\r
+\r
+ if ($u->compare($v) >= 0) {\r
+ $u = $u->subtract($v);\r
+ $a = $a->subtract($c);\r
+ $b = $b->subtract($d);\r
+ } else {\r
+ $v = $v->subtract($u);\r
+ $c = $c->subtract($a);\r
+ $d = $d->subtract($b);\r
+ }\r
+ }\r
+\r
+ return array(\r
+ 'gcd' => $this->_normalize($g->multiply($v)),\r
+ 'x' => $this->_normalize($c),\r
+ 'y' => $this->_normalize($d)\r
+ );\r
+ }\r
+\r
+ /**\r
+ * Calculates the greatest common divisor\r
+ *\r
+ * Say you have 693 and 609. The GCD is 21.\r
+ *\r
+ * Here's an example:\r
+ * <code>\r
+ * <?php\r
+ * include('Math/BigInteger.php');\r
+ *\r
+ * $a = new Math_BigInteger(693);\r
+ * $b = new Math_BigInteger(609);\r
+ *\r
+ * $gcd = a->extendedGCD($b);\r
+ *\r
+ * echo $gcd->toString() . "\r\n"; // outputs 21\r
+ * ?>\r
+ * </code>\r
+ *\r
+ * @param Math_BigInteger $n\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ */\r
+ function gcd($n)\r
+ {\r
+ extract($this->extendedGCD($n));\r
+ return $gcd;\r
+ }\r
+\r
+ /**\r
+ * Absolute value.\r
+ *\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ */\r
+ function abs()\r
+ {\r
+ $temp = new Math_BigInteger();\r
+\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp->value = gmp_abs($this->value);\r
+ break;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $temp->value = (bccomp($this->value, '0', 0) < 0) ? substr($this->value, 1) : $this->value;\r
+ break;\r
+ default:\r
+ $temp->value = $this->value;\r
+ }\r
+\r
+ return $temp;\r
+ }\r
+\r
+ /**\r
+ * Compares two numbers.\r
+ *\r
+ * Although one might think !$x->compare($y) means $x != $y, it, in fact, means the opposite. The reason for this is\r
+ * demonstrated thusly:\r
+ *\r
+ * $x > $y: $x->compare($y) > 0\r
+ * $x < $y: $x->compare($y) < 0\r
+ * $x == $y: $x->compare($y) == 0\r
+ *\r
+ * Note how the same comparison operator is used. If you want to test for equality, use $x->equals($y).\r
+ *\r
+ * @param Math_BigInteger $y\r
+ * @return Integer < 0 if $this is less than $y; > 0 if $this is greater than $y, and 0 if they are equal.\r
+ * @access public\r
+ * @see equals()\r
+ * @internal Could return $this->subtract($x), but that's not as fast as what we do do.\r
+ */\r
+ function compare($y)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ return gmp_cmp($this->value, $y->value);\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ return bccomp($this->value, $y->value, 0);\r
+ }\r
+\r
+ return $this->_compare($this->value, $this->is_negative, $y->value, $y->is_negative);\r
+ }\r
+\r
+ /**\r
+ * Compares two numbers.\r
+ *\r
+ * @param Array $x_value\r
+ * @param Boolean $x_negative\r
+ * @param Array $y_value\r
+ * @param Boolean $y_negative\r
+ * @return Integer\r
+ * @see compare()\r
+ * @access private\r
+ */\r
+ function _compare($x_value, $x_negative, $y_value, $y_negative)\r
+ {\r
+ if ( $x_negative != $y_negative ) {\r
+ return ( !$x_negative && $y_negative ) ? 1 : -1;\r
+ }\r
+\r
+ $result = $x_negative ? -1 : 1;\r
+\r
+ if ( count($x_value) != count($y_value) ) {\r
+ return ( count($x_value) > count($y_value) ) ? $result : -$result;\r
+ }\r
+ $size = max(count($x_value), count($y_value));\r
+\r
+ $x_value = array_pad($x_value, $size, 0);\r
+ $y_value = array_pad($y_value, $size, 0);\r
+\r
+ for ($i = count($x_value) - 1; $i >= 0; --$i) {\r
+ if ($x_value[$i] != $y_value[$i]) {\r
+ return ( $x_value[$i] > $y_value[$i] ) ? $result : -$result;\r
+ }\r
+ }\r
+\r
+ return 0;\r
+ }\r
+\r
+ /**\r
+ * Tests the equality of two numbers.\r
+ *\r
+ * If you need to see if one number is greater than or less than another number, use Math_BigInteger::compare()\r
+ *\r
+ * @param Math_BigInteger $x\r
+ * @return Boolean\r
+ * @access public\r
+ * @see compare()\r
+ */\r
+ function equals($x)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ return gmp_cmp($this->value, $x->value) == 0;\r
+ default:\r
+ return $this->value === $x->value && $this->is_negative == $x->is_negative;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Set Precision\r
+ *\r
+ * Some bitwise operations give different results depending on the precision being used. Examples include left\r
+ * shift, not, and rotates.\r
+ *\r
+ * @param Integer $bits\r
+ * @access public\r
+ */\r
+ function setPrecision($bits)\r
+ {\r
+ $this->precision = $bits;\r
+ if ( MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_BCMATH ) {\r
+ $this->bitmask = new Math_BigInteger(chr((1 << ($bits & 0x7)) - 1) . str_repeat(chr(0xFF), $bits >> 3), 256);\r
+ } else {\r
+ $this->bitmask = new Math_BigInteger(bcpow('2', $bits, 0));\r
+ }\r
+\r
+ $temp = $this->_normalize($this);\r
+ $this->value = $temp->value;\r
+ }\r
+\r
+ /**\r
+ * Logical And\r
+ *\r
+ * @param Math_BigInteger $x\r
+ * @access public\r
+ * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>\r
+ * @return Math_BigInteger\r
+ */\r
+ function bitwise_and($x)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = gmp_and($this->value, $x->value);\r
+\r
+ return $this->_normalize($temp);\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $left = $this->toBytes();\r
+ $right = $x->toBytes();\r
+\r
+ $length = max(strlen($left), strlen($right));\r
+\r
+ $left = str_pad($left, $length, chr(0), STR_PAD_LEFT);\r
+ $right = str_pad($right, $length, chr(0), STR_PAD_LEFT);\r
+\r
+ return $this->_normalize(new Math_BigInteger($left & $right, 256));\r
+ }\r
+\r
+ $result = $this->copy();\r
+\r
+ $length = min(count($x->value), count($this->value));\r
+\r
+ $result->value = array_slice($result->value, 0, $length);\r
+\r
+ for ($i = 0; $i < $length; ++$i) {\r
+ $result->value[$i]&= $x->value[$i];\r
+ }\r
+\r
+ return $this->_normalize($result);\r
+ }\r
+\r
+ /**\r
+ * Logical Or\r
+ *\r
+ * @param Math_BigInteger $x\r
+ * @access public\r
+ * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>\r
+ * @return Math_BigInteger\r
+ */\r
+ function bitwise_or($x)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = gmp_or($this->value, $x->value);\r
+\r
+ return $this->_normalize($temp);\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $left = $this->toBytes();\r
+ $right = $x->toBytes();\r
+\r
+ $length = max(strlen($left), strlen($right));\r
+\r
+ $left = str_pad($left, $length, chr(0), STR_PAD_LEFT);\r
+ $right = str_pad($right, $length, chr(0), STR_PAD_LEFT);\r
+\r
+ return $this->_normalize(new Math_BigInteger($left | $right, 256));\r
+ }\r
+\r
+ $length = max(count($this->value), count($x->value));\r
+ $result = $this->copy();\r
+ $result->value = array_pad($result->value, $length, 0);\r
+ $x->value = array_pad($x->value, $length, 0);\r
+\r
+ for ($i = 0; $i < $length; ++$i) {\r
+ $result->value[$i]|= $x->value[$i];\r
+ }\r
+\r
+ return $this->_normalize($result);\r
+ }\r
+\r
+ /**\r
+ * Logical Exclusive-Or\r
+ *\r
+ * @param Math_BigInteger $x\r
+ * @access public\r
+ * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>\r
+ * @return Math_BigInteger\r
+ */\r
+ function bitwise_xor($x)\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ $temp = new Math_BigInteger();\r
+ $temp->value = gmp_xor($this->value, $x->value);\r
+\r
+ return $this->_normalize($temp);\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $left = $this->toBytes();\r
+ $right = $x->toBytes();\r
+\r
+ $length = max(strlen($left), strlen($right));\r
+\r
+ $left = str_pad($left, $length, chr(0), STR_PAD_LEFT);\r
+ $right = str_pad($right, $length, chr(0), STR_PAD_LEFT);\r
+\r
+ return $this->_normalize(new Math_BigInteger($left ^ $right, 256));\r
+ }\r
+\r
+ $length = max(count($this->value), count($x->value));\r
+ $result = $this->copy();\r
+ $result->value = array_pad($result->value, $length, 0);\r
+ $x->value = array_pad($x->value, $length, 0);\r
+\r
+ for ($i = 0; $i < $length; ++$i) {\r
+ $result->value[$i]^= $x->value[$i];\r
+ }\r
+\r
+ return $this->_normalize($result);\r
+ }\r
+\r
+ /**\r
+ * Logical Not\r
+ *\r
+ * @access public\r
+ * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>\r
+ * @return Math_BigInteger\r
+ */\r
+ function bitwise_not()\r
+ {\r
+ // calculuate "not" without regard to $this->precision\r
+ // (will always result in a smaller number. ie. ~1 isn't 1111 1110 - it's 0)\r
+ $temp = $this->toBytes();\r
+ $pre_msb = decbin(ord($temp[0]));\r
+ $temp = ~$temp;\r
+ $msb = decbin(ord($temp[0]));\r
+ if (strlen($msb) == 8) {\r
+ $msb = substr($msb, strpos($msb, '0'));\r
+ }\r
+ $temp[0] = chr(bindec($msb));\r
+\r
+ // see if we need to add extra leading 1's\r
+ $current_bits = strlen($pre_msb) + 8 * strlen($temp) - 8;\r
+ $new_bits = $this->precision - $current_bits;\r
+ if ($new_bits <= 0) {\r
+ return $this->_normalize(new Math_BigInteger($temp, 256));\r
+ }\r
+\r
+ // generate as many leading 1's as we need to.\r
+ $leading_ones = chr((1 << ($new_bits & 0x7)) - 1) . str_repeat(chr(0xFF), $new_bits >> 3);\r
+ $this->_base256_lshift($leading_ones, $current_bits);\r
+\r
+ $temp = str_pad($temp, ceil($this->bits / 8), chr(0), STR_PAD_LEFT);\r
+\r
+ return $this->_normalize(new Math_BigInteger($leading_ones | $temp, 256));\r
+ }\r
+\r
+ /**\r
+ * Logical Right Shift\r
+ *\r
+ * Shifts BigInteger's by $shift bits, effectively dividing by 2**$shift.\r
+ *\r
+ * @param Integer $shift\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ * @internal The only version that yields any speed increases is the internal version.\r
+ */\r
+ function bitwise_rightShift($shift)\r
+ {\r
+ $temp = new Math_BigInteger();\r
+\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ static $two;\r
+\r
+ if (!isset($two)) {\r
+ $two = gmp_init('2');\r
+ }\r
+\r
+ $temp->value = gmp_div_q($this->value, gmp_pow($two, $shift));\r
+\r
+ break;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $temp->value = bcdiv($this->value, bcpow('2', $shift, 0), 0);\r
+\r
+ break;\r
+ default: // could just replace _lshift with this, but then all _lshift() calls would need to be rewritten\r
+ // and I don't want to do that...\r
+ $temp->value = $this->value;\r
+ $temp->_rshift($shift);\r
+ }\r
+\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ /**\r
+ * Logical Left Shift\r
+ *\r
+ * Shifts BigInteger's by $shift bits, effectively multiplying by 2**$shift.\r
+ *\r
+ * @param Integer $shift\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ * @internal The only version that yields any speed increases is the internal version.\r
+ */\r
+ function bitwise_leftShift($shift)\r
+ {\r
+ $temp = new Math_BigInteger();\r
+\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ static $two;\r
+\r
+ if (!isset($two)) {\r
+ $two = gmp_init('2');\r
+ }\r
+\r
+ $temp->value = gmp_mul($this->value, gmp_pow($two, $shift));\r
+\r
+ break;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ $temp->value = bcmul($this->value, bcpow('2', $shift, 0), 0);\r
+\r
+ break;\r
+ default: // could just replace _rshift with this, but then all _lshift() calls would need to be rewritten\r
+ // and I don't want to do that...\r
+ $temp->value = $this->value;\r
+ $temp->_lshift($shift);\r
+ }\r
+\r
+ return $this->_normalize($temp);\r
+ }\r
+\r
+ /**\r
+ * Logical Left Rotate\r
+ *\r
+ * Instead of the top x bits being dropped they're appended to the shifted bit string.\r
+ *\r
+ * @param Integer $shift\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ */\r
+ function bitwise_leftRotate($shift)\r
+ {\r
+ $bits = $this->toBytes();\r
+\r
+ if ($this->precision > 0) {\r
+ $precision = $this->precision;\r
+ if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_BCMATH ) {\r
+ $mask = $this->bitmask->subtract(new Math_BigInteger(1));\r
+ $mask = $mask->toBytes();\r
+ } else {\r
+ $mask = $this->bitmask->toBytes();\r
+ }\r
+ } else {\r
+ $temp = ord($bits[0]);\r
+ for ($i = 0; $temp >> $i; ++$i);\r
+ $precision = 8 * strlen($bits) - 8 + $i;\r
+ $mask = chr((1 << ($precision & 0x7)) - 1) . str_repeat(chr(0xFF), $precision >> 3);\r
+ }\r
+\r
+ if ($shift < 0) {\r
+ $shift+= $precision;\r
+ }\r
+ $shift%= $precision;\r
+\r
+ if (!$shift) {\r
+ return $this->copy();\r
+ }\r
+\r
+ $left = $this->bitwise_leftShift($shift);\r
+ $left = $left->bitwise_and(new Math_BigInteger($mask, 256));\r
+ $right = $this->bitwise_rightShift($precision - $shift);\r
+ $result = MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_BCMATH ? $left->bitwise_or($right) : $left->add($right);\r
+ return $this->_normalize($result);\r
+ }\r
+\r
+ /**\r
+ * Logical Right Rotate\r
+ *\r
+ * Instead of the bottom x bits being dropped they're prepended to the shifted bit string.\r
+ *\r
+ * @param Integer $shift\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ */\r
+ function bitwise_rightRotate($shift)\r
+ {\r
+ return $this->bitwise_leftRotate(-$shift);\r
+ }\r
+\r
+ /**\r
+ * Set random number generator function\r
+ *\r
+ * This function is deprecated.\r
+ *\r
+ * @param String $generator\r
+ * @access public\r
+ */\r
+ function setRandomGenerator($generator)\r
+ {\r
+ }\r
+\r
+ /**\r
+ * Generate a random number\r
+ *\r
+ * @param optional Integer $min\r
+ * @param optional Integer $max\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ */\r
+ function random($min = false, $max = false)\r
+ {\r
+ if ($min === false) {\r
+ $min = new Math_BigInteger(0);\r
+ }\r
+\r
+ if ($max === false) {\r
+ $max = new Math_BigInteger(0x7FFFFFFF);\r
+ }\r
+\r
+ $compare = $max->compare($min);\r
+\r
+ if (!$compare) {\r
+ return $this->_normalize($min);\r
+ } else if ($compare < 0) {\r
+ // if $min is bigger then $max, swap $min and $max\r
+ $temp = $max;\r
+ $max = $min;\r
+ $min = $temp;\r
+ }\r
+\r
+ $max = $max->subtract($min);\r
+ $max = ltrim($max->toBytes(), chr(0));\r
+ $size = strlen($max) - 1;\r
+\r
+ $crypt_random = function_exists('crypt_random_string') || (!class_exists('Crypt_Random') && function_exists('crypt_random_string'));\r
+ if ($crypt_random) {\r
+ $random = crypt_random_string($size);\r
+ } else {\r
+ $random = '';\r
+\r
+ if ($size & 1) {\r
+ $random.= chr(mt_rand(0, 255));\r
+ }\r
+\r
+ $blocks = $size >> 1;\r
+ for ($i = 0; $i < $blocks; ++$i) {\r
+ // mt_rand(-2147483648, 0x7FFFFFFF) always produces -2147483648 on some systems\r
+ $random.= pack('n', mt_rand(0, 0xFFFF));\r
+ }\r
+ }\r
+\r
+ $fragment = new Math_BigInteger($random, 256);\r
+ $leading = $fragment->compare(new Math_BigInteger(substr($max, 1), 256)) > 0 ?\r
+ ord($max[0]) - 1 : ord($max[0]);\r
+\r
+ if (!$crypt_random) {\r
+ $msb = chr(mt_rand(0, $leading));\r
+ } else {\r
+ $cutoff = floor(0xFF / $leading) * $leading;\r
+ while (true) {\r
+ $msb = ord(crypt_random_string(1));\r
+ if ($msb <= $cutoff) {\r
+ $msb%= $leading;\r
+ break;\r
+ }\r
+ }\r
+ $msb = chr($msb);\r
+ }\r
+\r
+ $random = new Math_BigInteger($msb . $random, 256);\r
+\r
+ return $this->_normalize($random->add($min));\r
+ }\r
+\r
+ /**\r
+ * Generate a random prime number.\r
+ *\r
+ * If there's not a prime within the given range, false will be returned. If more than $timeout seconds have elapsed,\r
+ * give up and return false.\r
+ *\r
+ * @param optional Integer $min\r
+ * @param optional Integer $max\r
+ * @param optional Integer $timeout\r
+ * @return Math_BigInteger\r
+ * @access public\r
+ * @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap4.pdf#page=15 HAC 4.44}.\r
+ */\r
+ function randomPrime($min = false, $max = false, $timeout = false)\r
+ {\r
+ if ($min === false) {\r
+ $min = new Math_BigInteger(0);\r
+ }\r
+\r
+ if ($max === false) {\r
+ $max = new Math_BigInteger(0x7FFFFFFF);\r
+ }\r
+\r
+ $compare = $max->compare($min);\r
+\r
+ if (!$compare) {\r
+ return $min->isPrime() ? $min : false;\r
+ } else if ($compare < 0) {\r
+ // if $min is bigger then $max, swap $min and $max\r
+ $temp = $max;\r
+ $max = $min;\r
+ $min = $temp;\r
+ }\r
+\r
+ static $one, $two;\r
+ if (!isset($one)) {\r
+ $one = new Math_BigInteger(1);\r
+ $two = new Math_BigInteger(2);\r
+ }\r
+\r
+ $start = time();\r
+\r
+ $x = $this->random($min, $max);\r
+\r
+ // gmp_nextprime() requires PHP 5 >= 5.2.0 per <http://php.net/gmp-nextprime>.\r
+ if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_GMP && function_exists('gmp_nextprime') ) {\r
+ $p->value = gmp_nextprime($x->value);\r
+\r
+ if ($p->compare($max) <= 0) {\r
+ return $p;\r
+ }\r
+\r
+ if (!$min->equals($x)) {\r
+ $x = $x->subtract($one);\r
+ }\r
+\r
+ return $x->randomPrime($min, $x);\r
+ }\r
+\r
+ if ($x->equals($two)) {\r
+ return $x;\r
+ }\r
+\r
+ $x->_make_odd();\r
+ if ($x->compare($max) > 0) {\r
+ // if $x > $max then $max is even and if $min == $max then no prime number exists between the specified range\r
+ if ($min->equals($max)) {\r
+ return false;\r
+ }\r
+ $x = $min->copy();\r
+ $x->_make_odd();\r
+ }\r
+\r
+ $initial_x = $x->copy();\r
+\r
+ while (true) {\r
+ if ($timeout !== false && time() - $start > $timeout) {\r
+ return false;\r
+ }\r
+\r
+ if ($x->isPrime()) {\r
+ return $x;\r
+ }\r
+\r
+ $x = $x->add($two);\r
+\r
+ if ($x->compare($max) > 0) {\r
+ $x = $min->copy();\r
+ if ($x->equals($two)) {\r
+ return $x;\r
+ }\r
+ $x->_make_odd();\r
+ }\r
+\r
+ if ($x->equals($initial_x)) {\r
+ return false;\r
+ }\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Make the current number odd\r
+ *\r
+ * If the current number is odd it'll be unchanged. If it's even, one will be added to it.\r
+ *\r
+ * @see randomPrime()\r
+ * @access private\r
+ */\r
+ function _make_odd()\r
+ {\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ gmp_setbit($this->value, 0);\r
+ break;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ if ($this->value[strlen($this->value) - 1] % 2 == 0) {\r
+ $this->value = bcadd($this->value, '1');\r
+ }\r
+ break;\r
+ default:\r
+ $this->value[0] |= 1;\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Checks a numer to see if it's prime\r
+ *\r
+ * Assuming the $t parameter is not set, this function has an error rate of 2**-80. The main motivation for the\r
+ * $t parameter is distributability. Math_BigInteger::randomPrime() can be distributed accross multiple pageloads\r
+ * on a website instead of just one.\r
+ *\r
+ * @param optional Integer $t\r
+ * @return Boolean\r
+ * @access public\r
+ * @internal Uses the\r
+ * {@link http://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test Miller-Rabin primality test}. See \r
+ * {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap4.pdf#page=8 HAC 4.24}.\r
+ */\r
+ function isPrime($t = false)\r
+ {\r
+ $length = strlen($this->toBytes());\r
+\r
+ if (!$t) {\r
+ // see HAC 4.49 "Note (controlling the error probability)"\r
+ if ($length >= 163) { $t = 2; } // floor(1300 / 8)\r
+ else if ($length >= 106) { $t = 3; } // floor( 850 / 8)\r
+ else if ($length >= 81 ) { $t = 4; } // floor( 650 / 8)\r
+ else if ($length >= 68 ) { $t = 5; } // floor( 550 / 8)\r
+ else if ($length >= 56 ) { $t = 6; } // floor( 450 / 8)\r
+ else if ($length >= 50 ) { $t = 7; } // floor( 400 / 8)\r
+ else if ($length >= 43 ) { $t = 8; } // floor( 350 / 8)\r
+ else if ($length >= 37 ) { $t = 9; } // floor( 300 / 8)\r
+ else if ($length >= 31 ) { $t = 12; } // floor( 250 / 8)\r
+ else if ($length >= 25 ) { $t = 15; } // floor( 200 / 8)\r
+ else if ($length >= 18 ) { $t = 18; } // floor( 150 / 8)\r
+ else { $t = 27; }\r
+ }\r
+\r
+ // ie. gmp_testbit($this, 0)\r
+ // ie. isEven() or !isOdd()\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ return gmp_prob_prime($this->value, $t) != 0;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ if ($this->value === '2') {\r
+ return true;\r
+ }\r
+ if ($this->value[strlen($this->value) - 1] % 2 == 0) {\r
+ return false;\r
+ }\r
+ break;\r
+ default:\r
+ if ($this->value == array(2)) {\r
+ return true;\r
+ }\r
+ if (~$this->value[0] & 1) {\r
+ return false;\r
+ }\r
+ }\r
+\r
+ static $primes, $zero, $one, $two;\r
+\r
+ if (!isset($primes)) {\r
+ $primes = array(\r
+ 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, \r
+ 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, \r
+ 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, \r
+ 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, \r
+ 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, \r
+ 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, \r
+ 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, \r
+ 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, \r
+ 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, \r
+ 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, \r
+ 953, 967, 971, 977, 983, 991, 997\r
+ );\r
+\r
+ if ( MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_INTERNAL ) {\r
+ for ($i = 0; $i < count($primes); ++$i) {\r
+ $primes[$i] = new Math_BigInteger($primes[$i]);\r
+ }\r
+ }\r
+\r
+ $zero = new Math_BigInteger();\r
+ $one = new Math_BigInteger(1);\r
+ $two = new Math_BigInteger(2);\r
+ }\r
+\r
+ if ($this->equals($one)) {\r
+ return false;\r
+ }\r
+\r
+ // see HAC 4.4.1 "Random search for probable primes"\r
+ if ( MATH_BIGINTEGER_MODE != MATH_BIGINTEGER_MODE_INTERNAL ) {\r
+ foreach ($primes as $prime) {\r
+ list(, $r) = $this->divide($prime);\r
+ if ($r->equals($zero)) {\r
+ return $this->equals($prime);\r
+ }\r
+ }\r
+ } else {\r
+ $value = $this->value;\r
+ foreach ($primes as $prime) {\r
+ list(, $r) = $this->_divide_digit($value, $prime);\r
+ if (!$r) {\r
+ return count($value) == 1 && $value[0] == $prime;\r
+ }\r
+ }\r
+ }\r
+\r
+ $n = $this->copy();\r
+ $n_1 = $n->subtract($one);\r
+ $n_2 = $n->subtract($two);\r
+\r
+ $r = $n_1->copy();\r
+ $r_value = $r->value;\r
+ // ie. $s = gmp_scan1($n, 0) and $r = gmp_div_q($n, gmp_pow(gmp_init('2'), $s));\r
+ if ( MATH_BIGINTEGER_MODE == MATH_BIGINTEGER_MODE_BCMATH ) {\r
+ $s = 0;\r
+ // if $n was 1, $r would be 0 and this would be an infinite loop, hence our $this->equals($one) check earlier\r
+ while ($r->value[strlen($r->value) - 1] % 2 == 0) {\r
+ $r->value = bcdiv($r->value, '2', 0);\r
+ ++$s;\r
+ }\r
+ } else {\r
+ for ($i = 0, $r_length = count($r_value); $i < $r_length; ++$i) {\r
+ $temp = ~$r_value[$i] & 0xFFFFFF;\r
+ for ($j = 1; ($temp >> $j) & 1; ++$j);\r
+ if ($j != 25) {\r
+ break;\r
+ }\r
+ }\r
+ $s = 26 * $i + $j - 1;\r
+ $r->_rshift($s);\r
+ }\r
+\r
+ for ($i = 0; $i < $t; ++$i) {\r
+ $a = $this->random($two, $n_2);\r
+ $y = $a->modPow($r, $n);\r
+\r
+ if (!$y->equals($one) && !$y->equals($n_1)) {\r
+ for ($j = 1; $j < $s && !$y->equals($n_1); ++$j) {\r
+ $y = $y->modPow($two, $n);\r
+ if ($y->equals($one)) {\r
+ return false;\r
+ }\r
+ }\r
+\r
+ if (!$y->equals($n_1)) {\r
+ return false;\r
+ }\r
+ }\r
+ }\r
+ return true;\r
+ }\r
+\r
+ /**\r
+ * Logical Left Shift\r
+ *\r
+ * Shifts BigInteger's by $shift bits.\r
+ *\r
+ * @param Integer $shift\r
+ * @access private\r
+ */\r
+ function _lshift($shift)\r
+ {\r
+ if ( $shift == 0 ) {\r
+ return;\r
+ }\r
+\r
+ $num_digits = (int) ($shift / MATH_BIGINTEGER_BASE);\r
+ $shift %= MATH_BIGINTEGER_BASE;\r
+ $shift = 1 << $shift;\r
+\r
+ $carry = 0;\r
+\r
+ for ($i = 0; $i < count($this->value); ++$i) {\r
+ $temp = $this->value[$i] * $shift + $carry;\r
+ $carry = (int) ($temp / MATH_BIGINTEGER_BASE_FULL);\r
+ $this->value[$i] = (int) ($temp - $carry * MATH_BIGINTEGER_BASE_FULL);\r
+ }\r
+\r
+ if ( $carry ) {\r
+ $this->value[] = $carry;\r
+ }\r
+\r
+ while ($num_digits--) {\r
+ array_unshift($this->value, 0);\r
+ }\r
+ }\r
+\r
+ /**\r
+ * Logical Right Shift\r
+ *\r
+ * Shifts BigInteger's by $shift bits.\r
+ *\r
+ * @param Integer $shift\r
+ * @access private\r
+ */\r
+ function _rshift($shift)\r
+ {\r
+ if ($shift == 0) {\r
+ return;\r
+ }\r
+\r
+ $num_digits = (int) ($shift / MATH_BIGINTEGER_BASE);\r
+ $shift %= MATH_BIGINTEGER_BASE;\r
+ $carry_shift = MATH_BIGINTEGER_BASE - $shift;\r
+ $carry_mask = (1 << $shift) - 1;\r
+\r
+ if ( $num_digits ) {\r
+ $this->value = array_slice($this->value, $num_digits);\r
+ }\r
+\r
+ $carry = 0;\r
+\r
+ for ($i = count($this->value) - 1; $i >= 0; --$i) {\r
+ $temp = $this->value[$i] >> $shift | $carry;\r
+ $carry = ($this->value[$i] & $carry_mask) << $carry_shift;\r
+ $this->value[$i] = $temp;\r
+ }\r
+\r
+ $this->value = $this->_trim($this->value);\r
+ }\r
+\r
+ /**\r
+ * Normalize\r
+ *\r
+ * Removes leading zeros and truncates (if necessary) to maintain the appropriate precision\r
+ *\r
+ * @param Math_BigInteger\r
+ * @return Math_BigInteger\r
+ * @see _trim()\r
+ * @access private\r
+ */\r
+ function _normalize($result)\r
+ {\r
+ $result->precision = $this->precision;\r
+ $result->bitmask = $this->bitmask;\r
+\r
+ switch ( MATH_BIGINTEGER_MODE ) {\r
+ case MATH_BIGINTEGER_MODE_GMP:\r
+ if (!empty($result->bitmask->value)) {\r
+ $result->value = gmp_and($result->value, $result->bitmask->value);\r
+ }\r
+\r
+ return $result;\r
+ case MATH_BIGINTEGER_MODE_BCMATH:\r
+ if (!empty($result->bitmask->value)) {\r
+ $result->value = bcmod($result->value, $result->bitmask->value);\r
+ }\r
+\r
+ return $result;\r
+ }\r
+\r
+ $value = &$result->value;\r
+\r
+ if ( !count($value) ) {\r
+ return $result;\r
+ }\r
+\r
+ $value = $this->_trim($value);\r
+\r
+ if (!empty($result->bitmask->value)) {\r
+ $length = min(count($value), count($this->bitmask->value));\r
+ $value = array_slice($value, 0, $length);\r
+\r
+ for ($i = 0; $i < $length; ++$i) {\r
+ $value[$i] = $value[$i] & $this->bitmask->value[$i];\r
+ }\r
+ }\r
+\r
+ return $result;\r
+ }\r
+\r
+ /**\r
+ * Trim\r
+ *\r
+ * Removes leading zeros\r
+ *\r
+ * @param Array $value\r
+ * @return Math_BigInteger\r
+ * @access private\r
+ */\r
+ function _trim($value)\r
+ {\r
+ for ($i = count($value) - 1; $i >= 0; --$i) {\r
+ if ( $value[$i] ) {\r
+ break;\r
+ }\r
+ unset($value[$i]);\r
+ }\r
+\r
+ return $value;\r
+ }\r
+\r
+ /**\r
+ * Array Repeat\r
+ *\r
+ * @param $input Array\r
+ * @param $multiplier mixed\r
+ * @return Array\r
+ * @access private\r
+ */\r
+ function _array_repeat($input, $multiplier)\r
+ {\r
+ return ($multiplier) ? array_fill(0, $multiplier, $input) : array();\r
+ }\r
+\r
+ /**\r
+ * Logical Left Shift\r
+ *\r
+ * Shifts binary strings $shift bits, essentially multiplying by 2**$shift.\r
+ *\r
+ * @param $x String\r
+ * @param $shift Integer\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _base256_lshift(&$x, $shift)\r
+ {\r
+ if ($shift == 0) {\r
+ return;\r
+ }\r
+\r
+ $num_bytes = $shift >> 3; // eg. floor($shift/8)\r
+ $shift &= 7; // eg. $shift % 8\r
+\r
+ $carry = 0;\r
+ for ($i = strlen($x) - 1; $i >= 0; --$i) {\r
+ $temp = ord($x[$i]) << $shift | $carry;\r
+ $x[$i] = chr($temp);\r
+ $carry = $temp >> 8;\r
+ }\r
+ $carry = ($carry != 0) ? chr($carry) : '';\r
+ $x = $carry . $x . str_repeat(chr(0), $num_bytes);\r
+ }\r
+\r
+ /**\r
+ * Logical Right Shift\r
+ *\r
+ * Shifts binary strings $shift bits, essentially dividing by 2**$shift and returning the remainder.\r
+ *\r
+ * @param $x String\r
+ * @param $shift Integer\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _base256_rshift(&$x, $shift)\r
+ {\r
+ if ($shift == 0) {\r
+ $x = ltrim($x, chr(0));\r
+ return '';\r
+ }\r
+\r
+ $num_bytes = $shift >> 3; // eg. floor($shift/8)\r
+ $shift &= 7; // eg. $shift % 8\r
+\r
+ $remainder = '';\r
+ if ($num_bytes) {\r
+ $start = $num_bytes > strlen($x) ? -strlen($x) : -$num_bytes;\r
+ $remainder = substr($x, $start);\r
+ $x = substr($x, 0, -$num_bytes);\r
+ }\r
+\r
+ $carry = 0;\r
+ $carry_shift = 8 - $shift;\r
+ for ($i = 0; $i < strlen($x); ++$i) {\r
+ $temp = (ord($x[$i]) >> $shift) | $carry;\r
+ $carry = (ord($x[$i]) << $carry_shift) & 0xFF;\r
+ $x[$i] = chr($temp);\r
+ }\r
+ $x = ltrim($x, chr(0));\r
+\r
+ $remainder = chr($carry >> $carry_shift) . $remainder;\r
+\r
+ return ltrim($remainder, chr(0));\r
+ }\r
+\r
+ // one quirk about how the following functions are implemented is that PHP defines N to be an unsigned long\r
+ // at 32-bits, while java's longs are 64-bits.\r
+\r
+ /**\r
+ * Converts 32-bit integers to bytes.\r
+ *\r
+ * @param Integer $x\r
+ * @return String\r
+ * @access private\r
+ */\r
+ function _int2bytes($x)\r
+ {\r
+ return ltrim(pack('N', $x), chr(0));\r
+ }\r
+\r
+ /**\r
+ * Converts bytes to 32-bit integers\r
+ *\r
+ * @param String $x\r
+ * @return Integer\r
+ * @access private\r
+ */\r
+ function _bytes2int($x)\r
+ {\r
+ $temp = unpack('Nint', str_pad($x, 4, chr(0), STR_PAD_LEFT));\r
+ return $temp['int'];\r
+ }\r
+\r
+ /**\r
+ * DER-encode an integer\r
+ *\r
+ * The ability to DER-encode integers is needed to create RSA public keys for use with OpenSSL\r
+ *\r
+ * @see modPow()\r
+ * @access private\r
+ * @param Integer $length\r
+ * @return String\r
+ */\r
+ function _encodeASN1Length($length)\r
+ {\r
+ if ($length <= 0x7F) {\r
+ return chr($length);\r
+ }\r
+\r
+ $temp = ltrim(pack('N', $length), chr(0));\r
+ return pack('Ca*', 0x80 | strlen($temp), $temp);\r
+ }\r
+}\r
projects / quix0rs-gnu-social.git / commitdiff