The linguistic evolution of a word once meaning nothing at all
The word 'cipher' traces its lineage back to the Sanskrit word for zero. In the Middle Ages, as the concept of zero traveled from Arabic to Europe, it was so baffling to Western minds that the term eventually came to describe any communication that was difficult to understand.
While often used interchangeably with 'code' in casual conversation, the two are technically distinct. A code functions by substituting entire strings of characters or phrases with different symbols, often to save time or space—much like the commercial telegraph codes used to shorten expensive telegrams. In contrast, a cipher is an algorithmic process that operates at a much lower level, typically substituting individual letters, small groups of letters, or even bits of data.
The history of ciphers is a progression of increasing complexity. One of the earliest known systems was the Caesar Cipher, used by Julius Caesar around 50 BC to communicate with Marcus Tullius Cicero by shifting the alphabet by three positions. Later, during the 1640s, Edward Montagu used ciphers during the English Civil War, and in 1641, John Wilkins even described a 'musical cipher' where letters were replaced by musical notes.
Modern cryptography has moved away from cumbersome codebooks toward sophisticated algorithms. These are categorized by their use of keys and data handling. Symmetric key algorithms, such as AES, use the same secret key for both encryption and decryption. Asymmetric algorithms use a pair of related keys, allowing one to be made public. Today, ciphers are further divided into block ciphers, which process fixed-size data chunks, and stream ciphers, which handle continuous flows of information.
The security of these systems relies on computational difficulty. An adversary might attempt a 'brute force' attack by using massive computing power to exhaustively search for a key. Therefore, increasing the key size is a primary defense, as it makes such searches impractical. However, Claude Shannon proved that the only theoretically unbreakable method is the 'one-time pad,' provided the key is as long as the message and used only once.
Source: Cipher
