Cryptography, Computer Engineering

Assignment Help:

Basically I need implement program using LC3 assembly language where I can type any message using ASCII code (this will my input). Then read the output in cipher text. It has to be a combination of this to labs in the bottom. ( please make sure design the flow chart for the program)

Computer Organization and Architecture Lab 4: Cryptography

Description:

An encryption algorithm transforms "plain text" into "cipher text." Just like a door needs a key to lock and unlock it, an encryption algorithm often requires a key to encrypt and decrypt a message. For example, suppose the plain text message is HELLO WORLD. An encryption algorithm consisting of nothing more than replacing each letter with the next letter in the alphabet would produce the cipher text IFMMP XPSME. The decryption algorithm simply replaces each letter with the one before it, and presto: the plain text HELLO WORLD is produced.
Procedure:

Implement, in LC-3 assembly language, an encryption/decryption program that meets the following requirements:
1. The key is 6 and stored at x31 00.
2. Your message is restricted to a maximum of 32 characters. They are stored at x3110 to x311 F. The last ASCII code of the text string must be EOT (x04).
3. The encryption algorithm is as follows. Each ASCII code in the message will be transformed as follows:
• The low order bit (LSB) of the code will be toggled. That is, if it is a 1, it will be replaced by 0 and vice verse.
• The key will be added to the result of step 1 above.
• The result should be stored at location x3120 to x312F.
• For example, if the input (plain text) is A and the encryption key is 6, the program should take the ASCII value of A, 01000001, toggle bit [3:0], producing 01001110 and then add the encryption key, 6. The final output character would be 01000110, which is the ASCII value F.
4. Decryption algorithm is as follows. Each ASCII code in the message will be transformed as follows:
• Subtract the encryption key from the ASCII code.
• Toggle the low order bit of the result of ste

• The result should be stored back to location x311 0 to x311 F.
Notes and Suggestions:
• The first line of your programs must specify the memory address of the first instruction of your program. LC-3 simulator will place your program starting at that address. For this assignment, you should place your program starting at x3000 (using the .ORIG pseudo¬op) .
• If you are using a Windows machine, use the LC3Edit program to type in your programs.
On Sun and Linux workstations, pico, emacs, and vi are several of the text editors you can use. Your program file needs to be in plain text format.


Related Discussions:- Cryptography

Demostrate the example of spreadsheet, Now consider the following spreadshe...

Now consider the following spreadsheet: Formula in cell D2 is = (B2/C2) Replicating this formula (by highlighting then drag down to D7) gives all the formulas needed in cell

What do you mean by shared memory, Q. What do you mean by Shared Memory? ...

Q. What do you mean by Shared Memory? In shared memory scheme more focus is on controlling parallelism instead of data parallelism. In this model numerous processes run indepen

How many flip-flops are required to construct mod 30 counter, How many flip...

How many flip-flops are required to construct mod 30 counter ? Ans. Mod - 30 counter +/- requires 5 Flip-Flop as 30 5 . Mod - N counter counts overall ' N ' number of state

Simulated annealing - artificial intelligence, Simulated Annealing: On...

Simulated Annealing: One way to get around the problem of local maxima, and related problems like ridges and plateaux in hill climbing is to allow the agent to go downhill to

Explain deadlock, What is a deadlock? A deadlock is a situation that ca...

What is a deadlock? A deadlock is a situation that can increase when two units, A and B use a shared resource. Assume that unit B cannot complete its task unless unit A complet

Why process scheduling algorithm favour i/o bound processes, Suppose that a...

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes,

Address phase - computer architecture, Address phase: A PCI bus transa...

Address phase: A PCI bus transaction starts having an address phase. The initiator,  after seeing that it has GNT# and the bus is inactive, drives the target address onto the

Parallel computing, explain different types of parallel processing mechani...

explain different types of parallel processing mechanism

Determine by which final selector is connected, The final selector is conne...

The final selector is connected to the (A) calling subscriber.                     (B) switching network. (C) called subscriber.                      (D) li

What is electronic cash, What is electronic cash? E-cash is cash that i...

What is electronic cash? E-cash is cash that is demonstrated by two models. One is on-line type of e-cash that allows for the completion of all kinds of internet transactions.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd