Cryptography Reference
In-Depth Information
d.
11
x
+ 12
y
+
z
1 (mod 23)
15
x
+ 20
y
+ 22
z
11 (mod 23)
3
x
+ 9
y
12 (mod 23)
e.
11
x
+ 12
y
+
z
1 (mod 23)
15
x
+ 20
y
+ 22
z
11 (mod 23)
3
x
+ 9
y
10 (mod 23)
2.
Find an inverse of the matrix
A
modulo
n
, if such an inverse exists.
a.
n
= 26, and matrix
A
follows:
27
51
b.
n
= 25, and matrix
A
follows:
120
301
432
c.
n
= 7, and matrix
A
follows:
200
330
612
d.
n
= 13, and matrix
A
follows:
1 090
0 230
3 401
10121
3.
Write a transpose() method for the ModMatrix class which returns the transpose of a
matrix. The transpose of a matrix is simply the matrix “flipped over”; that is, the
m
n
matrix becomes an
n
m
matrix where the
i
,
j
th element in the transpose is just the
j
,
i
th element of the original. For example, the transpose of
12
34
56
is
135
246
4.
Modify the gaussianSolve() method so that it works for matrices whose modulus is not
prime.
Search WWH ::
Custom Search