Q4:- A fast computer is used to break a ciphertext (A) using columnar transposition cipher that needs 150 attempts, the speed of processor is 4 MIPS (million instructions per second), and each attempt needs 5 instructions. Another computer of speed 3 MIPS is used to break ciphertext (B) using Caesar Cipher that needs 110 attempts, and each attempt needs 4 instructions for ciphertext (B). Determine which ciphertext will be broken first (consider the worst case, i.e. the last attempt is the successful one), write your answer in details?

Q4:- A fast computer is used to break a ciphertext (A) using columnar transposition cipher that needs 150 attempts, the speed of processor is 4 MIPS (million instructions per second), and each attempt needs 5 instructions. Another computer of speed 3 MIPS is used to break ciphertext (B) using Caesar Cipher that needs 110 attempts, and each attempt needs 4 instructions for ciphertext (B). Determine which ciphertext will be broken first (consider the worst case, i.e. the last attempt is the successful one), write your answer in details?

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

We analyzed a program which was supposedly used for cracking some cryptographic algorithms. During the investigations we determined that the program input size can be varied in a wide range and for N-bit input the program result is also always N bit long. Additionally we found that the program working time depends significantly on input length N, especially when N is greater than 10-15. Our test also revealed, that the program working time depends only on input length, not the input itself. During our tests, we fixed the following working times (with an accuracy of one hundredth of a second): N=2-16.38 seconds N = 5-16.38 seconds N = 10-16.44 seconds N=15-18.39 seconds N=20-1 minute 4.22 seconds We also planned to test the program for N=25 and N = 30, but for both cases the program didn't finish within half an hour and was forced to terminate it. Finally, we decided for N= 30 to not terminate the program, but to wait a little bit longer. The result was 18 hours 16 minutes 14.62…
Cryptography problem mathematics Suppose Alice and Bob are using a cryptosystem with a 128-bit key, so there are 2128possible keys. Eve is trying a brute-force attack on the system.(a) Suppose it takes 1 day for Eve to try 264 possible keys. At this rate, how long willit take for Eve to try all 2128 keys? (b) Suppose Alice waits 10 years and then buys a computer that is 100 times fasterthan the one she now owns. Will she finish trying all 2128 keys before or after whatshe does in part (a)?
.. Execute Dijkstra's algorithm starting from s = 0 11 2 2 8 9 5 10 3 5 13 7 4 1 6 6 3 12 4
Computer Science Please I want a short answer 7.10 In discussing the CTR mode, it was mentioned that if any plaintext block that is encrypted using a given counter value is known, then the output of the encryption function can be determined easily from the associated ciphertext block. Show the calculation.
A fast computer is used to break a ciphertext (A) using columnar transposition cipher that needs 150attempts, the speed of processor is 4 MIPS (million instructions per second), and each attempt needs5 instructions. Another computer of speed 3 MIPS is used to break ciphertext (B) using Caesar Cipherthat needs 110 attempts, and each attempt needs 4 instructions for ciphertext (B). Determine whichciphertext will be broken first (consider the worst case, i.e. the last attempt is the successful one),write your answer in details?
4
To prevent the tapping and use of information on a wireless network which has brought untold mistrust amongst the directors of Okonko Systems, you suggested that every message that is transmitted should go through the following: A systematic two left bit shift; After “a” above, the algorithm f[(6m +2) + k] mode 13 should be applied to the cipher text, where m is the message and k =9 is a key; After “b” above, perform a systematic right bit shift to the new cipher; The message should then be transmitted. If on a trial basis, the message is “genomics” Use the mono – alphabetic letters where a = 0, b = 1, ….z = 25 to find the cipher that would be transmitted
Applications of Cryptography:
A.Given p=25, q=9, and e=7, generate the public key (n,e) and the private key (n,d) using the RSA Key generation algorithm. (Use Excel for computations) b. Given Bob's public key of (85, 7) and private key of (85, 55), show how Alice can encrypt m=3 to send to Bob. Show the ciphertext. c. Given Bob's public key of (85, 7) and private key of (85, 55), show how Bob can decrypt the ciphertext y=2 received from Alice. Show the plaintext. d. Using the fast exponentiation method, determine 530 mod 47. Show your work.
Messages are to be encoded using the RSA method, and the primes chosen are p “ 17 and q “ 19, so that n “ pq “ 323, and e “ 19. Thus, the public key is p323, 19q. (a) Show that the decryption exponent d (your private key) is 91.
Consider a 64 bit Block Encryption algorithm E. Suppose you have encrypted a 64 byte message Mı, M2, .. M64. Show / explain using diagrammatic forms how you would decrypt the message using CBC and OFB-16. Use an 8 byte IV: I1, I2, ... Is.
The hacker group Desdeia tries to break our old weak cipher which we used for the communication with the Duchess of Ligovia. It's generally known that an actual breaking of the cipher needs the reviewing a huge amount of variants which probably lasts a couple of months. Additionally we know that the reviewing of different variants needs always the same server resource. Using our intelligence sources we tried to get some information about the actual progress of breaking, but we got only some fragments: • The hacker group Desdeia uses for breaking their powerful four-core server which resources are fully dedicated to breaking process. . The actual breaking process began exactly at noon, but we don't know, on which day. . By the noon of 2nd of April, already 648,467,673 variants were successfully reviewed. Exactly at this noon, when the breaking process was already lasted for 19 days, it was attempted to double the server speed. The doubling itself was failed, but instead of it there was…