#### Filter Results:

- Full text PDF available (1)

#### Publication Year

1981

1983

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Hamid R. Amirazizi, Martin E. Hellman
- CRYPTO
- 1981

-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)

- Hamid R. Amirazizi, Ehud D. Karnin, Justin M. Reyneri
- CRYPTO
- 1981

- ‹
- 1
- ›