Is NTRU still hard if $G$ is set to 1?
If $G$ is set to $1$, then the adversary can easily decrypt the ciphertext because in this case $h = pf^{-1} \mod q,  p$ is coprime with $q$, then inverting  $p \mod q$ is possible and  after that he calculates $f \mod q$ from $h$, then he calculates $f^{-1} \mod p$ from $f$