$4.$ The RSA algorithm for public key cryptography is based on:

a$.$ the difficulty of finding the prime factors of large numbers

b$.$ having a nonlinear keyspace

c$.$ Galois field theory

d$.$ the difficulty of solving np$-$hard problems