Cryptography

List of algorithms analysed during the 'Cryptography' course from the M.Sc. in ICT Engineering, Università degli Studi di Padova, a.y. 2020/2021.

Primality test algorithms

Goal: state whether a given natural number is prime or composite.

Content:

• Miller-Rabin's test
• Akrawal-Kayal-Saxena (AKS) algorithm
• Eratosthenes' sieve

Factoring algorithms

Goal: find (at least) one divisor of a given natural number.

Content:

• Fermat factoring algorithm
• Pollard's rho method with Floyd iterations
• Trial-division method

Prerequisites

It is used Python 3.x and the following modules:

• Crypto.Utils.number => pip install pycryptodome
• mpmath => pip install mpmath
• gmpy2 => pip install gmpy2