friendica-addons/securemail/php-gpg/libs/GPG/globals.php

<?php
/** @package    php-gpg::GPG */

/** assign globals */
global $bs;
global $bx2;
global $bm;
global $bx;
global $bd;
global $bdm;

$bs = 28;
$bx2 = 1 << $bs;
$bm = $bx2 - 1;
$bx = $bx2 >> 1;
$bd = $bs >> 1;
$bdm = (1 << $bd) - 1;

/**
 */
function mpi2b($s)
{
    global $bs;
    global $bx2;
    global $bm;
    global $bx;
    global $bd;
    global $bdm;

    $bn = 1;
    $r = array(0);
    $rn = 0;
    $sb = 256;
    $c = 0;
    $sn = strlen($s);
    if($sn < 2) {
        echo("string too short, not a MPI");
        return 0;
    }

    $len = ($sn - 2) * 8;
    $bits = ord($s[0]) * 256 + ord($s[1]);
    if ($bits > $len || $bits < $len - 8) {
        echo("not a MPI, bits = $bits, len = $len");
        return 0;
    }

    for ($n = 0; $n < $len; $n++) {
        if (($sb <<= 1) > 255) {
            $sb = 1; $c = ord($s[--$sn]);
        }
        if ($bn > $bm) {
            $bn = 1;
            $r[++$rn]=0;
        }
        if ($c & $sb) $r[$rn] |= $bn;
        $bn <<= 1;
    }

    return $r;
}

/**
 */
function b2mpi($b)
{
    global $bs;
    global $bx2;
    global $bm;
    global $bx;
    global $bd;
    global $bdm;

    $bn = 1;
    $bc = 0;
    $r = array(0);
    $rb = 1;
    $rn = 0;
    $bits = count($b) * $bs;
    $n = 0;
    $rr = "";

    for ($n = 0; $n < $bits; $n++) {
        if ($b[$bc] & $bn) $r[$rn] |= $rb;
        if(($rb <<= 1) > 255) {
            $rb = 1; $r[++$rn]=0;
        }
        if (($bn <<= 1) > $bm) {
            $bn=1; $bc++;
        }
    }

    while ($rn && $r[$rn]==0) $rn--;

    $bn=256;
    for($bits = 8; $bits > 0; $bits--) if ($r[$rn] & ($bn >>= 1)) break;
    $bits += $rn * 8;

    $rr .= chr($bits / 256 ) . chr($bits % 256);
    if ($bits) for($n = $rn; $n >= 0; $n--) $rr .= chr($r[$n]);

    return $rr;
}

/**
 */
function bmodexp($xx, $y, $m) {
    global $bs;
    global $bx2;
    global $bm;
    global $bx;
    global $bd;
    global $bdm;

    $r = array(1);
    $an = 0;
    $a = 0;
    $x = array_merge((array)$xx);
    $n = count($m) * 2;
    $mu = array_fill(0, $n + 1, 0);

    $mu[$n--] = 1;
    for(; $n >= 0; $n--) $mu[$n] = 0;
    $dd = new bdiv($mu, $m);
    $mu = $dd->q;

    for($n = 0; $n < count($y); $n++) {
        for ($a = 1, $an = 0; $an < $bs; $an++, $a <<= 1) {
            if ($y[$n] & $a) $r = bmod2(bmul($r, $x), $m, $mu);
            $x = bmod2(bmul($x, $x), $m, $mu);
        }
    }

    return $r;
}

/**
 */
function simplemod($i, $m) // returns the mod where m < 2^bd
{
    $c = 0;
    $v = 0;
    for ($n = count($i) - 1; $n >= 0; $n--)
    {
        $v = $i[$n];
        $c = (($v >> $bd) + ($c << $bd)) % $m;
        $c = (($v & $bdm) + ($c << $bd)) % $m;
    }

    return $c;
}

/**
 */
function bmod($p, $m) // binary modulo
{
    global $bdm;

    if (count($m) == 1) {
        if(count($p) == 1) return array($p[0] % $m[0]);
        if($m[0] < $bdm) return array(simplemod($p, $m[0]));
    }

    $r = new bdiv($p, $m);
    return $r->mod;
}

/**
 */
function bmod2($x, $m, $mu) {
    $xl = count($x) - (count($m) << 1);
    if ($xl > 0) return bmod2(array_concat(array_slice($x, 0, $xl), bmod2(array_slice($x, $xl), $m, $mu)), $m, $mu);

    $ml1 = count($m) + 1;
    $ml2 = count($m) - 1;
    $rr = 0;

    $q3 = array_slice(bmul(array_slice($x, $ml2), $mu), $ml1);
    $r1 = array_slice($x, 0, $ml1);
    $r2 = array_slice(bmul($q3, $m), 0, $ml1);

    $r = bsub($r1, $r2);
    if (count($r) == 0) {
        $r1[$ml1] = 1;
        $r = bsub($r1, $r2);
    }
    for ($n = 0;; $n++) {
        $rr = bsub($r, $m);
        if(count($rr) == 0) break;
        $r = $rr;
        if($n >= 3) return bmod2($r, $m, $mu);
    }

    return $r;
}

/**
 */
function toppart($x, $start, $len) {
    global $bx2;

    $n = 0;
    while ($start >= 0 && $len-- > 0) $n = $n * $bx2 + $x[$start--];

    return $n;
}

/**
 */
function zeros($n) {
    $r = array_fill(0, $n, 0);
    while ($n-- > 0) $r[$n] = 0;
    return $r;
}

/**
 * @package    verysimple::Encryption
 */
