encryption - Casio fx-83GB PLUS, how to perform x mod y? -
how can i
x mod y (e.g. 89 ^ 3 mod 3127)
On this calculator
I got the cryptography exam yesterday and I do not know how I have to work on the calc ..
This is the encryption of RSA algorithms. .
Any thoughts?
I suspect that your calculator is a modulus function, it's a decent algorithm that works: / P>
- Compute 89 ^ 3 = 704 969. Write it down or keep the result somewhere.
- Now to reduce the modulo n To do this, calculate the result / ignore the modulus and the decimal, e.g. 704 9 69/3127 and about; 225
- Multiply that number by modulus and subtract it from the original result, e.g. 7049 969 - 225 * 3127 = 1394. If the original derivation is so large that it exceeds your calculator, then you can calculate a small exponent and do the above reduction modules n many times. For example, if you are asking to calculate 89 ^ 10, then you can calculate 89 ^ 5 instead, reduce that module N, the result of the square is 89 ^ 10, and square value Reduce modulo n
An important point is that at any point in the calculation process, you can reduce the value modulo n and still reach the same figure. Your professor can throw you a curveball in this way - or they can not, however, be better prepared.
Comments
Post a Comment