The quadratic residuosity problem in computational number theory is the question of distinguishing by calculating the quadratic residues modulo N, where N is a composite number. This is an important consideration in contemporary cryptography.
Read more about Quadratic Residuosity Problem: Formulation, Applications
Famous quotes containing the word problem:
“Any solution to a problem changes the problem.”
—R.W. (Richard William)