Abstract

Modern cryptographic algorithms are typically designed around computationally hard problems. Generally speaking, breaking a cryptographic system implies finding its secret key. In classical cryptanalysis, an adversary that knows the algorithm specification and has access to its input/output messages tries to overcome these computationally hard problems by employing abstract mathematical models. If the computational effort necessary to break the algorithm is beyond the ability of any adversary, then it can be considered secure.