Find the result bit string of the Feistel cipher after the FIRST round of calculations.

• Plaintext: 0011 1000
• Key 1: 1000
• Key2, Key3, ...: does not matter
• Function: AND

For RSA compute the ciphertext if

p = 7, q = 13, m = 2, e = 5

Write only the number (for example: 15)

Let there be a statement: "If n is an odd positive integer, then 5n+6 is odd".

Which method of proof are we using if we assume that: "n is odd and 5n+6 is even"?

Find the sum of products expansion of the function

Use mathematical induction:

Solve the equation

252x + 105y = GCD(252, 105)

Compute x+y and write it in the block

Write only the number (for example: 15)

Write only the number (for example, 15)

Let n be a positive integer. Which of the following statements are equivalent?