|
|
|
|
|
|
|
|
CTK Exchange
BenVitale
Member since Dec-20-07
|
Dec-20-07, 08:08 AM (EST) |
|
"Discrete logarithm problem"
|
They say that the Discrete logarithm problem is supposed to be very difficult to solve. Here's an example: Given the primitive element 2, the prime number 331, and the number 141, solve for the number x below: 2^x = 141 mod (331) Can you find the value for x? I found that 2 is not primitive mod 331, as 2^30 = 1 mod 331. So it'seems that there is no solution. This is what i saw. Does anyone see another solution? |
|
Alert | IP |
Printer-friendly page |
Reply |
Reply With Quote | Top |
|
|
mr_homm
Member since May-22-05
|
Dec-21-07, 01:35 PM (EST) |
|
1. "RE: Discrete logarithm problem"
In response to message #0
|
I get the same result. There are always some numbers that occur as powers of 2, even though 2 is not primitive. In this case, since the nonzero integers mod 331 are a group of order 330 under multiplication, the possible subgroups have orders 1, 2, 3, 5, 6, 10, 11, 15, 22, 30, 33, 55, 66, 110, 165, and 330. As you observed, the powers of 2 generate a subgroup of order 30, so there is a 1 in 11 chance that a randomly chosen positive integer mod 331 would occur as a power of 2. As it happens, 141 is not there. Thus there is no solution to this problem. |
|
Alert | IP |
Printer-friendly page |
Reply |
Reply With Quote | Top |
|
|
You may be curious to have a look at the old CTK Exchange archive. Please do not post there.
Copyright © 1996-2018 Alexander Bogomolny
|
|