Form: lower bound
Statements with form: lower-bound. This page only exists because at least one statement currently uses this value – if you add a statement with a new form value not listed under Problems, copy this page as the starting point for its facet page (see CONTRIBUTING.md).
| Status | Statement | Tags |
|---|---|---|
|
Generalized mirror theory The fully generalized Mirror Theory bound for arbitrary cycle-consistent multi-graphs up to the information-theoretic limit is open; current techniques only reach component size O(N^{1/4}). 2 open |
standardlower-boundresearch-opennew-idea (ai) | |
|
Simon-oracle amplification, strong version Open. The version without the collision finder is known only when the one-way function is itself a random oracle; with an arbitrary one-way function, with or without the collision finder, nothing is established. 5 open |
otherlower-boundresearch-opennew-idea (ai) | |
|
Censoring can only hurt Open. The censored side is proved at essentially optimal round count with matching lower bounds; what is missing is the transfer of any such bound to uncensored AES at the same round count. 5 open |
standardlower-boundresearch-opennew-idea (ai) |
No matching items