It is not the case that A product of factor bit-lengths is still bounded by O((log n)²), not exceeding the polynomial bound relative to input encoding length.
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.