OurBigBook About$ Donate
 Sign in+ Sign up
by Ciro Santilli (@cirosantilli, 37)

NP-hard cryptosystems

 ... Information technology Computer Computer science Computational problem Function problem Integer factorization
 0 By others on same topic  0 Discussions  Updated 2025-05-26  +Created 1970-01-01  See my version
This is natural question because both integer factorization and discrete logarithm are the basis for the most popular public-key cryptography systems as of 2020 (RSA and Diffie-Hellman key exchange respectively), and both are NP-intermediate. Why not use something more provenly hard?
  • cs.stackexchange.com/questions/356/why-hasnt-there-been-an-encryption-algorithm-that-is-based-on-the-known-np-hard "Why hasn't there been an encryption algorithm that is based on the known NP-Hard problems?"

 Ancestors (9)

  1. Integer factorization
  2. Function problem
  3. Computational problem
  4. Computer science
  5. Computer
  6. Information technology
  7. Area of technology
  8. Technology
  9.  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