00:01
Okay, now c, d is an element in the group g cross h, and we know the order of c is equal to m, and the order of is equal to m.
00:27
That means c to the power m will be equal to identity in g, and d to the power m is equal to identity in h.
00:38
We assume the log, the gcd, which is the greatest common divisor between m and n, is greater than zero, than one, is strictly greater than one.
00:57
Let's just assume it is equal to some k, which is strictly greater than one.
01:05
Then we want to consider the order of this element.
01:14
Okay, by our assumption, as the greatest common divisor between m and n is equal to k, that means m can be written as k times m prime, with some m prime as a positive integer.
01:33
N can be also written as k times m prime, where m prime is also some integer.
01:43
M is strictly less than m, and n is strictly less than n.
01:51
Okay, this is the conclusion by the greatest common factor or common divisor between m and n.
02:01
Then we can consider the order of this element.
02:08
Okay, by our result, we know m times n is equal to k times m prime, times k times m prime, which is equal to k square times m prime times n prime.
02:25
Okay, and that means, and by the fact we have, we know m prime times m prime times k is strictly less than mn...