What is the one-time pad encryption of “lucio” under the same key?
Question 2.3. (12 points):
In the encryption of a string of 8 characters:
(a) What is the total number of encryptions possible if (in one encryption) all characters
are to be shifted with the same shift out of m possible shifts? Show your work.
(b) What is the total number of encryptions possible if (in one encryption) each
character can be shifted with a random shift out of m possible shifts? Show your
work.
Please read Chapter 2 from the Ian Smith reference on Algorithms and Complexity
before answering these questions.
Question 3.1.1. (Smith text, Ex 2.1.) (12 points)
A design task involves finding values for three variables. Each variable can take two
values. How many solutions are possible? If each solution requires 1 second to be
evaluated on a computer, how long does it take to evaluate all solutions? If the number of
variables increases to 30, how long does it take to evaluate all solutions? Show your
work.
Question 3.1.2. (Smith text, Ex 2.2.) (12 points)
A mathematical problem involves finding values for N continuous variables such that a
certain function (objective function

Sample Solution