<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Average-case complexity - Page 19 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=average-case_complexity&amp;p=18">1.Previous</a><br />
<a accesskey="3" href="page.php?w=average-case_complexity&amp;p=20">3.Next</a>
</p>
<p>of one-way functions is still an <a href="page.php?w=open_problem">open problem</a>, many candidate one-way functions are based on hard problems such as <a href="page.php?w=integer_factorization">integer factorization</a> or computing the <a href="page.php?w=discrete_log">discrete log</a>. Note that it is not desirable for the candidate function to be -complete since this would only guarantee that there is likely no efficient algorithm for solving the problem in the worst case; what we actually want is a guarantee that no efficient algorithm</p><p>
<a accesskey="1" href="page.php?w=average-case_complexity&amp;p=18">1.Previous</a><br />
<a accesskey="3" href="page.php?w=average-case_complexity&amp;p=20">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
