6.1-6.2

I thought the whole way that the RSA algorithm worked was really cool. It seemes sort of magical how it is able to give you the plaintext by taking the ciphertext to an exponent. I'm curious as to whether the decryption exponent is unique (mod (p-1)(q-1)) for a given encryption exponent. I didn't understand how the attacks against RSA work since I got lost in the reading for all of it.