A quadratic residue modulo n is an integer that can be expressed as the square of another integer modulo n. Understanding quadratic residues is fundamental in number theory and has applications in cryptography, particularly in algorithms like RSA and primality testing.