Slide 6
Slide 6 text
Symmetric encryption
• Keys can be very simple. For example, you might have a key for a text file
that says, 'Replace each letter with the one two positions further along in
the alphabet'. So DAVID becomes FCXKF.
• To decrypt the message, you just need to know the key (the rule that
describes how the file was encrypted originally). If a key is as simple as
the one above, and you have enough data to work with, it wouldn't take
you very long to work out how to break the code and find out what they
was.
• In practice, therefore, symmetric encryption uses codes that are a little
more sophisticated than the one in this example. However, because of
the fantastic processing power of computers, you can still crack many
codes using symmetric encryption eventually using brute force – trying
out every possible combination of a key until you find the correct one.