Decide whether the following statements are true or false and correct the false ones:

1. 76 mod 13 is equivalent to ((72 mod 13)(72 mod 13)(72 mod 13)) mod 13

2. Given x y mod p, x, and p (where p is a 2048-bit prime), there is no known, efficient way to compute y.