Yes and no. Yes, because prime inference with high accuracy would make codebreaking much easier. No, because, for example, in RSA you need to deal with semiprimes, and that setup seems different as per Sam Blake’s research here: https://arxiv.org/abs/2308.12290
This sounds similar to whether a contemporary machine learning model can break a cryptographic cipher, a hash function, or something like that.
Yes and no. Yes, because prime inference with high accuracy would make codebreaking much easier. No, because, for example, in RSA you need to deal with semiprimes, and that setup seems different as per Sam Blake’s research here: https://arxiv.org/abs/2308.12290