What would be the consequences of factoring being NP-complete? Are there any references covering this?
As well as implying NP=co-NP, it would also imply that BQP contained NP.

It would also seem to imply that hard instances of NP-complete problems were easy to generate.