As you know, des is insecure because of its short key length (56 bits). an improvement, proposed by rivest, is desx. desx has key length 120 bits, seen as a pair k = (k1, k2), where k1 is 56 bits and k2 is 64 bits. the encryption of a one-block message m is desx(k, m) = k2 ⊕ des(k1, (m ⊕ k2))

a. explain how decryption is done.

How can data be added to a new table in data base

Which of the following commands is more recommended while creating a bot?

3. what is the output of the following statements? temporary object1; temporary object2("rectangle", 8.5, 5); temporary object3("circle", 6, 0); temporary object4("cylinder", 6, 3.5); cout < < fixed < < showpoint < < setprecision(2); object1.print(); object2.print(); object3.print(); object4.print(); object1.set("sphere", 4.5, 0); object1.print();