Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

1. The number of Caesar Ciphers on an alphabet of 53 symbols is 2. If an attacke

ID: 3745265 • Letter: 1

Question

1. The number of Caesar Ciphers on an alphabet of 53 symbols is
2. If an attacker wants to decrypt a secret message encrypted using a Caesar cipher with an alphabet of 68 symbols, How many ciphers does he/she has to try in order to find the original message?
3. The quotient of -37 divided by 6 is
4. The remainder of -37 divided by 6 is
5. The quotient of 54 divided by -8 is
6. The remainder of 54 divided by -8 is
7. The quotient of -65 divided by -10 is
8. The remainder of -65 divided by -10




1. The number of Caesar Ciphers on an alphabet of 53 symbols is
2. If an attacker wants to decrypt a secret message encrypted using a Caesar cipher with an alphabet of 68 symbols, How many ciphers does he/she has to try in order to find the original message?
3. The quotient of -37 divided by 6 is
4. The remainder of -37 divided by 6 is
5. The quotient of 54 divided by -8 is
6. The remainder of 54 divided by -8 is
7. The quotient of -65 divided by -10 is
8. The remainder of -65 divided by -10




1. The number of Caesar Ciphers on an alphabet of 53 symbols is
2. If an attacker wants to decrypt a secret message encrypted using a Caesar cipher with an alphabet of 68 symbols, How many ciphers does he/she has to try in order to find the original message?
3. The quotient of -37 divided by 6 is
4. The remainder of -37 divided by 6 is
5. The quotient of 54 divided by -8 is
6. The remainder of 54 divided by -8 is
7. The quotient of -65 divided by -10 is
8. The remainder of -65 divided by -10




Explanation / Answer

1. 25

This is because the maximum caesar ciphers possible is 25. When you shift by 26, you get the same message

2. 25

This is because the maximum caesar ciphers possible is 25. When you shift by 26, you get the same message

For the below questions, use euclidian division theorem:

Using Euclidean Division:

Given two integers a and b (non-zero) there exist unique integers q and r such that:

a=bq+r

and

0 r <|b|

Here, a is the given number, q is quotient, r is remainder

3. -7

As the nearest shortest number is -42

4. -5

5. -6

6. 6

7. -7

8. -5