Hierarchical Storage Management originated in the mainframe world where it was used to minimize storage costs. The HSM name signifies that the software has the intelligence to move files along a hierarchy of storage devices that are ranked in terms of cost per megabyte of storage, speed of storage and retrieval, and overall capacity limits. Files are migrated along the hierarchy to less expensive forms of storage based on rules tied to the frequency of data access. File migration and retrieval is transparent to users. Two major factors, data access response time and storage costs determine the appropriate combination of storage devices used in
HSM. A typical three tier strategy may be composed of hard drives as primary storage on the file servers, rewritable optical as the secondary storage type, and tape as the final tertiary storage location. If faster access is required, a hard drive can be considered as an alternative to optical for secondary storage, and WORM
(Write Once, Read Many) optical can also be implemented, in place of tape, as the final storage destination.

Explanation

AES is an example of Symmetric Key algorithm. After DES was used as an encryption standard for over 20 years and it was cracked in a relatively short time once the necessary technology was available, NIST decided a new standard, the Advanced Encryption Standard (AES), needed to be put into place .
In January 1997 , NIST announced its request for AES candidates and outlined the requirements in FIPS PUB 197. AES was to be a symmetric block cipher supporting key sizes of 128, 192, and 256 bits.
The following five algorithms were the finalists:
MARS Developed by the IBM team that created Lucifer
RC6 Developed by RSA Laboratories
Serpent Developed by Ross Anderson, Eli Biham, and Lars Knudsen
Twofish Developed by Counterpane Systems
Rijndael Developed by Joan Daemen and Vincent Rijmen
Out of these contestants, Rijndael was chosen.
The block sizes that Rijndael supports are 128, 192 , and 256 bits.
The number of rounds depends upon the size of the block and the key length:
If both the key and block size are 128 bits, there are 10 rounds.
If both the key and block size are 192 bits, there are 12 rounds.
If both the key and block size are 256 bits, there are 14 rounds.
When preparing for my CISSP exam, i came across this post by Laurel Marotta at the URL below:
http://cissp-study.3965.n7.nabble.com/CCCure-CISSP-Study-Plan-to-crack-CISSP-clarificationtd401.html
This tips was originally contributed by Doug Landoll Here is an easy way to remember the types of crypto cipher: The sentence to remember is: DEER MRS H CARBIDS
Asymmetric: encrypt with 1 key, decrypt with other Key exchange. A key pair: Public and Private. Services: Confidentiality, Nonrepudiation, Integrity, Digital Signature
D - Diffie-Hellman E - El Gamal: DH +nonrepudiation E - ECC R - RSA
Hash- one-way algorithm, no key
M - MD5
R - RIPEMD (160)
S - SHA (3)
H - Haval (v)
Symmetric: Encryption, one key
C - CAST
A - AES: 128k, 10r; 192k, 12 r; 256k, 14r
R - RC4, RC5, RC6
B - BLOWFISH:23-448k, 64bit block
I - IDEA : 128k, 64bit block
D - DES-64-bit block, 16r
S - SERPENT
The following answers are all incorrect because they are all Asymmetric Crypto ciphers:
Elliptic curve cryptosystem(ECC)
Diffie-Hellman
Merkle-Hellman Knapsack
The following reference(s) were/was used to create this question:
Harris, Shon (2012-10-18). CISSP All-in-One Exam Guide, 6th Edition (p. 809). McGraw-Hill .
Kindle Edition.