Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It only takes a minute to sign up.
Sign up to join this community
I am reading the Handbook of Applied Cryptography and on page 99 the authors write , after showing that $QRP \le_P FACTORING$:
It is believed that the $QRP$ is as difficult as the problem of factoring integers, although no proof of this is known.
I am not quite sure what "as difficult" means, do they say that it is assumed that $QRP \ge_P FACTORING$?
I would put it as "it is conjectured" rather than "it is assumed", but otherwise, yeah...
