Our site uses cookies. Some of the cookies we use are essential for parts of the site to operate and have already been set. You may delete and block all cookies from this site, but parts of the site will not work. To find out more about cookies on this website, see our Cookie Policy
Accept
© eRevision.uk and ZigZag Education 2025
This test is run by .
Note that your final mark will not be saved in the system.

5. Compression, Encryption and Hashing GapFill

Target Level
C
Running Total
0
0%
Attempt
1 of 3

You must fill all the gaps before clicking ‘Check Answers!’

Encryption of text data involves processing  open textASCIIUnicodeplaintext – that's the unencrypted text – with some kind of  decodertriggermechanismcipher – an algorithm that turns it into a form that does not make sense to a human reader. That form is called  transposition textkey textciphertextclosed text, and it must be subsequently  decompresseddecodedencodeddecrypted before it can be put to any use.

There are various means of doing this, to varying degrees of sophistication. Some systems use one or more keys to encrypt and decrypt the data. In  symmetricmatched-pairkey-matchedsyntactic encryption, the same key is used to encrypt the data as to decrypt it. This form of encryption is used in many aspects of  HTTPSHTTPFTPTCP, in part because it's  cheaperquickermore securemore reliable than the alternative method.

That alternative method is called  asymmetricdual-keyunmatchedtransposed encryption, and it works slightly differently. When a sender needs to encrypt a piece of data, they uses the  secondarytertiaryprivatepublic key of the  recipientnetworksenderISP. That key cannot decrypt the data. The encrypted data is sent, whereupon the recipient uses the   privatepublicsecondaryprime key of the  sendernetworkISPrecipient in order to  decryptcompileinterprettranslate the data.

This is your 1st attempt! You get 3 marks for each one you get right. Good luck!

Pass Mark
72%