CISSP GLOSSARY · SECURITY ARCHITECTURE
Symmetric encryption
Encryption where one shared secret key both encrypts and decrypts: fast enough for bulk data, but burdened by the key distribution problem and n(n-1)/2 keys for n parties.
Symmetric encryption uses a single shared key for both encryption and decryption. Because its operations are computationally cheap, it is the workhorse for bulk data: full-disk encryption, VPN tunnels, database encryption, and the payload protection inside TLS sessions. AES is the modern standard, running as a block cipher in modes such as GCM; older ciphers like DES and 3DES survive only as exam history.
Its defining weakness is the key distribution problem: both parties must hold the same secret, and delivering it over an insecure channel is exactly the problem encryption was meant to solve. Scale makes it worse: n parties who all need private pairwise channels require n(n-1)/2 keys, so 100 users means 4,950 keys to generate, distribute, and rotate. In practice the problem is solved by hybrid cryptography: asymmetric encryption negotiates a fresh symmetric session key, and the symmetric cipher then carries the data.
Exam relevance: speed and bulk data are the trigger words; if a scenario asks which cryptography encrypts large volumes efficiently, the answer is symmetric. If it asks how many keys n users need, apply n(n-1)/2. The confusable is asymmetric encryption: it solves key distribution and enables signatures, but is orders of magnitude slower, which is why the exam’s correct architecture is almost always both together, not either alone.