PHP programming forum. Ask questions or help people concerning PHP code. Don't understand a function? Need help implementing a class? Don't understand a class? Here is where to ask. Remember to do your homework!
when I choose small values of p and q then it becomes very easy to find p and q from n. And when I choose large values of p and q then the calculation becomes so huge that even bc math cannot handle the values. Is there any simple way to implement RSA.
when i try to calculate pow(3434,45435435) the server takes too much time and apparently just hangs. In this case I am not being able to calculate large values which is a must for RSA. I have implemented RSA with small values of p and q which is obviously not secured but I am not being able to take large values like 768 bits which is secured.
I am reading replies but you are understanding my problem, my problem is not about calculation, my problem is bcpow(large values,large values) takes so much time that you can have a cup of coffee at that time. In that case how can I implement RSA.
thank you all for your time. My problem of calculation has been solved. I have found the algorithm which can calculate the power modulo of 1024 bits number in a minute.
devendra-m wrote:thank you all for your time. My problem of calculation has been solved. I have found the algorithm which can calculate the power modulo of 1024 bits number in a minute.