Assignment #1

Solutions
January 10, 2006
September 19, 2014 Practical Aspects of Modern Cryptography
Problem #1
Show that
((a mod m) + b) mod m = (a + b) mod m
and
((a mod m) b) mod m = (a b) mod m

September 19, 2014 Practical Aspects of Modern Cryptography
Answer #1
Let
r
1
= a mod m,
r
2
= (a + b) mod m, and
r
3
= ((a mod m) + b) mod m.
Then there exist integers q
1
, q
2
, and q
3
such that
a = q
1
m + r
1
,
a + b = q
2
m + r
2
, and
((a mod m) + b) = q
3
m + r
3
.
September 19, 2014 Practical Aspects of Modern Cryptography
Answer #1 (cont.)
r
2
r
3

= ((a + b) q
2
m) ((a mod m) + b) q
3
m)
= ((a + b) q
2
m) ((r
1
+ b) q
3
m)
= ((a + b) q
2
m) (((a q
1
m) + b) q
3
m)
= (q
1
q
2
+ q
3
)m
But 0 r
2
< m and 0 r
3
< m, so |r
2
r
3
| < m.
Thus, (q
1
q
2
+ q
3
) = 0, and therefore r
2
= r
3
.
September 19, 2014 Practical Aspects of Modern Cryptography
Answer #1 (cont.)
Let
r
1
= a mod m,
r
2
= (a b) mod m, and
r
3
= ((a mod m) b) mod m.
Then there exist integers q
1
, q
2
, and q
3
such that
a = q
1
m + r
1
,
a b = q
2
m + r
2
, and
((a mod m) b) = q
3
m + r
3
.
September 19, 2014 Practical Aspects of Modern Cryptography
Answer #1 (cont.)
r
2
r
3

= ((a b) q
2
m) ((a mod m) b) q
3
m)
= ((a b) q
2
m) ((r
1
b) q
3
m)
= ((a b) q
2
m) (((a q
1
m) b) q
3
m)
= (bq
1
q
2
+ q
3
)m
But 0 r
2
< m and 0 r
3
< m, so |r
2
r
3
| < m.
Thus, (bq
1
q
2
+ q
3
) = 0, and therefore r
2
= r
3
.
September 19, 2014 Practical Aspects of Modern Cryptography
Problem #2
Find the mod 11 multiplicative inverse of
each value x in the range 0 < x < 11.
September 19, 2014 Practical Aspects of Modern Cryptography
Answer #2
1 2 3 4 5 6 7 8 9 10
1 1 2 3 4 5 6 7 8 9 10
2 2 4 6 8 10 1 3 5 7 9
3 3 6 9 1 4 7 10 2 5 8
4 4 8 1 5 9 2 6 10 3 7
5 5 10 4 9 3 8 2 7 1 6
6 6 1 7 2 8 3 9 4 10 5
7 7 3 10 6 2 9 5 1 8 4
8 8 5 2 10 7 4 1 9 6 3
9 9 7 5 3 1 10 8 6 4 2
10 10 9 8 7 6 5 4 3 2 1
September 19, 2014 Practical Aspects of Modern Cryptography
Answer #2 (cont.)
1 2 3 4 5 6 7 8 9 10
1 1 2 3 4 5 6 7 8 9 10
2 2 4 6 8 10 1 3 5 7 9
3 3 6 9 1 4 7 10 2 5 8
4 4 8 1 5 9 2 6 10 3 7
5 5 10 4 9 3 8 2 7 1 6
6 6 1 7 2 8 3 9 4 10 5
7 7 3 10 6 2 9 5 1 8 4
8 8 5 2 10 7 4 1 9 6 3
9 9 7 5 3 1 10 8 6 4 2
10 10 9 8 7 6 5 4 3 2 1
September 19, 2014 Practical Aspects of Modern Cryptography
Answer #2 (cont.)
The same cannot be done mod 12.

For example, 2Y mod 12 is even regardless
of the value of Y. Therefore 2 does not
have a mod 12 multiplicative inverse.
September 19, 2014 Practical Aspects of Modern Cryptography
Problem #3
Compute
3
1415926535897932384626433832795028841971693993751058
209749445923078164
mod 11.
September 19, 2014 Practical Aspects of Modern Cryptography
Answer #3
3
1
mod 11 = 3 3
6
mod 11 = 3
3
2
mod 11 = 9 3
7
mod 11 = 9
3
3
mod 11 = 5 3
8
mod 11 = 5
3
4
mod 11 = 4 3
9
mod 11 = 4
3
5
mod 11 = 1 3
10
mod 11 = 1

3
4
mod 11 = 4
September 19, 2014 Practical Aspects of Modern Cryptography
Problem #4
Compute
2
7182818284590452353602874713526624977572470936999595
749669676277240766
mod 33.
September 19, 2014 Practical Aspects of Modern Cryptography
Answer #4
2
1
mod 33 = 2 2
6
mod 33 = 31
2
2
mod 33 = 4 2
7
mod 33 = 29
2
3
mod 33 = 8 2
8
mod 33 = 25
2
4
mod 33 = 16 2
9
mod 33 = 17
2
5
mod 33 = 32 2
10
mod 33 = 1

3
6
mod 33 = 31
September 19, 2014 Practical Aspects of Modern Cryptography
Problem #5
If p is a prime, then for integers a such that
0 < a < p, then a

p

-

1
mod p = 1.

Use this fact to show that 65 is not prime.

September 19, 2014 Practical Aspects of Modern Cryptography
Answer #5
2
1
mod 65 = 2 2
16
mod 65 = 16
2
2
mod 65 = 4 2
32
mod 65 = 61
2
4
mod 65 = 16 2
64
mod 65 = 16
2
8
mod 65 = 61

2
64
mod 65 = 16 1
Thus 65 is not prime.