Mathematical Foundations

Modulo operation

there are two unique integers q and r such that a = qb + r,
where q = a/b , and 0 ≤ r < b. q and r are the quotient and remainder.
We write   r = a mod b.
--- Example: 89 mod 7 = 5 and -13 mod 6 = 5

Set of residues: Zn(余集)

----- The result of the modulo operation with modulus n is always an integer between 0 and n-1
-----The formed set is called the set of residues modulo n,or Zn
----- For each n, we have one set of residues, Zn={0,1,2,…,(n-1)}
---- for example: Z2={0,1}, Z6={0,1,2,3,4,5},

Properties of modular arithmetic

Example: Please proof the following reducibility of modular arithmetic,i.e.

Proof:  ∵a=r1*n+q1,     b=r2*n+q2,

左边式子：(a+b) mod n=[( r1*n+q1)+( r2*n+q2)] mod n

=(0+0+q1+q2)mod n

=( q1+q2)modn

右边式子：[(amod n)+(b mod n)] mod n

=[((r1*n+q1) mod n)+((r2*n+q2)mod n)] mod n

=(q1+q2)modn

∴左边等于右边，也即(a+b)mod n=[(a mod n)+(b mod n)]mod n

Proof:  ∵a=r1*n+q1,     b=r2*n+q2,

左边式子：(a*b) mod n=[( r1*n+q1)*( r2*n+q2)] mod n

=(r1*r2*n²+r1*q2*n+r2*q1*n+q1*q2)modn

=(0+0+0+q1*q2)mod n

=( q1*q2)modn

右边式子：[(amod n)*(b mod n)] mod n

=[((r1*n+q1) mod n)*((r2*n+q2)mod n)] mod n

=(q1*q2)modn

∴左边等于右边，也即(a*b)mod n=[(a mod n)*(b mod n)]mod n

Modular exponentiation

Example：Please computer 27³⁵⁷mod 17

Ans: 6

27³⁵⁷ mod 17

=[(27mod17) ³⁵⁷] mod 17=(10³⁵⁷)mod 17=(10^{256+64+32+4+1})mod 17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*(10³²mod17)*(10⁴mod17)*(10¹mod17)]mod17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*(10³²mod17)*(10⁴mod17)*(10)]mod17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*(10³²mod17)*(10²mod17)*(10²mod17)*(10)]mod 17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*(10³²mod17)*(15)*(15)*(10)]mod 17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*(10³²mod17)*((15*15)mod 17)*(10)]mod 17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*(10³²mod17)*(4)*(10)]mod17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*((10⁴mod17)⁸mod 17)*(4)*(10)]mod 17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*(4⁸mod 17)*(4)*(10)]mod 17

=[(10²⁵⁶mod17)*(10⁶⁴mod17)*(1)*(4)*(10)]mod17

=[(10²⁵⁶mod17)*(10³²mod17)*(10³²mod17)*(1)*(4)*(10)]mod 17

=[(10²⁵⁶mod17)*(1*1 mod 17)*(1)*(4)*(10)]mod17

=[(10²⁵⁶mod17)*(1)*(1)*(4)*(10)]mod17

=[((10⁶⁴mod17)⁴ mod17)* (1)*(1)*(4)*(10)]mod 17

=[((1)⁴ mod 17)* (1)*(1)*(4)*(10)]mod17

=[(1)* (1)*(1)*(4)*(10)]mod 17=[(1)* (1)*(1)*(4*10)mod17]mod 17

=[(40)mod 17]mod 17=6 mod 17

= 6

Additive Inverse

a+b=0(mod n)

在模运算中，每一个整数都有一个加法逆，它们之和模n为0

Multiplicative Inverse

Let x ∈ Zn. If there is an integer y ∈ Zn such that x n y = 1.
The integer y is called the multiplicative inverse of x, usually denoted x−1.

在集合Zn中，若g(n,a)=1时，a有一个乘法逆。

Random and pseudorandom numbers

Pseudorandom numbers: sequences of numbers that appear to be random generated by some algorithm
*** PRG: deterministic, not statistically random But can pass many randomness test
Example:
glibc random():
r[i] ← ( r[i-3] + r[i-31] ) % 232
output r[i] >> 1