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

A graph ''g'' with ''n'' nodes is bipartite, A graph 'G' with 'n' nodes is ...

A graph 'G' with 'n' nodes is bipartite if it have  no cycle of odd length.

View the site files, To see a high-level representation of the structure of...

To see a high-level representation of the structure of a local site, you use Dreamweaver's Site Map view. You can also use site map to add new files to the site, to add, remove and

Explain language processor development tools by diagram, Explain Language ...

Explain Language Processor Development Tools (LPDTs) through schematic diagram. LPDT that is Language processor development tools focuses upon generation of the analysis phase

Loop statement in both the pbo and pai events, Why do we need to code a LOO...

Why do we need to code a LOOP statement in both the PBO and PAI events for each table in the screen? We require coding a LOOP statement in both PBO and PAI events for every ta

Discuss the concept of segmentation, Discuss the concept of segmentation? ...

Discuss the concept of segmentation? Segmentation is method for the non contiguous storage allocation. This is different from paging as this supports user's view of his program

Explain how a node can be inserted into an avl tree, Explain how a node can...

Explain how a node can be inserted into an AVL tree. We can insert a node into an AVL tree through the insertion algorithm for binary search trees in which we compare the key o

What are limitations of assembly language, What are limitations of assembly...

What are limitations of assembly language? i. It is changed to machine language using assembler which is time consuming when compared with machine language. ii. It is comple

Fact finding techniques on banking system, what are the questionnaries and ...

what are the questionnaries and observation of work site for banking system?

Accessing the operands - assembly language, Accessing the Operands: ...

Accessing the Operands: operands are usually place in one of two places: -registers (32 int, 32 fp) -memory (232locations) registers are -simple to spe

Learning weights in perceptrons, Learning Weights in Perceptrons - Artifici...

Learning Weights in Perceptrons - Artificial neural network In detail we will look at the learning method for weights in multi-layer networks next chapter. The following descri

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