liveBook · Manning

Symmetric key encryption

As explained in Grokking Relational Database Design

Symmetric encryption is reversible encryption that uses the same secret key for encryption and decryption.

Symmetric-key encryption protects sensitive data that must later be used in its original form. It encrypts and decrypts data with the same secret key and algorithm. section 7.4

Saved credit-card details

An online store encrypts a customer’s credit-card information before storing it. When the customer places another order, the application uses the secret key to decrypt the stored value instead of asking for the card again. The key must remain secret and be handled properly. section 7.4

Common points to remember:

  • Use symmetric encryption when protected information must be recovered repeatedly or periodically. section 7.4
  • Recognize AES, 3DES, and Blowfish as common symmetric algorithms; AES includes 128-, 192-, and 256-bit variants. section 7.4

How Grokking Relational Database Design covers it

How deep it goes
Defines reversibility, explains shared keys and algorithms, and names variants without detailing implementation procedures.
Examples
Uses saved credit-card information in an online store as the central example.
What you can do after
Apply it to encrypt and later decrypt sensitive values stored for repeated application use.
How it connects
Connects symmetric encryption with hashing, password authentication, database security, and key management.

Also explained in

Compare how 6 books explain symmetric key encryption →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Grokking Relational Database Design. The section links point to the parts of the book it draws on.