4 Chapter 2: Problem 4Previous ProblemProblem ListNext ProblemResults for this submissionEnteredAnswer PreviewResult001111001111incorrect101000101000incorrectAt least one of the answers above is NOT correct.Note: 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 are100101011101 = so S1 82 83 S4 S5 S6 57 S8 S9 S10 S11.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$5 = 0, s4 = 1, s3 = 0, s2 = 1, s1 = 0, so = 1).001111b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to representPs = 0, p4 = 1, p, = 0, p2 = 1, p = 0, po = 1).101000

Answer: I have given answered in the handwritten format in brief explanation

Entered Answer Preview Result 001111 001111 incorrect 101000 101000 incorrect At least one of the answers above is NOT correct. Note: 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 100101011101 = so 51 $2 83 84 85 S6 87 8g S9 S10 $ 11 · 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 $5 = 0, s4 = 1, s3 = 0, s2 = 1, s1 = 0, so = 1). 001111 b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent Ps = 0, p4 = 1, p3 = 0, p2 = 1, p1 = 0, po = 1). 101000

Entered Answer Preview Result 001111 001111 incorrect 101000 101000 incorrect At least one of the answers above is NOT correct. Note: 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 100101011101 = so 51 $2 83 84 85 S6 87 8g S9 S10 $ 11 · 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 $5 = 0, s4 = 1, s3 = 0, s2 = 1, s1 = 0, so = 1). 001111 b) What are the tap bits of the LFSR? Please enter your answer as unspaced binary digits (e.g. 010101 to represent Ps = 0, p4 = 1, p3 = 0, p2 = 1, p1 = 0, po = 1). 101000

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. We have defined a symmetric cryptography algorithm using the XOR operator. Assume our messages (before encryption) consist of only uppercase and lowercase letters, digits and blank character. In addition, assume the key size is only one byte which is an integer between 0 and 255 (inclusive). The pseudocode of the proposed encryption algorithm is as follows: Read the message // for example message=”Hi” Read the key // for example key=10 Cipher_text=[] //an empty list for i=1 to len(message): Cipher_text= Cipher_text.append(XOR(message[i],key)) Return Cipher_text Assume XOR function, takes a character and the key, then returns the result of bitwise XOR of ASCII code of the letter with the key as an (one byte) integer. For example, if message=”Hi” and key=10, then we should first calculate the ASCCI code of “H” which is 72 and find the result of (72 XOR 10) which is 66. Then the ASCCI code of “i” is 105, so the result of (105 XOR 10) is 99. Thus the Cipher_text would be…
PLEASE PLEASE SHOW CALCULATIONS Using the Vigenere cipher given in class: ADQYS MIUSB OXKKT MIBHK IZOOO EQOOG IFBAG KAUMFVVTAA CIDTW MOCIO EQOOG BMBFV ZGGWP CIEKQ HSNEWVECNE DLAAV RWKXS VNSVP HCEUT QOIOF MEGJS WTPCHAJMOC HIUIX Determine the Keys that would be needed to decipher the given cipher given the following deductions made in class Key of length 6; alphabet 1: AIKHOIATTOBGEEERNEOSAI alphabet 2: DUKKEFUAWEMGKWDWSUFWJU alphabet 3: QSTIQBMAMQBWQVLKVTMTMI alphabet 4: YBMZOAFCOOFPHEAXPQEPOX alphabet 5: SOIOOGVICOVCSVASHOGCC alphabet 6: MXBOGKVDIGZINNVVCIJHH
One potential limitation of a digital signature is that for a given signature σ of a message m corresponding to a public key pk, one could generate a pk', sk' that produces a signature σ' for m, such that σ' = σ. Given a signing function S, a verification function V, that each takes corresponding private and public keys for generating and verifying a signature and is vulnerable to these duplicate keys, please generate S' and V' that are immune to a duplicate keys attack.
What is the security requirement on password hashing? Given a password w, its hash is calculated as . This question is about the security requirement on function h. (a) Can we use any function as h for password hashing? For example, can we use the "mod 100" function, which is a common computer science function? (Given any integer value x, "mod 100" function works by "x mod 100," which is a value between [0, 99]; for example, if x = 105, x mod 100 = 5; x = 1000000, x mod 100 = 0;) (b) If not, what is the security requirement on h?
Substitution Cipher is an old technique that substitutes one thing for another. For example, alphabet messages can be ciphered by applying the following substitution. plaintext: abcdefghijklmnopqrstuvwxyz | | V Vciphertext: mnbvcxzasdfghjklpoiuytrewq However, this type of ciphering produces patterns since the same plaintext strings produce the same cipher text. Polyalphabetic Cipher, on the other hand mitigates this problem as plaintext characters are not always replaced with the same cipher text character. The replacement of each character dependson a key as well as on the position of the character in the text; for example, by using a formula such as: for (int i=0; i < length of P; i++) C[i] = P[i] + K + (i mod 3) In essence, if the key, K, is choses as K=10, then 10 is added to characters in position 0, 3, 6, …; and 11 is added for those in…
In a special case of a permutation cipher, we take a message, M, and write its letters in an s× t table, in a row-major fashion, and then let the ciphertext be a column-major listing of the entries in the table. For example, to encrypt the message ATTACKATDAWN, using a 3 × 4 table, we would write the message as ATTA CKAT DAWN and then write down the ciphertext as ACDTKATAWATN. The secret key in this cryptosystem is the pair (s, t). How is decryption done in this cryptosystem? Also, how hard would it be to attack this cryptosystem using a ciphertext-only attack?
When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. Describe an efficient scheme for Alice to do this. What is the running time of this algorithm? From Data Structures and Algorithms C-7.56
(a) Write a complete PHP code that would produce the output below: 1 12 123 1234 12345 123456 1234567 12345678 123456789 (b) Differentiate between "sha1" and "md5" encryption function of MySQL clearly giving examples of each. (c) Give the major difference between the POST and the GET method.
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.
Suppose you have two columns, [Text1] and [Text2], in a MS Access table, how do you enforcethat only one of them can have a value?A) Apply the validation rule to either [Text1] or [Text2] column: ([Text1]="" And [text2]<>"") Or ([Text1]<>""And [text2]="" B) Apply the validation rule to either [Text1] or [Text2] column: ([Text1]="" And [text2]!="") Or ([Text1]!=""And [text2]="" C) Apply the validation rule to the table: [Text1] or [Text2] column: ([Text1]="" And [text2]!="") Or([Text1]!="" And [text2]="" D) Apply the validation rule to the table: ([Text1]="" And [text2]<>"") Or ([Text1]<>"" And [text2]="" E) none of the above
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.
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;}