About: Decisional composite residuosity assumption

An Entity of Type: WikicatComputationalHardnessAssumptions, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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

Property Value
dbo:abstract
  • 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 (en)
dbo:wikiPageID
  • 23702343 (xsd:integer)
dbo:wikiPageLength
  • 905 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1076092638 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
rdf:type
rdfs:comment
  • 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 (en)
rdfs:label
  • Decisional composite residuosity assumption (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License