In
cryptography the standard model is the model that gives the
adversary the strongest powers for attacking the cryptographic scheme at hand. Other names used are bare model and plain model. The attacker is only restricted in a
complexity theoretic sense, i.e. in the amount of computation he can do in a certain time interval. A polynomially bounded attacker can only do a polynomial amount of computation, and thus cannot solve every problem instance of a super-polynomial problem.
Exponential time is an important subset of super-polynomial time.
See more at Wikipedia.org...