Difficult:
It seems like we can only find the discrete logarithm if p is of a moderate to small size. I don't think I understand the Pohlig-Hellman algorithm very well because there seem to be a lot of steps to it. All of these algorithms seems like they are pretty complicated. I don't really get why the computing discrete logs mod 4 is very helpful for anything either.
Reflective:
It seems we have good ways of factoring numbers for many subsets of problems. In general I wonder if usual RSA attacks try all of these ways because it would be easy or if they just assume that these subsets are not included in anyone's RSA key.
No comments:
Post a Comment