-
Discarded computers, disk
drives and
media are also a
potential source of
plaintexts. Most
operating systems do not
actually erase anything— they
simply mark...
- chosen-
plaintext attack (CPA2),
where the
adversary can
request the
ciphertexts of
additional plaintexts after seeing the
ciphertexts for some
plaintexts. A...
- an
arbitrary set of
plaintexts of
their own
choosing Batch chosen-
plaintext attack:
where the
cryptanalyst chooses all
plaintexts before any of them are...
- The known-
plaintext attack (KPA) is an
attack model for
cryptanalysis where the
attacker has
access to both the
plaintext (called a crib) and its encrypted...
- (
plaintexts)
corresponding to an
arbitrary set of
plaintexts (ciphertexts) of
their own choosing.
Adaptive chosen-
plaintext: like a chosen-
plaintext attack...
- GCM or OFB mode
results in
XORing the same
keystream with two or more
plaintexts, a
clear misuse of a stream, with a
catastrophic loss of security. Deterministic...
- In the RSA cryptosystem,
plaintexts and
ciphertexts are both
values modulo N (the modulus). Therefore, RSA is not
plaintext aware: one way of generating...
- idea of
likely plaintexts will they be able to
choose a
function R that
makes sure time and
space are only used for
likely plaintexts, not the entire...
-
attack requiring 100–10000
chosen plaintexts, and Sean
Murphy (1990)
found an
improvement that
needs only 20
chosen plaintexts.
Murphy and den Boer's methods...
-
dialled digit),
there is a known-
plaintext attack using 40 to 80
known plaintexts. For 2-byte blocks, 4
known plaintexts suffice. The "improved" CMEA, CMEA-I...
