I am doing a task which involves developing a Feistel cipher in the nand2tetris HACK assembly language. I have working implementations of an XOR and rotation (bit shift) function in HACK. I believe the first step for the cipher is splitting the 16-bit plaintext into two equal parts. How would I achieve this?

I am doing a task which involves developing a Feistel cipher in the nand2tetris HACK assembly language. I have working implementations of an XOR and rotation (bit shift) function in HACK. I believe the first step for the cipher is splitting the 16-bit plaintext into two equal parts. How would I achieve this?

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter8: Data And Network Communication Technology

Section: Chapter Questions

Problem 41VE

See similar textbooks

Similar questions

Implement 4-bit block cipher using 4 XOR gates, plain text input [3:0] p, key input [3:0] k and cipher text output [3:0] c using Verilog. Use two of 4-bit block cipher and 2 XOR gates to implement 8-bit block cipher with plain text input [7:0] p, key input [3:0] k, initialization vector input [3:0] and cipher text output [7:0] c. ex) IV = 4’b1101, key = 4’b1000, plaintext = 8’b01100001 (‘a’, 97)
To prevent the tapping and use of information on a wireless network which has brought untold mistrust amongst the directors of Okonko Systems, you suggested that every message that is transmitted should go through the following: A systematic two left bit shift; After “a” above, the algorithm f[(6m +2) + k] mode 13 should be applied to the cipher text, where m is the message and k =9 is a key; After “b” above, perform a systematic right bit shift to the new cipher; The message should then be transmitted. If on a trial basis, the message is “genomics” Use the mono – alphabetic letters where a = 0, b = 1, ….z = 25 to find the cipher that would be transmitted
Encrypt the 12-bit plaintext 101010100111 using Simplified B-DES and the 9-bit key K = 010001111. This is a non-computer problem and you need to show all the steps of the encryption process
Create a MIPS assembly program using MARS to do RSA encryption/decryption. Get a numeric message from the user and encrypt it. Also, get a numeric message from the user and decrypt it. An RSA public key consists of a pair of numbers (n, e), and the message m is encrypted to a ciphertext c by calculating c = me (mod n). The RSA private key consists of a pair of numbers (n, d), and a ciphertext c is decrypted by calculating m = cd (mod n). For this, use n=21733, e=257, d=1403. Note that since me and cd can get rather large (hundreds or thousands of digits for our examples), use the following pseudocode to handle encryption and decryption: doRSA( n, exp, msg ) cmsg = msg Initialize ciphertext, requires odd exponent mpow = msg message to the power 1, 2, 4, 8, 16, … tempexp = exp temporary exponent while ( tempexp > 1 ) mpow = ( mpow * mpow ) % n square the message tempexp = tempexp / 2 update the power if ( tempexp % 2 == 1 ) 1 bit in the binary representation of e? cmsg = ( cmsg…
perform an time and delay analysis of aes encryption algorithm in python.
Consider AES with 128-bit block length and 128-bit key length. What is the output of the first round of AES if the plaintext consists of 128 ones and the first subkey also consists of 128 zeros?
Given the RSA public key (3,70747) and private key (46811,70747). a. Encrypt the letter ‘z’ using its ASCII value and implement in python. b. Decrypt the result from the subtask above and generate the original text and implement in python. c. Encrypt the word ‘Cyber’ two characters at a time padding with a space and implement in python. d. Decrypt the following three blocks 14520 66071 27623. The blocks are the encryption of a five-letter word, encrypted two characters at a time and padded with a space. Recover the word and implement in python. d. The blocks are the encryption of a five letter word, encrypted two characters at a time and padded with a space. Recover the word and implement in python. e. Determine the maximum block size, in bits, that this modulus can encrypt and decrypt.
We use DES in cipher feedback mode (CFB) to encrypt a plaintext m = m1m2 ...m100 into a ciphertext c1c2 ...c100, where each mi is 8-bit long. The ciphertext is sent to Bob. If c15 and c25 are missing and c8 and c88 are received as c8' and c88' wrongly, what mi’s can B compute correctly from the received ciphertext?
what are the main two problems of One-Time Pad cipher
The function f(R, K) = P(S(E(R XOR K)) of the DES cryptographic protocol manipulates different sizes of bit-strings. The bit-string sizes of P-SEK in this order are: 32-48-48-32 32-32-48 48 48-48-32-32 64-32-32 48 64 48 32-64 SAVE
Use the key 1010 0111 0011 1011 to encrypt the plaintext "ok" as expressed in ASCII, that is 0110 1111 0110 1011. The designers of S-AES got the ciphertext 0000 0111 0011 1000. Do you? Please explain step by step how to do as I am not clear how to do
Write a python program to generate a random secure hexadecimal token