How can I calculate $x=y^{\frac{1}z} \pmod n$?

Asked Apr 22 '19 at 18:49

Active Apr 22 '19 at 18:51

Viewed 52 times

How can I calculate $$x=y^{\frac{1}z} \pmod n$$

I have $y, z$ and $n$, but I really don't have any good ideas on how to get x without brute-forcing it. Is there any good way to calculate it?

edited Apr 22 '19 at 18:51

Dr. Mathva

asked Apr 22 '19 at 18:49

mariyah

1

See here. – Bill Dubuque Apr 22 '19 at 18:53
3

Given that the strength of the still very-much-in-use RSA algorithm for encryption is based on this problem being hard to solve, I wouldn't expect this problem to be easy to solve. I would, however, expect there to be a lot of work done on this subject. Little of which I'm familiar with. – Arthur Apr 22 '19 at 18:57

0 Answers0