what are DP and DQ in Encryption by RSA in c#
DP is $d\bmod{p-1}$, similarly DQ is $d\bmod{q-1}$. InverseQ is $q^{-1}\bmod{p}$.

These are used in applying the Chinese Remainder Theorem to RSA decryption, which is an optimization technique.