Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
- Block size = 4 bits
- Hash size = 4 bits
- Encryption function: Divide the key into two halves: LK and RK; Divide the plaintext into two halves: LT and RT; Then ciphertext= LC||RC where LC=LK XOR RT; and RC = RK XOR LT; where LC, RC, LT, and RT are each 2 bits; Plaintext and ciphertext are each 4 bits.
- g(H) = a 4-bit string that is equal to the complement of bits in H; For example, if H=A (Hexa) = 1010 (binary); then g(H)= 0101
- H0 = Initial hash = C (in Hexa)
- Given message M: D9 (in Hexa);
a. Determine the hash (in hexadecimal) of the message M using Martyas-Meyer-Oseas hash function
b. Determine the hash (in hexadecimal) of the message M using Davis-Meyer hash function
c. Determine the hash (in hexadecimal) of the message M using Migayuchi-Preneel hash function
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 4 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Advances in computing technology which allow for a faster hash rate will provide faster transactions per second. True ◻ False ◻arrow_forwardThe case in which a key other than the desired one is kept at the identified location is called?a) Hashingb) Collisionc) Chainingd) Open addressingarrow_forwardMySQL Method create() to create a bench table with fields: id - integer, must auto-increment val1 - integer (starts at 1 and each record increases by 1) val2 - integer (val1 % 10) str1 - varchar(20) = "Test"+val1arrow_forward
- Use recurrence relation: T(n) = T(n – 1) + n if n > 1 T(n) = 1 if n = 1 Use the substitution method with a guess of cn². Sub.Remainder: What is the remainder after substituting in the guess? Enter an expressionarrow_forwardAssume you have a hash table length of 29. Given the value 371, what index will the entry map to? 29 371 23 None of the abovearrow_forward9:05 Part 2: Encryption Details: description Objective: Develop a program that encrypts a plaintext file by XORing 128-bit blocks of the file with a key repeatedly until the entire file is encrypted. • The plaintext file will be a book from Project Gutenberg. Note: Done • The encryption method should use the XOR operation on the file, 128 bits at a time, with the key. • Each 128-bit block is XORed with the same key. • The program should work from the command line and accept three parameters: o The name of the key file Usage: o The name of the plaintext file o The desired name of the resulting ciphertext file This encryption method is not supposed to be secure. ( $ ./bad_streamcipher_enc kf pt ctarrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education