6.5-6.7, 7.1

1. In discrete logs, why would the prime be left out of the notation? Surely the logarithm makes little sense without the context of the prime in question, or can it be generalized?

2. Interestingly enough, one of the efforts to break RSA is headed by people who want to watch high definition films on their Linux machines. Based on what I read some months ago, one attack vector concerned the use of a low public exponent (something like e=3) in the AACS Blu-ray standard. This could be seen as a discrete logarithm problem, correct? And are these logarithms harder to solve as the exponent grows?