Cryptography attacks.
Lots of different flavors of these, the
plain text, the cyber tax, rubber hose attack, chosen key.
Most of these you probably wouldn't perform in your lifetime, but when you're
cracking encryption, using things like chosen c ypher text, known plain text,
brute force, rainbow tables, things like that, that can definitely come into play.
But a known plain text attack is where you know what the plain text is and the c
ypher text, and you can see the before and the after.
In chosen c ypher text, you get to reverse what was encrypted.
Some of this stuff would require access to the crypto system,
and that's usually not going to be the case.
Rubber hose attack, beating somebody with
a rubber hose until they give up the encryption key.
Man in the middle attack, Timing attack,
a couple of other variations of that as well.
But we'll look at things like brute force attacks, dictionary attacks, and hybrid
attacks when we're cracking passwords or encryption keys.
A brute force attack is every possible
combination of characters, bits, whatever I'm brute forcing.
We actually already talked about that in password cracking.
And a birthday attack is a situation where you've got two different inputs
that produce the same hash output for hashing algorithm.
The whole idea here is that in a birthday attack on a
password, you could actually crack a user's password with the wrong password as
long as it produces the same hash as the user's password.
The idea there, if you're using a non
collision resistant algorithm, is that somebody may actually log in with the
incorrect password, but the system still accepts it.
That's based on the birthday paradox. All right, and that's going to
wrap up our module for Module Two, information security attacks.
Up next, Module Three.