Decisional composite residuosity assumption
http://dbpedia.org/resource/Decisional_composite_residuosity_assumption an entity of type: WikicatComputationalHardnessAssumptions
The decisional composite residuosity assumption (DCRA) is a mathematical assumption used in cryptography. In particular, the assumption is used in the proof of the Paillier cryptosystem. Informally, the DCRA states that given a composite and an integer , it is hard to decide whether is an -residue modulo . I.e. whether there exists a such that
rdf:langString
rdf:langString
Decisional composite residuosity assumption
xsd:integer
23702343
xsd:integer
1076092638
rdf:langString
The decisional composite residuosity assumption (DCRA) is a mathematical assumption used in cryptography. In particular, the assumption is used in the proof of the Paillier cryptosystem. Informally, the DCRA states that given a composite and an integer , it is hard to decide whether is an -residue modulo . I.e. whether there exists a such that
xsd:nonNegativeInteger
905