Overview

A cryptosystem is a formal structure for protecting information by means of cryptographic algorithms and keys. The term is used in two related senses: broadly to mean any organized set of cryptographic tools and practices used to secure data, and more narrowly in theoretical cryptography to denote an encryption scheme defined by specific algorithms (typically key generation, encryption and decryption).

Core components

In the narrower, formal view a cryptosystem normally consists of three algorithmic parts: key generation (which produces one or more keys), encryption (which converts plaintext to ciphertext using a key), and decryption (which reverses that process). Important elements include:

  • Plaintext and ciphertext spaces — what can be encrypted and the resulting encoded output.
  • Keys — symmetric (shared secret) or asymmetric (public/private pairs).
  • Algorithms — deterministic or probabilistic procedures that perform encryption and decryption.

History and development

Modern cryptosystems emerged from classical ciphers and evolved through theoretical advances in the 20th century. Claude Shannon established information-theoretic foundations, while the 1970s brought public-key ideas and practical public-key systems that changed how secure communication and key distribution are performed.

Uses and examples

Cryptosystems are central to secure messaging, web security (TLS), disk and file encryption, secure email, and digital signatures (closely related but distinct schemes). Symmetric cryptosystems such as block and stream ciphers are efficient for bulk data, while asymmetric systems enable secure key exchange and authentication.

Distinctions and security properties

Cryptosystem is distinct from the informal term cipher (often a single algorithm) and from broader protocols that combine cryptography with infrastructure. Security properties include confidentiality, integrity, and authenticity; formal notions such as semantic security and IND-CPA/IND-CCA capture resistance to particular attacks. Some schemes aim for information-theoretic (perfect) secrecy, while most practical systems rely on computational hardness assumptions that may be affected by advances such as quantum computing.