Continue to Site

Welcome to EDAboard.com

Welcome to our site! EDAboard.com is an international Electronics Discussion Forum focused on EDA software, circuits, schematics, books, theory, papers, asic, pld, 8051, DSP, Network, RF, Analog Design, PCB, Service Manuals... and a whole lot more! To participate you need to register. Registration is free. Click here to register now.

(mod) at RSA cipher systems

Status
Not open for further replies.

khaledos

Junior Member level 3
Joined
Dec 11, 2012
Messages
31
Helped
0
Reputation
0
Reaction score
0
Trophy points
1,286
Activity points
1,446
at RSA cipher systems

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

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 %.
 
Last edited:

THANKS, for your effort
 

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
 

Status
Not open for further replies.

Part and Inventory Search

Welcome to EDABoard.com

Sponsor

Back
Top