(mod) at RSA cipher systems

[khaledos]

at RSA cipher systems

what's meant by C=M mod n like (88²mod187) and how can calculate it ??

 

[albert22]

The modulo operation is just the reminder of the division. In your example divide 88² / 187 (dont do decimals)and ignore the result but take only the remainder. 7744/187=41 remainder 77. So 88² mod 187 = 77.
In this case the modulo always returns a number between 0 and 187-1.
For example 13 mod 3 = 1 because 13/3 = 4 with remainder 1.
The modulo operator in C is the %.

 

[khaledos]

THANKS, for your effort

 

[albert22]

THANKS, for your effort

I hope that I didnt confuse you. Do you need a clearer explanation?
Take care because posts just for thanking, are not allowed on the rules (somebody could complain)
If it helped just click the "helped me" button.

I may add that C=M mod n always returns C between 0 and n-1.

Regards