Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Phi-hiding_assumption> ?p ?o }
Showing triples 1 to 34 of
34
with 100 triples per page.
- Phi-hiding_assumption abstract "The phi-hiding assumption or Φ-hiding assumption is an assumption about the difficulty of finding small factors of φ(m) where m is a number whose factorization is unknown, and φ is Euler's totient function. The security of many modern cryptosystems comes from the perceived difficulty of certain problems. Since P vs. NP problem is still unresolved, cryptographers cannot be sure computationally intractable problems exist. Cryptographers thus make assumptions as to which problems are hard. It is commonly believed that if m is the product of two large primes, then calculating φ(m) is currently computationally infeasible; this assumption is required for the security of the RSA Cryptosystem. The Φ-Hiding assumption is a stronger assumption, namely that if p1 and p2 are small primes exactly one of which divides φ(m), there is no polynomial-time algorithm which can distinguish which of the primes p1 and p2 divides φ(m) with probability significantly greater than one-half.This assumption was first stated in the 1999 paper Computationally Private Information Retrieval with Polylogarithmic Communication.".
- Phi-hiding_assumption wikiPageExternalLink cachin99computationally.html.
- Phi-hiding_assumption wikiPageExternalLink cachin99efficient.html.
- Phi-hiding_assumption wikiPageExternalLink citation.cfm?id=1102160&dl=acm&coll=&CFID=15151515&CFTOKEN=6184618.
- Phi-hiding_assumption wikiPageExternalLink 80959djt41b8l6rc.
- Phi-hiding_assumption wikiPageID "6133075".
- Phi-hiding_assumption wikiPageLength "2695".
- Phi-hiding_assumption wikiPageOutDegree "12".
- Phi-hiding_assumption wikiPageRevisionID "621695548".
- Phi-hiding_assumption wikiPageWikiLink Category:Computational_hardness_assumptions.
- Phi-hiding_assumption wikiPageWikiLink Category:Computational_number_theory.
- Phi-hiding_assumption wikiPageWikiLink Category:Theory_of_cryptography.
- Phi-hiding_assumption wikiPageWikiLink Computational_hardness_assumption.
- Phi-hiding_assumption wikiPageWikiLink Cryptosystem.
- Phi-hiding_assumption wikiPageWikiLink Eulers_totient_function.
- Phi-hiding_assumption wikiPageWikiLink Factorization.
- Phi-hiding_assumption wikiPageWikiLink P_versus_NP_problem.
- Phi-hiding_assumption wikiPageWikiLink Prime_number.
- Phi-hiding_assumption wikiPageWikiLink RSA_(cryptosystem).
- Phi-hiding_assumption wikiPageWikiLink Time_complexity.
- Phi-hiding_assumption wikiPageWikiLinkText "Phi-hiding assumption".
- Phi-hiding_assumption wikiPageUsesTemplate Template:Reflist.
- Phi-hiding_assumption subject Category:Computational_hardness_assumptions.
- Phi-hiding_assumption subject Category:Computational_number_theory.
- Phi-hiding_assumption subject Category:Theory_of_cryptography.
- Phi-hiding_assumption hypernym Assumption.
- Phi-hiding_assumption type Algorithm.
- Phi-hiding_assumption comment "The phi-hiding assumption or Φ-hiding assumption is an assumption about the difficulty of finding small factors of φ(m) where m is a number whose factorization is unknown, and φ is Euler's totient function. The security of many modern cryptosystems comes from the perceived difficulty of certain problems. Since P vs. NP problem is still unresolved, cryptographers cannot be sure computationally intractable problems exist. Cryptographers thus make assumptions as to which problems are hard.".
- Phi-hiding_assumption label "Phi-hiding assumption".
- Phi-hiding_assumption sameAs Q7181494.
- Phi-hiding_assumption sameAs m.0frxv3.
- Phi-hiding_assumption sameAs Q7181494.
- Phi-hiding_assumption wasDerivedFrom Phi-hiding_assumption?oldid=621695548.
- Phi-hiding_assumption isPrimaryTopicOf Phi-hiding_assumption.