Modern Cryptography

Question 1

If a number can be broken down into equal pieces greater than one, we call it a _____ _____.

Answer 1

composite number

Question 2

What is an Ulam spiral?

Answer 2

List all possible numbers in order in a growing spiral, then shade or color all the prime numbers.

(The structure of the pattern is still unsolved today)

Question 3

Euclid, date and location

Answer 3

300 BC

Alexandria

Question 4

factorization

Answer 4

take any number and find all the prime numbers it divides into equally

Question 5

Fundamental theorem of arithmetic

Answer 5

every possible number has one and only one prime factorization

(no two numbers share a prime factorization)

Question 6

1976, Whitfield Diffie and Martin Hellman

Answer 6

New Directions in Cryptography

One way function, easy in one direction, hard in the other (for instance mixed paint colors)

Select same color, then each choose private color, mix and send, then each add own private color.

Question 7

46mod12=10

(how to say this)

Answer 7

46 mod 12 is congruent to 10

Question 8

3mod17=12

What is 17 called?

What is 3 called?

Answer 8

prime modulus

generator

Question 9

What is the discrete logarithm problem?

Answer 9

Question 10

Strength of a one-way function is the __ ___ __ ___ __.

Answer 10

time needed to reverse it

Question 11

The discrete logarithm problem is very time consuming when using this

Answer 11

a prime modulus hundreds of digits long