What is your understanding of the difference between a stream cipher and a block cipher?

Computers and Technology

1 answer:

Mars2501 [29]2 years ago

4 0

Answer:

In a stream cipher, the information is ciphered byte-by-byte.

In a block cipher, the information is ciphered block by block.

Explanation:

Suppose I have the following text:

Buffalo Bills New England Patriots

New York Jets Miami Dolphins

Each line is one byte, so, on the stream cipher, i am going to apply the ciphering algorithm on:

The letter B

The letter u

The letter f

Until

The letter s(of Miami Dolphins)

Now for the block cipher, i am saying that each line is a block, so the algorithm is going to be applied.

First on: Buffalo Bills New England Patriots

Then: New York Jets Miami Dolphins

You might be interested in

In Windows Explorer, the opposite of expanding a folder is a what

Tomtit [17]

The opposite of expanding a folder is Collapsing a folder. Hope I helped :)

3 0

2 years ago

Some systems provide file sharing by maintaining a single copy of a file. Other systems maintain several copies, one for each of

Natalka [10]

Answer:

Explanation:

When you have a single copy, a large number of concurrent updates that are supposed to go to a file may result in the user obtaining incorrect information. This incorrect information obtained them leads to the file being left in an incorrect state. When you have a lot of or multiple copies, then storage waste exist and the various copies might happen not to be consistent with respect one other. In summary, what happens is that

a) Using one copy saves space, but also the change might have an effect on all the users.

b) Using multiple copies avoids eliminates the change problem, while creating its own problems, using more space.

3 0

2 years ago

A problem associated with old drivers is:

alexdok [17]

Vision problems, also generally slowed movements/reaction time

7 0

2 years ago

Suppose you wish to develop a matrix-multiplication algorithm that is asymptotically faster than Strassen’s algorithm. Your algo

Kazeer [188]

Answer:

The number of subproblems are given as $T(n)=a*T(n/8)+\theta(n^2)$ while the value of T(n) to be less than S(n) is for 342.

Explanation:

The number of subproblems are given as

$T(n)=a*T(n/8)+\theta(n^2)$

Asymptotic running time for Strassen’s algorithm is $S(n)=\theta(n^{log(7)})$

Now, when a increases, number of subproblems determines the asymptotic running time of the problem and case 1 of master theorem applies. So, in worst case, asymptotic running time of the algorithm will be

$T(n)=\theta(n^{logb(a)})=\theta(n^{log8(a)})=\theta(n^{log_{2}(a^{1/3})})$