A company of soldiers are beyond enemy lines waiting to launch a surprise attack. However, they require orders from their commander, who will be sending a code (an integer) via a cell phone. It is known that the enemy can intercept all communications, which is why the commander and his troops have decided upon the details of the encoded secret code before setting off for the mission. The discussion is shown in the table below. For example, if bits 14, 11 and 7 of the secret code are 0, 0 and 0, it implies that the the company must hold their position. Assuming a random code between 39999 and 3999999 is received by the soldiers, determine what action will be taken. You are not allowed to convert the number into a binary in your code. Use bitwise operators.

A company of soldiers are beyond enemy lines waiting to launch a surprise attack. However, they require orders from their commander, who will be sending a code (an integer) via a cell phone. It is known that the enemy can intercept all communications, which is why the commander and his troops have decided upon the details of the encoded secret code before setting off for the mission. The discussion is shown in the table below. For example, if bits 14, 11 and 7 of the secret code are 0, 0 and 0, it implies that the the company must hold their position. Assuming a random code between 39999 and 3999999 is received by the soldiers, determine what action will be taken. You are not allowed to convert the number into a binary in your code. Use bitwise operators.

Np Ms Office 365/Excel 2016 I Ntermed

1st Edition

ISBN:9781337508841

Author:Carey

Publisher:Carey

Chapter3: Performing Calculations With Formulas And Functions

Section: Chapter Questions

Problem 2.8CP

See similar textbooks

Similar questions

The following message uses a direct mapping of letters to numbers (i.e. A-1, B=2, c-3, etc.).Using the values D=17 and m=21, decrypt the following message:10 15 12 18 1 3 17 14 7 18 14 17 17 9 18 14
Question ACTIVITY : CODING Suppose the following messages are source encoded given by the table. Message Encoded Bits UP 00 DOWN 01 LEFT 10 RIGHT 11 I. Complete the given table by writing the source encoded message of the following set of directions. Set of Directions Source Encoding LEFT - UP - RIGHT - DOWN 1.) UP - DOWN - UP - RIGHT 2.) DOWN - DOWN - RIGHT - LEFT 3.) UP - DOWN - LEFT - RIGHT 4.) RIGHT - LEFT - RIGHT - UP 5.) II. Decode the set of directions given by the message received. Message Received Decoded Message 10010011 1.) 01010010 2.) 11000110 3.) 01100111 4.) 00101111 5.) III. Complete the given table by writing the channel encoded message by using parity check of adding 1 bit in the message. Message Source Encoding Channel Encoding ALLY 000 1.) ENEMY 011 2.) ATTACK 100 3.) RETREAT 111 4.) SURRENDER 101 5.) IV. Encode the following messages using the given message and the value of r. Source Encoding r Channel…
1-The eficiency of 64 equiprobable messages coded in fixed length i . a9 b 9l00% AP 2+ Ihe effciency of 17 cquiprobable messages coded in a fixed lengh wil be approximately—— WI00% B)20% 8% d)non ofthe mentioned 3- The average code lengih L f 10 equiprobuble messages coded in a ixed length il be - 1 W2 94 dnonofthe mentioned 4 For 11 cquiprobable messages coded in fixed ength cod then 5- For 256 equiprobable messsges coded in fxed length code then
**Please do A or C** 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…
Implement the Hamming Code error detection and correction algorithm for a group message to be transmitted over a network. Hamming code algorithm allows the receiver to detect errors that may have been introduced due to many factors such as noise, interference, and many others. -> Assume the following: 1. The sender message length is 2 bytes. The data transmitted to the user is the 2-byte data in addition to the parity bits. 2. The receiver must be able to detect and correct 1-bit error. Report :In the report you must include an overview of the Hamming code algorithm and you need to show: 1. The detailed calculation of the minimum number of parity bits needed for a message of 2-byte length. 2. Details on how sender generates the parity bits. 3. Details on how thew receiver detects and corrects a 1-bit error. THANKS., PLEASE GIVE DETAILED DESCRIPTION.
The Lingala Language of Republic of Congo has 35 letters. Consider an Affine cipher, which encrypts each letter according to the rule: C=(p×k1+k2) mod 35. Here C, p, k1, and k2 are each members in the range 0 to 34, where C represents the ciphertext letter, p the plaintext letter, and k1 and k2 are constant keys. How many possible keys does this affine system have? Explain in details.
write a sender and receiver side bit stuffing program in which a frame is to be simulated with header , payload and trailer . in that demonstrate bit stuffing concept. c/c++/java can be used for processing a given file/string of binary bits. [starting and ending flags/indicator are 01111110].
Mr. Thapa wants to send a message to his friend Mr. Chen via a public channel. To make his message secured he added a CRC (using both binary and polynomial equation) at the end of his message. Mr. Chen received the message sent by Mr. Thapa and found error in the data and discard the message. Now consider the following parameters for necessary calculations. 1.Last part of your student ID (e.g. 14008) is the message send by Mr. Thapa. Generate binary and Polynomial equation from your ID. 2.Use x3+x+1 as divisor [in both cases] 3.For Polynomial Equations, your reverse ID (e.g. 14008) is the message received by Mr. Chen along with the generated CRC of Mr. Thapa. 4.For Binary Calculations, follow regular procedure to generate CRC and send to Mr. Chen.
As discussed in Class 05, cryptography is the area of mathematics intended for the study of techniques and principles for transforming information from its original form to another, unintelligible form, so that it can be used only when authorized. According to the definition of encryption, carefully analyze the following situation presented below: For the transmission of encrypted messages between two points A and B, A generates a private key and forwards it to B, A encrypts the message using this same private key and sends this message to B, upon receiving the message, B decrypts the message with the same private key. Regarding the situation presented above, mark the alternative that corresponds to the encryption mode used. A) Cryptographic Abstract;B) Asymmetrical;C) Digital Certification;D) Symmetrical;E) Digital Signature.
Msg3. B→A : B, N1, Ks, Message2, h(B, N1, Message2) Whereas: h(m) represents the digest of the message (m). {m}{K} represents the encryption of message (m) using the key (K) PK is public key N1 is a random number. 1. What are the main problems in Msg3?
In mathematical logic it is known that the “OR” operator is a binary operator between two operands, “p” and “q”, where each one can have either 0 (zero) or 1 (one) as a truth value. Considering the truth table of the “OR” operator, what is the probability of the result of an operation between “p” and “q” resulting in the value “1”? A) ¾ B) ¼ C) ½ D) 1 E) 0
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…