1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
worty [1.4K]
3 years ago
11

Compare AES to DES. For each of the following elements of DES, indicate the comparable element in AES or explain why it is not n

eeded in AES:a.Swapping of halves of the blockb. f functionc.permutation Pd. XOR of the f function output with the left half of the blocke. XOR of the subkey material with the input to the f function.
Computers and Technology
1 answer:
Setler79 [48]3 years ago
4 0

Answer:

See explaination for the comparison

Explanation:

Comparison Of AES & DES:

DES(Data Encryption Standard)

​In DES the data block is always been divided into two of the halves.

It works on the Feistel Cipher Structure.

The plaintext is of the 64 bits.

DES has 16 rounds in it.

The rounds that are in DES are as follows:

Expansion

Permutation

XOR

S-box

P-box

Swap

DES has a smaller key which is less secure as compared to AES

In speed, the DES is comparatively slower.

AES(Advanced Encryption Standard)

​In AES the entire data block is always processed as a single matrix.

It works on the principle of substitution and permutation.

The plaintext in AES varies from 128 bits ,192 bits, 256 bits, etc.

AES has a larger key size as compared to the DES.

There are many variations to the rounds in AES and is dependent on the bits of the encryption.They are as follows: 128-bits algorithm consists of 10 rounds. 192-bits algorithm consists of 12 rounds. 256-bits algorithm consists of 14 rounds.

The names for the rounds are as follows:

Subbytes

Shiftrows

Mix Columns

AddRoundkeys.

AES is having large secret key comapratively to the DES which is more secure.

Comparing the speed for the encryptions AES is faster than DES.

a.) AddRoundKey

b.) Since AES is not Feistel cipher this step is not essential.

c.) ByteSub is there.

d.) ShiftRow and MixColumn

e.) No swaping of halves

You might be interested in
Consider the following code:
ycow [4]

Answer:

The num >= 0 test condition is not correct

Explanation:

The line would lead to the printing of "Your entered: " + str(num) repeatedly without stopping.

The while loop checks the condition that the "num" variable is less than zero. This condition will always be true as there is no means of resetting the value after initially inputting the value that is less than zero.

4 0
3 years ago
Which text features does this section contain? Check all that apply.
NISA [10]

which ones apply manuelh


6 0
3 years ago
Chegg Suppose the heap is a full tree, size 2^n-1. what is the minimum number of steps to change a min heap to a max heap. Show
adoni [48]

Answer:

Explanation:

We start from the bottom-most and rightmost internal node of min Heap and then heapify all internal modes in the bottom-up way to build the Max heap.

To build a heap, the following algorithm is implemented for any input array.

BUILD-HEAP(A)

   heapsize := size(A)

   for i := floor(heapsize/2) downto 1

       do HEAPIFY(A, i)

   end for

Convert the given array of elements into an almost complete binary tree.

Ensure that the tree is a max heap.

Check that every non-leaf node contains a greater or equal value element than its child nodes.

If there exists any node that does not satisfy the ordering property of max heap, swap the elements.

Start checking from a non-leaf node with the highest index (bottom to top and right to left).

4 0
3 years ago
How do i get around goguardian from a chromebook
Dafna11 [192]

Answer:

Navigate to your GoGuardian Classroom.

Click the Students tab.

Click the X icon to the right of the student's name.

Confirm by selecting Remove Student from the popup.

Explanation:

GoGuardian Off-campus filtering. Even after class, students still need access to the best learning tools for their education. ... Using Google's Admin Console and Chrome OS, GoGuardian is able to offer its complete Chromebook filtering and monitoring software wherever the device may be.

3 0
3 years ago
Consider a binary search tree where each tree node v has a field v.sum which stores the sum of all the keys in the subtree roote
AVprozaik [17]

Answer:

Each time you insert a new node, call the function to adjust the sum.

This method has to be called each time we insert new node to the tree since the sum at all the

parent nodes from the newly inserted node changes when we insert the node.

// toSumTree method will convert the tree into sum tree.

int toSumTree(struct node *node)

{

if(node == NULL)

return 0;

// Store the old value

int old_val = node->data;

// Recursively call for left and right subtrees and store the sum as new value of this node

node->data = toSumTree(node->left) + toSumTree(node->right);

// Return the sum of values of nodes in left and right subtrees and

// old_value of this node

return node->data + old_val;

}

This has the complexity of O(n).

Explanation:

6 0
3 years ago
Other questions:
  • What is the most efficient way to include a space after each paragraph?
    13·2 answers
  • What is the value of the variable result after these lines of code are executed?
    5·2 answers
  • Can somebody explain me what this code does in a few or one sentence?#include #include using namespace std;int main () { const i
    12·1 answer
  • Which of the following is considered a benefit when using slab allocator?
    6·1 answer
  • What could be one rule to help your friend to blog safely
    6·2 answers
  • Assume that the following method header is for a method in class A.
    15·1 answer
  • State two functions of windows environment​
    9·1 answer
  • What does ctto mean?
    11·2 answers
  • Which term is used in object-oriented programming to reference characteristics of an object?
    15·1 answer
  • What is the output?
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!