Modes of operation such as CFB and CBC require the use of an initial variable (IV), which must be known by both the sender and receiver. Discuss the pros and cons of the following suggestions for selection of IVs Randomly generate each IV; Use a counter that is incremented after each message as the IV; Use the last ciphertext block of the previous message as the IV

Modes of operation such as CFB and CBC require the use of an initial variable (IV), which must be known by both the sender and receiver. Discuss the pros and cons of the following suggestions for selection of IVs Randomly generate each IV; Use a counter that is incremented after each message as the IV; Use the last ciphertext block of the previous message as the IV

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

in C++ language Magic Decoder Ring. A one-time pad is a coding device that uses each character of a key string only once to encode and decode a corresponding character in a message string. Thus, the first character in the key is used to encode and decode the first character in the clear message, the second character in the key is used with the second character in the message, etc. No portion of the key is reused in subsequent messages, making for a very solid coding system, assuming a randomly generated key. You will need to create a class titled MagicDecoderRing that contains the variables and functions needed for obtaining the clear and key texts, encoding and decoding the messages, writing out the encoded message etc. You will need to instantiate an instance of this class in your main function to run your program and encode and decode messages. You need to further break your MagicDecoderRing code down into many small functions that each can be described with a single sentence…
In C++ language Magic Decoder Ring. A one-time pad is a coding device that uses each character of a key string only once to encode and decode a corresponding character in a message string. Thus, the first character in the key is used to encode and decode the first character in the clear message, the second character in the key is used with the second character in the message, etc. No portion of the key is reused in subsequent messages, making for a very solid coding system, assuming a randomly generated key. You will need to create a class titled MagicDecoderRing that contains the variables and functions needed for obtaining the clear and key texts, encoding and decoding the messages, writing out the encoded message etc. You will need to instantiate an instance of this class in your main function to run your program and encode and decode messages. You need to further break your MagicDecoderRing code down into many small functions that each can be described with a single sentence…
in c++ Magic Decoder Ring. A one-time pad is a coding device that uses each character of a key string only once to encode and decode a corresponding character in a message string. Thus, the first character in the key is used to encode and decode the first character in the clear message, the second character in the key is used with the second character in the message, etc. No portion of the key is reused in subsequent messages, making for a very solid coding system, assuming a randomly generated key. You will need to create a class titled MagicDecoderRing that contains the variables and functions needed for obtaining the clear and key texts, encoding and decoding the messages, writing out the encoded message etc. You will need to instantiate an instance of this class in your main function to run your program and encode and decode messages. You need to further break your MagicDecoderRing code down into many small functions that each can be described with a single sentence without ‘ands”…
Goal:Experimenting with AES-128 symmetric key cipher. Note:Using Python programming language that provided libraries for AES. Description:PART 1: write a program that uses AES-128 to decrypt a message. The program should be named "decrypt", and should deal with three files that contain the encrypted text as a stream of bytes, the 128-bit key for decryption stored as a stream of bytes, and the outcome of the decryption, respectively.- To test this program, here's an example of an encrypted message (ciphertext.dat) and its 128-bit secret key (key.dat). PART 2: you will try to use "brute force" to decrypt an encrypted message, where you only have the first 96-bits of the 128-bit secret key (last 4 bytes of the secret key are missing!) The program should be called "findk", and should deal with two files that contain the encrypted text as a stream of bytes and the first 96-bits of the key, respectively. The program should print out on standard output the missing 4 bytes of the key in…
Computer NETWORKS A bit stream X is transmitted using the standard CRC method, where, X is the 8 bit ASCII of 49 and divisor will be the 8 bit ASCII of 9 . [Note: remove the left most 0’s from X as well as divisor]. Write down the complete procedure to create codeword at sender side and then check at receiver side that either the data received is correct or not?
Public Key Authority is one example of this. Before sending a message to A, the Public Key Authority must prepare a request for B's public key (E(PRauth[PUB] || Request || Time1]). It's debatable whether letter in the alphabet A should be used to understand the message.
9. Cryptology is the science of making and breaking codes. This lab explores how the idea or functions and their inverses can be used to encode and decode messages. To encode and decode a message, first replace each letter of the alphabet with a positive integer using the following scheme, thus rewriting the original message as numbers instead of words: P- 16 Q- 17 R- 18 S- 19 T-20 Z-26 Blank - 27 A – 1 В - 2 С -3 D- 4 E- 5 F- 6 G- 7 H-8 |- 9 J- 10 K- 11 L-12 М -13 N- 14 O- 15 U- 21 V- 22 W-23 X-24 Y-25 ENCODING: A one-to-one function can be used to encode a numerical message. For example, suppose you want to send the message MATH to a friend, and you have decided that the function f(x) = 3x + 4 will be the encoding function, This function simply describes the procedure used to create the encoded message – in this case multiply by 3 and add 4. First change the letters to corresponding numbers as shown above: 13 1 20 8. Then use these as the input values in f(x). Tuoy Jud noltonut…
You are given the following parameters in RSA cryptosystem: p = 11, q = 13, e = 13 a) Find the integer d. b) List down the public key and private key. You need to encrypt the plaintext message, M = OF. c) Convert this message to value according to ASCII table. To encrypt this message, you can either combine the value, or separate it into the blocks of 2 digits (Hint: it must satisfy the condition M < n). d) Encrypt and decrypt the message OF. e) If the decimal value (not character) of ciphertext is 188267, decrypt this value and convert it to an appropriate message according to the ASCII table.
Public Key Authority is one such instance. The Public Key Authority must prepare a request for B's public key before delivering a message to A (E(PRauth[PUB || Request || Time1]). It is debated if the letter A should be used to decipher the message.
Computer science Use C language to solve the question. The initial server and client .c code is given write code using these .c client and server files. Q1: Design a client-server model for two-way communication. Both the client and server should beable to send and receive messages.Upon the establishment of successful connection, the server should send a message, “Hi, youhave connected to the server!”.[The client should then send a string to the server. The server should reverse the string andsend it back to the client. The client should then display the received string.] This job will bedone in a loop of 5 times. -------------------------------------------- server.c #include <stdio.h> #include <stdlib.h> #include <sys/socket.h> #include <sys/types.h> #include <netinet/in.h> int main() { char server_message[256] = "Hi, Yes you have reached the server!"; char buf[200]; // create the server socket int server_socket; server_socket = socket(AF_INET,…
Using C programming language: A Transposition Cipher A very simple transposition cipher encrypt(S, N) can be described by the following rules: If the length of S is 1 or 2, then encrypt(S, N) is S. If S is a string of N characters s1 s2 s3... sN and k = N/2, then encrypt(S)= encrypt(sk sk−1... s2 s1 ,K)+ encrypt(sN sN−1... sk+1 ,N - K) where + indicates string concatenation. For example, encrypt("Ok", 2) = "Ok" and encrypt("12345678", 8) = "34127856". Write a program to implement this cipher. The input is a file that is guaranteed to have less then 2048 characters. Code structure might look like this: #define MAX_SIZE 2048char text_buffer[MAX_SIZE];int main(){ // read file into text_buffer encrypt(text_buffer, n); // print out text_buffer return 0;}
write an encoder and a decoder for a modified "book cipher." A book cipher uses a document or book as the cipher key, and the cipher itself uses numbers that reference the words within the text. For example, one of the Beale ciphers used an edition of The Declaration of Independence as the cipher key. The cipher you will write will use a pair of numbers corresponding to each letter in the text. The first number denotes the position of a word in the key text (starting at 0), and the second number denotes the position of the letter in the word (also starting at 0). For instance, given the following key text (the numbers correspond to the index of the first word in the line) [0] 'Twas brillig, and the slithy toves Did gyre and gimble in the wabe; [13] All mimsy were the borogoves, And the mome raths outgrabe. [23] "Beware the Jabberwock, my son! The jaws that bite, the claws that catch! [36] Beware the Jubjub bird, and shun The frumious Bandersnatch!" [45] He took his vorpal sword in…