Quadratic residuosity problem
id:
quadratic-residuosity-problem-293-9804983
title:
Quadratic residuosity problem
text:
The quadratic residuosity problem (QRP) in computational number theory is to decide, given integers a and N , whether a is a quadratic residue modulo N or not.
Here N = p 1 p 2 for two unknown primes p 1 and p 2 , and a is among the numbers which are not obviously quadratic non-residues. The problem was first described by Gauss in his Disquisitiones Arithmeticae in 1801. This problem is believed to be computationally difficult.
Several cryptographic methods rely on its hardness, see § Applicatio
brand slug:
wiki
category slug:
encyclopedia
description:
Problem in computational number theory
original url:
https://en.wikipedia.org/wiki/Quadratic_residuosity_problem
date created:
date modified:
2023-12-20T20:32:08Z
main entity:
{"identifier":"Q3406257","url":"https://www.wikidata.org/entity/Q3406257"}
image:
fields total:
13
integrity:
14