Use ubuntu terminal and atom text editor please

Note: You are welcome to subenit this assignment as an individual, or as a team of 2. Just keep in mind that if you work in a team of 2, you should ensure that both team members know what they are doing. Otherwise, you may find yourself unprepared for the final exam. To get started, create a new folder. Add an assembly source file to that folder called It is this source file that you will submit to Blackboard. Overview In this assignment, you will create the ultimate encryption program. The program will ask the user for a message and a key, and will use that key to encrypt the message, then again to revive the original message Part 1 (6 marks) encrypt.asm is part of the program will input two strings, with prompts. The program will then take, character by character, the original message and the key and apply the Vigenre cipher 1 (algorithm for encryption) to it. To collect a single byte from memory, try something like the following mov dl, [rax] In the above example, "dl is an 8-bit register (actually, the low order 8 bits of the 64-bit register rdx). Similarly, there are al, bl, dl (and even ah, bh, ch, and dh. The Vigenre cipher is a relatively old idea. It takes a key of any size, which is a series of letters (e.g a word). The key is used repeatedly so that each character in the plaintext has a cornesponding letter from the key. For example, here is the match up for the key 'OPENSESAME and the message Key Plaintext: MEETUSAT TWEL VEOCLOCKSHARP Note Duplicating the key so thuat it is the same length as the wessage is one of the trickiest parts of this program. Create a s?ifficiently large string ??? le for the result (eg duplicatedKey, copy the letters fronkey ilntil you get to the wull-terminator (a character equal to zero). Keep a count of houw many claracters have been copied, and stop when that count ranches the message lengtk. Whenever you get to the end of the lry, go back to the first cluaracter The letter O above the "M' in the leftmost column in the above example means that your algorithm will apply a Caesar-O shift. This is a fancy way of saying that you will add 14 to the ASCII value for M (with wrap-around if the value goes beyond Z'). A full table of the shifts is given in the table below. For Note: You are welcome to subenit this assignment as an individual, or as a team of 2. Just keep in mind that if you work in a team of 2, you should ensure that both team members know what they are doing. Otherwise, you may find yourself unprepared for the final exam. To get started, create a new folder. Add an assembly source file to that folder called It is this source file that you will submit to Blackboard. Overview In this assignment, you will create the ultimate encryption program. The program will ask the user for a message and a key, and will use that key to encrypt the message, then again to revive the original message Part 1 (6 marks) encrypt.asm is part of the program will input two strings, with prompts. The program will then take, character by character, the original message and the key and apply the Vigenre cipher 1 (algorithm for encryption) to it. To collect a single byte from memory, try something like the following mov dl, [rax] In the above example, "dl is an 8-bit register (actually, the low order 8 bits of the 64-bit register rdx). Similarly, there are al, bl, dl (and even ah, bh, ch, and dh. The Vigenre cipher is a relatively old idea. It takes a key of any size, which is a series of letters (e.g a word). The key is used repeatedly so that each character in the plaintext has a cornesponding letter from the key. For example, here is the match up for the key 'OPENSESAME and the message Key Plaintext: MEETUSAT TWEL VEOCLOCKSHARP Note Duplicating the key so thuat it is the same length as the wessage is one of the trickiest parts of this program. Create a s?ifficiently large string ??? le for the result (eg duplicatedKey, copy the letters fronkey ilntil you get to the wull-terminator (a character equal to zero). Keep a count of houw many claracters have been copied, and stop when that count ranches the message lengtk. Whenever you get to the end of the lry, go back to the first cluaracter The letter O above the "M' in the leftmost column in the above example means that your algorithm will apply a Caesar-O shift. This is a fancy way of saying that you will add 14 to the ASCII value for M (with wrap-around if the value goes beyond Z'). A full table of the shifts is given in the table below. For