Comments on: RSA: Encrypting in JavaScript and Decrypting in PHP

By: tarcard

tarcard — Mon, 18 Jul 2011 21:56:56 +0000

Got some issues with the PHP libraries, since they are based on PHP4 and im currently using PHP5.2 … here’s the issue:

Strict Standards: Non-static method Crypt_RSA_MathLoader::loadWrapper() should not be called statically, assuming $this from incompatible context in C:\xampp\php\PEAR\Crypt\RSA\Key.php on line 159
Strict Standards: Only variables should be assigned by reference in C:\xampp\php\PEAR\Crypt\RSA\Key.php on line 159
Strict Standards: Non-static method PEAR::isError() should not be called statically, assuming $this from incompatible context in C:\xampp\php\PEAR\Crypt\RSA\ErrorHandler.php on line 150
Strict Standards: Non-static method Crypt_RSA_MathLoader::loadWrapper() should not be called statically, assuming $this from incompatible context in C:\xampp\php\PEAR\Crypt\RSA.php on line 191
Strict Standards: Non-static method Crypt_RSA_MathLoader::loadWrapper() should not be called statically, assuming $this from incompatible context in C:\xampp\php\PEAR\Crypt\RSA\MathLoader.php on line 98

Problem appears to be that PHP5 doesn’t like all those static calls to functions… Is there any easy way to handle this problem or changing the code in the libraries are the only option?

By: haleema

haleema — Thu, 07 Apr 2011 04:48:46 +0000

encrypting in javascript & decrypting in php is working for me.

By: haleema

haleema — Thu, 07 Apr 2011 04:47:33 +0000

hey,
i was trying to encrypt in php & decrypt in javascript using the same method. but decryption in javascript is not giving back the proper output ,it is giving some special characters. can anybody pls tell me how to get bak de string in original format ?

By: Tola Anjorin

Tola Anjorin — Mon, 07 Feb 2011 11:02:50 +0000

Please am having trouble decrypting the string in php.

I think my problem is with the

$m = $math_obj->int2bin(“11570601966616835094916890432003700913″);

i think $m is supposed to be a string of binary, however, i get weird characters like y �2h�ߋi�5R�

please any idea?

By: Zaid Crowe

Zaid Crowe — Fri, 07 Jan 2011 18:43:49 +0000

none of the examples above seem to work for strings over 13 chars – and I can’t for the life of me work out why.

Any one have any ideas/explanations?

By: franck

franck — Thu, 25 Nov 2010 15:50:42 +0000

It seems to work well, thanks for this good script. I am going to use it when submitting passwords to authenticate users without SSL. I am truying to change keys each time, but you have done the hardest work.

By: Mike

Mike — Sat, 09 Oct 2010 09:53:32 +0000

Is it possible to link your javascript to working with this library?
http://phpseclib.sourceforge.net/

Is there a way to specify the key size when generating the public & private keys? 128bit is very insecure for an assymetric algorithm.
http://en.wikipedia.org/wiki/Key_size#Asymmetric_algorithm_key_lengths

By: fie

fie — Sat, 01 May 2010 10:06:20 +0000

php, hex to bin
$bin_str = pack(“H*” , $hex_str);

By: elsehair

elsehair — Mon, 07 Dec 2009 02:48:06 +0000

Using what essentially amounts to null padding on plaintexts means that the techniques described here are about as secure as ECB mode for block ciphers. ie. it’s not all that secure. Personally, I think OAEP padding ought to be used. PEAR’s long since abandoned Crypt_RSA doesn’t support it but phpseclib’s Crypt_RSA does:

http://phpseclib.sourceforge.net/

By: shrui

shrui — Tue, 01 Dec 2009 20:39:30 +0000

[code] destroy code....
function generate($key_len = null, $pubexp = null)//add the second parameter $
//...
//original code in KeyPair.php(CRYPT_RSA-1.0.0): line 245~271{
if($pubexp != null&&$this->_math_obj->cmpAbs($pubexp,2)>0)
$e = $this->_math_obj->nextPrime($this->_math_obj->dec($pubexp));
else{
while(true){
$e = $this->_math_obj->getRand($q_len, $this->_random_generator);
if ($this->_math_obj->cmpAbs($e,2)_math_obj->nextPrime($this->_math_obj->dec($e));
break;
}
}
do{
$p = $this->_math_obj->getRand($p_len, $this->_random_generator, true);
$p = $this->_math_obj->nextPrime($p);
do{
do{
$q = $this->_math_obj->getRand($q_len, $this->_random_generator, true);
$tmp_len = $this->_math_obj->bitLen($this->_math_obj->mul($p, $q));
if ($tmp_len $key_len) $q_len--;
} while ($tmp_len != $key_len);
$q = $this->_math_obj->nextPrime($q);
$tmp = $this->_math_obj->mul($p, $q);
} while ($this->_math_obj->bitLen($tmp) != $key_len);
// $n - is shared modulus
$n = $this->_math_obj->mul($p, $q);
// generate pubexp ($e) and private ($d) keys
$pq = $this->_math_obj->mul($this->_math_obj->dec($p), $this->_math_obj->dec($q));
}while($this->_math_obj->cmpAbs($this->_math_obj->mod($pq,$e),0)==0);//mod() is a new method
//original code in KeyPair.php(CRYPT_RSA-1.0.0): line 245~271}