In encryption so is the mod function used alo, like in RSA.. I have heavily problems to understand that functin, someone that could help me ?

Acid_Cool_178

If you mean the modulo function, well that would be quite easy. It gives the remainder of an integer division.

Examples: 10 MOD 3 = 1
15 MOD 5 = 0
13 MOD 10 = 3
etc...

Don't know if this answers your question... otherwise, try to be more specific... ;-)

but WHY is 10 MOD 3 = 1
How is the mod function built up ?

Acid_Cool_178

because 10 = 3 * 3 + 1

other example 13 MOD 10 = 3 because 13 = 10 * 1 + 3
(1 is the quotient, 3 is the remainder of ``13 divided by 10''... the mod function simply returns the remainder of an integer division...)

Wooha, thanxx alot poiu.. Finally i'm understanding

Acid_Cool_178