Cryptography

Cryptography secures information by transforming it according to a secret or public procedure that intended parties can verify or reverse. ¹ The readable message is plaintext; the transformed result is ciphertext; and the controlling value is a key. Classical methods, including substitution and transposition ciphers, depended chiefly on secrecy of the method or on relatively small keys. The Enigma machine showed both the practical value and weakness of mechanical secrecy during the Second World War, while the later development of electronic computing made systematic cryptanalysis far more powerful.

Modern practice generally assumes that algorithms are public and that security rests on the key. The 1976 work of Whitfield Diffie and Martin Hellman helped establish public-key cryptography, allowing parties to agree on secrets over an open channel; RSA then demonstrated practical public-key encryption and signatures. ² Cryptography consequently became a mathematical and engineering discipline rather than merely a craft of secret codes.

Cryptographic mechanisms are selected according to the security property and threat they must address. Symmetric encryption uses one shared secret for encryption and decryption; the Advanced Encryption Standard (AES) is a widely standardized example. Public-key systems use related key pairs: a public key can be distributed openly, while a private key remains controlled by its owner. They support encryption, key establishment, and digital signatures, though they are generally slower than symmetric algorithms.

• Hash functions produce fixed-length digests used for integrity checks, commitments, and password-verification designs.
• Message-authentication codes detect alteration when communicating parties share a secret.
• Digital signatures bind a message to a signing key and permit verification of origin and integrity.
• Authenticated encryption combines confidentiality with detection of tampering, reducing mistakes caused by assembling separate mechanisms.

Security is not equivalent to secrecy alone: authentication, freshness, access control, and resistance to replay may be equally important. A secure algorithm can still fail through poor randomness, leaked keys, unsafe implementation, or misuse of a protocol.

Cryptography becomes useful at scale through protocols that establish trust and manage keys. In Transport Layer Security (TLS), for example, a handshake authenticates a server through certificates, negotiates algorithms, and establishes temporary session keys before application data is exchanged. ³ Certificate authorities help bind public keys to names, but that trust model introduces operational responsibilities, including certificate issuance, revocation, renewal, and protection of private keys.

Key management often determines practical security more than the choice between reputable algorithms. Organizations must generate keys with strong randomness, restrict their use, rotate or retire them, maintain recovery procedures, and account for compromise. Cryptographic agility—the ability to replace algorithms or parameters—matters because standards, hardware, and attacks change. Poorly designed systems may expose metadata even when message contents are encrypted, and end-to-end encryption cannot by itself prevent compromise of an endpoint that displays the plaintext.

Standards bodies such as NIST publish guidance on key lifetimes, algorithm selection, and transitions. ⁴

Cryptography also includes specialized techniques that change what can be revealed and who must be trusted. Zero-knowledge proofs let one party demonstrate possession of information without disclosing the information itself; they have applications in authentication and privacy-preserving systems. Secure multiparty computation allows several parties to calculate over combined inputs while limiting disclosure of each private input, while homomorphic encryption permits certain computations on encrypted data.

The field has an unusual relationship with mathematics and physical science. Quantum cryptography, especially quantum key distribution, uses properties of quantum states to detect some forms of interception, but it requires specialized equipment and does not replace authentication or broader security engineering. Conversely, a sufficiently capable quantum computer could threaten widely deployed public-key schemes based on factoring or discrete logarithms. This prospect has driven post-quantum cryptography, which develops classical algorithms intended to resist quantum attacks; NIST has begun standardizing such algorithms while recommending planned migration rather than abrupt replacement. ⁵

Ciphertext

The transformed output produced when plaintext is processed by an encryption algorithm and key.

Cryptanalysis

The study of recovering protected information or distinguishing weaknesses in cryptographic systems.

Key

A value that controls a cryptographic operation, such as encryption, decryption, signing, or verification.

Public-key cryptography

Cryptography using mathematically related public and private keys for functions such as key establishment and signatures.

Authenticated encryption

Encryption that also provides a verifiable indication that the protected data has not been altered.