If proved (and Nash was suitably skeptical) this would imply what is now called P ≠ NP, since a proposed key can easily be verified in polynomial time.
Se se probase (e Nash era escéptico) implicaría o que hoxe se chamaría P ≠ NP, xa que unha clave proposta pode ser facilmente verificada en tempo polinomial.