Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
What is the size of the keyspace for a double transposition cipher with m * n matrix? Justify your answer.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution
Trending nowThis is a popular solution!
Step by stepSolved in 2 steps
Knowledge Booster
Similar questions
- Recall that the sponge construction describes how to turn a public random permutation into a cryptographic hash function. Once the data to be hashed has been padded, the next step is to absorb the data r bits at a time. blk = <0>while not done: xor the next r bits of data into the first r bits of blk blk = p(blk) As a convenient (but not secure because it's too small) public random permutation, lets use the AES S-box for p. What is blk after absorbing each of the following when r=4 bits. Give your answer as exactly either 2 hexadecimal digits or 8 binary digits with no spaces (eg, 0A or 00001010). Note that the data is already padded and you should restart at blk=<0> each for each computation Data: 1001 Resulting blk:____ Data 10011001 Resulting blk:_____ Data 100110011001 Resulting blk:____arrow_forwardConsider an 8-bit block cipher. How many possible input blocks does this cipher have? How many possible mappings are there? If we view each mapping as a key, then how many possible keys does this cipher have?arrow_forwardThe Java hash function for Strings computes a hash code based on a fixed maximum number of characters of the string. Given that Strings have no meaningful upper bound in length, describe how an effective, constant-time hashing algorithm can be constructed. (Hint: If you were to pick, say, eight characters to represent a string of length l, which would you choose?)arrow_forward
- 2. Create a view named Top10PaidInvoices that returns three columns for each vendor: VendorName, LastInvoice (the most recent invoice date), and SumOfInvoices (the sum of the InvoiceTotal column). Return only the 10 vendors with the largest SumOfInvoices and include only paid invoices.arrow_forwardWe know that a digital signature is for the purpose of ensuring data integrity and authenticity. a) Checksum adds all the bits of the message (or blocks), is checksum a good way to construct a digital signature scheme? How about a hash function, i.e, Sign(M)= h(M)?b) If we use a hash to generate a signature in a more complicated way as follows Sign(k,m) = σ = h(k) XOR m XOR h(m), and m, σ will be sent along. Would this be a secure signature? Briefly explain. please do not use chegg or ai tool like chat gpt pleasearrow_forwardFind out what risks are involved with the various authentication techniques and suggest a way to deal with the following situation.Bob uses a cryptographic hash function to check a password against a cache of other hashes.Bob performs a cryptographic hash on a password and checks it against a database of previously double-hashed passwords.arrow_forward
- This question concerns block cipher modes. We will use a simple affine cipher, which can be expressed in C as follows. char cipher(unsigned char block, char key) { return (key+11"block)%256; } The inverse of this cipher is shown below. char inv_cipher(unsigned char block, char key) { // 163 is the inverse of 11 mod 256 return (163*(block-key+256))%256; } Note that the block size is 8 bits, which is one byte (and one ASCII character). We will work with the fixed key 0x08. We now decrypt various ciphertexts using modes for this cipher. In every case in which the mode requires an IV, the IV will be OXAA. In the case of CTR mode, we use a (nonce || counter) arrangement in which the nonce is the left 5 bits of OXAA and the counter is a 3 bit counter that begins at 0. In all of the problems given below, one character is one block. Each character of the plaintext should be regarded as its corresponding ASCII code. The ciphertext is given in hexadecimal. a) Decrypt the ciphertext "303…arrow_forwardIs there a certain number of linked lists that are always included inside a hash table of size m? To save my life, please explain what the purpose of a hash function is since I have not the faintest clue. Provide an example to support your idea.arrow_forwardWhat makes a Key Derivation Function unique in comparison to other families of secure hash functions that have been explored (for example, the SHA family of algorithms)? Provide as much information as you possibly can if you want to be sure that your message is comprehended by the intended audience.arrow_forward
- In simple uniform hashing, each key is assumed to have equal probability to map to any of the hashes in a given table of size m. Given an open-address table of size 100 and 2 random keys, what is the probability that they hash to the same value? What is the probability that they hash to different values? PLEASE give me a written paragraph answerarrow_forwardStrings of undefined length are used as keys to access a hash table. Report the C implementation of a proper hash function. Specify and explain (in plain English) how to select the algorithm and how to avoid overflows during the computation of the hash function. Motivate all choices.arrow_forwardFind out what risks are involved with the various authentication techniques and suggest a way to deal with the following situation.Bob uses a cryptographic hash function to check a password against a cache of other hashes.Bob performs a cryptographic hash on a password and checks it against a database of previously double-hashed passwords.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY