its the reverse modular exponentiation problem right? e.g. some a is transformed into b by x^a mod y = b where y is a prime and x has special properties relati

its the reverse modular exponentiation problem right? e.g. some a is transformed into b by x^a mod y = b where y is a prime and x has special properties relative to it? doing that once each, sharing the resulting b's then using the b from the other person raised to the power of your original input a to create a number that is kept secret (because a was kept secret) - so if you can get a back from b (x and y are not secret) then you can work out the derived secret number and its not so secret anymore its true that for large numbers this becomes harder, and there are many a's for a given b, but iirc the properties of modular arithmetic make them identical in effect, such that finding any a is good enough to crack the key exchange. ... is that right?