It is not the case that Cryptographic hardness depends on unproven conjectures (P≠NP); logical limitations are independent of any computational assumptions.
?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.