[math-fun] hard problem

I was fooling around with dicrete log and came up with the following: Pick p_0, p_1 > n s.t. g is a generator and discrete log is easy for both. Let lg_j be discrete log base g over p_j. Find x s.t. g^{lg_0(n) - lg_0(x)} mod p_0 = g^{lg_1(n) - lg_1(x)} mod p_1 This is a hard problem, since it's equivalent to factoring. I think what I mean is obvious by the notation, but it doesn't really work, since we're dealing with equivalence classes that aren't equal. Is there a better way of writing that? -- Mike Stay staym@clear.net.nz