Spomky-Labs / jose

src/Algorithm/KeyEncryption/RSA.php

Doc Comments +1 added lines, -1 removed lines

@@ -90,7 +90,7 @@
     }
 
     /**
-     * @return \phpseclib\Crypt\RSA
+     * @return JoseRSA
      */
     private function getRsaObject()
     {

src/Util/BigInteger.php

Doc Comments +24 added lines, -26 removed lines

@@ -676,7 +676,7 @@ 
      * ?>
      * </code>
      *
-     * @param \Jose\Util\Integer $y
+     * @param BigInteger $y
      * @return \Jose\Util\BigInteger
      * @internal Performs base-2**52 addition
      */
@@ -803,7 +803,7 @@ 
      * ?>
      * </code>
      *
-     * @param \Jose\Util\Integer $y
+     * @param BigInteger $y
      * @return \Jose\Util\BigInteger
      * @internal Performs base-2**52 subtraction
      */
@@ -935,7 +935,7 @@ 
      * ?>
      * </code>
      *
-     * @param \Jose\Util\Integer $x
+     * @param BigInteger $x
      * @return \Jose\Util\BigInteger
      */
     public function multiply(BigInteger $x)
@@ -1212,8 +1212,8 @@ 
      * ?>
      * </code>
      *
-     * @param \Jose\Util\Integer $y
-     * @return array
+     * @param BigInteger $y
+     * @return BigInteger[]
      * @internal This function is based off of {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=9 HAC 14.20}.
      */
     public function divide(BigInteger $y)
@@ -1426,8 +1426,8 @@ 
      * ?>
      * </code>
      *
-     * @param \Jose\Util\Integer $e
-     * @param \Jose\Util\Integer $n
+     * @param BigInteger $e
+     * @param BigInteger $n
      * @return \Jose\Util\BigInteger
      * @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
@@ -1595,8 +1595,8 @@ 
      *
      * Alias for modPow().
      *
-     * @param \Jose\Util\Integer $e
-     * @param \Jose\Util\Integer $n
+     * @param BigInteger $e
+     * @param BigInteger $n
      * @return \Jose\Util\BigInteger
      */
     public function powMod(BigInteger $e, BigInteger $n)
@@ -2211,8 +2211,8 @@ 
      * ?>
      * </code>
      *
-     * @param \Jose\Util\Integer $n
-     * @return \Jose\Util\eger|false
+     * @param BigInteger $n
+     * @return BigInteger
      * @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap14.pdf#page=21 HAC 14.64} for more information.
      */
     public function modInverse(BigInteger $n)
@@ -2272,7 +2272,7 @@ 
      * ?>
      * </code>
      *
-     * @param \Jose\Util\Integer $n
+     * @param BigInteger $n
      * @return \Jose\Util\BigInteger
      * @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,
@@ -2403,7 +2403,7 @@ 
      * ?>
      * </code>
      *
-     * @param \Jose\Util\Integer $n
+     * @param BigInteger $n
      * @return \Jose\Util\BigInteger
      */
     public function gcd(BigInteger $n)
@@ -2447,7 +2447,7 @@ 
      *
      * Note how the same comparison operator is used.  If you want to test for equality, use $x->equals($y).
      *
-     * @param \Jose\Util\Integer $y
+     * @param BigInteger $y
      * @return int < 0 if $this is less than $y; > 0 if $this is greater than $y, and 0 if they are equal.
      * @internal Could return $this->subtract($x), but that's not as fast as what we do do.
      */
@@ -2502,7 +2502,7 @@ 
      *
      * If you need to see if one number is greater than or less than another number, use BigInteger::compare()
      *
-     * @param \Jose\Util\Integer $x
+     * @param BigInteger $x
      * @return bool
      */
     public function equals(BigInteger $x)
@@ -2555,7 +2555,7 @@ 
     /**
      * Logical And
      *
-     * @param \Jose\Util\Integer $x
+     * @param BigInteger $x
      * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
      * @return \Jose\Util\BigInteger
      */
@@ -2595,7 +2595,7 @@ 
     /**
      * Logical Or
      *
-     * @param \Jose\Util\Integer $x
+     * @param BigInteger $x
      * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
      * @return \Jose\Util\BigInteger
      */
@@ -2634,7 +2634,7 @@ 
     /**
      * Logical Exclusive-Or
      *
-     * @param \Jose\Util\Integer $x
+     * @param BigInteger $x
      * @internal Implemented per a request by Lluis Pamies i Juarez <lluis _a_ pamies.cat>
      * @return \Jose\Util\BigInteger
      */
@@ -2845,7 +2845,7 @@ 
      *
      * Byte length is equal to $length. Uses \phpseclib\Crypt\Random if it's loaded and mt_rand if it's not.
      *
-     * @param int $length
+     * @param integer $size
      * @return \Jose\Util\BigInteger
      */
     private static function _random_number_helper($size)
@@ -2878,8 +2878,6 @@ 
      * BigInteger::random($min, $max)
      * BigInteger::random($max, $min)
      *
-     * @param \Jose\Util\eger $arg1
-     * @param \Jose\Util\eger $arg2
      * @return \Jose\Util\BigInteger
      */
     static function random(BigInteger $min, BigInteger $max)
@@ -2944,8 +2942,8 @@ 
      * 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 \Jose\Util\teger $min
-     * @param \Jose\Util\teger $max
+     * @param BigInteger $min
+     * @param BigInteger $max
      * @param int $timeout
      * @return Math_BigInteger|false
      * @internal See {@link http://www.cacr.math.uwaterloo.ca/hac/about/chap4.pdf#page=15 HAC 4.44}.
@@ -3344,8 +3342,8 @@ 
     /**
      * Array Repeat
      *
-     * @param $input Array
-     * @param $multiplier mixed
+     * @param integer $input Array
+     * @param integer $multiplier mixed
      * @return array
      */
     private static function _array_repeat($input, $multiplier)
@@ -3359,7 +3357,7 @@ 
      * Shifts binary strings $shift bits, essentially multiplying by 2**$shift.
      *
      * @param $x String
-     * @param $shift Integer
+     * @param integer $shift Integer
      * @return string
      */
     private static function _base256_lshift(&$x, $shift)

src/Util/Hash.php

Doc Comments +1 added lines, -1 removed lines

@@ -50,7 +50,7 @@
      *
      * As set by the constructor or by the setHash() method.
      *
-     * @return string
+     * @return integer
      */
     public function getHash()
     {

src/Util/RSA.php

Doc Comments +6 added lines, -6 removed lines

@@ -1164,7 +1164,7 @@ 
      *    Typical salt lengths in octets are hLen (the length of the output
      *    of the hash function Hash) and 0.
      *
-     * @param int $format
+     * @param integer $sLen
      */
     public function setSaltLength($sLen)
     {
@@ -1403,7 +1403,6 @@ 
      * See {@link http://tools.ietf.org/html/rfc3447#appendix-B.2.1 RFC3447#appendix-B.2.1}.
      *
      * @param string $mgfSeed
-     * @param int $mgfLen
      * @return string
      */
     private function _mgf1($mgfSeed, $maskLen)
@@ -1705,7 +1704,7 @@ 
      * @param string $m
      * @param string $em
      * @param int $emBits
-     * @return string
+     * @return boolean
      */
     private function _emsa_pss_verify($m, $em, $emBits)
     {
@@ -1775,7 +1774,7 @@ 
      *
      * @param string $m
      * @param string $s
-     * @return string
+     * @return boolean
      */
     private function _rsassa_pss_verify($m, $s)
     {
@@ -1893,7 +1892,8 @@ 
      * See {@link http://tools.ietf.org/html/rfc3447#section-8.2.2 RFC3447#section-8.2.2}.
      *
      * @param string $m
-     * @return string
+     * @param string $s
+     * @return boolean
      */
     private function _rsassa_pkcs1_v1_5_verify($m, $s)
     {
@@ -2007,7 +2007,7 @@ 
      * Decryption
      *
      * @see self::encrypt()
-     * @param string $plaintext
+     * @param string $ciphertext
      * @return string
      */
     public function decrypt($ciphertext)