Why do we use prime factors in asymmetric algorithms compared to other factors?
lets say we use two prime numbers p = 53 and q = 59 our public key in RSA algorithm would be p * q = 3127
while it is difficult to find the private key from this using prime
factorisation, I feel it is equally difficult to find the factors for some normal number too
like p = 52, q = 58 where public key would be p * q = 3016
but why is prime number preferred over the others, is it because how the algorithm works? Think I am missing something trivial.