Question

CTR Mode (a) Suppose that we are using the 3-DES in CTR mode for encrypting 8TB...

CTR Mode

(a) Suppose that we are using the 3-DES in CTR mode for encrypting 8TB of capacity. (1TB, terabyte, has 240 bytes) What is the maximum length of the IV which can be used? Justify your answer.

(b) We are using the AES in CTR mode for encrypting a disk with 8TB capacity. What is the maximum length of the IV? Justify your answer.

Homework Answers

Answer #1

(a) As we know,

1 byte = 8 bits

1 TB = 240 bytes

Disk capacity = 8 TB = (8 * 8 * 240) bits = 64 * 240 bits

As we know, the block size in 3-DES = 64 bits [Assuming the default value]

So, number of blocks = (64 * 240)/64 = 240 blocks

So, we will need 40 bits to represent these 240 blocks.

So, these 40 bits will be used for counter.

So, maximum length of the IV = (64 - 40) = 24 bits

(b) As we know,

1 byte = 8 bits

1 TB = 240 bytes

Disk capacity = 8 TB = (8 * 8 * 240) bits = 64 * 240 bits

As we know, the block size in AES = 128 bits [Assuming the default value]

So, number of blocks = (64 * 240)/128 = 239 blocks

So, we will need 39 bits to represent these 239 blocks.

So, these 39 bits will be used for counter.

So, maximum length of the IV = (128 - 39) = 89 bits

Please comment in case of any doubt.
Please upvote if this helps.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
An ECB mode of operation that incorporates padding encrypts a 200 bit message using DES. What...
An ECB mode of operation that incorporates padding encrypts a 200 bit message using DES. What is the necessary amount of padding in bytes Group of answer choices 0 7 8 none of the above
Operating System. Please only answer this question if you are sure of the answer, thank you....
Operating System. Please only answer this question if you are sure of the answer, thank you. Please provide an explanation for your answer as to why it is for what it is. Assume that the maximum capacity of a file system space is 8TB (1TB = 240 bytes), and the disk block size is 2KB. The file control block (FCB) contains an index table of 512 bytes. Answer the following questions: Suppose that the index table only adopts the direct...
This question concerns block cipher modes. We will use a simple affine cipher, which can be...
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; } 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 encrypt various plaintexts using modes for this cipher. In every case in which the mode requires an IV, the IV will be 0xAA....
NWS620S Tutorial 1: Symmetric Encryption - DES Encryption is the translation of data into a secret...
NWS620S Tutorial 1: Symmetric Encryption - DES Encryption is the translation of data into a secret code so that only authorised entities can read it. Encrypting data is considered a very effective way of achieving data security. To access encrypted data, you must have access to a secret key that enables you to decrypt it. Unencrypted data is called plain text; encrypted data is referred to as cipher text. There are two types of encryption: • Symmetric encryption • Asymmetric...
Suppose you have two disks each with 128 pie-shaped sectors. One disk has 32 red sectors...
Suppose you have two disks each with 128 pie-shaped sectors. One disk has 32 red sectors and 96 white sectors. The other disk has 64 white sectors and 64 red sectors. The two patterns can be completely arbitrary. Can we place one over the other such that at least 64 sectors on each disk have the same color? Justify your answer using probabilistic methods and be sure to provide a sample space to support your reasoning.
Suppose we have six $1 bills that we are going to hand out to 3 of...
Suppose we have six $1 bills that we are going to hand out to 3 of our friends. How many ways can we do that? My teachers solution is 8 choose 2 using the but I thought the answer would be 3^6 since each dollar has the option of going to 3 different people.
In heapsort we view an array as a binary tree using the following mapping: a[0] is...
In heapsort we view an array as a binary tree using the following mapping: a[0] is the root of the entire tree and for element a[i], its left child is a[2i+1] and its right child is a[2i+2]. Answer the following questions for an array of size n. ( Answers in some cases may be in terms of n.) a) What is the index of the parent a[i] for any i > 0? b) What is the biggest index for which...
Define g(x) = f(x) + tan-1 (2x) on [−1, √3/2 ]. Suppose that both f'' and...
Define g(x) = f(x) + tan-1 (2x) on [−1, √3/2 ]. Suppose that both f'' and g'' are continuous for all x-values on [−1, √3/2 ]. Suppose that the only local extrema that f has on the interval [−1, √3/2 ] is a local minimum at x = 1/2 . (a) Determine the open intervals of increasing and decreasing for g on the interval [1/2 , √3/2] . (b) Suppose f(1/2) = 0 and f(√3/2) = 2. Find the absolute...
1) We have a stick of unit length. We break that into 3 pieces using the...
1) We have a stick of unit length. We break that into 3 pieces using the following methods a. We chose randomly and independently two points on the stick using a uniform PDF, and we break stick at these 2 points b. We break the stick at a random point chosen by using a uniform PDF, and then we break the piece that contains the right end of the stick, at a random point chosen by using a uniform PDF...
Suppose we find an organism on Titan whose hereditary molecule uses 3 base-pair molecules instead of...
Suppose we find an organism on Titan whose hereditary molecule uses 3 base-pair molecules instead of the 4 found in DNA. Suppose also that it uses 75 amino acids instead of the 22 used by Earth-based life. What is the minimum length of the genetic “words” used by this hereditary molecule?
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT