Following the notation seen in class, we have a block cipher that is chained in this way:= Pe XOR ECCPe XOR IV), K)C - P, XOR EC(P: XOR ), K)- P2 XOR ECCP: XOR C), K)%3D%3DWould it be suitable to be used as MAC (Message Authentication Code)?O No, because you cannot compute the CBC residueO It depends by the value IVYesO No

MAC assist block chaining message authentication (CBC) residue. MAC also assists the continuous XOR…

Answered: Following the notation seen in class,…

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

Affine Cipher is an example of a Monoalphabetic substitution cipher. The encryption process is substantially mathematical done by using the following formula: C = (P ∗ ?1 + ?2) mod 26. Where k1, k2 are two integers representing the key (selected randomly), C is the ciphertext value, and P is the plaintext value. Where C and P integers with values between 0 and 25. Write an Octave programme to implement this system, run your programme using the Plaintext: “the quick brown fox jumped over the lazy dog”. Show the obtained ciphertext with the selected values of the keys k1 & k2. Given that the plaintext “s” mapped to ciphertext “W”, plaintext “x” mapped to ciphertext “Z” when encrypted with Affine Cipher. Determine, mathematically, the values for the two keys K1 and K2.
Affine Cipher is an example of a Monoalphabetic substitution cipher. The encryption process is substantially mathematical done by using the following formula: C = (P ∗ ?1 + ?2) mod 26. Where k1, k2 are two integers representing the key (selected randomly), C is the ciphertext value, and P is the plaintext value. Where C and P integers with values between 0 and 25. 1) Write an Octave programme to implement this system, run your programme using the Plaintext: “the quick brown fox jumped over the lazy dog”. Show the obtained ciphertext with the selected values of the keys k1 & k2. 2) Given that the plaintext “s” mapped to ciphertext “W”, plaintext “x” mapped to ciphertext “Z” when encrypted with Affine Cipher. Determine, mathematically, the values for the two keys K1 and K2. I need an octave code for the first part of this question, that i can just copy and paste. In addition, to an explanation of the steps done to…
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?
An affine cipher has the form c = (am+b) mod n. Suppose m is an integer between 0 and 25, eachinteger representing a letter.(a) Let n = 26, a = 3, and b = 123. What is the ciphertext corresponding to the phrase THIS IS A CIPHERMESSAGE.(b) A requirement for a cipher is that every plaintext letter correspond to a different ciphertext letter. If either aand b is not relatively prime to n, does the affine cipher meet this property? Either prove it does or presenta counterexample.
We 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 please
Alice sets up an RSA public/private key, but instead of using two primes, she chooses three primes p, q, and r and she uses n=pqr as her RSA-style modulus. She chooses an encryption exponent e and calculates a decryption exponent d. Encryption and Decryption are defined: C ≡ me mod n and m ≡ Cd mod n where C is the ciphertext corresponding to the message m. Decryption: de ≡ 1 mod φ(n) | Let p = 5, q = 7, r = 3, e = 11, and the decryption exponent d = -13. n = 105 & φ(n) = 48 Q: Alice upgrades to three primes that are each 200 digits long. How many digits does n have?
Write a program that performs the brute-force attack to break the password. The following table shows encrypted passwords using the crypt() function. Your mission is to break the password corresponding your CWID in the table. For example, the last digit of your CWID is 1, then you should identify the plaintext password for indBOW06MoVz6. Last digit of CWID Encrypted password 1 indBOW06MoVz6 2 in79RsnfG/VWo 3 inbqJM0dLgWvo 4 incT1ji3YqQ/Y 5 in7haMV00ylgk 6 in1U0tb9WpIcI 7 inPlXS.yNKivQ 8 inqidvfWapJp2 9 injY7hdQJTeu2 0 inQW.HgtuEe. Last digit of CWID Encrypted password 1 indBOW06MoVz6 2 in79RsnfG/VWo 3 inbqJM0dLgWvo 4 incT1ji3YqQ/Y 5 in7haMV00ylgk 6 in1U0tb9WpIcI 7 inPlXS.yNKivQ 8 inqidvfWapJp2 9 injY7hdQJTeu2 0 inQW.HgtuEe. i want answer for 2nd one
Suppose your RSA public key is PK: {n, e} = {13861, 37}. Your friend sends you a ciphertext C = 9908. But unfortunately you have forgotten your private key, now you have to crack it yourself.a) Write down a possible condition of factors p and q.p= q=b) What is your private key SK: {d}?d=c) What is the plaintext of your friend’s message?The plaintext M =d) Suppose the plaintext M is a 12-digit number consisting of a prefix “19” and 1234567890. What is the corresponding ciphertext? Since M is greater than n, you only need to encrypt four digits at a time. Ignore redundant zeros. e.g., 0001 = 1. The result should contain three integers.The ciphertext C0 =
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…
B has just received the following message, which represents a cryptographic data object:{({(KPbB)KPrS mod KPbS}K1,{|(NB, NA, {{({K2}KPbB, NS)}(G1)KPrA mod NA}K1, {|{({G3}(KPbA)KPrS mod KPbS, G2)}K1|}KPrB)|}KPrA)}KBSThe following explains various terms in this object and some of the abbreviations used:• {M}K represents the encryption of some message/data M using the key K• {|M|}K represents the digital signing of some message/data M using the key K• NX represents a nonce (i.e. a fresh and possibly random number used once only) generated by X• KpbX represents the public part of the key pair presumably owned by X• KprX represents the private part of the key pair presumably owned by X• KAB represents a symmetric key shared between A and B• K (or K1, K2, K3 etc.) represents some arbitrary key with no assumptions about its scope• M represents some alphanumeric/textual message with no assumptions• G1, G2, G3 etc. are prime numberswhich of the following sets of keys, nonces, numbers, and…
Using the encryption and decryption methods, write a program called SDESMitm.java or sdesmitm.py that will carry out a meet-in-the-middle attack on 2SDES. This system encrypts a plaintext first with one key and then again with a different key. Please review the attack in the notes and the textbook. Recall that this is a known-plaintext attack. I will provide plaintext/ciphertext pairs. Based on those, you should be able to recover the two 9-bit keys. Write the program so that it can be run from the command line taking four parameters: plaintext 1 integer ciphertext 1 integer plaintext 2 integer ciphertext 2 integer Two pairs are needed because the first plaintext/ciphertext pair will let you create a short list of key pairs and the second plaintext/ciphertext pair will allow you to narrow that list down to one key pair. When run, the program should print the two keys. You can test your program on the plaintext/ciphertext pairs 0/247; 4095/2808. In my implemenation, the firat…
Perform a polyalphabetic (Veginere) encryption on the plaintext “MEET ME RIGHT AFTER THIS EXAAM FOR A PARTY” using the keyword “MOSIANO” 2. With the plaintext “THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG EVERY TIME SINCE THE DOG IS SO LAZY AND DOESN’T WANT TO STRETCH OUT”, perform a column matrix encryption using the key K=256413.

SEE MORE QUESTIONS

Recommended textbooks for you

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

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

SEE MORE TEXTBOOKS