Cat a Ci CCC EN Ls DISCUSSION POINT Figure 1.13 - The Enigme machine. The Germans used encrypted messages during Viorid ari using the Enigma machine An operator would type In amessageané then serambleit by using three ta five notched wheels, The recipient woul need \w huow the exact settings of re wheels in order to decipher the message. There were 159% 10!" possible combinations Encryptedmessazes from the Lorenzcipher machine led to the developmanto! the worl’ irs clectric programmable computer, Colossus, whichielped British Lede breakers read encrypted German messages, The first major encryption algorithm or computers was the Data EncryptionStandard (ES) used inthe 1970s. t Used a 56-bit (is and 0s) key. This offered 70> 10" aossible combinations, ut the development of computers meant tatit eventually became possible to'crack’ the code. This, wasreplacec by the Advanced Encryption Standard (AES) hich uses upto 256-DIt keys. This can offer 309 x 10" possible combinations. TASK 1 Using tre Caccar cipher 13 oeample above, write an encrypted meseagetoa ‘ens. Askyoue fiend fo decipherit 2 Choose how many lettersyou are geing wa shift by:snd \wrte another encrypted message toa friend, Don't tell your friend how many letters you shiled by. Your friend should tryto decipher thecodeby noiking out \which letters appear rast conmoniy. 3 See www.mah.uit.edu/CryploClubProject/CCpacket. pdf to create a ciaher wheel and use itto encrypt and decrypt messages, Symmetric encryption Thisisthe oklest method ef encryption. Itrequires both thesender and recipient to possess the secret encryption anddecryption key, With symmetric eneryption, the secretkey needs to he san‘ tothe recipient. This could be done at aseparale Line, 2utitstill has to betransmitied whether by post or overthe interne: and it could ba ercepted Sender acon Encrypt using secet key >| pecryps using the same secret key Figure 1.14 -Symmetric encryption. Asymmetric encryption Asyinmnetric encryption is also known as public key cryptograpry. Asymmetiic encryption overcomes the problem af symmetric encryption keys beingiinterceated by using a pair of xeys. his will include a public key whichis ava lable to anybody wantingtosend data, and a private key thar isknown only to the recipient. They keys the algorithm required ‘0 enc'ypt end decrypt the data | he process works like this | Serer Feder encyps using ecpien's | +] peuypesusig same Pubic key oth singh matching private hey Figure 1.15- Asymmetric encryption Inthe next example, Tomasz sends message to Helene, Tomasz enciypis the message using Haleve’s pubic key. Helene recewes the encrypres massage and decrypts It | using her private key. Thismethodrequires a lot more proce: encrypticn and soit takes longer to decrypt the data ing thensymmetic In order to finda puilie xe, digital certificates are required whichidentiy the user or server and provide the public oy A dipjtal certificate is unique to each user ar server ‘digital cerifficate usually include + organisation name + organisalion Ural issued the certiicale + user’semailaddre + user'scountry + user's public key