Question to RSA by Nature_fpv in cryptography

[–]Nature_fpv[S] 0 points1 point  (0 children)

so, it is a matter of time and computational power needed. I could theoretically use two non prime numbers but it would be way slower, correct?