CryptoBook

Search…

Fundamentals

Number Theory

Abstract algebra

Elliptic Curves

Lattices

Asymmetric Cryptography

Symmetric Cryptography

Isogeny Based Cryptography

Appendices

Powered By GitBook

Division and Greatest common divisor

Author: Zademn

Introduction

Two of the skills a cryptographer must master are:

1.

Knowing his way and being comfortable to work with numbers.

2.

Understanding and manipulating abstract objects.

This chapter of f**undamentals **proposes to prepare you for understanding the basics of **number theory** and **abstract algebra **.We will start with the most basic concepts such as division and build up knowledge until you, *future cryptographer, *are able to follow and understand the proofs and intricacies of the cryptosystems that make our everyday life secure.

We will provide examples and snippets of code and be sure to play with them. If math is not your strongest suit, we **highly** suggest to pause and ponder for each concept and take it slow.

For the math-savy people we cover advanced topics in specific chapters on the subjects of number theory and group theory.

Division

Let

$\mathbb{Z} = \{\dots , -1, 0, 1, 2, 3 \dots \}$

be the set denoting the integers. For

$a, b, \in \mathbb{Z}$

we say that $a$

divides $b$

if there is some $k \in \mathbb{Z}$

such that $a \cdot k = b$

$a | b$

For

$a = 2, b = 6$

we have $2 | 6$

because we can find $k = 3$

such that $6 = 2 \cdot 3$

.

$a | a, \ 1 | a \text{ and } a | 0$

$a | b$

and $a | c$

implies $a | (bu + cv) \ \forall u, v, \in \mathbb{Z}$

Example: Let

$b = 6, u = 5$

and $c = 9, v = 2$

$3 | 6$

and $3 | 9 \Rightarrow 3 | (6 \cdot 5 + 9 \cdot 2) \iff 3 | 48$

. We can find $k = 16$

such that $48 = 3 \cdot 16$

$a | b$

and $b | c$

implies $a | c$

if

$a|b$

and $b|a$

then $a = \pm b$

Let

$a, b \in \mathbb{Z}$

with $b≥1$

,There exists **unique**

$q, r \in \mathbb{Z}$

such that $\boxed{a = bq + r}$

and $0 \leq r < b$

** quotient** and ** remainder**

$q$

is called the$r$

theTo find

$q, r$

python offers us the `divmod()`

function that takes $a, b$

as arguments1

q, r = divmod(6, 2)

2

print(q, r)

3

# 3 0

4

5

q, r = divmod(13, 5)

6

print(q, r)

7

# 2 3

8

# Note that 13 = 2 * 5 + 3

Copied!

If we want to find only the quotient

$q$

we can use the `//`

operatorIf we want to find the remainder

$r$

we can use the modulo `%`

operator1

q = 13 // 5

2

print(q)

3

# 2

4

5

r = 13 % 5

6

print(r)

7

# 3

Copied!

1.

Now it's *your* turn! Play with the proprieties of the division in Python and see if they hold.

Greatest common divisor

Let **greatest common divisor** is the largest integer ****

$a, b \in \mathbb{Z}$

be 2 integers. The $d \in \mathbb{Z}$

such that $d | a$

and $d | b$

$\gcd(a, b) = d$

1

# In python we can import math to get the GCD algo

2

import math

3

print(math.gcd(18, 12)) # -> 6

4

# Sage has it already!

5

print(gcd(18, 12)) # -> 6

Copied!

for all other common divisors

$c$

of $a, b$

we have $c | d$

Things to think about

What can we say about numbers

$a, b$

with $\gcd(a, b) = 1$

? How are their divisors?

Last modified 5mo ago

Export as PDF

Copy link