I. Overview

%%{init: { 'theme': 'base', 'themeVariables': { 'edgeLabelBackground': '#fff' }}}%%
flowchart LR
    A["Plaintext"] -- "High-speed computation with a single secret key" --> B["Ciphertext"]
    style A fill:#f9f9f9,stroke:#333,stroke-width:3px
    style B fill:#e1f5fe,stroke:#01579b,stroke-width:3px

Definition: A cryptographic scheme in which sender and receiver use a pre-shared “single secret key” to transform plaintext into ciphertext, and back again into plaintext.

Features:
( High-Speed Computation ) Computation is far faster than asymmetric-key cryptography
( Simple Structure ) The algorithm structure is simple, making software and hardware implementation easy
( Efficiency ) High computational efficiency makes it well suited to processing large volumes of data and real-time encryption

II. Mechanism & Components

A. Structure of Symmetric-Key Cryptography

  • Encryption: C = E(K, P) (P: plaintext, K: shared key, C: ciphertext)
  • Decryption: P = D(K, C) (the same key K is used for both encryption and decryption)

B. Classification by Data Processing Unit

CategoryStream CipherBlock Cipher
Processing Unit1 bit or 1 byte at a timeFixed-size blocks (64/128/256 bits)
Core PrinciplePseudorandom stream XORed with the dataRepeated substitution (S) and permutation (P)
Computation SpeedVery fast (real-time capable)Relatively slower than a stream cipher
ExamplesRC4, A5/1, Salsa20DES, AES, SEED, ARIA
Trade-offsEasy hardware implementation, low diffusionHigher security, but requires padding

III. Advanced Topics & Comparison

LimitationDetailsSolution
Key Distribution ProblemSafely delivering the key to the recipient is difficultDiffie-Hellman, hybrid cryptography (envelope)
Key Management Burdenn(n-1)/2 keys are required among n usersKDC (key distribution center), integration with accredited certification systems
Lack of IntegrityExposure of the key threatens not just confidentiality but also tamperingUse authenticated encryption such as HMAC or GCM mode

Last updated 18 Aug 2026, 00:00 UTC. history