"; } return $keys; } function findD($e,$m) { $n = 0; while(bccomp(bcmod(bcadd(1,bcmul($n,$m)),$e),0)!=0){ $n++; } $d=bcdiv(bcadd(1,bcmul($n,$m)),$e); return $d; } /* * Standard method of calculating D * D = E-1 (mod N) * It's presumed D will be found in less then 16 iterations */ /* * This function return Greatest Common Divisor for $e and $m numbers */ function GCD($e,$m) { $y = $e; $x = $m; while (bccomp($y, 0) != 0) { // modulus function $w = bcsub($x, bcmul($y, bcdiv($x, $y, 0)));; $x = $y; $y = $w; } return $x; } /* * Calculating E under conditions: * GCD(N,E) = 1 and 1GCD($e, $m), '1') != 0){ $e = '5'; $step = '2'; while(bccomp($this->GCD($e, $m), '1') != 0){ $e = bcadd($e, $step); if($step == '2'){ $step = '4'; }else{ $step = '2'; } } } return $e; } /* * ENCRYPT function returns * X = M^E (mod N) */ function encrypt ($m, $e, $n, $s=3) { $coded = ''; $max = strlen($m); $packets = ceil($max/$s); for($i=0; $i<$packets; $i++){ $packet = substr($m, $i*$s, $s); $code = '0'; for($j=0; $j<$s; $j++){ $code = bcadd($code, bcmul(ord($packet[$j]), bcpow('256',$j))); } $code = bcpowmod($code, $e, $n); $coded .= $code.' '; } return trim($coded); } /* ENCRYPT function returns M = X^D (mod N) */ function decrypt ($c, $d, $n) { $coded = split(' ', $c); $message = ''; $max = count($coded); for($i=0; $i<$max; $i++){ $code = bcpowmod($coded[$i], $d, $n); print "
$coded[$i] $n $d ,$code
"; while(bccomp($code, '0') != 0){ $ascii = bcmod($code, '256'); $code = bcdiv($code, '256', 0); $message .= chr($ascii); } } return $message; } } ?>XML-RPC server accepts POST requests only.