Plaintexts

Some articles on plaintexts, plaintext:

Paillier Cryptosystem - Algorithm - Homomorphic Properties
... can be described Homomorphic addition of plaintexts The product of two ciphertexts will decrypt to the sum of their corresponding plaintexts, The product of a ciphertext with a plaintext raising g ...
Attack Model
... In cryptography, a sending party uses a cipher to encrypt (transform) a secret plaintext into a ciphertext, which is sent over an insecure communication channel to ... to try to "break" the cipher, to read the plaintext and obtain the key so that future enciphered messages can be read ... Known-plaintext attack (KPA) - in this type of attack it is assumed that pairs of plaintext and the corresponding enciphered text are available to the analyst ...
Interpolation Attack
... can be determined by standard Lagrange interpolation techniques, using known plaintexts as data points ... Alternatively, chosen plaintexts can be used to simplify the equations and optimize the attack ... This attack can work even when an algebraic relationship between plaintexts and ciphertexts holds for only a fraction of values ...
Davies' Attack
... It is a known-plaintext attack based on the non-uniform distribution of the outputs of pairs of adjacent S-boxes ... It works by collecting many known plaintext/ciphertext pairs and calculating the empirical distribution of certain characteristics ... be deduced given sufficiently many known plaintexts, leaving the remaining bits to be found through brute force ...
Cellular Message Encryption Algorithm
... There is a chosen-plaintext attack, effective for all block sizes, using 338 chosen plaintexts ... to encrypt each dialled digit), there is a known-plaintext attack using 40 to 80 known plaintexts ... For 2-byte blocks, 4 known plaintexts suffice ...