Cryptography, Cybersecurity.
prime numbers, and rather than generating them randomly, it generated from and where k and a are generated randomly. In RSA, these are then multiplied to produce an RSA modulus: N=p.q From the modulus, it is then relatively easy to factorize back to p and q, and then easy to crack the RSA method.