We consider the long-term security of the Advanced Encryption Standard(AES) with a key length of 128-bit with respect to exhaustive key-search attacks. AES is perhapsthe most widely used symmetric cipher at this time.a. Assume that an attacker has a special purpose application specific integrated circuit (ASIC)which checks 5 *108 keys per second, and she has a budget of $1 million. One ASIC costs$50, and we assume 100% overhead for integrating the ASIC (manufacturing the printedcircuit boards, power supply, cooling, etc.). How many ASICS can we run in parallel withthe given budget? How long does a worst-case key search take? Relate this time to the age ofthe Universe, which is about 10¹0 years.

Search engine cost with overhead $100 . $1 mlion budget can buy 10,000 search engines.

Answered: a. Assume that an attacker has a…

Elements Of Modern Algebra

8th Edition

ISBN:9781285463230

Author:Gilbert, Linda, Jimmie

Publisher:Gilbert, Linda, Jimmie

Chapter2: The Integers

Section2.8: Introduction To Cryptography (optional)

Problem 6E

See similar textbooks

Similar questions

Suppose that in a long ciphertext message the letter occurred most frequently, followed in frequency by. Using the fact that in the -letter alphabet, described in Example, "blank" occurs most frequently, followed in frequency by, read the portion of the message enciphered using an affine mapping on. Write out the affine mapping and its inverse. Example 2 Translation Cipher Associate the letters of the "alphabet" with the integers. Let and define the mapping by where is the key, the number of positions from the plaintext to the ciphertext. If our alphabet consists of through, in natural order, followed by a blank, then we have "letters" that we associate with the integers as follows:
Suppose that in an RSA Public Key Cryptosystem, the public key is. Encrypt the message "pay me later” using two-digit blocks and the -letter alphabet from Example 2. What is the secret key? Example 2 Translation Cipher Associate the letters of the "alphabet" with the integers. Let and define the mapping by where is the key, the number of positions from the plaintext to the ciphertext. If our alphabet consists of through, in natural order, followed by a blank, then we have "letters" that we associate with the integers as follows:
Suppose that in an RSA Public Key Cryptosystem. Encrypt the message "algebra" using the -letter alphabet from Example 4. Use two-digit blocks. Use three-digit blocks. What is the secret key?
Suppose that in an RSA Public Key Cryptosystem, the public key is e=13,m=77. Encrypt the message "go for it" using two-digit blocks and the 27-letter alphabet A from Example 2. What is the secret key d? Example 2 Translation Cipher Associate the n letters of the "alphabet" with the integers 0,1,2,3.....n1. Let A={ 0,1,2,3.....n-1 } and define the mapping f:AA by f(x)=x+kmodn where k is the key, the number of positions from the plaintext to the ciphertext. If our alphabet consists of a through z, in natural order, followed by a blank, then we have 27 "letters" that we associate with the integers 0,1,2,...,26 as follows: Alphabet:abcdef...vwxyzblankA:012345212223242526
Suppose that in an RSA Public Key Cryptosystem. Encrypt the message "pascal" using the -letter alphabet from Example 4. Use two-digit blocks. Use three-digit blocks. What is the secret key?
Suppose the alphabet consists of a through z, in natural order, followed by a blank and then the digits 0 through 9, in natural order. Associate these "letters" with the numbers 0,1,2,...,36, respectively, thus forming a 37-letter alphabet, D. Use the affine cipher to decipher the message X01916R916546M9CN1L6B1LL6X0RZ6UII if you know that the plaintext message begins with "t" followed by "h". Write out the affine mapping f and its inverse.
a. Excluding the identity cipher, how many different translation ciphers are there using an alphabet of n "letters"? b. Excluding the identity cipher, how many different affine ciphers are there using an alphabet of n "letters," where n is a prime?
What is the decryption function for an affine cipher if the encryption function is c = (15p + 13) mod 26?
Suppose that you know that a ciphertext was produced by encrypting a plaintext message with a transposition cipher. How might you go about breaking it?
Encrypt the message AT TEN HEAD NORTH TO TRENCHES using a tabular transposition cipher with rows of length 4 characters. If necessary, pad the message with A's.
Use the Caesar cipher (shift of 3 places) to encryptBRAVE
The ciphertext OIKYWVHBX was produced by encrypting a plaintext message using the Vigen`ere cipher with key HOT. What is the plaintext message?

SEE MORE QUESTIONS

Recommended textbooks for you

Elements Of Modern Algebra

Algebra

ISBN:

9781285463230

Author:

Gilbert, Linda, Jimmie

Publisher:

Cengage Learning,

Elements Of Modern Algebra

Algebra

ISBN:

9781285463230

Author:

Gilbert, Linda, Jimmie

Publisher:

Cengage Learning,

SEE MORE TEXTBOOKS