24 Dec
2002
24 Dec
'02
4:42 p.m.
I came to the problem by starting with n/x mod p = n/x mod q which is probably the simplest way of writing it. I thought the hardness of the problem might be related to discrete log, so I chose p and q to be primes where discrete log was easy, but that seems to be orthogonal to the hardness of the problem. My original question was about notation, because I'm *not* saying they're in the same equivalence class, I'm saying that the bits match. -- Mike Stay staym@clear.net.nz