|
|
|
|
|
|
|
|
|
|
|
|
| home | help | back | first | fref | pref | prev | next | nref | lref | last | post |
Date: 3 Jun 1998 03:15:43 -0000 From: Julian Assange <proff@iq.org> To: coderpunks@toad.com cc: cryptography@c2.net I'm looking for a high workload function, with a large domain, NP hard to compute but verifyable that the computation is correct in P and preferably not requiring big-nums. (e.g would knapsacks fit this goal?) Suggestions? Cheers, Julian.
|
|
|
|
|
|
|
|
|
|
|
|
| home | help | back | first | fref | pref | prev | next | nref | lref | last | post |