An Applicable Public-Key-Cryptosystem Based on NP-Complete Problems.
Björn GrohmannPublished in: IACR Cryptol. ePrint Arch. (2014)
Keyphrases
- np complete problems
- public key cryptosystem
- np complete
- graph coloring
- public key
- phase transition
- hard problems
- digital signature
- signature scheme
- np hard
- special case
- diffie hellman
- max sat
- sat problem
- combinatorial problems
- satisfiability problem
- combinatorial optimization
- decision problems
- encryption scheme
- constraint satisfaction
- database design
- orders of magnitude
- genetic programming
- simulated annealing
- low cost
- genetic algorithm