class bdiv {
	var $q;
	var $mod;
	function bdiv($x, $y)
	{
		global $bs;
		global $bx2;
		global $bm;
		global $bx;
		global $bd;
		global $bdm;

		$n = count($x) - 1;
		$t = count($y) - 1;
		$nmt = $n - $t;

		if ($n < $t || $n == $t && ($x[$n] < $y[$n] || $n > 0 && $x[$n] == $y[$n] && $x[$n - 1] < $y[$n - 1])) {
			$this->q = array(0);
			$this->mod = array($x);
			return;
		}

		if ($n == $t && toppart($x, $t, 2) / toppart($y, $t, 2) < 4) {
			$qq = 0;
			$xx = 0;
			for(;;) {
				$xx = bsub($x, $y);
				if(count($xx) == 0) break;
				$x = $xx; $qq++;
			}
			$this->q = array($qq);
			$this->mod = $x;
			return;
		}

		$shift2 = floor(log($y[$t]) / M_LN2) + 1;
		$shift = $bs - $shift2;
		if ($shift) {
			$x = array_merge((array)$x); $y = array_merge((array)$y);
			for($i = $t; $i > 0; $i--) $y[$i] = (($y[$i] << $shift) & $bm) | ($y[$i - 1] >> $shift2);
			$y[0] = ($y[0] << $shift) & $bm;
			if($x[$n] & (($bm << $shift2) & $bm)) {
				$x[++$n] = 0; $nmt++;
			}
			for($i = $n; $i > 0; $i--) $x[$i] = (($x[$i] << $shift) & $bm) | ($x[$i - 1] >> $shift2);
			$x[0] = ($x[0] << $shift) & $bm;
		}

		$i = 0;
		$j = 0;
		$x2 = 0;
		$q = zeros($nmt + 1);
		$y2 = array_merge(zeros($nmt), (array)$y);
		for (;;) {
			$x2 = bsub($x, $y2);
			if(count($x2) == 0) break;
			$q[$nmt]++;
			$x = $x2;
		}

		$yt = $y[$t];
		$top =toppart($y, $t, 2);
		for ($i = $n; $i > $t; $i--) {
			$m = $i - $t - 1;
			if ($i >= count($x)) $q[$m] = 1;
			else if($x[$i] == $yt) $q[$m] = $bm;
			else $q[$m] = floor(toppart($x, $i, 2) / $yt);

			$topx = toppart($x, $i, 3);
			while ($q[$m] * $top > $topx) $q[$m]--;

			$y2 = array_slice($y2, 1);
			$x2 = bsub($x, bmul(array($q[$m]), $y2));
			if (count($x2) == 0) {
				$q[$m]--;
				$x2 =bsub($x, bmul(array($q[m]), $y2));
			}
			$x = $x2;
		}

		if ($shift) {
			for($i = 0; $i < count($x) - 1; $i++) $x[$i] = ($x[$i] >> $shift) | (($x[$i + 1] << $shift2) & $bm);
			$x[count($x) - 1] >>= $shift;
		}
		$n = count($q);
		while ($n > 1 && $q[$n - 1] == 0) $n--;
		$this->q = array_slice($q, 0, $n);
		$n = count($x);
		while ($n > 1 && $x[$n - 1] == 0) $n--;
		$this->mod = array_slice($x, 0, $n);
	}
}

/**
 */
function bsub($a, $b) {
    global $bs;
    global $bx2;
    global $bm;
    global $bx;
    global $bd;
    global $bdm;

    $al = count($a);
    $bl = count($b);

    if ($bl > $al) return array();
    if ($bl == $al) {
        if($b[$bl - 1] > $a[$bl - 1]) return array();
        if($bl == 1) return array($a[0] - $b[0]);
    }

    $r = array_fill(0, $al, 0);
    $c = 0;

    for ($n = 0; $n < $bl; $n++) {
        $c += $a[$n] - $b[$n];
        $r[$n] = $c & $bm;
        $c >>= $bs;
    }
    for (; $n < $al; $n++) {
        $c += $a[$n];
        $r[$n] = $c & $bm;
        $c >>= $bs;
    }
    if ($c) return array();

    if ($r[$n - 1]) return $r;
    while ($n > 1 && $r[$n - 1] == 0) $n--;

    return array_slice($r, 0, $n);
}

/**
 */
function bmul($a, $b) {
    global $bs;
    global $bx2;
    global $bm;
    global $bx;
    global $bd;
    global $bdm;

    $b = array_merge((array)$b, array(0));
    $al = count($a);
    $bl = count($b);
    $n = 0;
    $nn = 0;
    $aa = 0;
    $c = 0;
    $m = 0;
    $g = 0;
    $gg = 0;
    $h = 0;
    $hh = 0;
    $ghh = 0;
    $ghhb = 0;

    $r = zeros($al + $bl + 1);

    for ($n = 0; $n < $al; $n++) {
        $aa = $a[$n];
        if ($aa) {
            $c = 0;
            $hh = $aa >> $bd; $h = $aa & $bdm;
            $m = $n;
            for ($nn = 0; $nn < $bl; $nn++, $m++) {
                $g = $b[$nn]; $gg = $g >> $bd; $g = $g & $bdm;
                $ghh = $g * $hh + $h * $gg;
                $ghhb = $ghh >> $bd; $ghh &= $bdm;
                $c += $r[$m] + $h * $g + ($ghh << $bd);
                $r[$m] = $c & $bm;
                $c = ($c >> $bs) + $gg * $hh + $ghhb;
            }
        }
    }
    $n = count($r);

    if ($r[$n - 1]) return $r;
    while ($n > 1 && $r[$n - 1] == 0) $n--;

    return array_slice($r, 0, $n);
}

?>