Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Ciphertext stealing


 

In cryptography, ciphertext stealing is a variation of Cipher Block Chaining (CBC) that does not require any padding, at the cost of significantly increased complexity.

1 Encryption procedure

2 Decryption procedure

Proof that this decryption procedure really is the inverse of the encryption procedure is left as an exercise for the reader.

While it is an interesting mechanism to avoid padding, ciphertext stealing does not appear to be widely used. This is probably because much simpler solutions are available, such as using the block cipher in counter mode (CTR), or using a stream cipher.

Ciphertext stealing also requires the plaintext to be longer than one block. A workaround is to use a different mode of encryption when the plaintext length is one block or less, such as XORing the plaintext with block cipher encryption of the IV.


Block ciphers [ }|action=edit}} Edit }]
Algorithms: 3-Way | AES | Akelarre | Blowfish | Camellia | CAST-128 | CAST-256 | CMEA | DEAL | DES | DES-X | FEAL | FROG | G-DES | GOST | ICE | IDEA | Iraqi | KASUMI | KHAZAD | Khufu and Khafre | LOKI89/91 | LOKI97 | Lucifer | MacGuffin | Madryga | MAGENTA | MARS | MISTY1 | MMB | NewDES | RC2 | RC5 | RC6 | REDOC | Red Pike | S-1 | SAFER | SEED | Serpent | SHACAL | SHARK | Skipjack | Square | TEA | Triple DES | Twofish | XTEA
Design: Feistel network | Key schedule | Product cipher | S-box | SPN   Attacks: Brute force | Linear / Differential  cryptanalysis | Mod n | XSL   Standardisation: AES process | CRYPTREC | NESSIE   Misc: Avalanche effect | Block size | IV | Key size | Modes of operation | Piling-up lemma | Weak key

Cryptographic algorithms

Read more »

Non User