$49.$ Encryption is considered to be "computationally secure$"$ if

A$)$ It can't be broken at all

B$)$ The only way to break it is via brute$-$force

C$)$ It is based on hard math problems

D$)$ The time required to break the encryption exceeds the information's useful lifetime