CSE575_KnowledgeCheck_GenerativeAdversarialNetworksandtheir Applications

Problem with constructing MAC. The messages X to be authenticated consists of z independent blocks, so that: X = x1||x2|| . . . ||xz, where every xi consists of |xi| = 8 bits. The input blocks are consecutively put into the compression function  ci = h(ci−1, xi) = ci−1⊕xi At the end, the MAC value: MACk(X) = cz+k mod 28 is calculated, where k is a 64-bit long shared key. Describe how exactly the (effective part of the) key k can be calculated with only one known message X.

QUESTION 2 If the token bucket contains 500 Bytes and the arriving packet is 400 then: O a. All statements are INCORRECT O b. Conform action & the remaining bytes in the bucket would be 200 Bytes O C. Exceed action & the remaining bytes in the bucket would be 100 Bytes Od. The packet will be dropped as there no enough tokens in the bucket

Asap

Q2: A sequential network has one input and one output. The output becomes 1 when either M or N is detected in its input where M and N are binary numbers. Otherwise, it gives 0 in its output. Draw the state diagram for the following: 1. M 11 and N=00 (use mealy model). 2. M = 01 and N=11 (use mealy model). 3. M = 10 and N = 11(use mealy model). 4. M = 01 and N = 10 (use mealy model). 5. M 01 and N = 10 (use moore model).

Suppose that a 20-Mbps 802.11 LAN is transmitting 64-byte frames back-to-back over a radio channel with a bit error rate of 10−7 (i.e., the probability of a bit to flip duringthe transmission). How many frames per second will be damaged on average?(*hint: you would need to calculate the probability that a frame does not suffer any bit errors, thisis equivalent to the fraction of frames that do not suffer any bit errors on average.)

choose the best

Compute CBC-MAC for a message of 16 bits, “ABCD” (in Hexa). Assume a block size of 8 bits with an IV=C9 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be D8 (in Hexa).  (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV.

a. Compute CBC-MAC for a message of 16 bits, “8642” (in Hexa). Assume a block size of 8 bits with an IV=F1 (in hexa). For simplicity, assume the encryption to be a simple XOR of the key with the plaintext. Let the encryption key be B4 (in Hexa).  (Hint: Divide the message into blocks of 8 bits each; XOR each block with the previous cipher output; then encrypt this with the key. For the first block, XOR it with IV. Details in pages 325-326 Ch.12 of the textbook)     b. Suppose Alice computes the Secret prefix MAC (page 322: secret prefix MAC(x) = h(key || x)) for the message ”AM” (in ASCII) with key  “G” (in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret prefix MAC…

The code containing of 8 code words which encrypt the communications zero to 1 1 1 as follows:   State the succeeding questions with explanation on the question above:   Is it linear?   what is its block length, message length, charge and distance?   how many mistakes can it detect, and how many situations is it incorrect?   ( to reply this question grant the best range of errors that the code can assurance to end up conscious of or correct. for occasion a convenient parity bit can word two errors so we would say this can end up conscious of completely a single error. No calculations of risk are required.

In the protocol we avoid unnecessary transmission by sending only frames that are corrupted Select one: O a. Stop-and-Wait ARQ O b. Go-Back-N ARQ O c. Simplest ARQ O d. Selective-Repeat ARQ

What is the effect of a single-bit transmission error in the ciphertext when using theECB and CBC modes of DES operation? More precisely, answer the following question: Theplaintext blocks are {P1, P2, . . ., Pn). The ciphertext blocks are {C1, · · ·, Cn}. Suppose Cicontains a transmission error for some 1 <= i <= n. Which plaintext blocks will be recoveredincorrectly?

2. Decode the following packet 0000 00 12 80 4b c0 7f 00 16 d4 b8 59 b1 08 00 45 00 ...K.... ..Y...E- 0010 00 3b 1f 27 00 00 80 11 d1 ae co a8 64 8a c0 a8 d.. 0020 64 01 04 24 00 35 00 27 6d 5a 18 Of 01 00 00 01 d. -$-5.' mZ- 0030 00 00 00 00 00 00 09 77 69 72 65 73 68 61 72 6b -w ireshark 0040 03 6f 72 67 00 00 01 00 01 org- a. What is the Source MAC address? b. What is the destination MAC address? Circle the Type field. d. What does the type field identify? C. e. How long is the IP Header? Highlight or underline the IP Header portion of this datagram g. How long is the datagram? h. IP ID is i. f. Are there any fragment flags set? Circle yes or no. If yes, which ones? j. What is the value of the time to live field? k. What protocol is identified in the Protocol Field I. m. What is the destination IP Address? What is the source IP Address?

Just give the correct option no need explanation

5. What is the biggest advantage of CBC mode of operation O a. It does not need Initialization Vector (IV) O b. A cipher text block depends on all blocks before it O c. It does not propagate errors in the cipher text O d. It can encrypt in parallel different parts of the messages

A messaging system reads message as 4-digit positive integer d1d2d3d4 and stores encoding of the message e1e2e3e4 for security reason. The encoding process is as follows:  ei = (di+i) mod 3    For example, if message is 4590, the encoded message is 2101.     Read any arbitrary message and display the encoded message in the following format:    Original message =   Encoded message =    language : C

For NAT Network Address Translation Scenario: Jenny Bello is a small business owner selling and making customized computer peripherals. She has been finding it difficult to track her sales and inventories, however recently after an expert's advice, she adopted a Point of Sale (PoS) server. So, she can now track her sales and inventories at the store. However, she ran into another issue, the server can only be accessed within the store, because it has been assigned a private IPv4 address, it is not publicly accessible via the Internet. a) Why is not having the PoS server accessible over the Internet a problem for the business? b) What caused this problem? c) Propose a solution for the problem and explain how the solution works.

The notation from this problem is from Understanding Cryptography by Paar and Pelzl. Suppose you have an LFSR with 6 state bits. The first 12 bits of output produced by this LFSR are 11110001010100=s0s1s2s3s4s5s6s7s8s9s10s11. The first bit produced is the leftmost bit and the bit most recently produced is the rightmost bit. a) What is the initial state of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent s5=0,s4=1,s3=0,s2=1,s1=0,s0=1 b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent p5=0,p4=1,p3=0,p2=1,p1=0,p0=1

Only answer, no explaination

question help needed

please explain step by step

What does the image below represent? What is KDC used for? Can you give an example of software that uses what is represented in the image?

Computer A uses the Go-back-N ARQ protocol to send a 110 Mbytes file to computer B with a window size of 15. Given each frame carries 100K bytes data. How long does it take to send the whole file (the total time taken from A sending the first bit of the file until A receiving the last acknowledgment)? Given that the transmission rate of the link is 500 Mbps and the propagation time between A and B is 15ms. Assume no data or control frame is lost or damaged and ignore the overhead due to header and trailer.