Hello MHF,

has it been (dis)proven yet that efficient polynomial integer factorization on a classical computer is impossible, (we know it is possibleandeasy on a quantum computer)? I can't seem to find any references on this topic on google and it sure would put many minds at rest knowing the answer. Does anybody have any information on this?

Thanks!