note 66141 added to function.bcpowmod

However, if you read his full note, you see this paragraph: "The function bcpowmod(v, e, m) is supposedly equivalent to bcmod(bcpow(v, e), m). However, for the large numbers used as keys in the RSA algorithm, the bcpow function generates a number so big as to overflow it. For any exponent greater than a few tens of thousands, bcpow overflows and returns 1." So you still can, and should (over bcmod(bcpow(v, e), m) ), use his function if you are using larger exponents, "any exponent greater than a few tens of thousand." ---- Server IP: 64.71.164.2 Probable Submitter: 65.43.250.150 ---- X-Spam-Status: No, hits=3.1 required=5.0 tests=DATE_MISSING,FROM_NO_LOWER autolearn=no version=2.64 ---- Manual Page -- http://www.php.net/manual/en/function.bcpowmod.php Edit -- http://master.php.net/note/edit/66141 Del: integrated -- http://master.php.net/note/delete/66141/integrated Del: useless -- http://master.php.net/note/delete/66141/useless Del: bad code -- http://master.php.net/note/delete/66141/bad+code Del: spam -- http://master.php.net/note/delete/66141/spam Del: non-english -- http://master.php.net/note/delete/66141/non-english Del: in docs -- http://master.php.net/note/delete/66141/in+docs Del: other reasons-- http://master.php.net/note/delete/66141 Reject -- http://master.php.net/note/reject/66141 Search -- http://master.php.net/manage/user-notes.php