Back to search

Lethbridge, Alta. : University of Health, Dept. of Mathematics and Computer Science

Studying the efficiency of the Frobenius primality test

Abstract

dc:description.abstract

In mathematics, especially number theory, prime numbers are essential concepts. Prime numbers are used in cryptography as one application. Finding large prime numbers is crucial for cryptographic protocols; to do this, we must be able to tell whether a given number is prime or not. To test whether a number is a prime number, we require a computationally efficient primality testing algorithm. The primary objective of my research is to evaluate how well the tests work. Especially, in my research our main focus is on Grantham’s primality test. Grantham’s test is probabilistic and fast, but it comes with the risk of false positives. To determine how ‘good’ a test is, one must be aware of the possibility of false positives because in our development, deterministic tests are slower than false positive ones. In this thesis, we will explain the definitions of ‘probable prime numbers’, such as ‘Frobenius pseudoprime’, as given by Jon Grantham. Our research goal is to find upper and lower bounds for the number of probable prime numbers by generalizing the work of Paul Erdös and Carl Pomerance on Fermat pseudoprimes, and Jon Grantham on Frobenius pseudoprimes.

Degree

thesis:*
Level thesis:degree_level
Masters
Grantor dc:publisher
Lethbridge, Alta. : University of Health, Dept. of Mathematics and Computer Science
Year dc:date.issued
2024

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Gheisari, Hiva
  • University of Lethbridge. Faculty of Arts and Science
Advisors dc:contributor.supervisor
  • Fiori, Andrew
  • Kadiri, Habiba

Subjects

dc:subject × 12

Rights

Language dc:language.iso
en

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10133/6952

Chain of custody

source
Harvested from
University of Lethbridge
Base URL
opus.uleth.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Gheisari, Hiva; University of Lethbridge. Faculty of Arts and Science. Studying the efficiency of the Frobenius primality test. Masters thesis, Lethbridge, Alta. : University of Health, Dept. of Mathematics and Computer Science, 2024. https://hdl.handle.net/10133/6952