(5/5)

- Explain how the Euclidian algorithm is used to compute the gcd of two numbers.

- Define the Euler function φ(n). Compute φ(6), φ(7), φ(9), φ(12).

- Define the characteristic of a field, give an example of a field with 7, 11 elements. Does there exist a field of 12 elements?

- Let F7 := Z/7Z be the field of 7 elements. Find the following expressions:

(3+6)11,(2+3)8

- Define affine ciphers, shift ciphers, block ciphers

- Encipher the following messages using the alphabet A of 29 characters and a shift cipher f(x) = x + 3.

1) The strongest survive

2) Is it over yet?

3) That is enough

4) The big day is coming! Be ready!

5) When you feel how depressingly, slowly you climb, it is well to remember, that things take time!

- Using the following matrix

encrypt the following message:

’See you on Monday!’

- Describe the mathematical encryption function for Enigma.

- Describe the algorithm behind RSA

- Name and describe briefly the two compositeness tests

(5/5)

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of