Performance metrices of cryptographic algorithms I'm a beginner and working on cryptography performance metrics. 


My question is that what are the important metrics to check the performance of Cryptography Algorithms.
Criteria for evaluation of Cryptography Algorithms:


Having public specification (the only secret is the key).
Patent status.
What it aims at: block cipher (DES, AES..), cipher, message digest, MAC, proof of origin, signature, key establishment, TRNG, PRNG.
Requirements for and limitations of the algorithm itself.


Randomness requirements;
Requirements to validate the input parameters (e.g. public key for ECDH).

Being symmetric (block ciphers, SHA) or asymmetric (RSA, ECDSA, ECDH).
Security under some threat model:


Resistance to key recovery (bounded at least by key size);
Block size (for block ciphers);
Resistance to pure cryptanalytic attacks;
Resistance to side-channel leakage (with many subdivisions);
Resistance to fault injection.

Complexity and familiarity / learning curve to use the algorithm.
Parameter sizes:


Output size (overhead / expansion ratio);
Encoded (public) key size;
Accepted input sizes;

Speed (often very platform-dependent):


Cycles/byte averages for large messages or multiple uses with the same key;
Time to setup a new key;
Time versus size.

Memory footprint:


Code;
RAM per running instance.

Availability of a version with suitable characteristics as above on a given platform.
Acceptance by security authorities.


Note: fell free to restructure / add to the list, this is a community wiki.