Gülşen Ayluçtarhan, “Primality testing” Dec 19, 2017

Title: Primality testing
Speaker: Gülşen Ayluçtarhan (MS candidate)
Date: 19.12.2017, Tuesday
Time: 10:30-11:00
Venue: Faculty of Engineering Meeting Room (109)
Abstract: Primality testing is a common problem in both number theory and cryptography. There are several algorithms to test whether a given number is prime or composite. The algorithms are categorized as probabilistic and deterministic. In this presentation, we will see examples of algorithms in each categories.