Trusted by Students Everywhere
Why Choose Us?
0% AI Guarantee

Human-written only.

24/7 Support

Anytime, anywhere.

Plagiarism Free

100% Original.

Expert Tutors

Masters & PhDs.

100% Confidential

Your privacy matters.

On-Time Delivery

Never miss a deadline.

Final Project Due 5-13-2021 @10pm PART 1- (10 Points) Decode the binary sequence (represented in hex) shown on this page using the hints given

Computer Science Dec 20, 2022

Final Project Due 5-13-2021 @10pm PART 1- (10 Points) Decode the binary sequence (represented in hex) shown on this page using the hints given. Important: 1) Match the bytes with your answers. 2) You must show the mathematics for the numbers with some explanation of how you have done the decoding. Hints: 1. It represents an Assignment Statement (variable = Expression). 2. Check ASCII codes for the variables. 3. Check other ASCII variables for : = ( ) 4. Three numbers are in the expression. 5. One number is stored as unsigned 16 bits integer and is between 59000 and 64000. 6. One number is stored as 16 bits two complement number. 7. One number is stored as a 32 bits float and is between 0 and 20. 42 65 74 61 20 30 20 28 20 fc 18 2b 41 44 00 00 20 2a 20 47 61 6d 6d 61 29 20 26 47 61 6d 6d 61 2b 2d fb 90 2 PART 2- (10 Points) 1) Apply the swap algorithm to swap the bits as shown to encrypt 9 printable ASCII characters of your own choice and then place the encrypted hex values (your cipher text) in place of the ? shown in the cipher symbol bytes of the data section. Make sure to show the original text and how the swapping was done (the steps). Swap method Before: a7agasa4a3a2a1a0 After: ajaoaga3a4a2a7a6 2) Expand the NASM program below to decrypt your cipher text in order to display your original text in each jar (one character in each jar). You must pass values to the relevant parameters of print subroutine for each call using the push instruction. section text global _start print: mov mov mov mov int ret ecx, [ESP + 8) edx, [ESP + 4) ebx, 1 eax, 4 0x80 8 _getchar: mov mov mov mov int ret ecx, num edx, 1 ebx, 0; eax, 3; 0x80 EBOOK _start: call and getchar byte [num], 0x0F push ush call lf 1 print byte [i], 1 condFor mov jmp update: mov add al, [i] al, 1 3 [i], al mov condFor: mov cmp jg al, [il al, (num) out For push push call msg len _print update jmp out For: mov int eax, 1 0x80 section data < Final AssignmentC4.pdf Q & 0x80 int ret _start: call and getchar byte [num), OXOF push push call lf 1 print byte [il, 1 condFor mov jmp update: mov add al, [i] al, 1 3 [i], al mov condFor: mov cmp jg al, [i] al, (num) out For push push call msg len print update jmp out For: mov int 1 eax, Ox80 section data msg db +", 0x0A db "* ? +", 0x0A db Ox?? db lf db Ox?? len equ $ - msg Cipher db 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 segment .

Archived Solution
Unlocked Solution

You have full access to this solution. To save a copy with all formatting and attachments, use the button below.

Already a member? Sign In
Important Note: This solution is from our archive and has been purchased by others. Submitting it as-is may trigger plagiarism detection. Use it for reference only.

For ready-to-submit work, please order a fresh solution below.

Or get 100% fresh solution
Get Custom Quote
Secure Payment