A BRIEF INTRODUCTION TO QUADRATIC RESIDUOSITY BASED CRYPTOGRAPHY.

The quadratic residuosity problem is the problem to distinguish between the dis-tributions of quadratic residues and quadratic non-residues modulo a composite integer. The intractability of the quadratic residuosity problem is the basis for the security of numerous constructions in cryptography, including public-key en-cryption schemes, pseudo-random generators, or cryptographic protocols. The aim of this talk is to provide a brief overview on the quadratic residuosity problem and its applications to cryptography. [ABSTRACT FROM AUTHOR]