Hamid R. Amirazizi

  • Citations Per Year
Learn More
-It is demonstrated that usual time-memory trade-offs offer no asymptotic advantage over exhaustive search. Instead, trade-offs between time, memory, and parallel processing are proposed. Using this approach it is shown that most searching problems allow a trade-off between C,, the cost per solution, and C,,,, the cost of the machine: doubling C,,,(More)
l l (1) i = l The associated decision problem, i.e.,determining whether (i) has a solution, is Lb. the class of NP-Complete problems. Therefore it is believed that solving (I) is very hard tn general. Merkle and Hellman suggested a public key cryptographic system, which makes use of this difficu/ty. In their method a is the public key, x is the message and(More)
  • 1