The attacker gets one of the parties to encrypt or sign one or
more messages of the attacker's choosing, thus causing information about the
victim's system to be revealed. Examples include causing a user of the RSA
signature system to reveal their secret key through a series of signatures,
the introduction of malicious commands into the data entry stream of a
victim who is blindly following directions of a remote person claiming to be
assisting them, and inducing a bank to make a series of attacker-specified
transactions so as to cause cryptographic protocols, methods, or keys to be
revealed.
Complexity: Selected plaintext attacks have differing complexity depending
on the system under attack. Attacks on RSA systems have been shown to be
linear in time and polynomial in space.
fc@red.a.net