When ever I see P != NP around, it reminds me of when a matrix is equal to its self adjoint, and I wonder if you use any predefined curves and treat it as a pol

When ever I see P != NP around, it reminds me of when a matrix is equal to its self adjoint, and I wonder if you use any predefined curves and treat it as a polynomial eigenvalue problem, then project it onto a lower dimensional complex space, if one can then use the solutions to generate approximately the observed ciphertext?