high-workload function, checkable in p

New Message	Reply	About this list	Date view	Thread view	Subject view	Author view

Julian Assange (proff@iq.org)
3 Jun 1998 03:15:43 -0000

Next message: Tomas Fasth: "Re: The hidden fox"
Previous message: Kriston J. Rehberg: "Re: RSA's SecurPC not-so-"Secur""
Next in thread: Mike Rosing: "Re: high-workload function, checkable in p"
Reply: Mike Rosing: "Re: high-workload function, checkable in p"

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.

Next message: Tomas Fasth: "Re: The hidden fox"
Previous message: Kriston J. Rehberg: "Re: RSA's SecurPC not-so-"Secur""
Next in thread: Mike Rosing: "Re: high-workload function, checkable in p"
Reply: Mike Rosing: "Re: high-workload function, checkable in p"

New Message	Reply	About this list	Date view	Thread view	Subject view	Author view

All trademarks and copyrights are the property of their respective owners.
Other Directory Sites: SeekWonder | Directory Owners Forum

The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:18:19 ADT