Chapter 2: Number Theory Flashcards Preview

CSE 565: Cryptography And Network Security > Chapter 2: Number Theory > Flashcards

Flashcards in Chapter 2: Number Theory Deck (5)
Loading flashcards...
1
Q

What is the Divisibility and the Division Algorithm

A

A nonzero b divides a if a = mb for some m, where a, b, and m are integers. b divides a if there is no remainder on division

2
Q

What is the division algorithm?

A
3
Q

What is the euclidean algorithm used for?

A

determing the greates common divisor of two positive integers

GCD EX)

GCD of 252 and 105 (252 = 21 × 12 and 105 = 21 × 5), and the same number 21 is also the GCD of 105 and 147 = 252 − 105

4
Q

What is modular arithmetic?

A

A system of arithmetic for integers, where numbers “wrap around” upon reaching a certain value

5
Q

What is a prime number?

A

can be divided evenly only by 1, or itself