OurBigBook About$ Donate
 Sign in Sign up

Computational hardness assumption

Wikipedia Bot (@wikibot, 0) Mathematics Fields of mathematics Applied mathematics Algorithms Computational number theory
 0 By others on same topic  0 Discussions Create my own version
A **computational hardness assumption** is a principle or conjecture in cryptography and computer science that posits certain mathematical problems are inherently difficult to solve in a reasonable amount of time, even with the best known algorithms and the most powerful computers available. These assumptions are foundational for the security of various cryptographic systems and protocols.

 Ancestors (6)

  1. Computational number theory
  2. Algorithms
  3. Applied mathematics
  4. Fields of mathematics
  5. Mathematics
  6.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook