Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Higher_residuosity_problem> ?p ?o }
Showing triples 1 to 38 of
38
with 100 triples per page.
- Higher_residuosity_problem abstract "In cryptography, most public key cryptosystems are founded on problems that are believed to be intractable. The higher residuosity problem (also called the n th-residuosity problem) is one such problem. This problem is easier to solve than integer factorization, so the assumption that this problem is hard to solve is stronger than the assumption that integer factorization is hard.".
- Higher_residuosity_problem wikiPageID "6158260".
- Higher_residuosity_problem wikiPageLength "3816".
- Higher_residuosity_problem wikiPageOutDegree "20".
- Higher_residuosity_problem wikiPageRevisionID "627255269".
- Higher_residuosity_problem wikiPageWikiLink Benaloh_cryptosystem.
- Higher_residuosity_problem wikiPageWikiLink Category:Computational_hardness_assumptions.
- Higher_residuosity_problem wikiPageWikiLink Category:Computational_number_theory.
- Higher_residuosity_problem wikiPageWikiLink Chinese_remainder_theorem.
- Higher_residuosity_problem wikiPageWikiLink Computational_hardness_assumption.
- Higher_residuosity_problem wikiPageWikiLink Cryptography.
- Higher_residuosity_problem wikiPageWikiLink Cyclic_group.
- Higher_residuosity_problem wikiPageWikiLink Group_(mathematics).
- Higher_residuosity_problem wikiPageWikiLink Index_of_a_subgroup.
- Higher_residuosity_problem wikiPageWikiLink Integer.
- Higher_residuosity_problem wikiPageWikiLink Integer_factorization.
- Higher_residuosity_problem wikiPageWikiLink Modular_arithmetic.
- Higher_residuosity_problem wikiPageWikiLink Naccache–Stern_cryptosystem.
- Higher_residuosity_problem wikiPageWikiLink Prime_number.
- Higher_residuosity_problem wikiPageWikiLink Public-key_cryptography.
- Higher_residuosity_problem wikiPageWikiLink Quadratic_residue.
- Higher_residuosity_problem wikiPageWikiLink Quadratic_residuosity_problem.
- Higher_residuosity_problem wikiPageWikiLink Ring_(mathematics).
- Higher_residuosity_problem wikiPageWikiLink Semantic_security.
- Higher_residuosity_problem wikiPageWikiLink Unit_(ring_theory).
- Higher_residuosity_problem wikiPageWikiLinkText "Higher residuosity problem".
- Higher_residuosity_problem wikiPageWikiLinkText "higher residuosity problem".
- Higher_residuosity_problem wikiPageUsesTemplate Template:Reflist.
- Higher_residuosity_problem subject Category:Computational_hardness_assumptions.
- Higher_residuosity_problem subject Category:Computational_number_theory.
- Higher_residuosity_problem type Algorithm.
- Higher_residuosity_problem comment "In cryptography, most public key cryptosystems are founded on problems that are believed to be intractable. The higher residuosity problem (also called the n th-residuosity problem) is one such problem. This problem is easier to solve than integer factorization, so the assumption that this problem is hard to solve is stronger than the assumption that integer factorization is hard.".
- Higher_residuosity_problem label "Higher residuosity problem".
- Higher_residuosity_problem sameAs Q5758408.
- Higher_residuosity_problem sameAs m.0ft7_c.
- Higher_residuosity_problem sameAs Q5758408.
- Higher_residuosity_problem wasDerivedFrom Higher_residuosity_problem?oldid=627255269.
- Higher_residuosity_problem isPrimaryTopicOf Higher_residuosity_problem.